FoxIntermediateBackend.Mod 582 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200620162026203620462056206620762086209621062116212621362146215621662176218621962206221622262236224622562266227622862296230623162326233623462356236623762386239624062416242624362446245624662476248624962506251625262536254625562566257625862596260626162626263626462656266626762686269627062716272627362746275627662776278627962806281628262836284628562866287628862896290629162926293629462956296629762986299630063016302630363046305630663076308630963106311631263136314631563166317631863196320632163226323632463256326632763286329633063316332633363346335633663376338633963406341634263436344634563466347634863496350635163526353635463556356635763586359636063616362636363646365636663676368636963706371637263736374637563766377637863796380638163826383638463856386638763886389639063916392639363946395639663976398639964006401640264036404640564066407640864096410641164126413641464156416641764186419642064216422642364246425642664276428642964306431643264336434643564366437643864396440644164426443644464456446644764486449645064516452645364546455645664576458645964606461646264636464646564666467646864696470647164726473647464756476647764786479648064816482648364846485648664876488648964906491649264936494649564966497649864996500650165026503650465056506650765086509651065116512651365146515651665176518651965206521652265236524652565266527652865296530653165326533653465356536653765386539654065416542654365446545654665476548654965506551655265536554655565566557655865596560656165626563656465656566656765686569657065716572657365746575657665776578657965806581658265836584658565866587658865896590659165926593659465956596659765986599660066016602660366046605660666076608660966106611661266136614661566166617661866196620662166226623662466256626662766286629663066316632663366346635663666376638663966406641664266436644664566466647664866496650665166526653665466556656665766586659666066616662666366646665666666676668666966706671667266736674667566766677667866796680668166826683668466856686668766886689669066916692669366946695669666976698669967006701670267036704670567066707670867096710671167126713671467156716671767186719672067216722672367246725672667276728672967306731673267336734673567366737673867396740674167426743674467456746674767486749675067516752675367546755675667576758675967606761676267636764676567666767676867696770677167726773677467756776677767786779678067816782678367846785678667876788678967906791679267936794679567966797679867996800680168026803680468056806680768086809681068116812681368146815681668176818681968206821682268236824682568266827682868296830683168326833683468356836683768386839684068416842684368446845684668476848684968506851685268536854685568566857685868596860686168626863686468656866686768686869687068716872687368746875687668776878687968806881688268836884688568866887688868896890689168926893689468956896689768986899690069016902690369046905690669076908690969106911691269136914691569166917691869196920692169226923692469256926692769286929693069316932693369346935693669376938693969406941694269436944694569466947694869496950695169526953695469556956695769586959696069616962696369646965696669676968696969706971697269736974697569766977697869796980698169826983698469856986698769886989699069916992699369946995699669976998699970007001700270037004700570067007700870097010701170127013701470157016701770187019702070217022702370247025702670277028702970307031703270337034703570367037703870397040704170427043704470457046704770487049705070517052705370547055705670577058705970607061706270637064706570667067706870697070707170727073707470757076707770787079708070817082708370847085708670877088708970907091709270937094709570967097709870997100710171027103710471057106710771087109711071117112711371147115711671177118711971207121712271237124712571267127712871297130713171327133713471357136713771387139714071417142714371447145714671477148714971507151715271537154715571567157715871597160716171627163716471657166716771687169717071717172717371747175717671777178717971807181718271837184718571867187718871897190719171927193719471957196719771987199720072017202720372047205720672077208720972107211721272137214721572167217721872197220722172227223722472257226722772287229723072317232723372347235723672377238723972407241724272437244724572467247724872497250725172527253725472557256725772587259726072617262726372647265726672677268726972707271727272737274727572767277727872797280728172827283728472857286728772887289729072917292729372947295729672977298729973007301730273037304730573067307730873097310731173127313731473157316731773187319732073217322732373247325732673277328732973307331733273337334733573367337733873397340734173427343734473457346734773487349735073517352735373547355735673577358735973607361736273637364736573667367736873697370737173727373737473757376737773787379738073817382738373847385738673877388738973907391739273937394739573967397739873997400740174027403740474057406740774087409741074117412741374147415741674177418741974207421742274237424742574267427742874297430743174327433743474357436743774387439744074417442744374447445744674477448744974507451745274537454745574567457745874597460746174627463746474657466746774687469747074717472747374747475747674777478747974807481748274837484748574867487748874897490749174927493749474957496749774987499750075017502750375047505750675077508750975107511751275137514751575167517751875197520752175227523752475257526752775287529753075317532753375347535753675377538753975407541754275437544754575467547754875497550755175527553755475557556755775587559756075617562756375647565756675677568756975707571757275737574757575767577757875797580758175827583758475857586758775887589759075917592759375947595759675977598759976007601760276037604760576067607760876097610761176127613761476157616761776187619762076217622762376247625762676277628762976307631763276337634763576367637763876397640764176427643764476457646764776487649765076517652765376547655765676577658765976607661766276637664766576667667766876697670767176727673767476757676767776787679768076817682768376847685768676877688768976907691769276937694769576967697769876997700770177027703770477057706770777087709771077117712771377147715771677177718771977207721772277237724772577267727772877297730773177327733773477357736773777387739774077417742774377447745774677477748774977507751775277537754775577567757775877597760776177627763776477657766776777687769777077717772777377747775777677777778777977807781778277837784778577867787778877897790779177927793779477957796779777987799780078017802780378047805780678077808780978107811781278137814781578167817781878197820782178227823782478257826782778287829783078317832783378347835783678377838783978407841784278437844784578467847784878497850785178527853785478557856785778587859786078617862786378647865786678677868786978707871787278737874787578767877787878797880788178827883788478857886788778887889789078917892789378947895789678977898789979007901790279037904790579067907790879097910791179127913791479157916791779187919792079217922792379247925792679277928792979307931793279337934793579367937793879397940794179427943794479457946794779487949795079517952795379547955795679577958795979607961796279637964796579667967796879697970797179727973797479757976797779787979798079817982798379847985798679877988798979907991799279937994799579967997799879998000800180028003800480058006800780088009801080118012801380148015801680178018801980208021802280238024802580268027802880298030803180328033803480358036803780388039804080418042804380448045804680478048804980508051805280538054805580568057805880598060806180628063806480658066806780688069807080718072807380748075807680778078807980808081808280838084808580868087808880898090809180928093809480958096809780988099810081018102810381048105810681078108810981108111811281138114811581168117811881198120812181228123812481258126812781288129813081318132813381348135813681378138813981408141814281438144814581468147814881498150815181528153815481558156815781588159816081618162816381648165816681678168816981708171817281738174817581768177817881798180818181828183818481858186818781888189819081918192819381948195819681978198819982008201820282038204820582068207820882098210821182128213821482158216821782188219822082218222822382248225822682278228822982308231823282338234823582368237823882398240824182428243824482458246824782488249825082518252825382548255825682578258825982608261826282638264826582668267826882698270827182728273827482758276827782788279828082818282828382848285828682878288828982908291829282938294829582968297829882998300830183028303830483058306830783088309831083118312831383148315831683178318831983208321832283238324832583268327832883298330833183328333833483358336833783388339834083418342834383448345834683478348834983508351835283538354835583568357835883598360836183628363836483658366836783688369837083718372837383748375837683778378837983808381838283838384838583868387838883898390839183928393839483958396839783988399840084018402840384048405840684078408840984108411841284138414841584168417841884198420842184228423842484258426842784288429843084318432843384348435843684378438843984408441844284438444844584468447844884498450845184528453845484558456845784588459846084618462846384648465846684678468846984708471847284738474847584768477847884798480848184828483848484858486848784888489849084918492849384948495849684978498849985008501850285038504850585068507850885098510851185128513851485158516851785188519852085218522852385248525852685278528852985308531853285338534853585368537853885398540854185428543854485458546854785488549855085518552855385548555855685578558855985608561856285638564856585668567856885698570857185728573857485758576857785788579858085818582858385848585858685878588858985908591859285938594859585968597859885998600860186028603860486058606860786088609861086118612861386148615861686178618861986208621862286238624862586268627862886298630863186328633863486358636863786388639864086418642864386448645864686478648864986508651865286538654865586568657865886598660866186628663866486658666866786688669867086718672867386748675867686778678867986808681868286838684868586868687868886898690869186928693869486958696869786988699870087018702870387048705870687078708870987108711871287138714871587168717871887198720872187228723872487258726872787288729873087318732873387348735873687378738873987408741874287438744874587468747874887498750875187528753875487558756875787588759876087618762876387648765876687678768876987708771877287738774877587768777877887798780878187828783878487858786878787888789879087918792879387948795879687978798879988008801880288038804880588068807880888098810881188128813881488158816881788188819882088218822882388248825882688278828882988308831883288338834883588368837883888398840884188428843884488458846884788488849885088518852885388548855885688578858885988608861886288638864886588668867886888698870887188728873887488758876887788788879888088818882888388848885888688878888888988908891889288938894889588968897889888998900890189028903890489058906890789088909891089118912891389148915891689178918891989208921892289238924892589268927892889298930893189328933893489358936893789388939894089418942894389448945894689478948894989508951895289538954895589568957895889598960896189628963896489658966896789688969897089718972897389748975897689778978897989808981898289838984898589868987898889898990899189928993899489958996899789988999900090019002900390049005900690079008900990109011901290139014901590169017901890199020902190229023902490259026902790289029903090319032903390349035903690379038903990409041904290439044904590469047904890499050905190529053905490559056905790589059906090619062906390649065906690679068906990709071907290739074907590769077907890799080908190829083908490859086908790889089909090919092909390949095909690979098909991009101910291039104910591069107910891099110911191129113911491159116911791189119912091219122912391249125912691279128912991309131913291339134913591369137913891399140914191429143914491459146914791489149915091519152915391549155915691579158915991609161916291639164916591669167916891699170917191729173917491759176917791789179918091819182918391849185918691879188918991909191919291939194919591969197919891999200920192029203920492059206920792089209921092119212921392149215921692179218921992209221922292239224922592269227922892299230923192329233923492359236923792389239924092419242924392449245924692479248924992509251925292539254925592569257925892599260926192629263926492659266926792689269927092719272927392749275927692779278927992809281928292839284928592869287928892899290929192929293929492959296929792989299930093019302930393049305930693079308930993109311931293139314931593169317931893199320932193229323932493259326932793289329933093319332933393349335933693379338933993409341934293439344934593469347934893499350935193529353935493559356935793589359936093619362936393649365936693679368936993709371937293739374937593769377937893799380938193829383938493859386938793889389939093919392939393949395939693979398939994009401940294039404940594069407940894099410941194129413941494159416941794189419942094219422942394249425942694279428942994309431943294339434943594369437943894399440944194429443944494459446944794489449945094519452945394549455945694579458945994609461946294639464946594669467946894699470947194729473947494759476947794789479948094819482948394849485948694879488948994909491949294939494949594969497949894999500950195029503950495059506950795089509951095119512951395149515951695179518951995209521952295239524952595269527952895299530953195329533953495359536953795389539954095419542954395449545954695479548954995509551955295539554955595569557955895599560956195629563956495659566956795689569957095719572957395749575957695779578957995809581958295839584958595869587958895899590959195929593959495959596959795989599960096019602960396049605960696079608960996109611961296139614961596169617961896199620962196229623962496259626962796289629963096319632963396349635963696379638963996409641964296439644964596469647964896499650965196529653965496559656965796589659966096619662966396649665966696679668966996709671967296739674967596769677967896799680968196829683968496859686968796889689969096919692969396949695969696979698969997009701970297039704970597069707970897099710971197129713971497159716971797189719972097219722972397249725972697279728972997309731973297339734973597369737973897399740974197429743974497459746974797489749975097519752975397549755975697579758975997609761976297639764976597669767976897699770977197729773977497759776977797789779978097819782978397849785978697879788978997909791979297939794979597969797979897999800980198029803980498059806980798089809981098119812981398149815981698179818981998209821982298239824982598269827982898299830983198329833983498359836983798389839984098419842984398449845984698479848984998509851985298539854985598569857985898599860986198629863986498659866986798689869987098719872987398749875987698779878987998809881988298839884988598869887988898899890989198929893989498959896989798989899990099019902990399049905990699079908990999109911991299139914991599169917991899199920992199229923992499259926992799289929993099319932993399349935993699379938993999409941994299439944994599469947994899499950995199529953995499559956995799589959996099619962996399649965996699679968996999709971997299739974997599769977997899799980998199829983998499859986998799889989999099919992999399949995999699979998999910000100011000210003100041000510006100071000810009100101001110012100131001410015100161001710018100191002010021100221002310024100251002610027100281002910030100311003210033100341003510036100371003810039100401004110042100431004410045100461004710048100491005010051100521005310054100551005610057100581005910060100611006210063100641006510066100671006810069100701007110072100731007410075100761007710078100791008010081100821008310084100851008610087100881008910090100911009210093100941009510096100971009810099101001010110102101031010410105101061010710108101091011010111101121011310114101151011610117101181011910120101211012210123101241012510126101271012810129101301013110132101331013410135101361013710138101391014010141101421014310144101451014610147101481014910150101511015210153101541015510156101571015810159101601016110162101631016410165101661016710168101691017010171101721017310174101751017610177101781017910180101811018210183101841018510186101871018810189101901019110192101931019410195101961019710198101991020010201102021020310204102051020610207102081020910210102111021210213102141021510216102171021810219102201022110222102231022410225102261022710228102291023010231102321023310234102351023610237102381023910240102411024210243102441024510246102471024810249102501025110252102531025410255102561025710258102591026010261102621026310264102651026610267102681026910270102711027210273102741027510276102771027810279102801028110282102831028410285102861028710288102891029010291102921029310294102951029610297102981029910300103011030210303103041030510306103071030810309103101031110312103131031410315103161031710318103191032010321103221032310324103251032610327103281032910330103311033210333103341033510336103371033810339103401034110342103431034410345103461034710348103491035010351103521035310354103551035610357103581035910360103611036210363103641036510366103671036810369103701037110372103731037410375103761037710378103791038010381103821038310384103851038610387103881038910390103911039210393103941039510396103971039810399104001040110402104031040410405104061040710408104091041010411104121041310414104151041610417104181041910420104211042210423104241042510426104271042810429104301043110432104331043410435104361043710438104391044010441104421044310444104451044610447104481044910450104511045210453104541045510456104571045810459104601046110462104631046410465104661046710468104691047010471104721047310474104751047610477104781047910480104811048210483104841048510486104871048810489104901049110492104931049410495104961049710498104991050010501105021050310504105051050610507105081050910510105111051210513105141051510516105171051810519105201052110522105231052410525105261052710528105291053010531105321053310534105351053610537105381053910540105411054210543105441054510546105471054810549105501055110552105531055410555105561055710558105591056010561105621056310564105651056610567105681056910570105711057210573105741057510576105771057810579105801058110582105831058410585105861058710588105891059010591105921059310594105951059610597105981059910600106011060210603106041060510606106071060810609106101061110612106131061410615106161061710618106191062010621106221062310624106251062610627106281062910630106311063210633106341063510636106371063810639106401064110642106431064410645106461064710648106491065010651106521065310654106551065610657106581065910660106611066210663106641066510666106671066810669106701067110672106731067410675106761067710678106791068010681106821068310684106851068610687106881068910690106911069210693106941069510696106971069810699107001070110702107031070410705107061070710708107091071010711107121071310714107151071610717107181071910720107211072210723107241072510726107271072810729107301073110732107331073410735107361073710738107391074010741107421074310744107451074610747107481074910750107511075210753107541075510756107571075810759107601076110762107631076410765107661076710768107691077010771107721077310774107751077610777107781077910780107811078210783107841078510786107871078810789107901079110792107931079410795107961079710798107991080010801108021080310804108051080610807108081080910810108111081210813108141081510816108171081810819108201082110822108231082410825108261082710828108291083010831108321083310834108351083610837108381083910840108411084210843108441084510846108471084810849108501085110852108531085410855108561085710858108591086010861108621086310864108651086610867108681086910870108711087210873108741087510876108771087810879108801088110882108831088410885108861088710888108891089010891108921089310894108951089610897108981089910900109011090210903109041090510906109071090810909109101091110912109131091410915109161091710918109191092010921109221092310924109251092610927109281092910930109311093210933109341093510936109371093810939109401094110942109431094410945109461094710948109491095010951109521095310954109551095610957109581095910960109611096210963109641096510966109671096810969109701097110972109731097410975109761097710978109791098010981109821098310984109851098610987109881098910990109911099210993109941099510996109971099810999110001100111002110031100411005110061100711008110091101011011110121101311014110151101611017110181101911020110211102211023110241102511026110271102811029110301103111032110331103411035110361103711038110391104011041110421104311044110451104611047110481104911050110511105211053110541105511056110571105811059110601106111062110631106411065110661106711068110691107011071110721107311074110751107611077110781107911080110811108211083110841108511086110871108811089110901109111092110931109411095110961109711098110991110011101111021110311104111051110611107111081110911110111111111211113111141111511116111171111811119111201112111122111231112411125111261112711128111291113011131111321113311134111351113611137111381113911140111411114211143111441114511146111471114811149111501115111152111531115411155111561115711158111591116011161111621116311164111651116611167111681116911170111711117211173111741117511176111771117811179111801118111182111831118411185111861118711188111891119011191111921119311194111951119611197111981119911200112011120211203112041120511206112071120811209112101121111212112131121411215112161121711218112191122011221112221122311224112251122611227112281122911230112311123211233112341123511236112371123811239112401124111242112431124411245112461124711248112491125011251112521125311254112551125611257112581125911260112611126211263112641126511266112671126811269112701127111272112731127411275112761127711278112791128011281112821128311284112851128611287112881128911290112911129211293112941129511296112971129811299113001130111302113031130411305113061130711308113091131011311113121131311314113151131611317113181131911320113211132211323113241132511326113271132811329113301133111332113331133411335113361133711338113391134011341113421134311344113451134611347113481134911350113511135211353113541135511356113571135811359113601136111362113631136411365113661136711368113691137011371113721137311374113751137611377113781137911380113811138211383113841138511386113871138811389113901139111392113931139411395113961139711398113991140011401114021140311404114051140611407114081140911410114111141211413114141141511416114171141811419114201142111422114231142411425114261142711428114291143011431114321143311434114351143611437114381143911440114411144211443114441144511446114471144811449114501145111452114531145411455114561145711458114591146011461114621146311464114651146611467114681146911470114711147211473114741147511476114771147811479114801148111482114831148411485114861148711488114891149011491114921149311494114951149611497114981149911500115011150211503115041150511506115071150811509115101151111512115131151411515115161151711518115191152011521115221152311524115251152611527115281152911530115311153211533115341153511536115371153811539115401154111542115431154411545115461154711548115491155011551115521155311554115551155611557115581155911560115611156211563115641156511566115671156811569115701157111572115731157411575115761157711578115791158011581115821158311584115851158611587115881158911590115911159211593115941159511596115971159811599116001160111602116031160411605116061160711608116091161011611116121161311614116151161611617116181161911620116211162211623116241162511626116271162811629116301163111632116331163411635116361163711638116391164011641116421164311644116451164611647116481164911650116511165211653116541165511656116571165811659116601166111662116631166411665116661166711668116691167011671116721167311674116751167611677116781167911680116811168211683116841168511686116871168811689116901169111692116931169411695116961169711698116991170011701117021170311704117051170611707117081170911710117111171211713117141171511716117171171811719117201172111722117231172411725117261172711728117291173011731117321173311734117351173611737117381173911740117411174211743117441174511746117471174811749117501175111752117531175411755117561175711758117591176011761117621176311764117651176611767117681176911770117711177211773117741177511776117771177811779117801178111782117831178411785117861178711788117891179011791117921179311794117951179611797117981179911800118011180211803118041180511806118071180811809118101181111812118131181411815118161181711818118191182011821118221182311824118251182611827118281182911830118311183211833118341183511836118371183811839118401184111842118431184411845118461184711848118491185011851118521185311854118551185611857118581185911860118611186211863118641186511866118671186811869118701187111872118731187411875118761187711878118791188011881118821188311884118851188611887118881188911890118911189211893118941189511896118971189811899119001190111902119031190411905119061190711908119091191011911119121191311914119151191611917119181191911920119211192211923119241192511926119271192811929119301193111932119331193411935119361193711938119391194011941119421194311944119451194611947119481194911950119511195211953119541195511956119571195811959119601196111962119631196411965119661196711968119691197011971119721197311974119751197611977119781197911980119811198211983119841198511986119871198811989119901199111992119931199411995119961199711998119991200012001120021200312004120051200612007120081200912010120111201212013120141201512016120171201812019120201202112022120231202412025120261202712028120291203012031120321203312034120351203612037120381203912040120411204212043120441204512046120471204812049120501205112052120531205412055120561205712058120591206012061120621206312064120651206612067120681206912070120711207212073120741207512076120771207812079120801208112082120831208412085120861208712088120891209012091120921209312094120951209612097120981209912100121011210212103121041210512106121071210812109121101211112112121131211412115121161211712118121191212012121121221212312124121251212612127121281212912130121311213212133121341213512136121371213812139121401214112142121431214412145121461214712148121491215012151121521215312154121551215612157121581215912160121611216212163121641216512166121671216812169121701217112172121731217412175121761217712178121791218012181121821218312184121851218612187121881218912190121911219212193121941219512196121971219812199122001220112202122031220412205122061220712208122091221012211122121221312214122151221612217122181221912220122211222212223122241222512226122271222812229122301223112232122331223412235122361223712238122391224012241122421224312244122451224612247122481224912250122511225212253122541225512256122571225812259122601226112262122631226412265122661226712268122691227012271122721227312274122751227612277122781227912280122811228212283122841228512286122871228812289122901229112292122931229412295122961229712298122991230012301123021230312304123051230612307123081230912310123111231212313123141231512316123171231812319123201232112322123231232412325123261232712328123291233012331123321233312334123351233612337123381233912340123411234212343123441234512346123471234812349123501235112352123531235412355123561235712358123591236012361123621236312364123651236612367123681236912370123711237212373123741237512376123771237812379123801238112382123831238412385123861238712388123891239012391123921239312394123951239612397123981239912400124011240212403124041240512406124071240812409124101241112412124131241412415124161241712418124191242012421124221242312424124251242612427124281242912430124311243212433124341243512436124371243812439124401244112442124431244412445124461244712448124491245012451124521245312454124551245612457124581245912460124611246212463124641246512466124671246812469124701247112472124731247412475124761247712478124791248012481124821248312484124851248612487124881248912490124911249212493124941249512496124971249812499125001250112502125031250412505125061250712508125091251012511125121251312514125151251612517125181251912520125211252212523125241252512526125271252812529125301253112532125331253412535125361253712538125391254012541125421254312544125451254612547125481254912550125511255212553125541255512556125571255812559125601256112562125631256412565125661256712568125691257012571125721257312574125751257612577125781257912580125811258212583125841258512586125871258812589125901259112592125931259412595125961259712598125991260012601126021260312604126051260612607126081260912610126111261212613126141261512616126171261812619126201262112622126231262412625126261262712628126291263012631126321263312634126351263612637126381263912640126411264212643126441264512646126471264812649126501265112652126531265412655126561265712658126591266012661126621266312664126651266612667126681266912670126711267212673126741267512676126771267812679126801268112682126831268412685126861268712688126891269012691126921269312694126951269612697126981269912700127011270212703127041270512706127071270812709127101271112712127131271412715127161271712718127191272012721127221272312724127251272612727127281272912730127311273212733127341273512736127371273812739127401274112742127431274412745127461274712748127491275012751127521275312754127551275612757127581275912760127611276212763127641276512766127671276812769127701277112772127731277412775127761277712778127791278012781127821278312784127851278612787127881278912790127911279212793127941279512796127971279812799128001280112802128031280412805128061280712808128091281012811128121281312814128151281612817128181281912820128211282212823128241282512826128271282812829128301283112832128331283412835128361283712838128391284012841128421284312844128451284612847128481284912850128511285212853128541285512856128571285812859128601286112862128631286412865128661286712868128691287012871128721287312874128751287612877128781287912880128811288212883128841288512886128871288812889128901289112892128931289412895128961289712898128991290012901129021290312904129051290612907129081290912910129111291212913129141291512916129171291812919129201292112922129231292412925129261292712928129291293012931129321293312934129351293612937129381293912940129411294212943129441294512946129471294812949129501295112952129531295412955129561295712958129591296012961129621296312964129651296612967129681296912970129711297212973129741297512976129771297812979129801298112982129831298412985129861298712988129891299012991129921299312994129951299612997129981299913000130011300213003130041300513006130071300813009130101301113012130131301413015130161301713018130191302013021130221302313024130251302613027130281302913030130311303213033130341303513036130371303813039130401304113042130431304413045130461304713048130491305013051130521305313054130551305613057130581305913060130611306213063130641306513066130671306813069130701307113072130731307413075130761307713078130791308013081130821308313084130851308613087130881308913090130911309213093130941309513096130971309813099131001310113102131031310413105131061310713108131091311013111131121311313114131151311613117131181311913120131211312213123131241312513126131271312813129131301313113132131331313413135131361313713138131391314013141131421314313144131451314613147131481314913150131511315213153131541315513156131571315813159131601316113162131631316413165131661316713168131691317013171131721317313174131751317613177131781317913180131811318213183131841318513186131871318813189131901319113192131931319413195131961319713198131991320013201132021320313204132051320613207132081320913210132111321213213132141321513216132171321813219132201322113222132231322413225132261322713228132291323013231132321323313234132351323613237132381323913240132411324213243132441324513246132471324813249132501325113252132531325413255132561325713258132591326013261132621326313264132651326613267132681326913270132711327213273132741327513276132771327813279132801328113282132831328413285132861328713288132891329013291132921329313294132951329613297132981329913300133011330213303133041330513306133071330813309133101331113312133131331413315133161331713318133191332013321133221332313324133251332613327133281332913330133311333213333133341333513336133371333813339133401334113342133431334413345133461334713348133491335013351133521335313354133551335613357133581335913360133611336213363133641336513366133671336813369133701337113372133731337413375133761337713378133791338013381133821338313384133851338613387133881338913390133911339213393133941339513396133971339813399134001340113402134031340413405134061340713408134091341013411134121341313414134151341613417134181341913420134211342213423134241342513426134271342813429134301343113432134331343413435134361343713438134391344013441134421344313444134451344613447134481344913450134511345213453134541345513456134571345813459134601346113462134631346413465134661346713468134691347013471134721347313474134751347613477134781347913480134811348213483134841348513486134871348813489134901349113492134931349413495134961349713498134991350013501135021350313504135051350613507135081350913510135111351213513135141351513516135171351813519135201352113522135231352413525135261352713528135291353013531135321353313534135351353613537135381353913540135411354213543135441354513546135471354813549135501355113552135531355413555135561355713558135591356013561135621356313564135651356613567135681356913570135711357213573135741357513576135771357813579135801358113582135831358413585135861358713588135891359013591135921359313594135951359613597135981359913600136011360213603136041360513606136071360813609136101361113612136131361413615136161361713618136191362013621136221362313624136251362613627136281362913630136311363213633136341363513636136371363813639136401364113642136431364413645136461364713648136491365013651136521365313654136551365613657136581365913660136611366213663136641366513666136671366813669136701367113672136731367413675136761367713678136791368013681136821368313684136851368613687136881368913690136911369213693136941369513696136971369813699137001370113702137031370413705137061370713708137091371013711137121371313714137151371613717137181371913720137211372213723137241372513726137271372813729137301373113732137331373413735137361373713738137391374013741137421374313744137451374613747137481374913750137511375213753137541375513756137571375813759137601376113762137631376413765137661376713768137691377013771137721377313774137751377613777137781377913780137811378213783137841378513786137871378813789137901379113792137931379413795137961379713798137991380013801138021380313804138051380613807138081380913810138111381213813138141381513816138171381813819138201382113822138231382413825138261382713828138291383013831138321383313834138351383613837138381383913840138411384213843138441384513846138471384813849138501385113852138531385413855138561385713858138591386013861138621386313864138651386613867138681386913870138711387213873138741387513876138771387813879138801388113882138831388413885138861388713888138891389013891138921389313894138951389613897138981389913900139011390213903139041390513906139071390813909139101391113912139131391413915139161391713918139191392013921139221392313924139251392613927139281392913930139311393213933139341393513936139371393813939139401394113942139431394413945139461394713948139491395013951139521395313954139551395613957139581395913960139611396213963139641396513966139671396813969139701397113972139731397413975139761397713978139791398013981139821398313984139851398613987139881398913990139911399213993139941399513996139971399813999140001400114002140031400414005140061400714008140091401014011140121401314014140151401614017140181401914020140211402214023140241402514026140271402814029140301403114032140331403414035140361403714038140391404014041140421404314044140451404614047140481404914050140511405214053140541405514056140571405814059140601406114062140631406414065140661406714068140691407014071140721407314074140751407614077140781407914080140811408214083140841408514086140871408814089140901409114092140931409414095140961409714098140991410014101141021410314104141051410614107141081410914110141111411214113141141411514116141171411814119141201412114122141231412414125141261412714128141291413014131141321413314134141351413614137141381413914140141411414214143141441414514146141471414814149141501415114152141531415414155141561415714158141591416014161141621416314164141651416614167141681416914170141711417214173141741417514176141771417814179141801418114182141831418414185141861418714188141891419014191141921419314194141951419614197141981419914200142011420214203142041420514206142071420814209142101421114212142131421414215142161421714218142191422014221142221422314224142251422614227142281422914230142311423214233142341423514236142371423814239142401424114242142431424414245142461424714248142491425014251142521425314254142551425614257142581425914260142611426214263142641426514266142671426814269142701427114272142731427414275142761427714278142791428014281142821428314284142851428614287142881428914290142911429214293142941429514296142971429814299143001430114302143031430414305143061430714308143091431014311143121431314314143151431614317143181431914320143211432214323143241432514326143271432814329143301433114332143331433414335143361433714338143391434014341143421434314344143451434614347143481434914350143511435214353143541435514356143571435814359143601436114362143631436414365143661436714368143691437014371143721437314374143751437614377143781437914380143811438214383143841438514386143871438814389143901439114392143931439414395143961439714398143991440014401144021440314404144051440614407144081440914410144111441214413144141441514416144171441814419144201442114422144231442414425144261442714428144291443014431144321443314434144351443614437144381443914440144411444214443144441444514446144471444814449144501445114452144531445414455144561445714458144591446014461144621446314464144651446614467144681446914470144711447214473144741447514476144771447814479144801448114482144831448414485144861448714488144891449014491144921449314494144951449614497144981449914500145011450214503145041450514506145071450814509145101451114512145131451414515145161451714518145191452014521145221452314524145251452614527145281452914530145311453214533145341453514536145371453814539145401454114542145431454414545145461454714548145491455014551145521455314554145551455614557145581455914560145611456214563145641456514566145671456814569145701457114572145731457414575145761457714578145791458014581145821458314584145851458614587145881458914590145911459214593145941459514596145971459814599146001460114602146031460414605146061460714608146091461014611146121461314614146151461614617146181461914620146211462214623146241462514626146271462814629146301463114632146331463414635146361463714638146391464014641146421464314644146451464614647146481464914650146511465214653146541465514656146571465814659146601466114662146631466414665146661466714668146691467014671146721467314674146751467614677146781467914680146811468214683146841468514686146871468814689146901469114692146931469414695146961469714698146991470014701147021470314704147051470614707147081470914710147111471214713147141471514716147171471814719147201472114722147231472414725147261472714728147291473014731147321473314734147351473614737147381473914740147411474214743147441474514746147471474814749147501475114752147531475414755147561475714758147591476014761147621476314764147651476614767147681476914770147711477214773147741477514776147771477814779147801478114782147831478414785147861478714788147891479014791147921479314794147951479614797147981479914800148011480214803148041480514806148071480814809148101481114812148131481414815148161481714818148191482014821148221482314824148251482614827148281482914830148311483214833148341483514836148371483814839148401484114842148431484414845148461484714848148491485014851148521485314854148551485614857148581485914860148611486214863148641486514866148671486814869148701487114872148731487414875148761487714878148791488014881148821488314884148851488614887148881488914890148911489214893148941489514896148971489814899149001490114902149031490414905
  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. EntryPriority=-4;
  59. FirstPriority=-3;
  60. InitPriority=-2;
  61. ExitPriority=-1;
  62. BasePointerTypeSize = 5;
  63. BaseArrayTypeSize = BasePointerTypeSize + 3;
  64. LengthOffset = BasePointerTypeSize + 0;
  65. DataOffset = BasePointerTypeSize + 1;
  66. DescriptorOffset = BasePointerTypeSize + 2;
  67. BaseRecordTypeSize = BasePointerTypeSize + 2;
  68. ActionOffset = BasePointerTypeSize + 0;
  69. MonitorOffset = BasePointerTypeSize + 1;
  70. BaseObjectTypeSize = BaseRecordTypeSize;
  71. ActionTypeSize = 3;
  72. MonitorTypeSize = 7;
  73. ProcessorOffset = BaseObjectTypeSize + 1;
  74. StackLimitOffset* = BaseObjectTypeSize + 3;
  75. QuantumOffset = BaseObjectTypeSize + 4;
  76. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  77. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  78. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  79. Size2Flag = 4; (* size = 2 *)
  80. Size3Flag = 5; (* size = 3 *)
  81. Size4Flag = 6; (* size = 4 *)
  82. Size5Flag = 7; (* size = 5 *)
  83. Size6Flag = 8; (* size = 6 *)
  84. Size7Flag = 9; (* size = 7 *)
  85. Size8Flag = 10; (* size = 8 *)
  86. ReflectionSupport = TRUE;
  87. (* 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:
  88. 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
  89. a base pointer but a procedure descriptor. The base pointer itself is in such cases located at BP + address size.
  90. *)
  91. (* I am not 100% sure if it is necessary or not -- so I keep a flag to be able to re-enable this *)
  92. ProtectModulesPointers = FALSE;
  93. CreateProcedureDescInfo = TRUE;
  94. WarningDynamicLoading = FALSE;
  95. SysvABI = {SyntaxTree.CCallingConvention};
  96. SysvABIorWINAPI = {SyntaxTree.CCallingConvention, SyntaxTree.WinAPICallingConvention};
  97. TYPE
  98. Position=SyntaxTree.Position;
  99. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  100. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  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. END;
  108. Fixup= POINTER TO RECORD
  109. pc: LONGINT;
  110. nextFixup: Fixup;
  111. END;
  112. WriteBackCall = POINTER TO RECORD
  113. call: SyntaxTree.ProcedureCallDesignator;
  114. next: WriteBackCall;
  115. END;
  116. Label= OBJECT
  117. VAR
  118. fixups: Fixup;
  119. section: IntermediateCode.Section;
  120. pc: LONGINT;
  121. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  122. BEGIN
  123. SELF.section := section; pc := -1;
  124. END InitLabel;
  125. PROCEDURE Resolve(pc: LONGINT);
  126. VAR at: LONGINT;
  127. BEGIN
  128. SELF.pc := pc;
  129. WHILE(fixups # NIL) DO
  130. at := fixups.pc;
  131. section.PatchAddress(at,pc);
  132. fixups := fixups.nextFixup;
  133. END;
  134. END Resolve;
  135. PROCEDURE AddFixup(at: LONGINT);
  136. VAR fixup: Fixup;
  137. BEGIN
  138. ASSERT(pc=-1);
  139. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  140. END AddFixup;
  141. END Label;
  142. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  143. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  144. VAR
  145. backend: IntermediateBackend;
  146. implementationVisitor: ImplementationVisitor;
  147. meta: MetaDataGenerator;
  148. system: Global.System;
  149. currentScope: SyntaxTree.Scope;
  150. module: Sections.Module;
  151. moduleSelf: SyntaxTree.Variable;
  152. dump: BOOLEAN;
  153. forceModuleBody: BOOLEAN;
  154. addressType: IntermediateCode.Type;
  155. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  156. BEGIN
  157. currentScope := NIL; module := NIL; moduleSelf := NIL;
  158. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  159. SELF.dump := dump;
  160. SELF.backend := backend;
  161. SELF.forceModuleBody := forceModuleBody;
  162. addressType := IntermediateCode.GetType(system,system.addressType)
  163. END Init;
  164. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  165. BEGIN
  166. backend.Error(module.module.sourceName, position, Streams.Invalid, s);
  167. END Error;
  168. PROCEDURE Type(x: SyntaxTree.Type);
  169. BEGIN
  170. x.Accept(SELF);
  171. END Type;
  172. (** types **)
  173. PROCEDURE VisitBasicType*(x: SyntaxTree.BasicType);
  174. BEGIN (* no code emission *) END VisitBasicType;
  175. PROCEDURE VisitCharacterType*(x: SyntaxTree.CharacterType);
  176. BEGIN (* no code emission *) END VisitCharacterType;
  177. PROCEDURE VisitIntegerType*(x: SyntaxTree.IntegerType);
  178. BEGIN (* no code emission *) END VisitIntegerType;
  179. PROCEDURE VisitFloatType*(x: SyntaxTree.FloatType);
  180. BEGIN (* no code emission *) END VisitFloatType;
  181. PROCEDURE VisitComplexType*(x: SyntaxTree.ComplexType);
  182. BEGIN (* no code emission *) END VisitComplexType;
  183. PROCEDURE VisitQualifiedType*(x: SyntaxTree.QualifiedType);
  184. VAR type: SyntaxTree.Type;
  185. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  186. type := x.resolved;
  187. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  188. meta.CheckTypeDeclaration(type);
  189. END;
  190. END VisitQualifiedType;
  191. PROCEDURE VisitStringType*(x: SyntaxTree.StringType);
  192. BEGIN (* no code emission *) END VisitStringType;
  193. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  194. BEGIN (* no code emission *)
  195. END VisitArrayRangeType;
  196. PROCEDURE VisitArrayType*(x: SyntaxTree.ArrayType);
  197. BEGIN (* no code emission *) END VisitArrayType;
  198. PROCEDURE VisitPortType*(x: SyntaxTree.PortType);
  199. BEGIN (* no code emission *) END VisitPortType;
  200. PROCEDURE VisitMathArrayType*(x: SyntaxTree.MathArrayType);
  201. BEGIN
  202. meta.CheckTypeDeclaration(x);
  203. END VisitMathArrayType;
  204. PROCEDURE VisitPointerType*(x: SyntaxTree.PointerType);
  205. BEGIN
  206. meta.CheckTypeDeclaration(x);
  207. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  208. END VisitPointerType;
  209. PROCEDURE VisitRecordType*(x: SyntaxTree.RecordType);
  210. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  211. BEGIN (* no code emission *)
  212. meta.CheckTypeDeclaration(x);
  213. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  214. IF x.pointerType.typeDeclaration # NIL THEN
  215. td := x.pointerType.typeDeclaration
  216. ELSE
  217. td := x.typeDeclaration
  218. END;
  219. Global.GetSymbolName(td,name);
  220. (* code section for object *)
  221. END;
  222. Scope(x.recordScope);
  223. END VisitRecordType;
  224. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  225. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  226. BEGIN
  227. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  228. WHILE (this # NIL) & (this.identifier# id) DO
  229. this := this.nextModifier;
  230. END;
  231. RETURN this # NIL
  232. END HasFlag;
  233. PROCEDURE VisitCellType*(x: SyntaxTree.CellType);
  234. VAR port,adr: LONGINT; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  235. BEGIN
  236. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  237. capabilities := {};
  238. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  239. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  240. backend.SetCapabilities(capabilities);
  241. IF ~implementationVisitor.checker.SkipImplementation(x) THEN
  242. Scope(x.cellScope);
  243. END;
  244. END VisitCellType;
  245. PROCEDURE VisitProcedureType*(x: SyntaxTree.ProcedureType);
  246. BEGIN (* no code emission *) END VisitProcedureType;
  247. PROCEDURE VisitEnumerationType*(x: SyntaxTree.EnumerationType);
  248. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  249. END VisitEnumerationType;
  250. (* symbols *)
  251. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  252. BEGIN
  253. Procedure(x);
  254. END VisitProcedure;
  255. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  256. BEGIN
  257. Procedure(x);
  258. END VisitOperator;
  259. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  260. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, dim, i: LONGINT;
  261. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  262. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  263. BEGIN
  264. type := type.resolved;
  265. IF type IS SyntaxTree.RecordType THEN
  266. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  267. ELSIF (type IS SyntaxTree.ArrayType) THEN
  268. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  269. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  270. END;
  271. ELSIF type IS SyntaxTree.MathArrayType THEN
  272. WITH type: SyntaxTree.MathArrayType DO
  273. IF type.form = SyntaxTree.Open THEN
  274. RETURN TRUE
  275. ELSIF type.form = SyntaxTree.Static THEN
  276. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  277. END;
  278. END;
  279. END;
  280. RETURN FALSE
  281. END TypeNeedsInitialization;
  282. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  283. VAR variable: SyntaxTree.Variable;
  284. BEGIN
  285. variable := scope.firstVariable;
  286. WHILE variable # NIL DO
  287. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  288. IF variable.initializer # NIL THEN RETURN TRUE END;
  289. variable := variable.nextVariable;
  290. END;
  291. RETURN FALSE
  292. END ScopeNeedsInitialization;
  293. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset:LONGINT);
  294. VAR size: LONGINT;
  295. BEGIN
  296. size := offset - lastUpdated;
  297. IF size > 0 THEN
  298. irv.Emit(Reserve(x.position,size));
  299. END;
  300. irv.Emit(Data(x.position, op));
  301. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  302. END SingleInitialize;
  303. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset:LONGINT);
  304. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable; i: LONGINT; size:LONGINT;
  305. BEGIN
  306. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  307. WITH type: SyntaxTree.RecordType DO
  308. baseType := type.baseType;
  309. IF baseType # NIL THEN
  310. baseType := baseType.resolved;
  311. IF baseType IS SyntaxTree.PointerType THEN
  312. baseType := baseType(SyntaxTree.PointerType).pointerBase
  313. END;
  314. Initialize(baseType,NIL, offset);
  315. END;
  316. variable := type.recordScope.firstVariable;
  317. WHILE variable # NIL DO
  318. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  319. variable := variable.nextVariable
  320. END;
  321. | type: SyntaxTree.ArrayType DO
  322. IF type.form = SyntaxTree.Static THEN
  323. baseType := type.arrayBase;
  324. IF TypeNeedsInitialization(baseType) THEN
  325. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  326. FOR i := 0 TO type.staticLength-1 DO
  327. Initialize(baseType,NIL,offset+i*size);
  328. END;
  329. END;
  330. END;
  331. | type: SyntaxTree.MathArrayType DO
  332. IF type.form = SyntaxTree.Open THEN
  333. dim := DynamicDim(type);
  334. baseType := SemanticChecker.ArrayBase(type,dim);
  335. imm := IntermediateCode.Immediate(addressType,dim);
  336. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  337. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  338. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  339. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  340. (* flags remain empty (=0) for open array *)
  341. ELSIF type.form = SyntaxTree.Static THEN
  342. baseType := type.arrayBase;
  343. IF TypeNeedsInitialization(baseType) THEN
  344. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  345. ASSERT(type.staticLength < 1024*1024*1024);
  346. FOR i := 0 TO type.staticLength-1 DO
  347. Initialize(baseType,NIL,offset+i*size);
  348. END;
  349. END;
  350. END;
  351. ELSE
  352. IF initializer # NIL THEN
  353. implementationVisitor.Evaluate(initializer, op);
  354. SingleInitialize(op.op, offset);
  355. END;
  356. END;
  357. END Initialize;
  358. BEGIN
  359. IF x.externalName # NIL THEN RETURN END;
  360. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  361. (* code section for variable *)
  362. Global.GetSymbolSegmentedName(x,name);
  363. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  364. irv.SetExported(IsExported(x));
  365. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  366. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  367. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  368. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  369. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  370. FOR i := 0 TO DynamicDim(x.type)-1 DO
  371. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  372. END;
  373. ELSE
  374. lastUpdated:= 0;
  375. IF ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  376. Initialize(x.type, x.initializer, 0);
  377. END;
  378. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  379. IF size > 0 THEN
  380. irv.Emit(Reserve(x.position,size));
  381. END;
  382. IF ~x.fixed THEN
  383. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  384. ELSE
  385. align := x.alignment;
  386. END;
  387. irv.SetPositionOrAlignment(x.fixed, align);
  388. meta.CheckTypeDeclaration(x.type);
  389. END;
  390. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  391. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  392. END;
  393. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  394. END VisitVariable;
  395. PROCEDURE VisitProperty*(x: SyntaxTree.Property);
  396. BEGIN
  397. VisitVariable(x)
  398. END VisitProperty;
  399. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  400. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i, dim: LONGINT;
  401. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  402. BEGIN
  403. ASSERT(currentScope IS SyntaxTree.CellScope);
  404. Global.GetSymbolSegmentedName(x,name);
  405. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  406. irv.SetExported(IsExported(x));
  407. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  408. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  409. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  410. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  411. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  412. FOR i := 0 TO DynamicDim(x.type)-1 DO
  413. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  414. END;
  415. ELSE
  416. lastUpdated:= 0;
  417. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  418. IF size > 0 THEN
  419. irv.Emit(Reserve(x.position,size));
  420. END;
  421. IF ~x.fixed THEN
  422. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  423. ELSE
  424. align := x.alignment;
  425. END;
  426. irv.SetPositionOrAlignment(x.fixed, align);
  427. meta.CheckTypeDeclaration(x.type);
  428. END;
  429. END VisitParameter;
  430. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  431. BEGIN
  432. Type(x.declaredType); (* => code in objects *)
  433. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  434. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  435. END;
  436. END VisitTypeDeclaration;
  437. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  438. BEGIN
  439. IF (SyntaxTree.Public * x.access # {}) THEN
  440. implementationVisitor.VisitConstant(x);
  441. END;
  442. END VisitConstant;
  443. PROCEDURE Scope(x: SyntaxTree.Scope);
  444. VAR procedure: SyntaxTree.Procedure;
  445. constant: SyntaxTree.Constant;
  446. variable: SyntaxTree.Variable;
  447. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  448. cell: SyntaxTree.CellType;
  449. parameter: SyntaxTree.Parameter;
  450. property: SyntaxTree.Property;
  451. BEGIN
  452. prevScope := currentScope;
  453. currentScope := x;
  454. (* constants treated in implementation visitor *)
  455. WITH x: SyntaxTree.CellScope DO
  456. cell := x.ownerCell;
  457. parameter := cell.firstParameter;
  458. WHILE parameter # NIL DO
  459. VisitParameter(parameter);
  460. parameter := parameter.nextParameter;
  461. END;
  462. property := cell.firstProperty;
  463. WHILE property # NIL DO
  464. VisitProperty(property);
  465. property := property.nextProperty;
  466. END;
  467. ELSE
  468. END;
  469. typeDeclaration := x.firstTypeDeclaration;
  470. WHILE typeDeclaration # NIL DO
  471. VisitTypeDeclaration(typeDeclaration);
  472. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  473. END;
  474. variable := x.firstVariable;
  475. WHILE variable # NIL DO
  476. VisitVariable(variable);
  477. variable := variable.nextVariable;
  478. END;
  479. procedure := x.firstProcedure;
  480. WHILE procedure # NIL DO
  481. VisitProcedure(procedure);
  482. procedure := procedure.nextProcedure;
  483. END;
  484. constant := x.firstConstant;
  485. WHILE constant # NIL DO
  486. VisitConstant(constant);
  487. constant := constant.nextConstant;
  488. END;
  489. currentScope := prevScope;
  490. END Scope;
  491. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  492. VAR parameter: SyntaxTree.Parameter;
  493. BEGIN
  494. parameter := first;
  495. WHILE parameter # NIL DO
  496. VisitParameter(parameter);
  497. parameter := parameter.nextParameter;
  498. END;
  499. END Parameters;
  500. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  501. VAR scope: SyntaxTree.ProcedureScope;
  502. prevScope: SyntaxTree.Scope;
  503. inline, finalizer: BOOLEAN;
  504. procedureType: SyntaxTree.ProcedureType;
  505. pc: LONGINT;
  506. memorySize: Basic.Integer; stackSize: LONGINT;
  507. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  508. null,size,src,dest,fp,res: IntermediateCode.Operand;
  509. callingConvention: LONGINT;
  510. cellType: SyntaxTree.CellType;
  511. register: WORD;
  512. registerParameters: SIZE;
  513. registerClass: IntermediateCode.RegisterClass;
  514. type: IntermediateCode.Type;
  515. formalParameter: SyntaxTree.Parameter;
  516. recordType: SyntaxTree.RecordType;
  517. isModuleBody: BOOLEAN;
  518. parametersSize: LONGINT;
  519. position: LONGINT;
  520. variable: SyntaxTree.Variable;
  521. nonParameterRegisters: WORD;
  522. PROCEDURE Signature;
  523. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  524. BEGIN
  525. procedureType := x.type(SyntaxTree.ProcedureType);
  526. returnType := procedureType.returnType;
  527. IF returnType # NIL THEN
  528. meta.CheckTypeDeclaration(returnType)
  529. END;
  530. parameter := procedureType.firstParameter;
  531. WHILE parameter # NIL DO
  532. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  533. parameter := parameter.nextParameter;
  534. END;
  535. END Signature;
  536. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: Basic.Integer): BOOLEAN;
  537. VAR result: BOOLEAN;
  538. BEGIN
  539. result := FALSE;
  540. IF x = SyntaxTree.invalidExpression THEN
  541. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  542. result := TRUE;
  543. value := x.resolved(SyntaxTree.IntegerValue).value;
  544. ELSE
  545. Error(x.position,"expression is not an integer constant");
  546. END;
  547. RETURN result;
  548. END CheckIntegerValue;
  549. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: Basic.Integer): BOOLEAN;
  550. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  551. BEGIN
  552. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  553. WHILE (this # NIL) & (this.identifier # id) DO
  554. this := this.nextModifier;
  555. END;
  556. IF this # NIL THEN
  557. IF this.expression = NIL THEN
  558. Error(this.position,"expected expression value");
  559. ELSIF CheckIntegerValue(this.expression,value) THEN
  560. END;
  561. RETURN TRUE
  562. ELSE RETURN FALSE
  563. END;
  564. END HasValue;
  565. CONST DefaultDataMemorySize=512;
  566. BEGIN
  567. IF x.externalName # NIL THEN RETURN END;
  568. (*
  569. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  570. *)
  571. (* code section for this procedure *)
  572. position := x.position.start;
  573. scope := x.procedureScope;
  574. prevScope := currentScope;
  575. currentScope := scope;
  576. procedureType := x.type(SyntaxTree.ProcedureType);
  577. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  578. implementationVisitor.temporaries.Clear;
  579. implementationVisitor.usedRegisters := NIL;
  580. implementationVisitor.registerUsageCount.Init;
  581. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  582. IF (scope.body # NIL) & (x.isInline) THEN
  583. inline := TRUE;
  584. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  585. ir.SetExported(IsExported(x));
  586. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  587. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  588. IF backend.cellsAreObjects THEN
  589. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  590. ir.SetExported(IsExported(x));
  591. ELSE
  592. RETURN; (* cellnet cannot be compiled for final static hardware *)
  593. END;
  594. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  595. inline := FALSE;
  596. AddBodyCallStub(x);
  597. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  598. ir.SetExported(IsExported(x));
  599. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  600. inline := FALSE;
  601. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  602. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,memorySize) THEN memorySize := DefaultDataMemorySize END;
  603. AddBodyCallStub(x);
  604. AddStackAllocation(x,memorySize);
  605. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  606. ir.SetExported(IsExported(x));
  607. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  608. inline := FALSE;
  609. Parameters(procedureType.firstParameter);
  610. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  611. ir.SetExported(IsExported(x));
  612. ELSE
  613. inline := FALSE;
  614. IF x.isEntry OR x.isExit THEN
  615. IF x.isEntry THEN
  616. ir := implementationVisitor.NewSection(module.allSections, Sections.EntryCodeSection, name,x,dump);
  617. ELSE
  618. ir := implementationVisitor.NewSection(module.allSections, Sections.ExitCodeSection, name,x,dump);
  619. END;
  620. ir.SetExported(TRUE);
  621. ELSE
  622. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  623. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  624. END;
  625. END;
  626. callingConvention := procedureType.callingConvention;
  627. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  628. parametersSize := ProcedureParametersSize(backend.system,x);
  629. ELSE
  630. parametersSize := 0;
  631. END;
  632. IF scope.body # NIL THEN
  633. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  634. IF ~inline THEN
  635. IF scope.lastVariable = NIL THEN
  636. stackSize := 0
  637. ELSE
  638. stackSize := scope.lastVariable.offsetInBits;
  639. IF stackSize <0 THEN stackSize := -stackSize END;
  640. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  641. END;
  642. (*
  643. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  644. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  645. *)
  646. (*
  647. ir.Emit(Nop(position)); (* placeholder for fill *)
  648. *)
  649. IF (callingConvention # SyntaxTree.OberonCallingConvention) & (~(callingConvention IN SysvABI) OR (system.addressSize # 64)) THEN
  650. backend.ResetParameterRegisters();
  651. (* assumption: registers are passed left to right and left parameters are in registers *)
  652. formalParameter := procedureType.firstParameter;
  653. WHILE (formalParameter # NIL) DO
  654. IF PassInRegister(formalParameter, callingConvention) THEN
  655. IF formalParameter.type.IsRecordType() THEN
  656. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  657. type := addressType;
  658. ELSE
  659. type := GetType(system, formalParameter.type);
  660. END;
  661. IF backend.GetParameterRegister(callingConvention, type, register) THEN
  662. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  663. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  664. IntermediateCode.InitMemory(dest,type,implementationVisitor.sp,ToMemoryUnits(system,formalParameter.offsetInBits - system.addressSize));
  665. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  666. implementationVisitor.ReleaseIntermediateOperand(src);
  667. END;
  668. END;
  669. formalParameter := formalParameter.nextParameter;
  670. END;
  671. END;
  672. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  673. implementationVisitor.EmitEnter(ir,x.position,x,callingConvention,ToMemoryUnits(system,stackSize));
  674. END;
  675. pc := ir.pc-1;
  676. IF (callingConvention IN SysvABI) & (system.addressSize = 64) THEN
  677. backend.ResetParameterRegisters();
  678. nonParameterRegisters := 0;
  679. (* assumption: registers are passed left to right and left parameters are in registers *)
  680. formalParameter := procedureType.firstParameter;
  681. WHILE (formalParameter # NIL) DO
  682. IF PassInRegister(formalParameter, callingConvention) THEN
  683. IF formalParameter.type.IsRecordType() THEN
  684. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  685. type := addressType;
  686. ELSE
  687. type := GetType(system, formalParameter.type);
  688. END;
  689. IF backend.GetParameterRegister(callingConvention, type, register) THEN
  690. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  691. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  692. implementationVisitor.currentScope := currentScope;
  693. variable := implementationVisitor.GetTemporaryVariable(formalParameter.type,FALSE,FALSE);
  694. formalParameter.SetOffset(variable.offsetInBits);
  695. IntermediateCode.InitMemory(dest,type,implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  696. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  697. implementationVisitor.ReleaseIntermediateOperand(src);
  698. ELSE
  699. INC(nonParameterRegisters);
  700. formalParameter.SetOffset(nonParameterRegisters * addressType.sizeInBits);
  701. END;
  702. END;
  703. formalParameter := formalParameter.nextParameter;
  704. END;
  705. END;
  706. END;
  707. implementationVisitor.tagsAvailable := callingConvention = SyntaxTree.OberonCallingConvention;
  708. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  709. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  710. IF scope.lastVariable # NIL THEN
  711. stackSize := scope.lastVariable.offsetInBits;
  712. IF stackSize <0 THEN stackSize := -stackSize END;
  713. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  714. END;
  715. END;
  716. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  717. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  718. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  719. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.builtinsModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  720. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  721. ir.EmitAt(pc,Push(size));
  722. implementationVisitor.StaticCallOperand(result,procedure);
  723. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  724. END;
  725. *)
  726. END;
  727. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,callingConvention,ToMemoryUnits(system,stackSize))); (*!!*)
  728. IF stackSize > 0 THEN
  729. IF (stackSize MOD system.addressSize = 0) THEN
  730. null := IntermediateCode.Immediate(addressType,0);
  731. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  732. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  733. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  734. ELSE
  735. null := IntermediateCode.Immediate(int8,0);
  736. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  737. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  738. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  739. END;
  740. (*! should potentially be called by backend -- enter might initialize
  741. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  742. *)
  743. END;
  744. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  745. parametersSize := ProcedureParametersSize(backend.system,x);
  746. ELSE
  747. parametersSize := 0;
  748. END;
  749. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  750. finalizer := FALSE;
  751. IF backend.cooperative & x.isFinalizer THEN
  752. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  753. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  754. GetRecordTypeName(recordType,name);
  755. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  756. END;
  757. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  758. IF backend.cooperative THEN
  759. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  760. IF implementationVisitor.profile & ~isModuleBody THEN
  761. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  762. END;
  763. ELSE
  764. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  765. END;
  766. implementationVisitor.EmitLeave(ir, x.position,x,callingConvention);
  767. IF finalizer THEN
  768. IF backend.hasLinkRegister THEN
  769. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  770. END;
  771. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  772. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  773. ir.Emit(Br(x.position,dest));
  774. ELSE
  775. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  776. END;
  777. ELSE
  778. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  779. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  780. END;
  781. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  782. IF backend.cooperative THEN
  783. IF HasPointers (scope) THEN
  784. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  785. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  786. ir.Emit(Result(x.position, res));
  787. ir.Emit(Push(x.position, res));
  788. implementationVisitor.ResetVariables(scope);
  789. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  790. ir.Emit(Pop(x.position, res));
  791. ir.Emit(Return(x.position, res));
  792. ELSE
  793. implementationVisitor.ResetVariables(scope);
  794. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  795. END;
  796. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  797. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  798. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  799. ir.Emit(Result(x.position, res));
  800. ir.Emit(Push(x.position, res));
  801. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  802. ir.Emit(Pop(x.position, res));
  803. ir.Emit(Return(x.position, res));
  804. ELSE
  805. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  806. END;
  807. END;
  808. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  809. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  810. ELSE
  811. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  812. ir.Emit(Nop(x.position));
  813. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  814. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  815. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  816. END;
  817. END;
  818. END
  819. END;
  820. ELSE (* force body for procedures *)
  821. implementationVisitor.EmitEnter(ir, x.position,x,callingConvention,0);
  822. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  823. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  824. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  825. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  826. END;
  827. Scope(scope);
  828. Signature;
  829. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  830. currentScope := prevScope;
  831. END Procedure;
  832. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  833. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  834. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  835. BEGIN
  836. ASSERT (bodyProcedure # NIL);
  837. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  838. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  839. procedure.SetScope(bodyProcedure.scope);
  840. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  841. procedure.SetAccess(SyntaxTree.Hidden);
  842. Global.GetSymbolSegmentedName (procedure,name);
  843. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  844. ir.SetExported(TRUE);
  845. Global.GetSymbolSegmentedName (bodyProcedure,name);
  846. IF ~meta.simple THEN
  847. implementationVisitor.currentScope := module.module.moduleScope;
  848. implementationVisitor.section := ir;
  849. implementationVisitor.PushSelfPointer();
  850. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  851. ELSIF backend.preregisterStatic THEN
  852. implementationVisitor.currentScope := module.module.moduleScope;
  853. implementationVisitor.section := ir;
  854. implementationVisitor.PushSelfPointer();
  855. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  856. ELSE
  857. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  858. ir.Emit(Call(bodyProcedure.position,op, 0));
  859. END;
  860. END AddBodyCallStub;
  861. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: Basic.Integer); (* code that is only necessary for static linkers *)
  862. VAR name: Basic.SegmentedName;
  863. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  864. BEGIN
  865. Global.GetSymbolSegmentedName (symbol,name);
  866. Basic.RemoveSuffix(name);
  867. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  868. ir := implementationVisitor.NewSection(module.allSections,Sections.EntryCodeSection,name,NIL,dump);
  869. ir.SetExported(TRUE);
  870. IntermediateCode.InitImmediate(op,addressType,initStack);
  871. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  872. END AddStackAllocation;
  873. (** entry function to visit a complete module *)
  874. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  875. VAR
  876. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  877. hasDynamicOperatorDeclarations: BOOLEAN;
  878. operator: SyntaxTree.Operator;
  879. import: SyntaxTree.Import;
  880. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  881. BEGIN
  882. type := type.resolved;
  883. IF type IS SyntaxTree.RecordType THEN
  884. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  885. ELSIF (type IS SyntaxTree.ArrayType) THEN
  886. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  887. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  888. END;
  889. ELSIF type IS SyntaxTree.MathArrayType THEN
  890. WITH type: SyntaxTree.MathArrayType DO
  891. IF type.form = SyntaxTree.Open THEN
  892. RETURN TRUE
  893. ELSIF type.form = SyntaxTree.Static THEN
  894. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  895. END;
  896. END;
  897. END;
  898. RETURN FALSE
  899. END TypeNeedsInitialization;
  900. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  901. VAR variable: SyntaxTree.Variable;
  902. BEGIN
  903. variable := scope.firstVariable;
  904. WHILE variable # NIL DO
  905. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  906. IF variable.initializer # NIL THEN RETURN TRUE END;
  907. variable := variable.nextVariable;
  908. END;
  909. RETURN FALSE
  910. END ScopeNeedsInitialization;
  911. BEGIN
  912. ASSERT(x # NIL); ASSERT(module # NIL);
  913. SELF.module := module;
  914. (* add import names to the generated Sections.Module *)
  915. import := x.moduleScope.firstImport;
  916. WHILE import # NIL DO
  917. import.module.GetName(idstr);
  918. module.imports.AddName(idstr);
  919. import := import.nextImport
  920. END;
  921. implementationVisitor.module := module;
  922. implementationVisitor.moduleScope := x.moduleScope;
  923. implementationVisitor.moduleSelf := moduleSelf;
  924. implementationVisitor.canBeLoaded := TRUE;
  925. meta.SetModule(module);
  926. IF (forceModuleBody OR ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  927. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  928. END;
  929. IF backend.profile THEN
  930. EnsureBodyProcedure(x.moduleScope);
  931. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  932. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  933. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  934. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  935. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  936. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0);
  937. Global.GetModuleName(module.module,idstr);
  938. implementationVisitor.ProfilerAddModule(idstr);
  939. implementationVisitor.numberProcedures := 0;
  940. END;
  941. implementationVisitor.profile := backend.profile;
  942. (* check if there is at least one dynamic operator locally defined *)
  943. hasDynamicOperatorDeclarations := FALSE;
  944. operator := x.moduleScope.firstOperator;
  945. WHILE operator # NIL DO
  946. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  947. operator := operator.nextOperator
  948. END;
  949. (* add operator initialization code section *)
  950. IF hasDynamicOperatorDeclarations THEN
  951. EnsureBodyProcedure(x.moduleScope);
  952. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  953. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  954. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0);
  955. END;
  956. Scope(x.moduleScope);
  957. IF hasDynamicOperatorDeclarations THEN
  958. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  959. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  960. END;
  961. IF backend.profile THEN
  962. implementationVisitor.ProfilerPatchInit;
  963. END;
  964. END Module;
  965. END DeclarationVisitor;
  966. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  967. RegisterUsageCount*=OBJECT
  968. VAR used: UsedArray; count: LONGINT;
  969. PROCEDURE &Init;
  970. VAR i: LONGINT;
  971. BEGIN
  972. count := 0;
  973. IF used = NIL THEN NEW(used,64); END;
  974. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  975. END Init;
  976. PROCEDURE Grow;
  977. VAR new: UsedArray; size,i: LONGINT;
  978. BEGIN
  979. size := LEN(used)*2;
  980. NEW(new,size);
  981. FOR i := 0 TO LEN(used)-1 DO
  982. new[i].count := used[i].count;
  983. new[i].type := used[i].type;
  984. new[i].map := used[i].map
  985. END;
  986. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  987. used := new
  988. END Grow;
  989. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  990. BEGIN
  991. INC(count);
  992. IF count = LEN(used) THEN Grow END;
  993. used[count].type := type;
  994. used[count].class := class;
  995. used[count].map := count;
  996. RETURN count;
  997. END Next;
  998. PROCEDURE IncUse(register: LONGINT);
  999. BEGIN
  1000. INC(used[register].count);
  1001. (*
  1002. IF (register = 1) & (count > 30) THEN
  1003. D.TraceBack;
  1004. END;
  1005. *)
  1006. END IncUse;
  1007. PROCEDURE DecUse(register: LONGINT);
  1008. BEGIN
  1009. DEC(used[register].count);
  1010. END DecUse;
  1011. PROCEDURE Map(register: LONGINT): LONGINT;
  1012. VAR map : LONGINT;
  1013. BEGIN
  1014. IF register > 0 THEN
  1015. map := used[register].map;
  1016. WHILE register # map DO register := map; map := used[register].map END;
  1017. END;
  1018. RETURN register
  1019. END Map;
  1020. PROCEDURE Use(register: LONGINT): LONGINT;
  1021. BEGIN
  1022. IF register< LEN(used) THEN
  1023. RETURN used[register].count
  1024. ELSE
  1025. RETURN 0
  1026. END
  1027. END Use;
  1028. END RegisterUsageCount;
  1029. RegisterEntry = POINTER TO RECORD
  1030. prev,next: RegisterEntry;
  1031. register: LONGINT;
  1032. registerClass: IntermediateCode.RegisterClass;
  1033. type: IntermediateCode.Type;
  1034. END;
  1035. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1036. Variables = OBJECT (Basic.List)
  1037. VAR
  1038. inUse: VariableUse;
  1039. registerIndex: LONGINT;
  1040. nameIndex: LONGINT;
  1041. PROCEDURE & Init;
  1042. VAR i: LONGINT;
  1043. BEGIN
  1044. InitList(16);
  1045. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1046. registerIndex := 1024;
  1047. nameIndex := 0;
  1048. END Init;
  1049. PROCEDURE Clear*;
  1050. VAR i: LONGINT;
  1051. BEGIN
  1052. Clear^;
  1053. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1054. registerIndex := 1024;
  1055. nameIndex := 0;
  1056. END Clear;
  1057. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1058. VAR string: SyntaxTree.IdentifierString ;
  1059. BEGIN
  1060. COPY("@hiddenIRVar",string);
  1061. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1062. RETURN SyntaxTree.NewIdentifier(string);
  1063. END GetUID;
  1064. PROCEDURE GetUsage(VAR use: VariableUse);
  1065. BEGIN
  1066. use := inUse;
  1067. END GetUsage;
  1068. PROCEDURE SetUsage(CONST use: VariableUse);
  1069. BEGIN
  1070. inUse := use;
  1071. END SetUsage;
  1072. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1073. VAR any: ANY;
  1074. BEGIN
  1075. any := Get(i);
  1076. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1077. END GetVariable;
  1078. PROCEDURE SetVariable(pos: LONGINT; v: SyntaxTree.Variable);
  1079. BEGIN
  1080. Set(pos, v);
  1081. END SetVariable;
  1082. PROCEDURE Occupy(pos: LONGINT);
  1083. BEGIN
  1084. INCL(inUse[pos DIV 32], pos MOD 32);
  1085. END Occupy;
  1086. PROCEDURE Occupied(pos: LONGINT): BOOLEAN;
  1087. BEGIN
  1088. RETURN (pos MOD 32) IN inUse[pos DIV 32];
  1089. END Occupied;
  1090. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1091. BEGIN
  1092. Occupy(Length());
  1093. Add(v);
  1094. END AddVariable;
  1095. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1096. BEGIN
  1097. t1 := t1.resolved;
  1098. t2 := t2.resolved;
  1099. (*RETURN t1.SameType(t2); *)
  1100. RETURN
  1101. (t1.SameType(t2))
  1102. OR
  1103. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1104. OR
  1105. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits > 0) & (t1.sizeInBits = t2.sizeInBits)
  1106. OR
  1107. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1108. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1109. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1110. OR
  1111. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1112. (DynamicDim(t1) = DynamicDim(t2))
  1113. );
  1114. END CompatibleType;
  1115. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1116. VAR var : SyntaxTree.Variable; i: LONGINT;
  1117. BEGIN
  1118. pos := Length();
  1119. FOR i := 0 TO pos-1 DO
  1120. IF ~(Occupied(i)) THEN
  1121. var := GetVariable(i);
  1122. IF (~var.useRegister) & CompatibleType(type, var.type) & (var.untraced = untraced) (*& ~(var.type.NeedsTrace())*) THEN
  1123. pos := i;
  1124. Occupy(i);
  1125. RETURN var;
  1126. END;
  1127. END;
  1128. END;
  1129. RETURN NIL
  1130. END GetFreeVariable;
  1131. END Variables;
  1132. SymbolMap = POINTER TO RECORD
  1133. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1134. isAddress: BOOLEAN;
  1135. END;
  1136. SymbolMapper = OBJECT
  1137. VAR
  1138. first: SymbolMap;
  1139. PROCEDURE & Init;
  1140. BEGIN
  1141. first := NIL;
  1142. END Init;
  1143. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1144. VAR new: SymbolMap;
  1145. BEGIN
  1146. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1147. new.next := first; first := new;
  1148. END Add;
  1149. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1150. VAR s: SymbolMap;
  1151. BEGIN
  1152. s := first;
  1153. WHILE (s # NIL) & (s.this # this) DO
  1154. s := s.next
  1155. END;
  1156. RETURN s
  1157. END Get;
  1158. END SymbolMapper;
  1159. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1160. VAR
  1161. system: Global.System;
  1162. section: IntermediateCode.Section;
  1163. module: Sections.Module;
  1164. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1165. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1166. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1167. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1168. checker: SemanticChecker.Checker;
  1169. backend: IntermediateBackend;
  1170. meta: MetaDataGenerator;
  1171. position: Position;
  1172. moduleSelf: SyntaxTree.Variable;
  1173. (* variables for hand over of variables / temporary state *)
  1174. currentScope: SyntaxTree.Scope;
  1175. constantDeclaration : SyntaxTree.Symbol;
  1176. result: Operand; (* result of the most recent expression / statement *)
  1177. destination: IntermediateCode.Operand;
  1178. arrayDestinationTag: IntermediateCode.Operand;
  1179. arrayDestinationDimension:LONGINT;
  1180. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1181. conditional: BOOLEAN;
  1182. trueLabel, falseLabel, exitLabel: Label;
  1183. locked: BOOLEAN;
  1184. (*
  1185. usedRegisters: Registers;
  1186. *)
  1187. registerUsageCount: RegisterUsageCount;
  1188. usedRegisters: RegisterEntry;
  1189. (* useful operands and types *)
  1190. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1191. bool,addressType,setType, sizeType, lenType, byteType: IntermediateCode.Type;
  1192. commentPrintout: Printout.Printer;
  1193. dump: Streams.Writer;
  1194. tagsAvailable : BOOLEAN;
  1195. supportedInstruction: SupportedInstructionProcedure;
  1196. supportedImmediate: SupportedImmediateProcedure;
  1197. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1198. emitLabels: BOOLEAN;
  1199. builtinsModuleName : SyntaxTree.IdentifierString;
  1200. indexCounter: LONGINT;
  1201. profile: BOOLEAN;
  1202. profileId, profileInit: IntermediateCode.Section;
  1203. profileInitPatchPosition: LONGINT;
  1204. numberProcedures: LONGINT;
  1205. procedureResultDesignator : SyntaxTree.Designator;
  1206. operatorInitializationCodeSection: IntermediateCode.Section;
  1207. fingerPrinter: FingerPrinter.FingerPrinter;
  1208. temporaries: Variables;
  1209. canBeLoaded : BOOLEAN;
  1210. currentIsInline: BOOLEAN;
  1211. currentMapper: SymbolMapper;
  1212. currentInlineExit: Label;
  1213. moduleBodySection: IntermediateCode.Section;
  1214. NeedDescriptor : BOOLEAN;
  1215. cooperativeSwitches: BOOLEAN;
  1216. lastSwitchPC: LONGINT;
  1217. isUnchecked: BOOLEAN;
  1218. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend);
  1219. BEGIN
  1220. SELF.system := system;
  1221. SELF.builtinsModuleName := runtime;
  1222. currentScope := NIL;
  1223. hiddenPointerType := NIL;
  1224. delegatePointerType := NIL;
  1225. awaitProcCounter := 0;
  1226. labelId := 0; constId := 0; labelId := 0;
  1227. SELF.checker := checker;
  1228. SELF.backend := backend;
  1229. position := Basic.invalidPosition;
  1230. conditional := FALSE;
  1231. locked := FALSE;
  1232. InitOperand(result,ModeUndefined);
  1233. addressType := IntermediateCode.GetType(system,system.addressType);
  1234. setType := IntermediateCode.GetType(system,system.setType);
  1235. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1236. lenType := IntermediateCode.GetType(system, system.lenType);
  1237. byteType := IntermediateCode.GetType(system, system.byteType);
  1238. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1239. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1240. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1241. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1242. nil := IntermediateCode.Immediate(addressType,0);
  1243. one := IntermediateCode.Immediate(addressType,1);
  1244. IntermediateCode.InitOperand(destination);
  1245. tagsAvailable := TRUE;
  1246. supportedInstruction := supportedInstructionProcedure;
  1247. supportedImmediate := supportedImmediateProcedure;
  1248. inData := FALSE;
  1249. SELF.emitLabels := emitLabels;
  1250. IntermediateCode.InitOperand(arrayDestinationTag);
  1251. bool := IntermediateCode.GetType(system,system.booleanType);
  1252. IntermediateCode.InitImmediate(false,bool,0);
  1253. IntermediateCode.InitImmediate(true,bool,1);
  1254. indexCounter := 0;
  1255. NEW(registerUsageCount);
  1256. usedRegisters := NIL;
  1257. procedureResultDesignator := NIL;
  1258. NEW(fingerPrinter);
  1259. NEW(temporaries);
  1260. currentIsInline := FALSE;
  1261. NeedDescriptor := FALSE;
  1262. isUnchecked := backend.noRuntimeChecks;
  1263. END Init;
  1264. TYPE Context = RECORD
  1265. section: IntermediateCode.Section;
  1266. registerUsageCount: RegisterUsageCount;
  1267. usedRegisters: RegisterEntry;
  1268. temporaries: Variables;
  1269. END;
  1270. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1271. VAR context: Context;
  1272. BEGIN
  1273. context.section := section;
  1274. context.registerUsageCount := registerUsageCount;
  1275. context.usedRegisters := usedRegisters;
  1276. context.temporaries := temporaries;
  1277. section := new;
  1278. NEW(registerUsageCount);
  1279. NEW(temporaries);
  1280. usedRegisters := NIL;
  1281. RETURN context;
  1282. END SwitchContext;
  1283. PROCEDURE ReturnToContext(context: Context);
  1284. BEGIN
  1285. section := context.section;
  1286. registerUsageCount := context.registerUsageCount;
  1287. usedRegisters := context.usedRegisters;
  1288. temporaries := context.temporaries;
  1289. END ReturnToContext;
  1290. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1291. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1292. BEGIN
  1293. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1294. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1295. END;
  1296. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1297. section.SetExported(IsExported(syntaxTreeSymbol));
  1298. RETURN section
  1299. END NewSection;
  1300. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1301. VAR new: LONGINT;
  1302. BEGIN
  1303. new := registerUsageCount.Next(type,class);
  1304. UseRegister(new);
  1305. RETURN new
  1306. END AcquireRegister;
  1307. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1308. VAR
  1309. fingerPrint: SyntaxTree.FingerPrint;
  1310. fingerPrintString: ARRAY 32 OF CHAR;
  1311. BEGIN
  1312. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1313. string := "[";
  1314. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1315. Strings.Append(string, fingerPrintString);
  1316. Strings.Append(string, "]");
  1317. END GetFingerprintString;
  1318. (** get the name for the code section that represens a certain symbol
  1319. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1320. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1321. VAR string: ARRAY 32 OF CHAR;
  1322. BEGIN
  1323. Global.GetSymbolSegmentedName(symbol, name);
  1324. (* if the symbol is an operator, then append the fingerprint to the name *)
  1325. IF symbol IS SyntaxTree.Operator THEN
  1326. GetFingerprintString(symbol, string);
  1327. Basic.AppendToSegmentedName(name,string);
  1328. END
  1329. END GetCodeSectionNameForSymbol;
  1330. (** get the name for the code section that represens a certain symbol
  1331. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1332. PROCEDURE GetCodeSectionNameForSymbolInScope(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope; VAR name: ARRAY OF CHAR);
  1333. VAR string: ARRAY 32 OF CHAR;
  1334. BEGIN
  1335. Global.GetSymbolNameInScope(symbol, scope, name);
  1336. (* if the symbol is an operator, then append the fingerprint to the name *)
  1337. IF symbol IS SyntaxTree.Operator THEN
  1338. GetFingerprintString(symbol, string);
  1339. Strings.Append(name, string);
  1340. END
  1341. END GetCodeSectionNameForSymbolInScope;
  1342. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1343. BEGIN
  1344. IF dump # NIL THEN
  1345. dump.String("enter "); dump.String(s); dump.Ln;
  1346. END;
  1347. END TraceEnter;
  1348. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1349. BEGIN
  1350. IF dump # NIL THEN
  1351. dump.String("exit "); dump.String(s); dump.Ln;
  1352. END;
  1353. END TraceExit;
  1354. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1355. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1356. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1357. VAR i: LONGINT;
  1358. BEGIN
  1359. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1360. IF op.rule # NIL THEN
  1361. FOR i := 0 TO LEN(op.rule)-1 DO
  1362. CheckRegister(op.rule[i])
  1363. END;
  1364. END;
  1365. END CheckRegister;
  1366. BEGIN
  1367. CheckRegister(instruction.op1);
  1368. CheckRegister(instruction.op2);
  1369. CheckRegister(instruction.op3);
  1370. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1371. ELSE section.Emit(instruction);
  1372. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1373. END;
  1374. END Emit;
  1375. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1376. VAR saved: RegisterEntry;
  1377. BEGIN
  1378. IF backend.cooperative THEN
  1379. ReleaseUsedRegisters(saved);
  1380. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1381. CallThis(position,"Runtime","Trap",1);
  1382. RestoreRegisterUse(saved);
  1383. ELSE
  1384. Emit(Trap(position,trapNo));
  1385. END;
  1386. END EmitTrap;
  1387. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT);
  1388. VAR name: Basic.SegmentedName;
  1389. VAR op1, op2, reg: IntermediateCode.Operand;
  1390. VAR call, nocall: Label;
  1391. VAR parametersSize: LONGINT;
  1392. VAR prevSection: IntermediateCode.Section;
  1393. VAR prevDump: Streams.Writer;
  1394. VAR body: SyntaxTree.Body;
  1395. VAR procedureType: SyntaxTree.ProcedureType;
  1396. BEGIN
  1397. IF procedure # NIL THEN
  1398. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1399. ELSE procedureType := NIL;
  1400. END;
  1401. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1402. prevSection := SELF.section;
  1403. SELF.section := section;
  1404. prevDump := dump;
  1405. dump := section.comments;
  1406. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1407. IF backend.hasLinkRegister THEN
  1408. Emit(Push(Basic.invalidPosition, lr));
  1409. END;
  1410. Emit(Push(Basic.invalidPosition,fp));
  1411. IF procedure # NIL THEN
  1412. body := procedure.procedureScope.body;
  1413. ELSE
  1414. body := NIL;
  1415. END;
  1416. IF backend.cooperative THEN
  1417. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1418. GetCodeSectionNameForSymbol(procedure, name);
  1419. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1420. ELSE
  1421. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1422. END;
  1423. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1424. IntermediateCode.AddOffset(op1, 1);
  1425. Emit(Push(Basic.invalidPosition,op1));
  1426. Emit(Mov(Basic.invalidPosition,fp, sp));
  1427. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1428. NEW(call, section);
  1429. NEW(nocall, section);
  1430. reg := NewRegisterOperand(addressType);
  1431. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1432. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1433. BrltL(call, sp, reg);
  1434. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1435. BrgeL(nocall, sp, op2);
  1436. call.Resolve(section.pc);
  1437. Emit(Push(Basic.invalidPosition, reg));
  1438. ReleaseIntermediateOperand(reg);
  1439. parametersSize := ProcParametersSize(procedure);
  1440. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1441. Emit(Push(Basic.invalidPosition, op2));
  1442. CallThis(position, "Activities","ExpandStack",2);
  1443. Emit(Result(Basic.invalidPosition, sp));
  1444. nocall.Resolve(section.pc);
  1445. END;
  1446. ELSE
  1447. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1448. Emit(Push(Basic.invalidPosition, one)) ;
  1449. procedureType.SetParametersOffset(1);
  1450. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1451. END;
  1452. Emit(Mov(Basic.invalidPosition, fp, sp));
  1453. END;
  1454. END;
  1455. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1456. SELF.section := prevSection;
  1457. dump := prevDump;
  1458. END EmitEnter;
  1459. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1460. VAR op1,op2: IntermediateCode.Operand;
  1461. VAR instruction: IntermediateCode.Instruction;
  1462. BEGIN
  1463. IntermediateCode.InitNumber(op1,callconv);
  1464. IntermediateCode.InitNumber(op2,varSize);
  1465. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1466. RETURN instruction
  1467. END Enter;
  1468. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1469. VAR op1: IntermediateCode.Operand;
  1470. VAR instruction: IntermediateCode.Instruction;
  1471. BEGIN
  1472. IntermediateCode.InitNumber(op1,callconv);
  1473. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1474. RETURN instruction
  1475. END Leave;
  1476. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1477. VAR prevSection: IntermediateCode.Section;
  1478. VAR op2, size: IntermediateCode.Operand;
  1479. VAR body: SyntaxTree.Body;
  1480. BEGIN
  1481. prevSection := SELF.section;
  1482. SELF.section := section;
  1483. Emit(Leave(position, callconv));
  1484. IF procedure # NIL THEN
  1485. body := procedure.procedureScope.body;
  1486. ELSE
  1487. body := NIL;
  1488. END;
  1489. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1490. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1491. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1492. Emit(Add(position, sp, fp, op2));
  1493. ELSE
  1494. Emit(Mov(position, sp, fp));
  1495. END;
  1496. Emit(Pop(position, fp));
  1497. END;
  1498. SELF.section := prevSection;
  1499. END EmitLeave;
  1500. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1501. VAR m: SymbolMap;
  1502. BEGIN
  1503. position := x.position;
  1504. IF currentIsInline THEN
  1505. m := currentMapper.Get(x);
  1506. IF m # NIL THEN
  1507. (*
  1508. Printout.Info("mapping from", x);
  1509. Printout.Info("mapping to ", m.to);
  1510. *)
  1511. m.to.Accept(SELF);
  1512. op := result;
  1513. IF m.tag # NIL THEN
  1514. ReleaseIntermediateOperand(result.tag);
  1515. m.tag.Accept(SELF);
  1516. op.tag := result.op;
  1517. ReleaseIntermediateOperand(result.tag);
  1518. END;
  1519. RETURN
  1520. END;
  1521. END;
  1522. x.Accept(SELF);
  1523. op := result;
  1524. END Symbol;
  1525. PROCEDURE Expression(x: SyntaxTree.Expression);
  1526. BEGIN
  1527. position := x.position;
  1528. constantDeclaration := NIL;
  1529. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1530. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1531. END;
  1532. IF x.resolved # NIL THEN
  1533. x.resolved.Accept(SELF)
  1534. ELSE
  1535. x.Accept(SELF)
  1536. END;
  1537. (* check this, was commented out in ActiveCells3 *)
  1538. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1539. Error(x.position, "unsupported modifier");
  1540. END;
  1541. END Expression;
  1542. (*
  1543. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1544. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1545. BEGIN
  1546. temporaries.GetUsage(current);
  1547. FOR i := 0 TO LEN(current)-1 DO
  1548. set := current[i] - previous[i];
  1549. IF set # {} THEN
  1550. FOR j := 0 TO MAX(SET)-1 DO
  1551. IF j IN set THEN
  1552. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1553. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1554. Symbol(variable, op);
  1555. MakeMemory(tmp,op.op,addressType,0);
  1556. ReleaseOperand(op);
  1557. Emit(Mov(position,tmp, nil ) );
  1558. ReleaseIntermediateOperand(tmp);
  1559. END;
  1560. END;
  1561. END;
  1562. END;
  1563. END;
  1564. END ResetUsedTemporaries;
  1565. *)
  1566. PROCEDURE Statement(x: SyntaxTree.Statement);
  1567. VAR use: VariableUse;
  1568. BEGIN
  1569. temporaries.GetUsage(use);
  1570. position := x.position;
  1571. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1572. IF commentPrintout # NIL THEN
  1573. commentPrintout.Statement(x);
  1574. dump.Ln;
  1575. (*dump.Update;*)
  1576. END;
  1577. x.Accept(SELF);
  1578. (*
  1579. CheckRegistersFree();
  1580. *)
  1581. (*ResetUsedTemporaries(use);*)
  1582. temporaries.SetUsage(use);
  1583. END Statement;
  1584. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1585. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1586. *)
  1587. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1588. BEGIN
  1589. ASSERT(op.mode # IntermediateCode.Undefined);
  1590. IF op.mode = IntermediateCode.ModeMemory THEN
  1591. ReuseCopy(res,op);
  1592. ELSE
  1593. res := op;
  1594. UseIntermediateOperand(res);
  1595. END;
  1596. IntermediateCode.AddOffset(res,offset);
  1597. IntermediateCode.MakeMemory(res,type);
  1598. END MakeMemory;
  1599. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1600. VAR mem: IntermediateCode.Operand;
  1601. BEGIN
  1602. MakeMemory(mem,res,type,offset);
  1603. ReleaseIntermediateOperand(res);
  1604. res := mem;
  1605. END ToMemory;
  1606. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1607. VAR mem: IntermediateCode.Operand;
  1608. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1609. componentType: SyntaxTree.Type;
  1610. BEGIN
  1611. type := type.resolved;
  1612. IF operand.mode = ModeReference THEN
  1613. IF type IS SyntaxTree.RangeType THEN
  1614. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1615. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1616. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1617. ReleaseOperand(operand);
  1618. operand.op := firstOp;
  1619. operand.tag := lastOp;
  1620. operand.extra := stepOp;
  1621. ELSIF type IS SyntaxTree.ComplexType THEN
  1622. componentType := type(SyntaxTree.ComplexType).componentType;
  1623. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1624. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1625. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1626. ReleaseOperand(operand);
  1627. operand.op := firstOp;
  1628. operand.tag := lastOp
  1629. ELSE
  1630. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1631. ReleaseIntermediateOperand(operand.op);
  1632. operand.op := mem;
  1633. END;
  1634. operand.mode := ModeValue;
  1635. END;
  1636. ASSERT(operand.mode = ModeValue);
  1637. END LoadValue;
  1638. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1639. VAR prevConditional: BOOLEAN;
  1640. BEGIN
  1641. prevConditional := conditional;
  1642. conditional := FALSE;
  1643. InitOperand(result, ModeUndefined);
  1644. Expression(x);
  1645. op := result;
  1646. LoadValue(op,x.type.resolved);
  1647. conditional := prevConditional;
  1648. END Evaluate;
  1649. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1650. VAR prevConditional: BOOLEAN;
  1651. BEGIN
  1652. prevConditional := conditional;
  1653. conditional := FALSE;
  1654. InitOperand(result,ModeUndefined);
  1655. Expression(x);
  1656. op := result;
  1657. (*
  1658. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1659. *)
  1660. conditional := prevConditional;
  1661. END Designate;
  1662. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1663. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1664. BEGIN
  1665. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1666. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1667. conditional := TRUE;
  1668. trueLabel := trueL; falseLabel := falseL;
  1669. Expression(x);
  1670. trueL := trueLabel; falseL := falseLabel;
  1671. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1672. END Condition;
  1673. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1674. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1675. BEGIN
  1676. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1677. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1678. RETURN op
  1679. END NewRegisterOperand;
  1680. PROCEDURE UnuseRegister(register: LONGINT);
  1681. BEGIN
  1682. IF (register > 0) THEN
  1683. register := registerUsageCount.Map(register);
  1684. registerUsageCount.DecUse(register);
  1685. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1686. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1687. END;
  1688. IF registerUsageCount.Use(register)=0 THEN
  1689. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1690. Warning(position, "register cannot be removed");
  1691. END;
  1692. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1693. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1694. END;
  1695. ELSIF registerUsageCount.Use(register)<0 THEN
  1696. Warning(position, "register removed too often");
  1697. IF dump # NIL THEN
  1698. dump.String("register removed too often"); dump.Ln; dump.Update;
  1699. END;
  1700. END;
  1701. END;
  1702. END UnuseRegister;
  1703. PROCEDURE UseRegister(register: LONGINT);
  1704. BEGIN
  1705. IF (register > 0) THEN
  1706. register := registerUsageCount.Map(register);
  1707. registerUsageCount.IncUse(register);
  1708. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1709. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1710. END;
  1711. IF registerUsageCount.Use(register)=1 THEN
  1712. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1713. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1714. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1715. END;
  1716. END;
  1717. END;
  1718. END UseRegister;
  1719. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1720. BEGIN
  1721. UnuseRegister(op.register)
  1722. END ReleaseIntermediateOperand;
  1723. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1724. BEGIN
  1725. UseRegister(op.register)
  1726. END UseIntermediateOperand;
  1727. PROCEDURE ReleaseOperand(CONST op: Operand);
  1728. BEGIN
  1729. UnuseRegister(op.op.register);
  1730. UnuseRegister(op.tag.register);
  1731. UnuseRegister(op.extra.register);
  1732. END ReleaseOperand;
  1733. (* save registers marked in array "markedRegisters" to the stack
  1734. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1735. *)
  1736. PROCEDURE SaveRegisters();
  1737. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1738. BEGIN
  1739. entry := usedRegisters;
  1740. WHILE entry # NIL DO
  1741. type := registerUsageCount.used[entry.register].type;
  1742. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1743. Emit(Push(position,op));
  1744. entry := entry.next;
  1745. END;
  1746. END SaveRegisters;
  1747. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1748. BEGIN
  1749. saved := usedRegisters;
  1750. usedRegisters := NIL;
  1751. END ReleaseUsedRegisters;
  1752. (** remove parameter registers from used queue *)
  1753. PROCEDURE ReleaseParameterRegisters;
  1754. VAR entry,prev,next: RegisterEntry;
  1755. BEGIN
  1756. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1757. WHILE entry # NIL DO
  1758. next := entry.next;
  1759. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1760. registerUsageCount.DecUse(entry.register);
  1761. ASSERT(registerUsageCount.Use(entry.register)=0);
  1762. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1763. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1764. END;
  1765. ELSIF prev = NIL THEN
  1766. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1767. ELSE
  1768. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1769. END;
  1770. entry := next;
  1771. END;
  1772. END ReleaseParameterRegisters;
  1773. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1774. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1775. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1776. BEGIN
  1777. entry := saved;
  1778. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1779. entry := prev;
  1780. WHILE entry # NIL DO
  1781. prev := entry.prev;
  1782. type := entry.type;
  1783. class := entry.registerClass;
  1784. IntermediateCode.InitRegister(op,type,class,entry.register);
  1785. Emit(Pop(position,op));
  1786. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1787. entry := prev;
  1788. END;
  1789. END RestoreRegisters;
  1790. (* re-enter registers from array saved into array markedRegisters (recursion possible) *)
  1791. PROCEDURE RestoreRegisterUse(CONST saved: RegisterEntry);
  1792. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1793. BEGIN
  1794. entry := saved;
  1795. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1796. entry := prev;
  1797. WHILE entry # NIL DO
  1798. prev := entry.prev;
  1799. type := entry.type;
  1800. class := entry.registerClass;
  1801. IntermediateCode.InitRegister(op,type,class,entry.register);
  1802. Emit(Mov(position,op,op));
  1803. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1804. entry := prev;
  1805. END;
  1806. END RestoreRegisterUse;
  1807. PROCEDURE CheckRegistersFree;
  1808. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1809. BEGIN
  1810. IF usedRegisters # NIL THEN
  1811. r := usedRegisters;
  1812. WHILE r # NIL DO
  1813. warning := "register ";
  1814. Strings.AppendInt(warning, r.register);
  1815. Strings.Append(warning, " not released.");
  1816. Warning(position,warning);
  1817. r := r .next;
  1818. END;
  1819. END;
  1820. FOR i := 0 TO registerUsageCount.count-1 DO
  1821. IF registerUsageCount.used[i].count < 0 THEN
  1822. warning := "register ";
  1823. Strings.AppendInt(warning, i);
  1824. Strings.Append(warning, " unused too often.");
  1825. Warning(position,warning);
  1826. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1827. warning := "register ";
  1828. Strings.AppendInt(warning, i);
  1829. Strings.Append(warning, " not unused often enough.");
  1830. Warning(position,warning);
  1831. END;
  1832. END;
  1833. END CheckRegistersFree;
  1834. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1835. Otherwise allocate a new register.
  1836. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1837. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1838. BEGIN
  1839. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1840. UseIntermediateOperand(result);
  1841. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1842. UseIntermediateOperand(result);
  1843. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1844. END;
  1845. END Reuse2;
  1846. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1847. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1848. If not then allocate a new register.
  1849. Does NOT necessarily keep the content of src1 or src2 in result!
  1850. *)
  1851. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1852. BEGIN
  1853. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1854. UseIntermediateOperand(result);
  1855. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1856. UseIntermediateOperand(result);
  1857. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1858. result := alternative; alternative := emptyOperand;
  1859. UseIntermediateOperand(result);
  1860. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1861. END;
  1862. END Reuse2a;
  1863. (* like reuse2 but only one source *)
  1864. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1865. BEGIN
  1866. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1867. UseIntermediateOperand(result);
  1868. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1869. END;
  1870. END Reuse1;
  1871. (* like reuse2a but only one source *)
  1872. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1873. BEGIN
  1874. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1875. UseIntermediateOperand(result);
  1876. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1877. UseIntermediateOperand(result);
  1878. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1879. END;
  1880. END Reuse1a;
  1881. (* like reuse1 but guarantees that content of src1 is in result *)
  1882. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1883. BEGIN
  1884. IF ReusableRegister(src1) THEN
  1885. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1886. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1887. UseIntermediateOperand(result);
  1888. ELSE
  1889. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1890. Emit(Mov(position,result,src1));
  1891. END
  1892. END ReuseCopy;
  1893. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1894. BEGIN
  1895. IF ReusableRegister(src) THEN
  1896. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1897. ELSE
  1898. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1899. Emit(Mov(position,result,src));
  1900. ReleaseIntermediateOperand(src);
  1901. END
  1902. END TransferToRegister;
  1903. (** labels and branches **)
  1904. PROCEDURE NewLabel(): Label;
  1905. VAR label: Label;
  1906. BEGIN
  1907. NEW(label,section); RETURN label;
  1908. END NewLabel;
  1909. PROCEDURE SetLabel(label: Label);
  1910. BEGIN label.Resolve(section.pc);
  1911. END SetLabel;
  1912. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1913. BEGIN
  1914. ASSERT(label # NIL);
  1915. IF label.pc < 0 THEN (* label not yet set *)
  1916. label.AddFixup(section.pc);
  1917. END;
  1918. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1919. END LabelOperand;
  1920. PROCEDURE BrL(label: Label);
  1921. BEGIN
  1922. Emit(Br(position,LabelOperand(label)));
  1923. END BrL;
  1924. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1925. BEGIN
  1926. Emit(Brge(position,LabelOperand(label),left,right));
  1927. END BrgeL;
  1928. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1929. BEGIN
  1930. Emit(Brlt(position,LabelOperand(label),left,right));
  1931. END BrltL;
  1932. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1933. BEGIN
  1934. Emit(Breq(position,LabelOperand(label),left,right));
  1935. END BreqL;
  1936. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1937. BEGIN
  1938. Emit(Brne(position,LabelOperand(label),left,right));
  1939. END BrneL;
  1940. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1941. VAR new: IntermediateCode.Operand;
  1942. BEGIN
  1943. IF Trace THEN TraceEnter("Convert") END;
  1944. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1945. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1946. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1947. & (operand.offset = 0)
  1948. THEN
  1949. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1950. Emit(Conv(position,new,operand));
  1951. ELSE
  1952. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1953. Emit(Conv(position,new,operand));
  1954. ReleaseIntermediateOperand(operand);
  1955. END;
  1956. operand := new;
  1957. 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
  1958. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1959. ELSE
  1960. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1961. Emit(Conv(position,new,operand));
  1962. ReleaseIntermediateOperand(operand);
  1963. operand := new;
  1964. END;
  1965. IF Trace THEN TraceExit("Convert") END;
  1966. END Convert;
  1967. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1968. VAR exit: Label;
  1969. BEGIN
  1970. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1971. exit := NewLabel();
  1972. br(exit,left,right);
  1973. EmitTrap(position,trapNo);
  1974. SetLabel(exit);
  1975. END TrapC;
  1976. (** expressions *)
  1977. (** emit necessary runtime check for set elements **)
  1978. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1979. VAR max: IntermediateCode.Operand;
  1980. BEGIN
  1981. IF isUnchecked THEN RETURN END;
  1982. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1983. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1984. TrapC(BrgeL, max, o, SetElementTrap);
  1985. END;
  1986. END CheckSetElement;
  1987. (** the set that a range represents **)
  1988. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1989. VAR
  1990. operand: Operand;
  1991. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1992. BEGIN
  1993. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1994. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1995. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1996. one := IntermediateCode.Immediate(setType, 1);
  1997. Evaluate(x, operand);
  1998. Convert(operand.op, setType);
  1999. Convert(operand.tag, setType);
  2000. CheckSetElement(operand.op);
  2001. CheckSetElement(operand.tag);
  2002. (* create mask for lower bound
  2003. i.e. shift 11111111 to the left by the value of the lower bound
  2004. *)
  2005. Reuse1(temp, operand.op);
  2006. Emit(Shl(position,temp, allBits, operand.op));
  2007. ReleaseIntermediateOperand(operand.op);
  2008. operand.op := temp;
  2009. (* create mask for upper bound
  2010. i.e. shift 11111111 to the right by the difference between the
  2011. upper bound and the maximum number of set elements
  2012. *)
  2013. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  2014. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  2015. Reuse1(temp, operand.tag);
  2016. ELSE
  2017. Reuse1(temp, operand.tag);
  2018. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  2019. Emit(Sub(position,temp, size, operand.tag));
  2020. END;
  2021. Emit(Shr(position,temp, allBits, operand.tag));
  2022. ReleaseIntermediateOperand(operand.tag);
  2023. operand.tag := temp;
  2024. Reuse2(resultingSet, operand.op, operand.tag);
  2025. (* intersect the two masks *)
  2026. Emit(And(position,resultingSet, operand.op, operand.tag));
  2027. ReleaseOperand(operand);
  2028. RETURN resultingSet
  2029. END SetFromRange;
  2030. PROCEDURE VisitSet*(x: SyntaxTree.Set);
  2031. VAR
  2032. res, operand: Operand;
  2033. temp, one, noBits, dest: IntermediateCode.Operand;
  2034. expression: SyntaxTree.Expression;
  2035. i: LONGINT;
  2036. BEGIN
  2037. IF Trace THEN TraceEnter("VisitSet") END;
  2038. dest := destination;
  2039. destination := emptyOperand;
  2040. noBits := IntermediateCode.Immediate(setType, 0);
  2041. one := IntermediateCode.Immediate(setType, 1);
  2042. (* start off with the empty set *)
  2043. InitOperand(res, ModeValue);
  2044. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2045. Emit(Mov(position,res.op, noBits));
  2046. FOR i := 0 TO x.elements.Length() - 1 DO
  2047. expression := x.elements.GetExpression(i);
  2048. IF expression IS SyntaxTree.RangeExpression THEN
  2049. (* range of set elements *)
  2050. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2051. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2052. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2053. ReleaseIntermediateOperand(temp)
  2054. ELSE
  2055. (* singelton element *)
  2056. Evaluate(expression, operand);
  2057. Convert(operand.op, setType);
  2058. CheckSetElement(operand.op);
  2059. (* create subset containing single element *)
  2060. Reuse1(temp, operand.op);
  2061. Emit(Shl(position,temp, one, operand.op));
  2062. ReleaseOperand(operand);
  2063. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2064. ReleaseIntermediateOperand(temp);
  2065. END
  2066. END;
  2067. result := res;
  2068. destination := dest;
  2069. IF Trace THEN TraceExit("VisitSet") END;
  2070. END VisitSet;
  2071. (* math arrays of the form [a,b,c]
  2072. x is a static array and thus does not provide any pointers
  2073. *)
  2074. PROCEDURE VisitMathArrayExpression*(x: SyntaxTree.MathArrayExpression);
  2075. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2076. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2077. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2078. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2079. element: SyntaxTree.IntegerValue;
  2080. BEGIN
  2081. numberElements := x.elements.Length();
  2082. expression := index.parameters.GetExpression(dim);
  2083. element := expression(SyntaxTree.IntegerValue);
  2084. FOR i := 0 TO numberElements-1 DO
  2085. expression := x.elements.GetExpression(i);
  2086. element.SetValue(i);
  2087. IF expression IS SyntaxTree.MathArrayExpression THEN
  2088. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2089. ELSE
  2090. Assign(index,expression);
  2091. END;
  2092. END;
  2093. END RecursiveAssignment;
  2094. PROCEDURE Dimension(): LONGINT;
  2095. VAR dim: LONGINT; expression: SyntaxTree.Expression;
  2096. BEGIN
  2097. dim := 0;
  2098. expression := x;
  2099. WHILE expression IS SyntaxTree.MathArrayExpression DO
  2100. expression := expression(SyntaxTree.MathArrayExpression).elements.GetExpression(0);
  2101. INC(dim);
  2102. END;
  2103. RETURN dim;
  2104. END Dimension;
  2105. BEGIN
  2106. (*static math array not providing pointers anyway *)
  2107. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2108. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2109. designator.SetType(variable.type);
  2110. dim := Dimension();
  2111. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2112. FOR i := 0 TO dim-1 DO
  2113. element := SyntaxTree.NewIntegerValue(x.position,0);
  2114. element.SetType(system.longintType);
  2115. index.parameters.AddExpression(element);
  2116. END;
  2117. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2118. RecursiveAssignment(x,0);
  2119. Expression(designator);
  2120. END VisitMathArrayExpression;
  2121. PROCEDURE VisitUnaryExpression*(x: SyntaxTree.UnaryExpression);
  2122. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2123. BEGIN
  2124. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2125. dest := destination; destination := emptyOperand;
  2126. IF x.operator = Scanner.Not THEN
  2127. IF conditional THEN
  2128. Condition(x.left,falseLabel,trueLabel)
  2129. ELSE
  2130. Evaluate(x.left,operand);
  2131. InitOperand(result,ModeValue);
  2132. Reuse1a(result.op,operand.op,dest);
  2133. Emit(Xor(position,result.op,operand.op,true));
  2134. ReleaseOperand(operand);
  2135. END;
  2136. ELSIF x.operator = Scanner.Minus THEN
  2137. Evaluate(x.left,operand);
  2138. InitOperand(result,ModeValue);
  2139. Reuse1a(result.op,operand.op,dest);
  2140. type := x.left.type.resolved;
  2141. IF type IS SyntaxTree.SetType THEN
  2142. Emit(Not(position,result.op,operand.op));
  2143. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2144. Reuse1(result.tag,operand.tag);
  2145. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2146. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2147. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2148. Emit(Neg(position,result.op,operand.op));
  2149. ELSE HALT(200)
  2150. END;
  2151. ReleaseOperand(operand);
  2152. ELSIF x.operator = Scanner.Address THEN
  2153. Designate(x.left,operand);
  2154. operand.mode := ModeValue;
  2155. t0 := x.left.type.resolved;
  2156. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2157. ReleaseIntermediateOperand(operand.op);
  2158. operand.op := operand.tag;
  2159. IntermediateCode.InitOperand(operand.tag);
  2160. END;
  2161. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2162. result := operand;
  2163. ELSE HALT(100)
  2164. END;
  2165. destination := dest;
  2166. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2167. END VisitUnaryExpression;
  2168. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2169. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2170. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2171. BEGIN
  2172. type := type.resolved;
  2173. originalType := type;
  2174. IF type IS SyntaxTree.PointerType THEN
  2175. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2176. END;
  2177. IF type IS SyntaxTree.ObjectType THEN
  2178. BrL(trueL);
  2179. ELSE
  2180. ASSERT(type IS SyntaxTree.RecordType);
  2181. (*
  2182. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2183. *)
  2184. ReuseCopy(left,tag);
  2185. right := TypeDescriptorAdr(type);
  2186. IF backend.cooperative THEN
  2187. repeatL := NewLabel();
  2188. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2189. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2190. END;
  2191. SetLabel(repeatL);
  2192. BreqL(trueL,left,right);
  2193. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2194. BrneL(repeatL,left,nil);
  2195. ELSIF meta.simple THEN
  2196. level := type(SyntaxTree.RecordType).Level();
  2197. (* get type desc tag of level relative to base tag *)
  2198. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2199. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2200. IntermediateCode.MakeMemory(left,addressType);
  2201. BreqL(trueL,left,right);
  2202. ELSE
  2203. level := type(SyntaxTree.RecordType).Level();
  2204. (* get type desc tag of level relative to base tag *)
  2205. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2206. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2207. IntermediateCode.MakeMemory(left,addressType);
  2208. BreqL(trueL,left,right);
  2209. END;
  2210. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2211. BrL(falseL);
  2212. END;
  2213. END TypeTest;
  2214. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2215. BEGIN
  2216. backend.Error(module.module.sourceName,position,Streams.Invalid,s);
  2217. IF dump # NIL THEN
  2218. dump.String(s); dump.Ln;
  2219. END;
  2220. END Error;
  2221. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2222. BEGIN
  2223. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2224. IF dump # NIL THEN
  2225. dump.String(s); dump.Ln; dump.Update;
  2226. END;
  2227. END Warning;
  2228. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2229. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2230. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2231. operand:Operand;
  2232. BEGIN
  2233. previousSection := section;
  2234. Global.GetModuleName(mod,name);
  2235. Strings.Append(name,".@Trace");
  2236. Basic.ToSegmentedName(name, pooledName);
  2237. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2238. IF dump # NIL THEN dump := section.comments END;
  2239. IF backend.hasLinkRegister THEN
  2240. Emit(Push(Basic.invalidPosition, lr));
  2241. END;
  2242. variable := mod.moduleScope.firstVariable;
  2243. WHILE variable # NIL DO
  2244. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2245. Symbol(variable, operand);
  2246. register := operand.op;
  2247. CallTraceMethod(register, variable.type);
  2248. ReleaseIntermediateOperand(register);
  2249. END;
  2250. variable := variable.nextVariable;
  2251. END;
  2252. IF backend.hasLinkRegister THEN
  2253. Emit(Pop(Basic.invalidPosition, lr));
  2254. END;
  2255. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2256. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2257. Emit(Br(position,op));
  2258. INC(statCoopTraceModule, section.pc);
  2259. section := previousSection;
  2260. IF dump # NIL THEN dump := section.comments END;
  2261. END CreateTraceModuleMethod;
  2262. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2263. BEGIN
  2264. Emit (Push(position, dst));
  2265. Emit (Push(position, src));
  2266. CallThis(position,"GarbageCollector","Assign", 2);
  2267. END CallAssignPointer;
  2268. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2269. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2270. BEGIN
  2271. IF SemanticChecker.IsPointerType (type) THEN
  2272. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2273. ELSIF type.IsRecordType() THEN
  2274. Emit (Push(position,dst));
  2275. Emit (Push(position,src));
  2276. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2277. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2278. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2279. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2280. ELSIF IsStaticArray(type) THEN
  2281. size := StaticArrayNumElements(type);
  2282. base := StaticArrayBaseType(type);
  2283. IF base.IsRecordType() THEN
  2284. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2285. Emit (Push(position, dst));
  2286. Emit (Push(position, src));
  2287. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2288. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2289. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2290. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2291. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2292. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2293. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2294. Emit (Push(position, dst));
  2295. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2296. Emit (Push(position, src));
  2297. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2298. ELSE
  2299. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2300. Emit (Push(position, dst));
  2301. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2302. Emit (Push(position, src));
  2303. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2304. ASSERT(StaticArrayBaseType(type).IsPointer());
  2305. END;
  2306. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2307. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2308. Emit (Push(position, dst));
  2309. Emit (Push(position, src));
  2310. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2311. ELSE HALT(100); (* missing ? *)
  2312. END;
  2313. END CallAssignMethod;
  2314. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2315. VAR name: Basic.SegmentedName;
  2316. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2317. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2318. context: Context;
  2319. BEGIN
  2320. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2321. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2322. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2323. GetRecordTypeName (recordType,name);
  2324. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2325. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2326. section.SetExported (TRUE);
  2327. IF dump # NIL THEN dump := section.comments END;
  2328. IF backend.hasLinkRegister THEN
  2329. Emit(Push(Basic.invalidPosition, lr));
  2330. END;
  2331. variable := recordType.recordScope.firstVariable;
  2332. WHILE variable # NIL DO
  2333. IF variable.NeedsTrace() THEN
  2334. dst := NewRegisterOperand (addressType);
  2335. src := NewRegisterOperand (addressType);
  2336. Emit (Mov(position, dst, parameter1));
  2337. Emit (Mov(position, src, parameter2));
  2338. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2339. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2340. CallAssignMethod(dst, src, variable.type);
  2341. ReleaseIntermediateOperand(src);
  2342. ReleaseIntermediateOperand(dst);
  2343. END;
  2344. variable := variable.nextVariable;
  2345. END;
  2346. recordBase := recordType.GetBaseRecord();
  2347. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2348. IF backend.hasLinkRegister THEN
  2349. Emit(Pop(Basic.invalidPosition, lr));
  2350. END;
  2351. GetRecordTypeName (recordBase,name);
  2352. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2353. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2354. Emit(Br(position,op));
  2355. ELSE
  2356. Emit(Exit(position,0,0, 0));
  2357. END;
  2358. IF ~recordType.isObject THEN
  2359. GetRecordTypeName (recordType,name);
  2360. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2361. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2362. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2363. section.SetExported (TRUE);
  2364. NEW(registerUsageCount);
  2365. usedRegisters := NIL;
  2366. dst := NewRegisterOperand (addressType);
  2367. src := NewRegisterOperand (addressType);
  2368. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2369. Emit(Mov(position, dst, parameter1));
  2370. Emit(Mov(position, src, parameter2));
  2371. label := NewLabel();
  2372. SetLabel(label);
  2373. Emit(Push(position, dst));
  2374. Emit(Push(position, src));
  2375. GetRecordTypeName (recordType,name);
  2376. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2377. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2378. Emit(Call(position, op, 0));
  2379. Emit(Pop(position, src));
  2380. Emit(Pop(position, dst));
  2381. Emit(Add(position, dst, dst, ofs));
  2382. Emit(Add(position, src, src, ofs));
  2383. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2384. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2385. Emit(Exit(position,0,0, 0));
  2386. END;
  2387. INC(statCoopAssignProcedure, section.pc);
  2388. ReturnToContext(context);
  2389. IF dump # NIL THEN dump := section.comments END;
  2390. END CreateAssignProcedure;
  2391. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2392. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2393. BEGIN
  2394. IF IsUnsafePointer (type) THEN
  2395. skip := NewLabel();
  2396. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2397. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2398. BreqL (skip, op, nil);
  2399. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2400. SetLabel (skip);
  2401. ELSIF SemanticChecker.IsPointerType (type) THEN
  2402. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2403. CallThis(position,"GarbageCollector","Mark", 1);
  2404. ELSIF type.IsRecordType() THEN
  2405. Emit (Push(position,register));
  2406. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2407. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2408. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2409. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2410. ELSIF IsStaticArray(type) THEN
  2411. size := StaticArrayNumElements(type);
  2412. base := StaticArrayBaseType(type);
  2413. IF base.IsRecordType() THEN
  2414. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2415. Emit (Push(position, register));
  2416. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2417. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2418. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2419. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2420. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2421. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2422. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2423. Emit (Push(position, register));
  2424. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2425. ELSE
  2426. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2427. Emit (Push(position, register));
  2428. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2429. ASSERT(base.IsPointer());
  2430. END;
  2431. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2432. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2433. CallThis(position,"GarbageCollector","Mark", 1);
  2434. ELSE HALT(100); (* missing ? *)
  2435. END;
  2436. END CallTraceMethod;
  2437. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2438. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2439. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2440. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2441. BEGIN
  2442. previousSection := section;
  2443. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2444. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2445. GetRecordTypeName (recordType,name);
  2446. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2447. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2448. section.SetExported (TRUE);
  2449. IF dump # NIL THEN dump := section.comments END;
  2450. IF backend.hasLinkRegister THEN
  2451. Emit(Push(Basic.invalidPosition, lr));
  2452. END;
  2453. variable := recordType.recordScope.firstVariable;
  2454. WHILE variable # NIL DO
  2455. IF variable.NeedsTrace() THEN
  2456. register := NewRegisterOperand (addressType);
  2457. Emit (Mov(position,register,parameter1));
  2458. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2459. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2460. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2461. END;
  2462. CallTraceMethod(register, variable.type);
  2463. ReleaseIntermediateOperand(register);
  2464. END;
  2465. variable := variable.nextVariable;
  2466. END;
  2467. recordBase := recordType.GetBaseRecord();
  2468. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2469. recordBase := recordBase.GetBaseRecord();
  2470. END;
  2471. IF recordBase # NIL THEN
  2472. IF backend.hasLinkRegister THEN
  2473. Emit(Pop(Basic.invalidPosition, lr));
  2474. END;
  2475. GetRecordTypeName (recordBase,name);
  2476. IF HasExplicitTraceMethod (recordBase) THEN
  2477. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2478. ELSE
  2479. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2480. END;
  2481. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2482. Emit(Br(position,op));
  2483. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2484. Emit(Exit(position,0,0,0));
  2485. ELSE
  2486. IF backend.hasLinkRegister THEN
  2487. Emit(Pop(Basic.invalidPosition, lr));
  2488. END;
  2489. IF recordType.isObject THEN
  2490. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2491. ELSE
  2492. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2493. END;
  2494. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2495. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2496. Emit(Br(position,op));
  2497. END;
  2498. IF ~recordType.isObject THEN
  2499. GetRecordTypeName (recordType,name);
  2500. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2501. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2502. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2503. section.SetExported (TRUE);
  2504. NEW(registerUsageCount);
  2505. usedRegisters := NIL;
  2506. IF dump # NIL THEN dump := section.comments END;
  2507. register := NewRegisterOperand (addressType);
  2508. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2509. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2510. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2511. END;
  2512. Emit (Push(position,register));
  2513. GetRecordTypeName (recordType,name);
  2514. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2515. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2516. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2517. ReleaseIntermediateOperand(register);
  2518. Emit(Exit(position,0,0,0));
  2519. GetRecordTypeName (recordType,name);
  2520. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2521. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2522. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2523. section.SetExported (TRUE);
  2524. NEW(registerUsageCount);
  2525. usedRegisters := NIL;
  2526. register := NewRegisterOperand (addressType);
  2527. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2528. Emit(Mov(position, register, parameter1));
  2529. label := NewLabel();
  2530. SetLabel(label);
  2531. Emit(Push(position, register));
  2532. GetRecordTypeName (recordType,name);
  2533. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2534. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2535. Emit(Call(position, op, 0));
  2536. Emit(Pop(position, register));
  2537. Emit(Add(position, register, register, ofs));
  2538. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2539. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2540. Emit(Exit(position,0,0,0));
  2541. END;
  2542. INC(statCoopTraceMethod, section.pc);
  2543. ReturnToContext(context);
  2544. IF dump # NIL THEN dump := section.comments END;
  2545. END CreateTraceMethod;
  2546. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2547. VAR name: Basic.SegmentedName;
  2548. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2549. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2550. context: Context;
  2551. BEGIN
  2552. IF recordType.isObject THEN RETURN END;
  2553. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2554. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2555. GetRecordTypeName (recordType,name);
  2556. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2557. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2558. section.SetExported (TRUE);
  2559. IF dump # NIL THEN dump := section.comments END;
  2560. IF backend.hasLinkRegister THEN
  2561. Emit(Push(Basic.invalidPosition, lr));
  2562. END;
  2563. variable := recordType.recordScope.firstVariable;
  2564. WHILE variable # NIL DO
  2565. IF variable.NeedsTrace() THEN
  2566. dst := NewRegisterOperand (addressType);
  2567. Emit (Mov(position, dst, parameter1));
  2568. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2569. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2570. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2571. END;
  2572. CallResetProcedure(dst, nil, variable.type);
  2573. ReleaseIntermediateOperand(dst);
  2574. END;
  2575. variable := variable.nextVariable;
  2576. END;
  2577. recordBase := recordType.GetBaseRecord();
  2578. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2579. IF backend.hasLinkRegister THEN
  2580. Emit(Pop(Basic.invalidPosition, lr));
  2581. END;
  2582. GetRecordTypeName (recordBase,name);
  2583. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2584. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2585. Emit(Br(position,op));
  2586. ELSE
  2587. Emit(Exit(position,0,0, 0));
  2588. END;
  2589. GetRecordTypeName (recordType,name);
  2590. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2591. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2592. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2593. section.SetExported (TRUE);
  2594. NEW(registerUsageCount);
  2595. usedRegisters := NIL;
  2596. dst := NewRegisterOperand (addressType);
  2597. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2598. Emit(Mov(position, dst, parameter1));
  2599. label := NewLabel();
  2600. SetLabel(label);
  2601. Emit(Push(position, dst));
  2602. GetRecordTypeName (recordType,name);
  2603. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2604. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2605. Emit(Call(position, op, 0));
  2606. Emit(Pop(position, dst));
  2607. Emit(Add(position, dst, dst, ofs));
  2608. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2609. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2610. Emit(Exit(position,0,0, 0));
  2611. INC(statCoopResetProcedure, section.pc);
  2612. ReturnToContext(context);
  2613. IF dump # NIL THEN dump := section.comments END;
  2614. END CreateResetProcedure;
  2615. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2616. VAR name: Basic.SegmentedName; context: Context;
  2617. BEGIN
  2618. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2619. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2620. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2621. IF dump # NIL THEN dump := section.comments END;
  2622. IF backend.hasLinkRegister THEN
  2623. Emit(Push(Basic.invalidPosition, lr));
  2624. END;
  2625. Emit(Push(position,fp));
  2626. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2627. ResetVariables(scope);
  2628. Emit(Pop(position,fp));
  2629. Emit(Exit(position,0,0, 0));
  2630. ReturnToContext(context);
  2631. IF dump # NIL THEN dump := section.comments END;
  2632. END CreateResetMethod;
  2633. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2634. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2635. BEGIN
  2636. IF SemanticChecker.IsPointerType (type) THEN
  2637. Emit (Push(position, dest));
  2638. CallThis(position,"GarbageCollector","Reset", 1);
  2639. ELSIF type.IsRecordType() THEN
  2640. Emit (Push(position, dest));
  2641. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2642. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2643. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2644. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2645. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2646. size := GetArrayLength(type, tag);
  2647. base := ArrayBaseType(type);
  2648. IF base.IsRecordType() THEN
  2649. Emit (Push(position, size));
  2650. Emit (Push(position, dest));
  2651. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2652. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2653. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2654. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2655. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2656. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2657. Emit (Push(position, size));
  2658. Emit (Push(position, dest));
  2659. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2660. ELSE
  2661. Emit (Push(position, size));
  2662. Emit (Push(position, dest));
  2663. CallThis(position,"GarbageCollector","ResetArray", 2);
  2664. ASSERT(ArrayBaseType(type).IsPointer());
  2665. END;
  2666. ReleaseIntermediateOperand(size);
  2667. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2668. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2669. Emit (Push(position, dest));
  2670. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2671. ELSE HALT(100); (* missing ? *)
  2672. END;
  2673. END CallResetProcedure;
  2674. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2675. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; prevOffset: SIZE; pc: LONGINT;
  2676. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2677. VAR operand: Operand;
  2678. BEGIN
  2679. Symbol (symbol, operand);
  2680. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2681. ReleaseOperand(operand);
  2682. END Reset;
  2683. BEGIN
  2684. previousScope := currentScope;
  2685. currentScope := scope;
  2686. pc := section.pc;
  2687. prevOffset := MAX(SIZE);
  2688. variable := scope.firstVariable;
  2689. WHILE variable # NIL DO
  2690. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  2691. Reset (variable);
  2692. prevOffset := variable.offsetInBits;
  2693. END;
  2694. variable := variable.nextVariable;
  2695. END;
  2696. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2697. WHILE parameter # NIL DO
  2698. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  2699. Reset (parameter);
  2700. END;
  2701. parameter := parameter.nextParameter;
  2702. END;
  2703. INC(statCoopResetVariables, section.pc - pc);
  2704. currentScope := previousScope;
  2705. END ResetVariables;
  2706. PROCEDURE Reset (symbol: SyntaxTree.Symbol; refer: BOOLEAN);
  2707. VAR operand: Operand; type: SyntaxTree.Type; saved: RegisterEntry; size: SIZE; base: SyntaxTree.Type; arg: IntermediateCode.Operand;
  2708. BEGIN
  2709. type := symbol.type.resolved;
  2710. SaveRegisters();ReleaseUsedRegisters(saved);
  2711. IF SemanticChecker.IsPointerType(type) OR (type IS SyntaxTree.PortType) THEN
  2712. Symbol(symbol, operand);
  2713. ToMemory(operand.op,addressType,0);
  2714. Emit(Push(position,operand.op));
  2715. IF refer THEN
  2716. CallThis(position,"Heaps","Refer",1);
  2717. ELSE
  2718. CallThis(position,"Heaps","Reset",1);
  2719. END;
  2720. ELSIF type.IsRecordType() THEN
  2721. Symbol(symbol, operand);
  2722. Emit(Push(position,operand.op));
  2723. Emit(Push(position,operand.tag)); (* type desc *)
  2724. IF refer THEN
  2725. CallThis(position,"Heaps","ReferRecord",2);
  2726. ELSE
  2727. CallThis(position,"Heaps","ResetRecord",2);
  2728. END;
  2729. ELSIF IsStaticArray(type) THEN
  2730. size := StaticArrayNumElements(type);
  2731. base := StaticArrayBaseType(type);
  2732. Symbol(symbol, operand);
  2733. arg := TypeDescriptorAdr(base);
  2734. Emit(Push(position,operand.op));
  2735. Emit(Push(position,arg));
  2736. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  2737. ReleaseIntermediateOperand(arg);
  2738. IF refer THEN
  2739. CallThis(position,"Heaps","ReferArray",3);
  2740. ELSE
  2741. CallThis(position,"Heaps","ResetArray",3);
  2742. END;
  2743. ELSIF IsStaticMathArray(type) THEN (* the representation of a static math array coincides with static array *)
  2744. size := StaticMathArrayNumElements(type);
  2745. base := StaticMathArrayBaseType(type);
  2746. Symbol(symbol, operand);
  2747. arg := TypeDescriptorAdr(base);
  2748. Emit(Push(position,operand.op));
  2749. Emit(Push(position,arg));
  2750. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  2751. ReleaseIntermediateOperand(arg);
  2752. IF refer THEN
  2753. CallThis(position,"Heaps","ReferArray",3);
  2754. ELSE
  2755. CallThis(position,"Heaps","ResetArray",3);
  2756. END;
  2757. ELSIF type IS SyntaxTree.MathArrayType THEN
  2758. Symbol(symbol, operand);
  2759. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  2760. Emit (Push(position, operand.op));
  2761. ELSE
  2762. Emit (Push(position, operand.tag));
  2763. END;
  2764. IF refer THEN
  2765. CallThis(position,"Heaps","ReferMathArray", 1);
  2766. ELSE
  2767. CallThis(position,"Heaps","ResetMathArray", 1);
  2768. END;
  2769. ELSIF type IS SyntaxTree.ProcedureType THEN
  2770. ASSERT(type(SyntaxTree.ProcedureType).isDelegate);
  2771. Symbol(symbol, operand);
  2772. Emit (Push(position, operand.tag));
  2773. IF refer THEN
  2774. CallThis(position,"Heaps","Refer", 1);
  2775. ELSE
  2776. CallThis(position,"Heaps","Reset", 1);
  2777. END;
  2778. ELSE HALT(100); (* missing ? *)
  2779. END;
  2780. ReleaseOperand(operand);
  2781. RestoreRegisters(saved);
  2782. END Reset;
  2783. PROCEDURE ResetVariables2 (scope: SyntaxTree.ProcedureScope; refer: BOOLEAN);
  2784. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT; prevOffset: SIZE;
  2785. BEGIN
  2786. previousScope := currentScope;
  2787. currentScope := scope;
  2788. pc := section.pc;
  2789. IF ~ refer THEN
  2790. variable := scope.firstVariable;
  2791. prevOffset := MAX(SIZE);
  2792. WHILE variable # NIL DO
  2793. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  2794. Reset (variable,refer);
  2795. prevOffset := variable.offsetInBits;
  2796. END;
  2797. variable := variable.nextVariable;
  2798. END;
  2799. END;
  2800. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2801. WHILE parameter # NIL DO
  2802. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) & ~IsOpenArray(parameter.type) THEN
  2803. Reset (parameter,refer);
  2804. END;
  2805. parameter := parameter.nextParameter;
  2806. END;
  2807. INC(statCoopResetVariables, section.pc - pc);
  2808. currentScope := previousScope;
  2809. END ResetVariables2;
  2810. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2811. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2812. VAR op: IntermediateCode.Operand; context: Context;
  2813. BEGIN
  2814. previousSection := section;
  2815. GetCodeSectionNameForSymbol(procedure, name);
  2816. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  2817. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  2818. IF dump # NIL THEN dump := section.comments END;
  2819. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2820. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2821. Emit(Data(position,op));
  2822. Emit(Data(position,nil));
  2823. IF HasPointers (procedure.procedureScope) THEN
  2824. GetCodeSectionNameForSymbol(procedure, name);
  2825. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2826. ELSE
  2827. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2828. END;
  2829. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2830. Emit(Data(position,op));
  2831. ReturnToContext(context);
  2832. IF dump # NIL THEN dump := section.comments END;
  2833. END CreateProcedureDescriptor;
  2834. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2835. VAR import: SyntaxTree.Import;
  2836. s: Basic.MessageString;
  2837. selfName: SyntaxTree.IdentifierString;
  2838. BEGIN
  2839. moduleScope.ownerModule.GetName(selfName);
  2840. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2841. module := moduleScope.ownerModule
  2842. ELSE
  2843. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2844. IF import = NIL THEN
  2845. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2846. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2847. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2848. s := "Module ";
  2849. Strings.Append(s,moduleName);
  2850. Strings.Append(s," cannot be imported.");
  2851. IF force THEN
  2852. Error(position,s);
  2853. ELSIF canBeLoaded THEN
  2854. IF WarningDynamicLoading THEN
  2855. Strings.Append(s, "=> no dynamic linking.");
  2856. Warning(position, s);
  2857. END;
  2858. canBeLoaded := FALSE;
  2859. END;
  2860. RETURN FALSE
  2861. ELSE
  2862. SELF.module.imports.AddName(moduleName)
  2863. END;
  2864. ELSIF import.module = NIL THEN (* already tried *)
  2865. RETURN FALSE
  2866. END;
  2867. module := import.module;
  2868. END;
  2869. RETURN TRUE
  2870. END AddImport;
  2871. (* needed for old binary object file format*)
  2872. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2873. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2874. BEGIN
  2875. IF AddImport(moduleName,module,TRUE) THEN
  2876. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2877. IF procedure = NIL THEN
  2878. s := "Instruction not supported on target, emulation procedure ";
  2879. Strings.Append(s,moduleName);
  2880. Strings.Append(s,".");
  2881. Strings.Append(s,procedureName);
  2882. Strings.Append(s," not present");
  2883. Error(position,s);
  2884. ELSE
  2885. StaticCallOperand(r,procedure);
  2886. ReleaseOperand(r);
  2887. fp := GetFingerprint(procedure);
  2888. END;
  2889. END;
  2890. END EnsureSymbol;
  2891. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2892. VAR exit: Label; trueL,falseL: Label;
  2893. BEGIN
  2894. trueL := NewLabel();
  2895. falseL := NewLabel();
  2896. exit := NewLabel();
  2897. Condition(x,trueL,falseL);
  2898. InitOperand(result,ModeValue);
  2899. SetLabel(trueL);
  2900. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2901. Emit(Mov(position,result.op,true));
  2902. BrL(exit);
  2903. SetLabel(falseL);
  2904. Emit(MovReplace(position,result.op,false));
  2905. SetLabel(exit);
  2906. END ConditionToValue;
  2907. PROCEDURE ValueToCondition(VAR op: Operand);
  2908. BEGIN
  2909. LoadValue(op,system.booleanType);
  2910. BrneL(trueLabel,op.op, false);
  2911. ReleaseOperand(op);
  2912. BrL(falseLabel);
  2913. END ValueToCondition;
  2914. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2915. VAR size: LONGINT;
  2916. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2917. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2918. BEGIN
  2919. ASSERT(type.form = SyntaxTree.Open);
  2920. baseType := type.arrayBase.resolved;
  2921. IF IsOpenArray(baseType) THEN
  2922. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2923. ELSE
  2924. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2925. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2926. END;
  2927. len := tag;
  2928. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2929. IntermediateCode.MakeMemory(len,addressType);
  2930. UseIntermediateOperand(len);
  2931. Reuse2(res,sizeOperand,len);
  2932. Emit(Mul(position,res,sizeOperand,len));
  2933. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2934. RETURN res
  2935. END GetArraySize;
  2936. BEGIN
  2937. type := type.resolved;
  2938. IF IsOpenArray(type) THEN
  2939. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2940. RETURN tag
  2941. ELSE
  2942. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2943. END;
  2944. ELSE
  2945. size := ToMemoryUnits(system,system.SizeOf(type));
  2946. RETURN IntermediateCode.Immediate(addressType,size)
  2947. END;
  2948. END GetDynamicSize;
  2949. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2950. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2951. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2952. BEGIN
  2953. ASSERT(type.form = SyntaxTree.Open);
  2954. baseType := type.arrayBase.resolved;
  2955. IF IsOpenArray(baseType) THEN
  2956. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2957. ELSE
  2958. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2959. END;
  2960. len := tag;
  2961. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2962. IntermediateCode.MakeMemory(len,addressType);
  2963. UseIntermediateOperand(len);
  2964. Reuse2(res,sizeOperand,len);
  2965. Emit(Mul(position,res,sizeOperand,len));
  2966. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2967. RETURN res
  2968. END GetLength;
  2969. BEGIN
  2970. type := type.resolved;
  2971. IF IsOpenArray(type) THEN
  2972. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2973. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2974. ELSIF type IS SyntaxTree.StringType THEN
  2975. RETURN tag;
  2976. ELSE
  2977. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  2978. END;
  2979. END GetArrayLength;
  2980. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2981. VAR result: IntermediateCode.Operand;
  2982. BEGIN
  2983. IF backend.cooperative THEN
  2984. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2985. ELSE
  2986. MakeMemory(result, tag, addressType, 0);
  2987. END;
  2988. RETURN result
  2989. END GetSizeFromTag;
  2990. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2991. VAR parameter: SyntaxTree.Parameter;
  2992. BEGIN
  2993. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2994. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2995. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2996. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2997. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2998. END;
  2999. RETURN GetDynamicSize(e.type, tag);
  3000. END GetArrayOfBytesSize;
  3001. (*
  3002. to find imported symbol. not needed ?
  3003. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  3004. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  3005. BEGIN
  3006. IF AddImport(moduleName,importedModule,FALSE) THEN
  3007. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  3008. RETURN symbol
  3009. ELSE
  3010. RETURN NIL
  3011. END
  3012. END SymbolByName;
  3013. *)
  3014. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  3015. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  3016. BEGIN
  3017. IF AddImport(moduleName,runtimeModule,force) THEN
  3018. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3019. IF procedure = NIL THEN
  3020. s := "Procedure ";
  3021. Strings.Append(s,moduleName);
  3022. Strings.Append(s,".");
  3023. Strings.Append(s,procedureName);
  3024. Strings.Append(s," not present");
  3025. Error(position,s);
  3026. RETURN FALSE
  3027. ELSE
  3028. RETURN TRUE
  3029. END;
  3030. ELSE RETURN FALSE
  3031. END;
  3032. END GetRuntimeProcedure;
  3033. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  3034. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  3035. s: Basic.MessageString;
  3036. BEGIN
  3037. Basic.InitSegmentedName(name);
  3038. name[0] := Basic.MakeString(moduleName);
  3039. name[1] := Basic.MakeString(typeName);
  3040. name[2] := -1;
  3041. IF AddImport(moduleName,importedModule, FALSE) THEN
  3042. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  3043. IF symbol = NIL THEN
  3044. s := "type ";
  3045. Strings.Append(s,moduleName);
  3046. Strings.Append(s,".");
  3047. Strings.Append(s,typeName);
  3048. Strings.Append(s," not present");
  3049. Error(position,s);
  3050. END;
  3051. ELSE symbol := NIL;
  3052. END;
  3053. IF importedModule = moduleScope.ownerModule THEN
  3054. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3055. ELSE
  3056. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3057. END;
  3058. RETURN symbol
  3059. END GetTypeDescriptor;
  3060. (* 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. *)
  3061. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  3062. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  3063. pooledName: Basic.SegmentedName; size: LONGINT;
  3064. BEGIN
  3065. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  3066. StaticCallOperand(result,procedure);
  3067. IF numberParameters < 0 THEN
  3068. size := ProcParametersSize(procedure);
  3069. ELSE
  3070. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  3071. IF checkNumParameters & (size # ProcParametersSize(procedure)) THEN
  3072. Error(position,"runtime call parameter count mismatch");
  3073. END;
  3074. END;
  3075. Emit(Call(position, result.op, size));
  3076. ReleaseOperand(result);
  3077. ELSE (* only static linking possible *)
  3078. ASSERT(numberParameters >= 0);
  3079. Basic.InitSegmentedName(pooledName);
  3080. pooledName[0] := Basic.MakeString(moduleName);
  3081. pooledName[1] := Basic.MakeString(procedureName);
  3082. pooledName[2] := -1;
  3083. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  3084. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  3085. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  3086. END;
  3087. END CallThisChecked;
  3088. (* 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. *)
  3089. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  3090. BEGIN
  3091. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  3092. END CallThis;
  3093. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  3094. VAR
  3095. left,right: Operand;
  3096. leftSize, rightSize: IntermediateCode.Operand;
  3097. saved: RegisterEntry;
  3098. reg: IntermediateCode.Operand;
  3099. procedureName: SyntaxTree.IdentifierString;
  3100. BEGIN
  3101. procedureName := "CompareString";
  3102. SaveRegisters();ReleaseUsedRegisters(saved);
  3103. Designate(leftExpression,left);
  3104. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3105. Emit(Push(position,leftSize));
  3106. ReleaseIntermediateOperand(leftSize);
  3107. Emit(Push(position,left.op));
  3108. ReleaseOperand(left);
  3109. Designate(rightExpression,right);
  3110. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3111. Emit(Push(position,rightSize));
  3112. ReleaseIntermediateOperand(rightSize);
  3113. Emit(Push(position,right.op));
  3114. ReleaseOperand(right);
  3115. CallThis(position,builtinsModuleName,procedureName, 4);
  3116. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  3117. Emit(Result(position,reg));
  3118. (*
  3119. AcquireThisRegister(int8,IntermediateCode.Result);
  3120. *)
  3121. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  3122. (*
  3123. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  3124. *)
  3125. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  3126. ReleaseIntermediateOperand(reg);
  3127. BrL(falseLabel);
  3128. END CompareString;
  3129. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  3130. VAR
  3131. left,right: Operand;
  3132. leftSize, rightSize: IntermediateCode.Operand;
  3133. saved: RegisterEntry;
  3134. procedureName: SyntaxTree.IdentifierString;
  3135. BEGIN
  3136. procedureName := "CopyString";
  3137. SaveRegisters();ReleaseUsedRegisters(saved);
  3138. Designate(leftExpression,left);
  3139. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3140. Emit(Push(position,leftSize));
  3141. ReleaseIntermediateOperand(leftSize);
  3142. Emit(Push(position,left.op));
  3143. ReleaseOperand(left);
  3144. Designate(rightExpression,right);
  3145. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3146. Emit(Push(position,rightSize));
  3147. ReleaseIntermediateOperand(rightSize);
  3148. Emit(Push(position,right.op));
  3149. ReleaseOperand(right);
  3150. CallThis(position,builtinsModuleName,procedureName,4);
  3151. RestoreRegisters(saved);
  3152. END CopyString;
  3153. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  3154. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3155. leftType,rightType: SyntaxTree.Type;
  3156. leftExpression,rightExpression : SyntaxTree.Expression;
  3157. componentType: IntermediateCode.Type;
  3158. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  3159. size: LONGINT;
  3160. BEGIN
  3161. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3162. dest := destination; destination := emptyOperand;
  3163. leftType := x.left.type.resolved;
  3164. rightType := x.right.type.resolved;
  3165. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3166. CASE x.operator OF
  3167. Scanner.Or:
  3168. (* shortcut evaluation of left OR right *)
  3169. IF ~conditional THEN ConditionToValue(x);
  3170. ELSE
  3171. next := NewLabel();
  3172. Condition(x.left,trueLabel,next);
  3173. SetLabel(next);
  3174. Condition(x.right,trueLabel,falseLabel);
  3175. END;
  3176. |Scanner.And:
  3177. (* shortcut evaluation of left & right *)
  3178. IF ~conditional THEN ConditionToValue(x);
  3179. ELSE
  3180. next := NewLabel();
  3181. Condition(x.left,next,falseLabel);
  3182. SetLabel(next);
  3183. Condition(x.right,trueLabel,falseLabel);
  3184. END;
  3185. |Scanner.Is:
  3186. IF ~conditional THEN ConditionToValue(x);
  3187. ELSE
  3188. (* get type desc tag *)
  3189. IF IsPointerToRecord(leftType,recordType) THEN
  3190. Evaluate(x.left,left);
  3191. Dereference(left,recordType,IsUnsafePointer(leftType))
  3192. ELSE
  3193. Designate(x.left,left);
  3194. END;
  3195. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  3196. ReleaseOperand(left);
  3197. END;
  3198. |Scanner.Plus:
  3199. Evaluate(x.left,left);
  3200. Evaluate(x.right,right);
  3201. IF leftType IS SyntaxTree.SetType THEN
  3202. InitOperand(result,ModeValue);
  3203. Reuse2a(result.op,left.op,right.op,dest);
  3204. Emit(Or(position,result.op,left.op,right.op));
  3205. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3206. InitOperand(result,ModeValue);
  3207. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3208. Reuse2(result.tag,left.tag,right.tag);
  3209. Emit(Add(position,result.op,left.op,right.op));
  3210. Emit(Add(position,result.tag,left.tag,right.tag))
  3211. ELSE
  3212. InitOperand(result,ModeValue);
  3213. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3214. AddInt(result.op, left.op, right.op) ;
  3215. ELSE
  3216. *)
  3217. Reuse2a(result.op,left.op,right.op,dest);
  3218. Emit(Add(position,result.op,left.op,right.op));
  3219. (*
  3220. END;
  3221. *)
  3222. END;
  3223. ReleaseOperand(left); ReleaseOperand(right);
  3224. |Scanner.Minus:
  3225. Evaluate(x.left,left);
  3226. Evaluate(x.right,right);
  3227. IF leftType IS SyntaxTree.SetType THEN
  3228. InitOperand(result,ModeValue);
  3229. Reuse1(result.op,right.op);
  3230. Emit(Not(position,result.op,right.op));
  3231. ReleaseOperand(right);
  3232. Emit(And(position,result.op,result.op,left.op));
  3233. ReleaseOperand(left);
  3234. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3235. InitOperand(result,ModeValue);
  3236. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3237. Reuse2(result.tag,left.tag,right.tag);
  3238. Emit(Sub(position,result.op,left.op,right.op));
  3239. Emit(Sub(position,result.tag,left.tag,right.tag));
  3240. ReleaseOperand(left); ReleaseOperand(right)
  3241. ELSE
  3242. InitOperand(result,ModeValue);
  3243. Reuse2a(result.op,left.op,right.op,dest);
  3244. Emit(Sub(position,result.op,left.op,right.op));
  3245. ReleaseOperand(left); ReleaseOperand(right);
  3246. END;
  3247. |Scanner.Times:
  3248. Evaluate(x.left,left);
  3249. Evaluate(x.right,right);
  3250. IF leftType IS SyntaxTree.SetType THEN
  3251. InitOperand(result,ModeValue);
  3252. Reuse2a(result.op,left.op,right.op,dest);
  3253. Emit(And(position,result.op,left.op,right.op));
  3254. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3255. InitOperand(result, ModeValue);
  3256. componentType := left.op.type;
  3257. (* TODO: review this *)
  3258. (*
  3259. result.op = left.op * right.op - left.tag * right.tag
  3260. result.tag = left.tag * right.op + left.op * right.tag
  3261. *)
  3262. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3263. Emit(Mul(position,result.op, left.op, right.op));
  3264. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3265. Emit(Mul(position,tempReg, left.tag, right.tag));
  3266. Emit(Sub(position,result.op, result.op, tempReg));
  3267. Reuse2(result.tag, left.tag, right.op);
  3268. Emit(Mul(position,result.tag, left.tag, right.op));
  3269. Emit(Mul(position,tempReg, left.op, right.tag));
  3270. Emit(Add(position,result.tag, result.tag, tempReg));
  3271. ReleaseIntermediateOperand(tempReg)
  3272. ELSE
  3273. InitOperand(result,ModeValue);
  3274. Reuse2a(result.op,left.op,right.op,dest);
  3275. Emit(Mul(position,result.op,left.op,right.op));
  3276. END;
  3277. ReleaseOperand(left); ReleaseOperand(right);
  3278. |Scanner.Div:
  3279. Evaluate(x.left,left);
  3280. Evaluate(x.right,right);
  3281. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3282. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3283. IF ~isUnchecked THEN
  3284. exit := NewLabel();
  3285. BrltL(exit,zero,right.op);
  3286. EmitTrap(position,NegativeDivisorTrap);
  3287. SetLabel(exit);
  3288. END;
  3289. END;
  3290. InitOperand(result,ModeValue);
  3291. Reuse2a(result.op,left.op,right.op,dest);
  3292. Emit(Div(position,result.op,left.op,right.op));
  3293. ReleaseOperand(left); ReleaseOperand(right);
  3294. |Scanner.Mod:
  3295. Evaluate(x.left,left);
  3296. Evaluate(x.right,right);
  3297. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3298. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3299. IF ~isUnchecked THEN
  3300. exit := NewLabel();
  3301. BrltL(exit,zero,right.op);
  3302. EmitTrap(position,NegativeDivisorTrap);
  3303. SetLabel(exit);
  3304. END;
  3305. END;
  3306. InitOperand(result,ModeValue);
  3307. Reuse2a(result.op,left.op,right.op,dest);
  3308. Emit(Mod(position,result.op,left.op,right.op));
  3309. ReleaseOperand(left); ReleaseOperand(right);
  3310. |Scanner.Slash:
  3311. Evaluate(x.left,left);
  3312. Evaluate(x.right,right);
  3313. IF leftType IS SyntaxTree.SetType THEN
  3314. InitOperand(result,ModeValue);
  3315. Reuse2a(result.op,left.op,right.op,dest);
  3316. Emit(Xor(position,result.op,left.op,right.op));
  3317. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3318. InitOperand(result,ModeValue);
  3319. componentType := left.op.type;
  3320. (* review this *)
  3321. (*
  3322. divisor = right.op * right.op + right.tag * right.tag
  3323. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3324. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3325. *)
  3326. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3327. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3328. Emit(Mul(position,tempReg, right.op, right.op));
  3329. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3330. Emit(Add(position,tempReg, tempReg, tempReg2));
  3331. result.op := tempReg2;
  3332. Emit(Mul(position,result.op, left.op, right.op));
  3333. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3334. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3335. Emit(Add(position,result.op, result.op, tempReg2));
  3336. Emit(Div(position,result.op, result.op, tempReg));
  3337. Reuse2(result.tag, left.tag, right.op);
  3338. Emit(Mul(position,result.tag, left.tag, right.op));
  3339. Emit(Mul(position,tempReg2, left.op, right.tag));
  3340. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3341. Emit(Div(position,result.tag, result.tag, tempReg));
  3342. ReleaseIntermediateOperand(tempReg);
  3343. ReleaseIntermediateOperand(tempReg2)
  3344. ELSE
  3345. InitOperand(result,ModeValue);
  3346. Reuse2a(result.op,left.op,right.op,dest);
  3347. Emit(Div(position,result.op,left.op,right.op));
  3348. END;
  3349. ReleaseOperand(left); ReleaseOperand(right);
  3350. |Scanner.Equal:
  3351. IF ~conditional THEN ConditionToValue(x);
  3352. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3353. CompareString(BreqL,x.left,x.right);
  3354. ELSE
  3355. Evaluate(x.left,left);
  3356. Evaluate(x.right,right);
  3357. IF leftType IS SyntaxTree.RangeType THEN
  3358. ASSERT(rightType IS SyntaxTree.RangeType);
  3359. BrneL(falseLabel, left.op, right.op); (* first *)
  3360. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3361. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3362. ReleaseOperand(left); ReleaseOperand(right);
  3363. BrL(trueLabel)
  3364. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3365. BrneL(falseLabel, left.op, right.op); (* first *)
  3366. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3367. ReleaseOperand(left); ReleaseOperand(right);
  3368. BrL(trueLabel)
  3369. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3370. (* TODO: review this *)
  3371. BrneL(falseLabel, left.op, right.op); (* real part *)
  3372. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3373. ReleaseOperand(left); ReleaseOperand(right);
  3374. BrL(trueLabel)
  3375. ELSE
  3376. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3377. ReleaseOperand(left); ReleaseOperand(right);
  3378. BrL(trueLabel);
  3379. END;
  3380. END;
  3381. |Scanner.LessEqual:
  3382. IF ~conditional THEN ConditionToValue(x);
  3383. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3384. CompareString(BrgeL,x.right,x.left);
  3385. ELSE
  3386. Evaluate(x.left,left);
  3387. Evaluate(x.right,right);
  3388. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3389. Reuse1(temp.op,right.op);
  3390. Emit(And(position,temp.op,left.op,right.op));
  3391. ReleaseOperand(right);
  3392. BreqL(trueLabel,temp.op,left.op);
  3393. BrL(falseLabel);
  3394. ReleaseOperand(temp);ReleaseOperand(left);
  3395. ELSE
  3396. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3397. ReleaseOperand(left); ReleaseOperand(right);
  3398. BrL(trueLabel);
  3399. END;
  3400. END;
  3401. |Scanner.Less:
  3402. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3403. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  3404. leftExpression.SetType(system.booleanType);
  3405. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3406. rightExpression.SetType(system.booleanType);
  3407. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3408. leftExpression.SetType(system.booleanType);
  3409. Expression(leftExpression);
  3410. ELSIF ~conditional THEN ConditionToValue(x);
  3411. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3412. CompareString(BrltL,x.left,x.right);
  3413. ELSE
  3414. Evaluate(x.left,left);
  3415. Evaluate(x.right,right);
  3416. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3417. ReleaseOperand(left); ReleaseOperand(right);
  3418. BrL(trueLabel);
  3419. END;
  3420. |Scanner.Greater:
  3421. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3422. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  3423. leftExpression.SetType(system.booleanType);
  3424. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3425. rightExpression.SetType(system.booleanType);
  3426. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3427. leftExpression.SetType(system.booleanType);
  3428. Expression(leftExpression);
  3429. ELSIF ~conditional THEN ConditionToValue(x);
  3430. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3431. CompareString(BrltL,x.right,x.left);
  3432. ELSE
  3433. Evaluate(x.left,left);
  3434. Evaluate(x.right,right);
  3435. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3436. ReleaseOperand(left); ReleaseOperand(right);
  3437. BrL(trueLabel);
  3438. END;
  3439. |Scanner.GreaterEqual:
  3440. IF ~conditional THEN ConditionToValue(x);
  3441. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3442. CompareString(BrgeL,x.left,x.right);
  3443. ELSE
  3444. Evaluate(x.left,left);
  3445. Evaluate(x.right,right);
  3446. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3447. Reuse1(temp.op,left.op);
  3448. Emit(And(position,temp.op,left.op,right.op));
  3449. ReleaseOperand(left);
  3450. BreqL(trueLabel, temp.op,right.op);
  3451. ReleaseOperand(temp); ReleaseOperand(right);
  3452. BrL(falseLabel);
  3453. ELSE
  3454. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3455. ReleaseOperand(left); ReleaseOperand(right);
  3456. BrL(trueLabel);
  3457. END;
  3458. END;
  3459. |Scanner.Unequal:
  3460. IF ~conditional THEN ConditionToValue(x);
  3461. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3462. CompareString(BrneL,x.left,x.right);
  3463. ELSE
  3464. Evaluate(x.left,left);
  3465. Evaluate(x.right,right);
  3466. IF leftType IS SyntaxTree.RangeType THEN
  3467. ASSERT(rightType IS SyntaxTree.RangeType);
  3468. BrneL(trueLabel, left.op, right.op); (* first *)
  3469. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3470. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3471. ReleaseOperand(left); ReleaseOperand(right);
  3472. BrL(falseLabel)
  3473. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3474. BrneL(trueLabel, left.op, right.op); (* first *)
  3475. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3476. ReleaseOperand(left); ReleaseOperand(right);
  3477. BrL(falseLabel)
  3478. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3479. (* TODO: review this *)
  3480. BrneL(trueLabel, left.op, right.op); (* real part *)
  3481. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3482. ReleaseOperand(left); ReleaseOperand(right);
  3483. BrL(falseLabel)
  3484. ELSE
  3485. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3486. ReleaseOperand(left); ReleaseOperand(right);
  3487. BrL(trueLabel);
  3488. END;
  3489. END;
  3490. |Scanner.In:
  3491. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3492. Evaluate(x.left,left);
  3493. Evaluate(x.right,right);
  3494. Convert(left.op,setType);
  3495. Convert(right.op,setType);
  3496. ReuseCopy(temp.op,right.op);
  3497. Emit(Shr(position,temp.op,temp.op,left.op));
  3498. ReleaseOperand(right); ReleaseOperand(left);
  3499. IntermediateCode.InitImmediate(one,setType,1);
  3500. Emit(And(position,temp.op,temp.op,one));
  3501. IF conditional THEN
  3502. IntermediateCode.InitImmediate(zero,setType,0);
  3503. BrneL(trueLabel,temp.op,zero);
  3504. ReleaseOperand(temp);
  3505. BrL(falseLabel);
  3506. ELSE
  3507. Convert(temp.op,bool);
  3508. result.mode := ModeValue;
  3509. result.op := temp.op;
  3510. result.tag := nil; (* may be left over from calls to evaluate *)
  3511. END;
  3512. ELSE
  3513. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3514. IF x.operator = Scanner.Questionmarks THEN
  3515. leftExpression := x.left;
  3516. rightExpression := x.right;
  3517. ELSE
  3518. leftExpression := x.right;
  3519. rightExpression := x.left;
  3520. END;
  3521. Evaluate(leftExpression, left);
  3522. Emit(Push(position,left.op));
  3523. ReleaseOperand(left);
  3524. Designate(rightExpression, right);
  3525. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3526. IF ~backend.cellsAreObjects THEN
  3527. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3528. END;
  3529. Emit(Push(position,right.op));
  3530. ReleaseOperand(right);
  3531. IF backend.cellsAreObjects THEN
  3532. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3533. ELSE
  3534. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3535. END;
  3536. InitOperand(result, ModeValue);
  3537. result.op := NewRegisterOperand(bool);
  3538. Emit(Result(position,result.op));
  3539. IF conditional THEN
  3540. IntermediateCode.InitImmediate(zero,setType,0);
  3541. BrneL(trueLabel,result.op,zero);
  3542. ReleaseOperand(result);
  3543. BrL(falseLabel);
  3544. END;
  3545. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3546. leftExpression := x.left;
  3547. rightExpression := x.right;
  3548. Evaluate(leftExpression, left);
  3549. Emit(Push(position,left.op));
  3550. ReleaseOperand(left);
  3551. Evaluate(rightExpression, right);
  3552. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3553. IF ~backend.cellsAreObjects THEN
  3554. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3555. END;
  3556. Emit(Push(position,right.op));
  3557. ReleaseOperand(right);
  3558. IF backend.cellsAreObjects THEN
  3559. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3560. ELSE
  3561. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3562. END;
  3563. InitOperand(result, ModeValue);
  3564. result.op := NewRegisterOperand(bool);
  3565. Emit(Result(position,result.op));
  3566. IF conditional THEN
  3567. IntermediateCode.InitImmediate(zero,setType,0);
  3568. BrneL(trueLabel,result.op,zero);
  3569. ReleaseOperand(result);
  3570. BrL(falseLabel);
  3571. END;
  3572. ELSE
  3573. HALT(100);
  3574. END;
  3575. END;
  3576. destination := dest;
  3577. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3578. END VisitBinaryExpression;
  3579. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  3580. VAR localResult, operand: Operand;
  3581. BEGIN
  3582. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3583. InitOperand(localResult, ModeValue);
  3584. ASSERT(x.first # NIL);
  3585. Evaluate(x.first, operand);
  3586. localResult.op := operand.op;
  3587. ReleaseOperand(operand);
  3588. UseIntermediateOperand(localResult.op);
  3589. ASSERT(x.last # NIL);
  3590. Evaluate(x.last, operand);
  3591. localResult.tag := operand.op;
  3592. ReleaseOperand(operand);
  3593. UseIntermediateOperand(localResult.tag);
  3594. IF x.step # NIL THEN
  3595. Evaluate(x.step, operand);
  3596. localResult.extra := operand.op;
  3597. ReleaseOperand(operand);
  3598. UseIntermediateOperand(localResult.extra);
  3599. END;
  3600. result := localResult;
  3601. IF Trace THEN TraceExit("VisitRangeExpression") END
  3602. END VisitRangeExpression;
  3603. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3604. BEGIN
  3605. HALT(100); (* should never be evaluated *)
  3606. END VisitTensorRangeExpression;
  3607. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  3608. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3609. BEGIN
  3610. IF Trace THEN TraceEnter("VisitConversion") END;
  3611. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3612. dest := destination; destination := emptyOperand;
  3613. Evaluate(x.expression,old);
  3614. InitOperand(result,ModeValue);
  3615. result.op := old.op;
  3616. ASSERT(result.op.mode # 0);
  3617. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3618. (* convert TO a complex number *)
  3619. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3620. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3621. ASSERT(result.op.mode # 0);
  3622. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3623. (* convert FROM a complex number TO a complex number*)
  3624. result.tag := old.tag;
  3625. ASSERT(result.tag.mode # 0);
  3626. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3627. ASSERT(result.tag.mode # 0)
  3628. ELSE
  3629. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3630. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3631. END
  3632. ELSE
  3633. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3634. ASSERT(result.op.mode # 0);
  3635. result.tag := old.tag; (*! probably never used *)
  3636. END;
  3637. destination := dest;
  3638. IF Trace THEN TraceExit("VisitConversion") END;
  3639. END VisitConversion;
  3640. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  3641. BEGIN
  3642. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3643. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3644. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3645. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3646. END VisitTypeDeclaration;
  3647. (** designators (expressions) *)
  3648. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  3649. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3650. BEGIN
  3651. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3652. IF x.left # NIL THEN Expression(x.left) END;
  3653. Symbol(x.symbol,result);
  3654. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3655. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3656. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3657. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3658. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3659. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3660. END;
  3661. END;
  3662. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3663. END VisitSymbolDesignator;
  3664. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3665. BEGIN
  3666. IF isUnchecked THEN RETURN END;
  3667. IF tagsAvailable THEN
  3668. TrapC(BrltL,index,length,IndexCheckTrap);
  3669. END;
  3670. END BoundCheck;
  3671. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3672. VAR d: IntermediateCode.Operand;
  3673. BEGIN
  3674. IF isUnchecked THEN RETURN END;
  3675. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3676. TrapC(op,dim,d,ArraySizeTrap);
  3677. ReleaseIntermediateOperand(d);
  3678. END DimensionCheck;
  3679. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3680. VAR
  3681. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3682. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3683. expression: SyntaxTree.Expression;
  3684. resultingType, leftType, baseType: SyntaxTree.Type;
  3685. skipLabel1: Label;
  3686. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3687. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3688. variableOp: Operand;
  3689. variable: SyntaxTree.Variable;
  3690. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3691. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3692. VAR e: SyntaxTree.Expression; i: LONGINT;
  3693. BEGIN
  3694. tensorFound := FALSE;
  3695. FOR i := 0 TO parameters.Length()-1 DO
  3696. e := parameters.GetExpression(i);
  3697. IF e IS SyntaxTree.TensorRangeExpression THEN
  3698. ASSERT(~tensorFound);
  3699. tensorFound := TRUE;
  3700. ELSIF e IS SyntaxTree.RangeExpression THEN
  3701. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3702. ELSE
  3703. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3704. END;
  3705. END;
  3706. END CountIndices;
  3707. BEGIN
  3708. ASSERT(tagsAvailable);
  3709. resultingType := x.type.resolved; (* resulting type *)
  3710. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3711. InitOperand(localResult, ModeReference);
  3712. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3713. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3714. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3715. (* a globally defined array destination tag is available -> use and invalidate it*)
  3716. localResult.tag := arrayDestinationTag;
  3717. IntermediateCode.InitOperand(arrayDestinationTag)
  3718. ELSE
  3719. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3720. (* the result is of array range type and thus does not provide any collectable pointers *)
  3721. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3722. Symbol(variable, variableOp);
  3723. ReuseCopy(localResult.tag, variableOp.op);
  3724. ReleaseOperand(variableOp);
  3725. END
  3726. END;
  3727. indexListSize := x.parameters.Length();
  3728. CountIndices(x.parameters);
  3729. (*ASSERT(tensorRangeCount <= 1);*)
  3730. (* designate the array to be indexed over, perform tensor range check if known *)
  3731. Designate(x.left, array);
  3732. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3733. Dereference(array, leftType,FALSE);
  3734. IF ~tensorFound THEN
  3735. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  3736. END
  3737. END;
  3738. (* default base offset *)
  3739. srcDimOffset := 0;
  3740. destDimOffset := 0;
  3741. indexDim := 0;
  3742. (* use address of source array as basis *)
  3743. localResult.op := array.op;
  3744. UseIntermediateOperand(localResult.op);
  3745. (* go through the index list *)
  3746. FOR i := 0 TO indexListSize - 1 DO
  3747. expression := x.parameters.GetExpression(i);
  3748. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3749. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3750. srcDimOffset := -indexListSize;
  3751. destDimOffset := -suffixRanges;
  3752. ELSE
  3753. (* determine which dimension of source array is currently looked at *)
  3754. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3755. (* get the memory operand pointing to array descriptor dimension *)
  3756. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3757. (* make a reusable register from it *)
  3758. ReuseCopy(srcDim, tmp);
  3759. ReleaseIntermediateOperand(tmp);
  3760. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3761. ELSE
  3762. srcDim := IntermediateCode.Immediate(sizeType, i);
  3763. END;
  3764. (* get length and increment of source array for current dimension *)
  3765. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3766. Convert(sourceLength.op, sizeType);
  3767. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3768. Convert(sourceIncrement.op, sizeType);
  3769. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3770. ReleaseIntermediateOperand(srcDim);
  3771. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3772. (* SINGLE INDEX *)
  3773. Evaluate(expression, index);
  3774. ReleaseIntermediateOperand(index.tag);
  3775. index.tag := emptyOperand;
  3776. Convert(index.op, sizeType);
  3777. (* lower bound check *)
  3778. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3779. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3780. ELSIF isUnchecked THEN (* do nothing *)
  3781. ELSE
  3782. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3783. END;
  3784. (* upper bound check *)
  3785. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3786. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3787. ELSIF isUnchecked THEN (* do nothing *)
  3788. ELSE
  3789. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3790. END;
  3791. ReleaseOperand(sourceLength);
  3792. Convert(index.op, addressType);
  3793. summand := index.op;
  3794. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3795. (* RANGE OF INDICES *)
  3796. Evaluate(expression, range);
  3797. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3798. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3799. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3800. ReleaseOperand(range);
  3801. Convert(firstIndex, sizeType);
  3802. Convert(lastIndex, sizeType);
  3803. Convert(stepSize, sizeType);
  3804. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3805. if it is 'MAX(LONGINT)' *)
  3806. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3807. TransferToRegister(lastIndex, lastIndex);
  3808. skipLabel1 := NewLabel();
  3809. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3810. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3811. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3812. SetLabel(skipLabel1)
  3813. END;
  3814. (* check if step size is valid *)
  3815. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3816. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3817. ELSIF isUnchecked THEN (* do nothing *)
  3818. ELSE
  3819. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3820. END;
  3821. (* check lower bound check *)
  3822. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3823. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3824. ELSIF isUnchecked THEN (* do nothing *)
  3825. ELSE
  3826. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3827. END;
  3828. (* check upper bound check *)
  3829. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3830. (* statically open range: nothing to do *)
  3831. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3832. ASSERT(staticLastIndex < staticSourceLength)
  3833. ELSIF isUnchecked THEN (* do nothing *)
  3834. ELSE
  3835. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3836. END;
  3837. (* determine length of target array for current dimension *)
  3838. (* 1. incorporate last index: *)
  3839. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3840. (* last index is static *)
  3841. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3842. targetLength := sourceLength.op
  3843. ELSE
  3844. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3845. END;
  3846. UseIntermediateOperand(targetLength);
  3847. ELSE
  3848. (* targetLength := lastIndex + 1
  3849. Reuse1(targetLength, lastIndex);
  3850. *)
  3851. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3852. END;
  3853. ReleaseOperand(sourceLength);
  3854. ReleaseIntermediateOperand(lastIndex);
  3855. (* 2. incorporate first index: *)
  3856. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3857. (* first index and current target length are static *)
  3858. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3859. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3860. (* first index = 0: nothing to do *)
  3861. ELSE
  3862. (* targetLength := targetLength - firstIndex *)
  3863. TransferToRegister(targetLength, targetLength);
  3864. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3865. END;
  3866. (* clip negative lengths to 0 *)
  3867. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3868. IF staticTargetLength < 0 THEN
  3869. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3870. END
  3871. ELSE
  3872. skipLabel1 := NewLabel();
  3873. TransferToRegister(targetLength, targetLength);
  3874. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3875. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3876. SetLabel(skipLabel1)
  3877. END;
  3878. (* 3. incorporate index step size: *)
  3879. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3880. (*step size and current target length are static *)
  3881. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3882. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3883. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3884. (* step size = 1: nothing to do *)
  3885. ELSE
  3886. (* emit code for this:
  3887. targetLength := (targetLength-1) DIV stepSize +1;
  3888. *)
  3889. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3890. DivInt(targetLength, targetLength, stepSize);
  3891. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3892. END;
  3893. (* determine increment of target array for current dimension *)
  3894. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3895. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3896. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3897. (* step size = 1 *)
  3898. targetIncrement := sourceIncrement.op;
  3899. UseIntermediateOperand(targetIncrement)
  3900. ELSE
  3901. (* targetIncrement := sourceIncrement * stepSize *)
  3902. Reuse1(targetIncrement, stepSize);
  3903. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3904. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3905. END;
  3906. ReleaseIntermediateOperand(stepSize);
  3907. (* write length and increment of target array to descriptor *)
  3908. IF destDimOffset < 0 THEN
  3909. (* determine which dimension of target array is currently looked at *)
  3910. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3911. TransferToRegister(destDim, tmp);
  3912. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3913. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3914. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3915. ReleaseIntermediateOperand(destDim);
  3916. INC(destDimOffset);
  3917. ELSE
  3918. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3919. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  3920. END;
  3921. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3922. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3923. INC(indexDim);
  3924. Convert(firstIndex, addressType);
  3925. TransferToRegister(summand, firstIndex);
  3926. ELSE HALT(100);
  3927. END;
  3928. (*
  3929. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3930. *)
  3931. Convert(sourceIncrement.op, addressType);
  3932. Convert(summand, addressType);
  3933. MulInt(summand, summand, sourceIncrement.op);
  3934. ReleaseIntermediateOperand(sourceIncrement.op);
  3935. AddInt(localResult.op, localResult.op, summand);
  3936. ReleaseIntermediateOperand(summand);
  3937. END
  3938. END;
  3939. result := localResult;
  3940. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3941. ReleaseIntermediateOperand(result.tag);
  3942. result.tag := TypeDescriptorAdr(resultingType);
  3943. ELSIF IsDelegate(resultingType) THEN
  3944. ReleaseIntermediateOperand(result.tag);
  3945. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3946. UseIntermediateOperand(result.tag);
  3947. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3948. ReleaseIntermediateOperand(result.tag);
  3949. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3950. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3951. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3952. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3953. (* finalize target array descriptor *)
  3954. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3955. (* write lengths and increments of target array for remaining dimensions *)
  3956. i := indexListSize;
  3957. WHILE indexDim < targetArrayDimensionality DO
  3958. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3959. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3960. ReleaseOperand(sourceLength);
  3961. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3962. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3963. ReleaseOperand(sourceIncrement);
  3964. INC(i); INC(indexDim);
  3965. END;
  3966. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3967. tmp := nil;
  3968. ELSE
  3969. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3970. END;
  3971. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3972. ReleaseIntermediateOperand(tmp);
  3973. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3974. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3975. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3976. ELSE
  3977. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3978. END;
  3979. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3980. ReleaseIntermediateOperand(tmp);
  3981. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3982. (* write dimensionality *)
  3983. IF targetArrayDimensionality # 0 THEN
  3984. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3985. END;
  3986. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3987. END;
  3988. ReleaseOperand(array);
  3989. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3990. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3991. END;
  3992. END MathIndexDesignator;
  3993. (* get the length of an array , trying to make use of static information *)
  3994. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3995. VAR res: IntermediateCode.Operand; size: LONGINT;
  3996. BEGIN
  3997. type := type.resolved;
  3998. IF type IS SyntaxTree.ArrayType THEN
  3999. WITH type: SyntaxTree.ArrayType DO
  4000. IF type.form = SyntaxTree.Static THEN
  4001. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  4002. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4003. Evaluate(type.length, op);
  4004. ReleaseIntermediateOperand(op.tag);
  4005. RETURN op.op;*)
  4006. ELSE
  4007. res := tag;
  4008. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  4009. IntermediateCode.MakeMemory(res,addressType);
  4010. UseIntermediateOperand(res);
  4011. RETURN res
  4012. END
  4013. END;
  4014. ELSE
  4015. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  4016. RETURN IntermediateCode.Immediate(addressType,size);
  4017. END;
  4018. END ArrayLength;
  4019. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  4020. BEGIN
  4021. IF IsImmediate(x) THEN
  4022. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  4023. ELSE
  4024. IF ~ReusableRegister(res) THEN
  4025. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4026. ELSE
  4027. UseIntermediateOperand(res);
  4028. END;
  4029. Emit(Mov(position,res,x))
  4030. END;
  4031. END CopyInt;
  4032. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4033. BEGIN
  4034. ReleaseIntermediateOperand(res);
  4035. IF IsImmediate(x) & IsImmediate(y) THEN
  4036. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  4037. ELSIF IsAddress(x) & IsImmediate(y) THEN
  4038. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  4039. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  4040. ELSIF IsAddress(y) & IsImmediate(x) THEN
  4041. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  4042. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  4043. ELSIF IsRegister(x) & IsImmediate(y) THEN
  4044. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  4045. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  4046. UseIntermediateOperand(res);
  4047. ELSIF IsRegister(y) & IsImmediate(x) THEN
  4048. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  4049. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  4050. UseIntermediateOperand(res);
  4051. ELSE
  4052. IF ~ReusableRegister(res) THEN
  4053. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4054. ELSE
  4055. UseIntermediateOperand(res);
  4056. END;
  4057. IF IsImmediate(x) & (x.intValue = 0) THEN
  4058. Emit(Mov(position,res,y))
  4059. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  4060. Emit(Mov(position,res,x))
  4061. ELSE
  4062. Emit(Add(position,res, x, y));
  4063. END;
  4064. END;
  4065. END AddInt;
  4066. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4067. BEGIN
  4068. ReleaseIntermediateOperand(res);
  4069. IF IsImmediate(x) & IsImmediate(y) THEN
  4070. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  4071. ELSE
  4072. IF ~ReusableRegister(res) THEN
  4073. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4074. ELSE UseIntermediateOperand(res);
  4075. END;
  4076. IF IsImmediate(x) & (x.intValue = 1) THEN
  4077. Emit(Mov(position,res,y))
  4078. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4079. Emit(Mov(position,res,x))
  4080. ELSE
  4081. Emit(Mul(position,res, x, y));
  4082. END;
  4083. END;
  4084. END MulInt;
  4085. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4086. BEGIN
  4087. ReleaseIntermediateOperand(res);
  4088. IF IsImmediate(x) & IsImmediate(y) THEN
  4089. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  4090. ELSE
  4091. IF ~ReusableRegister(res) THEN
  4092. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4093. ELSE UseIntermediateOperand(res);
  4094. END;
  4095. IF IsImmediate(x) & (x.intValue = 1) THEN
  4096. Emit(Mov(position,res,y))
  4097. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4098. Emit(Mov(position,res,x))
  4099. ELSE
  4100. Emit(Div(position,res, x, y));
  4101. END;
  4102. END;
  4103. END DivInt;
  4104. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  4105. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  4106. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  4107. BEGIN
  4108. type := x.left.type.resolved;
  4109. IF type IS SyntaxTree.StringType THEN
  4110. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  4111. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  4112. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  4113. type := atype;
  4114. x.left.SetType(type);
  4115. END;
  4116. IntermediateCode.InitImmediate(res,addressType,0);
  4117. maxDim := x.parameters.Length()-1;
  4118. (*
  4119. computation rule:
  4120. a: ARRAY X,Y,Z OF Element with size S
  4121. a[i,j,k] -->
  4122. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  4123. *)
  4124. FOR i := 0 TO maxDim DO
  4125. e := x.parameters.GetExpression(i);
  4126. Evaluate(e,index);
  4127. Convert(index.op,addressType);
  4128. AddInt(res, res, index.op);
  4129. IF i = 0 THEN
  4130. (*
  4131. ReuseCopy(res, index.op);
  4132. *)
  4133. Designate(x.left,array);
  4134. type := x.left.type.resolved;
  4135. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4136. Dereference(array, type, FALSE);
  4137. END;
  4138. (*
  4139. ELSE AddInt(res, res, index.op);
  4140. *)
  4141. END;
  4142. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4143. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4144. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4145. BoundCheck(index.op, length);
  4146. END;
  4147. ReleaseIntermediateOperand(length);
  4148. END;
  4149. ReleaseOperand(index);
  4150. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4151. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4152. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4153. MulInt(res,res,length);
  4154. END;
  4155. ReleaseIntermediateOperand(length);
  4156. END;
  4157. (* remaining open dimensions -- compute address *)
  4158. i := maxDim+1;
  4159. IF type IS SyntaxTree.ArrayType THEN
  4160. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4161. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4162. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4163. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4164. MulInt(res,res,length);
  4165. END;
  4166. ReleaseIntermediateOperand(length);
  4167. INC(i);
  4168. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4169. END;
  4170. END;
  4171. IF (type IS SyntaxTree.ArrayType) THEN
  4172. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4173. size := StaticSize(system, type);
  4174. IF size # 1 THEN
  4175. length := IntermediateCode.Immediate(addressType,size);
  4176. MulInt(res,res,length);
  4177. END;
  4178. ELSE
  4179. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4180. IF size # 1 THEN
  4181. length := IntermediateCode.Immediate(addressType,size);
  4182. MulInt(res,res,length);
  4183. END;
  4184. END;
  4185. END;
  4186. AddInt(res,res,array.op);
  4187. InitOperand(result,ModeReference);
  4188. result.op := res;
  4189. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4190. ReleaseIntermediateOperand(result.tag);
  4191. result.tag := TypeDescriptorAdr(type);
  4192. ELSIF IsDelegate(type) THEN
  4193. ReleaseIntermediateOperand(result.tag);
  4194. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4195. UseIntermediateOperand(result.tag);
  4196. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4197. ReleaseIntermediateOperand(result.tag);
  4198. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4199. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4200. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4201. END;
  4202. ReleaseOperand(array);
  4203. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  4204. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  4205. END;
  4206. END IndexDesignator;
  4207. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  4208. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4209. BEGIN
  4210. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4211. dest := destination; destination := emptyOperand;
  4212. type := x.left.type.resolved;
  4213. IF type IS SyntaxTree.MathArrayType THEN
  4214. MathIndexDesignator(x);
  4215. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4216. IndexDesignator(x);
  4217. END;
  4218. destination := dest;
  4219. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4220. END VisitIndexDesignator;
  4221. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4222. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4223. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4224. procedure: SyntaxTree.Procedure;
  4225. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4226. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4227. BEGIN
  4228. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4229. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4230. parameters := expression.parameters;
  4231. moduleName := "FoxArrayBase";
  4232. procedureName := "CopyDescriptor";
  4233. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4234. SaveRegisters();ReleaseUsedRegisters(saved);
  4235. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4236. IF procedure = NIL THEN
  4237. s := "procedure ";
  4238. Strings.Append(s,moduleName);
  4239. Strings.Append(s,".");
  4240. Strings.Append(s,procedureName);
  4241. Strings.Append(s," not present");
  4242. Error(position,s);
  4243. ELSE
  4244. (* push address of temporary variable *)
  4245. Symbol(variable,destOperand);
  4246. Emit(Push(position,destOperand.op));
  4247. ReleaseOperand(destOperand);
  4248. (* push src *)
  4249. Evaluate(expression.left,srcOperand);
  4250. (*
  4251. Dereference(srcOperand,expression.type.resolved);
  4252. Emit(Push(position,srcOperand.tag));
  4253. *)
  4254. Emit(Push(position,srcOperand.op));
  4255. ReleaseOperand(srcOperand);
  4256. tensorFound := FALSE;
  4257. FOR i := 0 TO parameters.Length()-1 DO
  4258. e := parameters.GetExpression(i);
  4259. IF e IS SyntaxTree.TensorRangeExpression THEN
  4260. tensorFound := TRUE;
  4261. ELSIF e IS SyntaxTree.RangeExpression THEN
  4262. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4263. ELSE
  4264. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4265. END;
  4266. END;
  4267. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4268. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4269. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4270. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4271. StaticCallOperand(procOp,procedure);
  4272. Emit(Call(position,procOp.op,ProcParametersSize(procedure)));
  4273. ReleaseOperand(procOp);
  4274. END;
  4275. RestoreRegisters(saved);
  4276. END;
  4277. RETURN variable
  4278. END PrepareTensorDescriptor;
  4279. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; register: WORD);
  4280. VAR
  4281. type, descriptorType, baseType, componentType: SyntaxTree.Type;
  4282. operand, tmpOperand, variableOp, variable2Op: Operand;
  4283. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4284. variable, variable2: SyntaxTree.Variable;
  4285. dim, i, size: LONGINT;
  4286. (* TODO: needed? *)
  4287. oldArrayDestinationTag: IntermediateCode.Operand;
  4288. oldArrayDestinationDimension: LONGINT;
  4289. position: Position;
  4290. saved: RegisterEntry;
  4291. arrayFlags: SET;
  4292. m, n: LONGINT;
  4293. PROCEDURE Pass(op: IntermediateCode.Operand);
  4294. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4295. BEGIN
  4296. IF register >= 0 THEN
  4297. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  4298. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4299. Emit(Mov(position,parameterRegister, op));
  4300. ELSE
  4301. Emit(Push(position,op))
  4302. END
  4303. END Pass;
  4304. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4305. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4306. BEGIN
  4307. formalType := formalType.resolved; actualType := actualType.resolved;
  4308. IF IsOpenArray(formalType)THEN
  4309. IF actualType IS SyntaxTree.StringType THEN
  4310. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4311. RETURN;
  4312. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4313. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4314. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4315. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4316. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4317. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4318. ELSE
  4319. tmp := baseReg;
  4320. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4321. IntermediateCode.MakeMemory(tmp,addressType);
  4322. Pass((tmp));
  4323. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4324. END;
  4325. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4326. END;
  4327. END PushArrayLens;
  4328. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4329. BEGIN
  4330. CASE size OF
  4331. |2: INCL(flags,Size2Flag);
  4332. |3: INCL(flags,Size3Flag);
  4333. |4: INCL(flags,Size4Flag);
  4334. |5: INCL(flags,Size5Flag);
  4335. |6: INCL(flags,Size6Flag);
  4336. |7: INCL(flags,Size7Flag);
  4337. |8: INCL(flags,Size8Flag);
  4338. END;
  4339. END SetSmallArraySizeFlag;
  4340. BEGIN
  4341. IF Trace THEN TraceEnter("PushParameter") END;
  4342. position := expression.position;
  4343. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4344. type := expression.type.resolved;
  4345. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4346. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4347. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4348. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4349. );
  4350. (* TODO: needed? *)
  4351. oldArrayDestinationTag := arrayDestinationTag;
  4352. oldArrayDestinationDimension := arrayDestinationDimension;
  4353. IF IsArrayOfSystemByte(parameter.type) THEN
  4354. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4355. Designate(expression,operand);
  4356. ELSE
  4357. Evaluate(expression, tmpOperand);
  4358. (* array of system byte does not provide any pointers *)
  4359. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4360. Symbol(variable, operand);
  4361. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4362. Emit(Mov(position,tmp, tmpOperand.op));
  4363. ReleaseOperand(tmpOperand);
  4364. END;
  4365. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4366. ReleaseIntermediateOperand(operand.tag);
  4367. operand.tag := tmp;
  4368. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4369. Pass((operand.tag));
  4370. END;
  4371. Pass((operand.op));
  4372. ELSIF IsOpenArray(parameter.type) THEN
  4373. Designate(expression,operand);
  4374. baseReg := operand.tag;
  4375. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4376. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4377. END;
  4378. Pass((operand.op)); (* address of the array *)
  4379. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4380. (* case 1
  4381. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4382. *)
  4383. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4384. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4385. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4386. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4387. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4388. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4389. arrayDestinationTag := sp;
  4390. (* case 1b
  4391. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4392. *)
  4393. IF expression IS SyntaxTree.IndexDesignator THEN
  4394. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4395. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4396. arrayDestinationDimension := dim;
  4397. Designate(expression,operand);
  4398. (* case 1a
  4399. P(...,A,...) push: push array descriptor to stack
  4400. *)
  4401. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4402. Designate(expression,operand);
  4403. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4404. i := 0;
  4405. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4406. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4407. INC(i);
  4408. END;
  4409. type := expression.type.resolved;
  4410. WHILE (i<dim) DO (* remaining static dimensions *)
  4411. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4412. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4413. ReleaseOperand(tmpOperand);
  4414. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4415. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4416. ReleaseOperand(tmpOperand);
  4417. INC(i);
  4418. END;
  4419. dimOp := IntermediateCode.Immediate(addressType,dim);
  4420. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4421. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4422. (* case 1d
  4423. P(...,T,...) push: process left arguments, create array descriptor with given s of dimensions from T on stack
  4424. + case 1e
  4425. P(.. PT() ... );
  4426. *)
  4427. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4428. Designate(expression,operand);
  4429. Dereference(operand,type.resolved,FALSE);
  4430. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4431. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4432. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4433. (* case 1f
  4434. P(...,S,...) push: create array descriptor to S on stack
  4435. case 1g
  4436. P(... PS()...)
  4437. *)
  4438. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4439. Designate(expression,operand);
  4440. FOR i := 0 TO dim-1 DO
  4441. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4442. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4443. ReleaseOperand(tmpOperand);
  4444. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4445. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4446. ReleaseOperand(tmpOperand);
  4447. END;
  4448. (*******
  4449. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4450. *)
  4451. arrayFlags := {StaticFlag};
  4452. IF dim = 1 THEN
  4453. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4454. ReleaseOperand(tmpOperand);
  4455. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4456. m := LONGINT(tmpOperand.op.intValue);
  4457. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4458. ELSIF dim = 2 THEN
  4459. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4460. ReleaseOperand(tmpOperand);
  4461. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4462. m := LONGINT(tmpOperand.op.intValue);
  4463. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4464. ReleaseOperand(tmpOperand);
  4465. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4466. n := LONGINT(tmpOperand.op.intValue);
  4467. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4468. INCL(arrayFlags,SmallMatrixFlag);
  4469. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4470. END;
  4471. END;
  4472. (*******)
  4473. dimOp := IntermediateCode.Immediate(addressType,dim);
  4474. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4475. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4476. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4477. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4478. baseType := SemanticChecker.ArrayBase(type,dim);
  4479. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4480. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4481. ELSE HALT(100);
  4482. END;
  4483. (* case 2
  4484. procedure P([left args], var A: array [*,*] of Type, [right args])
  4485. *)
  4486. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4487. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4488. (* case 2b
  4489. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4490. push: push reference to pushed array descriptor
  4491. post: remove array descriptor.
  4492. *)
  4493. IF expression IS SyntaxTree.IndexDesignator THEN
  4494. descriptorType := GetMathArrayDescriptorType(dim);
  4495. (* range type : no allocation possible, should be untraced *)
  4496. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4497. Symbol(variable,variableOp);
  4498. arrayDestinationTag := variableOp.op;
  4499. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4500. arrayDestinationDimension := dim;
  4501. NeedDescriptor := TRUE;
  4502. Designate(expression,operand);
  4503. Pass((operand.tag));
  4504. NeedDescriptor := FALSE;
  4505. (* case 2a
  4506. P(...,A,...)
  4507. push: push reference to array descriptor on stack
  4508. *)
  4509. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4510. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4511. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4512. INC(i);
  4513. END;
  4514. IF i = dim THEN
  4515. Designate(expression,operand);
  4516. Pass((operand.tag));
  4517. ELSE (* open-static *)
  4518. type := expression.type.resolved;
  4519. descriptorType := GetMathArrayDescriptorType(dim);
  4520. (* static array , cannot be reallocated, untraced !*)
  4521. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4522. Symbol(variable,variableOp);
  4523. arrayDestinationTag := variableOp.op;
  4524. Designate(expression,operand);
  4525. FOR i := 0 TO dim-1 DO
  4526. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4527. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4528. ReleaseOperand(tmpOperand);
  4529. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4530. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4531. ReleaseOperand(tmpOperand);
  4532. END;
  4533. dimOp := IntermediateCode.Immediate(addressType,dim);
  4534. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4535. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4536. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4537. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4538. baseType := SemanticChecker.ArrayBase(type,dim);
  4539. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4540. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4541. Pass((arrayDestinationTag));
  4542. END;
  4543. (* case 2d
  4544. P(...,T,...) push: emit dimension check, push T
  4545. *)
  4546. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4547. Designate(expression,operand);
  4548. Dereference(operand,type.resolved,FALSE);
  4549. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4550. Pass((operand.tag));
  4551. (* case 2f
  4552. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4553. push: push reference to pushed array descriptor
  4554. post: remove array descriptor
  4555. *)
  4556. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4557. descriptorType := GetMathArrayDescriptorType(dim);
  4558. (* static array -- cannot be reallocatated, untraced *)
  4559. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4560. Symbol(variable,variableOp);
  4561. arrayDestinationTag := variableOp.op;
  4562. Designate(expression,operand);
  4563. FOR i := 0 TO dim-1 DO
  4564. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4565. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4566. ReleaseOperand(tmpOperand);
  4567. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4568. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4569. ReleaseOperand(tmpOperand);
  4570. END;
  4571. (*
  4572. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4573. *)
  4574. arrayFlags := {StaticFlag};
  4575. IF dim = 1 THEN
  4576. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4577. ReleaseOperand(tmpOperand);
  4578. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4579. m := LONGINT(tmpOperand.op.intValue);
  4580. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4581. ELSIF dim = 2 THEN
  4582. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4583. ReleaseOperand(tmpOperand);
  4584. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4585. m := LONGINT(tmpOperand.op.intValue);
  4586. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4587. ReleaseOperand(tmpOperand);
  4588. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4589. n := LONGINT(tmpOperand.op.intValue);
  4590. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4591. INCL(arrayFlags,SmallMatrixFlag);
  4592. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4593. END;
  4594. END;
  4595. (*******)
  4596. dimOp := IntermediateCode.Immediate(addressType,dim);
  4597. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4598. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4599. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4600. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4601. baseType := SemanticChecker.ArrayBase(type,dim);
  4602. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4603. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4604. Pass((arrayDestinationTag));
  4605. ELSE HALT(100);
  4606. END;
  4607. (* case 3
  4608. procedure P([left args], [const] A: array [?] of Type, [right args])
  4609. *)
  4610. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4611. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4612. (* case 3b
  4613. P(...,A[a..b,c..d],...)
  4614. *)
  4615. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4616. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4617. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4618. Symbol(variable,variableOp);
  4619. LoadValue(variableOp,system.addressType);
  4620. ELSE
  4621. descriptorType := GetMathArrayDescriptorType(dim);
  4622. (* range -- cannot be reallocated *)
  4623. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4624. Symbol(variable,variableOp);
  4625. END;
  4626. arrayDestinationTag := variableOp.op;
  4627. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4628. arrayDestinationDimension := 0;
  4629. Designate(expression,operand);
  4630. Pass((operand.tag));
  4631. (* case 3a
  4632. P(...,A,...)
  4633. *)
  4634. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4635. i := 0;
  4636. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4637. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4638. INC(i);
  4639. END;
  4640. IF i = dim THEN
  4641. Designate(expression,operand);
  4642. Pass((operand.tag));
  4643. ELSE (* open-static *)
  4644. type := expression.type.resolved;
  4645. descriptorType := GetMathArrayDescriptorType(dim);
  4646. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4647. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4648. Symbol(variable,variableOp);
  4649. arrayDestinationTag := variableOp.op;
  4650. Designate(expression,operand);
  4651. FOR i := 0 TO dim-1 DO
  4652. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4653. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4654. ReleaseOperand(tmpOperand);
  4655. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4656. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4657. ReleaseOperand(tmpOperand);
  4658. END;
  4659. dimOp := IntermediateCode.Immediate(addressType,dim);
  4660. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4661. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4662. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4663. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4664. baseType := SemanticChecker.ArrayBase(type,dim);
  4665. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4666. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4667. Pass((arrayDestinationTag));
  4668. END;
  4669. (* case 3d
  4670. P(...,T,...)
  4671. case 3e
  4672. P(...,PT(...),...)
  4673. *)
  4674. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4675. Designate(expression,operand);
  4676. Dereference(operand,type.resolved,FALSE);
  4677. Pass((operand.tag));
  4678. (* case 3f
  4679. P(...,S,...)
  4680. case 3g
  4681. P(...,PS(...),...)
  4682. *)
  4683. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4684. descriptorType := GetMathArrayDescriptorType(dim);
  4685. (* static array does not need to be traced *)
  4686. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4687. Symbol(variable,variableOp);
  4688. arrayDestinationTag := variableOp.op;
  4689. Designate(expression,operand);
  4690. IF operand.op.type.length >1 THEN (* vector register *)
  4691. (* static array does not need to be traced *)
  4692. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4693. Symbol(variable2, variable2Op);
  4694. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4695. Emit(Mov(position,tmp, operand.op));
  4696. ReleaseOperand(operand);
  4697. Symbol(variable2, operand);
  4698. END;
  4699. FOR i := 0 TO dim-1 DO
  4700. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4701. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4702. ReleaseOperand(tmpOperand);
  4703. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4704. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4705. ReleaseOperand(tmpOperand);
  4706. END;
  4707. dimOp := IntermediateCode.Immediate(addressType,dim);
  4708. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4709. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4710. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4711. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4712. baseType := SemanticChecker.ArrayBase(type,dim);
  4713. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4714. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4715. Pass((arrayDestinationTag));
  4716. ELSE HALT(100);
  4717. END;
  4718. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4719. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4720. (* case 4b
  4721. P(...,A[a..b,c..d],...)
  4722. *)
  4723. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4724. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4725. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4726. Symbol(variable,variableOp);
  4727. LoadValue(variableOp,system.addressType);
  4728. ELSE
  4729. descriptorType := GetMathArrayDescriptorType(dim);
  4730. (* range array -- cannot be allocated *)
  4731. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4732. Symbol(variable,variableOp);
  4733. END;
  4734. arrayDestinationTag := variableOp.op;
  4735. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4736. arrayDestinationDimension := 0;
  4737. Designate(expression,operand);
  4738. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4739. Symbol(variable,variableOp);
  4740. ELSE
  4741. (* alias to range -- untraced *)
  4742. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4743. Symbol(variable,variableOp);
  4744. MakeMemory(tmp,variableOp.op,addressType,0);
  4745. Emit(Mov(position,tmp,operand.tag));
  4746. ReleaseIntermediateOperand(tmp);
  4747. END;
  4748. Pass((variableOp.op));
  4749. ReleaseOperand(variableOp);
  4750. (* case 4a
  4751. P(...,A,...)
  4752. *)
  4753. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4754. i := 0;
  4755. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4756. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4757. INC(i);
  4758. END;
  4759. IF i = dim THEN
  4760. Designate(expression,operand);
  4761. arrayDestinationTag := operand.tag;
  4762. ELSE (* open-static *)
  4763. type := expression.type.resolved;
  4764. descriptorType := GetMathArrayDescriptorType(dim);
  4765. (* static array -- untraced *)
  4766. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4767. Symbol(variable,variableOp);
  4768. arrayDestinationTag := variableOp.op;
  4769. Designate(expression,operand);
  4770. FOR i := 0 TO dim-1 DO
  4771. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4772. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4773. ReleaseOperand(tmpOperand);
  4774. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4775. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4776. ReleaseOperand(tmpOperand);
  4777. END;
  4778. dimOp := IntermediateCode.Immediate(addressType,dim);
  4779. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4780. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4781. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4782. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4783. baseType := SemanticChecker.ArrayBase(type,dim);
  4784. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4785. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4786. END;
  4787. (* tensor alias to open array -- untraced *)
  4788. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4789. Symbol(variable,variableOp);
  4790. MakeMemory(tmp,variableOp.op,addressType,0);
  4791. Emit(Mov(position,tmp,arrayDestinationTag));
  4792. ReleaseIntermediateOperand(tmp);
  4793. Pass((variableOp.op));
  4794. ReleaseOperand(variableOp);
  4795. (* case 4d
  4796. P(...,T,...)
  4797. *)
  4798. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4799. Designate(expression,operand);
  4800. Pass((operand.op));
  4801. (* case 4f
  4802. P(...,S,...)
  4803. *)
  4804. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4805. descriptorType := GetMathArrayDescriptorType(dim);
  4806. (* static array -- cannot be reallocated, untraced *)
  4807. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4808. Symbol(variable,variableOp);
  4809. arrayDestinationTag := variableOp.op;
  4810. Designate(expression,operand);
  4811. FOR i := 0 TO dim-1 DO
  4812. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4813. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4814. ReleaseOperand(tmpOperand);
  4815. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4816. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4817. ReleaseOperand(tmpOperand);
  4818. END;
  4819. dimOp := IntermediateCode.Immediate(addressType,dim);
  4820. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4821. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4822. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4823. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4824. baseType := SemanticChecker.ArrayBase(type,dim);
  4825. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4826. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4827. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4828. Symbol(variable,variableOp);
  4829. MakeMemory(tmp,variableOp.op,addressType,0);
  4830. Emit(Mov(position,tmp,arrayDestinationTag));
  4831. ReleaseIntermediateOperand(tmp);
  4832. Pass((variableOp.op));
  4833. ReleaseOperand(variableOp);
  4834. ELSE HALT(100);
  4835. END;
  4836. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4837. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4838. Designate(expression,operand);
  4839. IF operand.op.type.length > 1 THEN
  4840. Emit(Push(position, operand.op));
  4841. ELSE
  4842. size := system.SizeOf(type);
  4843. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4844. size := ToMemoryUnits(system,size);
  4845. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4846. arrayDestinationTag := sp;
  4847. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4848. END;
  4849. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4850. Designate(expression,operand);
  4851. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4852. (* static array no pointer *)
  4853. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4854. Symbol(variable,variableOp);
  4855. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4856. Emit(Mov(position,tmp,operand.op));
  4857. Emit(Push(position,variableOp.op));
  4858. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4859. Pass((operand.op));
  4860. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4861. END;
  4862. ELSE HALT(200)
  4863. END;
  4864. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4865. IF parameter.kind = SyntaxTree.VarParameter THEN
  4866. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4867. Designate(expression, operand);
  4868. Pass((operand.op));
  4869. ELSE
  4870. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4871. Evaluate(expression, operand);
  4872. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,system.lenType) = system.AlignmentOf(system.variableAlignment,system.lenType)) THEN
  4873. Pass((operand.extra)); (* step *)
  4874. Pass((operand.tag)); (* last *)
  4875. Pass((operand.op)); (* first *)
  4876. ELSE
  4877. (* pass range as structure in order to comply with the variable alignment of its components *)
  4878. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  4879. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,system.lenType)));
  4880. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4881. tmp := sp;
  4882. IntermediateCode.MakeMemory(tmp,operand.op.type);
  4883. Emit(Mov(position,tmp,operand.op)); (* first *)
  4884. size := ToMemoryUnits(system,system.AlignedSizeOf(system.lenType));
  4885. IntermediateCode.AddOffset(tmp,size);
  4886. Emit(Mov(position,tmp,operand.tag)); (* last *)
  4887. IntermediateCode.AddOffset(tmp,size);
  4888. Emit(Mov(position,tmp,operand.extra)); (* step *)
  4889. END;
  4890. END
  4891. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4892. IF parameter.kind = SyntaxTree.VarParameter THEN
  4893. Designate(expression, operand);
  4894. Pass((operand.op));
  4895. ELSE
  4896. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4897. Evaluate(expression, operand);
  4898. componentType := parameter.type.resolved(SyntaxTree.ComplexType).componentType;
  4899. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,componentType) = system.AlignmentOf(system.variableAlignment,componentType)) THEN
  4900. Pass((operand.tag)); (* imaginary part *)
  4901. Pass((operand.op)) (* real part *)
  4902. ELSE
  4903. (* pass complex as structure in order to comply with the variable alignment of its components *)
  4904. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  4905. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,componentType)));
  4906. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4907. tmp := sp;
  4908. IntermediateCode.MakeMemory(tmp,operand.op.type);
  4909. Emit(Mov(position,tmp,operand.op)); (* real part *)
  4910. size := ToMemoryUnits(system,system.AlignedSizeOf(componentType));
  4911. IntermediateCode.AddOffset(tmp,size);
  4912. Emit(Mov(position,tmp,operand.tag)); (* imaginary part *)
  4913. END
  4914. END
  4915. ELSE
  4916. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4917. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4918. Designate(expression,operand);
  4919. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4920. (* stack allocation *)
  4921. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4922. (*! parameter alignment to be discussed ... *)
  4923. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4924. size := type(SyntaxTree.StringType).length;
  4925. END;
  4926. IF backend.cooperative & parameter.NeedsTrace() THEN
  4927. dst := NewRegisterOperand (addressType);
  4928. Emit(Mov(position,dst, sp));
  4929. IntermediateCode.InitImmediate(null, byteType, 0);
  4930. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4931. ReleaseIntermediateOperand(dst);
  4932. SaveRegisters();ReleaseUsedRegisters(saved);
  4933. (* register dst has been freed before SaveRegisters already *)
  4934. CallAssignMethod(dst, operand.op, parameter.type);
  4935. RestoreRegisters(saved);
  4936. END;
  4937. IF operand.op.type.length > 1 THEN (* vector *)
  4938. MakeMemory(tmp,sp,operand.op.type,0);
  4939. Emit(Mov(position, tmp, operand.op));
  4940. ELSE
  4941. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4942. END;
  4943. ELSIF IsOpenArray(parameter.type) THEN
  4944. Designate(expression,operand);
  4945. baseReg := operand.tag;
  4946. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4947. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4948. END;
  4949. Pass((operand.op)); (* address of the array *)
  4950. ELSIF IsDelegate(parameter.type) THEN
  4951. Evaluate(expression,operand);
  4952. IF backend.cooperative & parameter.NeedsTrace() THEN
  4953. Emit(Push(position, nil));
  4954. dst := NewRegisterOperand (addressType);
  4955. Emit(Mov(position,dst, sp));
  4956. ReleaseIntermediateOperand(dst);
  4957. SaveRegisters();ReleaseUsedRegisters(saved);
  4958. Emit(Push(position, dst));
  4959. (* register dst has been freed before SaveRegisters already *)
  4960. Emit(Push(position, operand.tag));
  4961. CallThis(position,"GarbageCollector","Assign",2);
  4962. RestoreRegisters(saved);
  4963. ELSE
  4964. Pass((operand.tag));
  4965. END;
  4966. Pass((operand.op));
  4967. ELSE
  4968. Evaluate(expression,operand);
  4969. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4970. Emit(Push(position, nil));
  4971. dst := NewRegisterOperand (addressType);
  4972. Emit(Mov(position,dst, sp));
  4973. ReleaseIntermediateOperand(dst);
  4974. SaveRegisters();ReleaseUsedRegisters(saved);
  4975. Emit(Push(position, dst));
  4976. (* register dst has been freed before SaveRegisters already *)
  4977. Emit(Push(position, operand.op));
  4978. CallThis(position,"GarbageCollector","Assign",2);
  4979. RestoreRegisters(saved);
  4980. ELSE
  4981. Pass((operand.op));
  4982. END;
  4983. END;
  4984. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4985. Evaluate(expression,operand);
  4986. Pass((operand.op));
  4987. ELSE (* var parameter *)
  4988. Designate(expression,operand);
  4989. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4990. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4991. Pass((operand.tag));
  4992. END;
  4993. END;
  4994. Pass((operand.op));
  4995. END;
  4996. END;
  4997. (* TODO: needed? *)
  4998. arrayDestinationTag := oldArrayDestinationTag;
  4999. arrayDestinationDimension := oldArrayDestinationDimension;
  5000. IF needsParameterBackup THEN
  5001. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5002. ReuseCopy(parameterBackup, operand.op)
  5003. END;
  5004. ReleaseOperand(operand);
  5005. IF Trace THEN TraceExit("PushParameter") END;
  5006. END PushParameter;
  5007. PROCEDURE VisitStatementDesignator*(x: SyntaxTree.StatementDesignator);
  5008. VAR prevConditional: BOOLEAN;
  5009. BEGIN
  5010. prevConditional := conditional;
  5011. conditional := FALSE;
  5012. IF (x.result # NIL) & ( x.result IS SyntaxTree.SymbolDesignator) & (x.result(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) & (x.result(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).useRegister) THEN
  5013. Expression(x.result); (* use register *)
  5014. END;
  5015. Statement(x.statement);
  5016. conditional := prevConditional;
  5017. IF x.result # NIL THEN Expression(x.result) END;
  5018. IF (x.result # NIL) & (x.result IS SyntaxTree.SymbolDesignator) & (x.result(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) & (x.result(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).useRegister) THEN
  5019. ReleaseIntermediateOperand(result.op);
  5020. END;
  5021. END VisitStatementDesignator;
  5022. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  5023. VAR
  5024. procedure: SyntaxTree.Procedure;
  5025. procedureType: SyntaxTree.ProcedureType;
  5026. wasInline: BOOLEAN;
  5027. actualParameters: SyntaxTree.ExpressionList;
  5028. formalParameter: SyntaxTree.Parameter;
  5029. actualParameter: SyntaxTree.Expression;
  5030. i: LONGINT;
  5031. localVariable: SyntaxTree.Variable;
  5032. variableDesignator, returnDesignator: SyntaxTree.Expression;
  5033. src, dest: Operand;
  5034. prevInlineExit : Label;
  5035. prevMapper: SymbolMapper;
  5036. tooComplex: BOOLEAN;
  5037. resultDesignator: SyntaxTree.Expression;
  5038. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  5039. BEGIN
  5040. IF e = NIL THEN RETURN TRUE
  5041. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  5042. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  5043. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  5044. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  5045. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  5046. ELSE RETURN FALSE
  5047. END;
  5048. END SimpleExpression;
  5049. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  5050. BEGIN
  5051. RETURN checker.CanPassInRegister(type)
  5052. END FitsInRegister;
  5053. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  5054. VAR
  5055. variable: SyntaxTree.Variable;
  5056. variableDesignator: SyntaxTree.Designator;
  5057. BEGIN
  5058. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  5059. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5060. variableDesignator.SetType(type);
  5061. RETURN variableDesignator
  5062. END GetTemp;
  5063. BEGIN
  5064. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5065. wasInline := currentIsInline;
  5066. prevInlineExit := currentInlineExit;
  5067. prevMapper := currentMapper;
  5068. currentInlineExit := NewLabel();
  5069. tooComplex := FALSE;
  5070. NEW(currentMapper);
  5071. currentIsInline := TRUE;
  5072. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5073. procedureType := procedure.type(SyntaxTree.ProcedureType);
  5074. formalParameter := procedureType.firstParameter;
  5075. actualParameters := x.parameters;
  5076. i := 0;
  5077. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  5078. actualParameter := actualParameters.GetExpression(i);
  5079. IF actualParameter.resolved # NIL THEN
  5080. actualParameter := actualParameter.resolved
  5081. END;
  5082. (*
  5083. if expression is simple and can be passed immediately
  5084. or if type fits in register then we can proceed
  5085. otherwise we escape to ordinary procedure call.
  5086. *)
  5087. (* cases where the expression can be mapped identically *)
  5088. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5089. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  5090. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  5091. variableDesignator := GetTemp(formalParameter.type, TRUE);
  5092. (*
  5093. Assign(variableDesignator, actualParameter);
  5094. *)
  5095. Evaluate(actualParameter, src);
  5096. Designate(variableDesignator, dest);
  5097. Emit(Mov(x.position, dest.op, src.op));
  5098. ReleaseOperand(dest);
  5099. ReleaseOperand(src);
  5100. (* the src operand should now have been completely released ! *)
  5101. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  5102. ELSE tooComplex := TRUE
  5103. END;
  5104. (*
  5105. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  5106. currentMapper.Add(formalParameter, actualParameter, NIL);
  5107. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  5108. variableDesignator := GetTemp(system.addressType, FALSE);
  5109. Designate(actualParameter, src);
  5110. Designate(variableDesignator, dest);
  5111. IntermediateCode.MakeMemory(dest.op,addressType);
  5112. Emit(Mov(x.position, dest.op, src.op));
  5113. ReleaseOperand(dest);
  5114. IF src.tag.mode # IntermediateCode.Undefined THEN
  5115. tagDesignator := GetTemp(system.addressType, FALSE);
  5116. Designate(tagDesignator, dest);
  5117. IntermediateCode.MakeMemory(dest.op,addressType);
  5118. Emit(Mov(x.position, dest.op, src.op));
  5119. END;
  5120. ReleaseOperand(dest); ReleaseOperand(src);
  5121. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  5122. END;
  5123. *)
  5124. formalParameter := formalParameter.nextParameter;
  5125. INC(i);
  5126. END;
  5127. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  5128. IF resultDesignator # NIL THEN
  5129. returnDesignator := resultDesignator
  5130. ELSE
  5131. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  5132. END;
  5133. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  5134. END;
  5135. localVariable := procedure.procedureScope.firstVariable;
  5136. WHILE ~tooComplex & (localVariable # NIL) DO
  5137. variableDesignator := GetTemp(localVariable.type, FALSE);
  5138. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  5139. localVariable := localVariable.nextVariable;
  5140. END;
  5141. IF ~tooComplex THEN
  5142. VisitStatementBlock(procedure.procedureScope.body);
  5143. SetLabel(currentInlineExit);
  5144. IF procedureType.returnType # NIL THEN
  5145. Designate(returnDesignator, result);
  5146. IF conditional THEN
  5147. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  5148. ValueToCondition(result)
  5149. END;
  5150. END;
  5151. END;
  5152. currentMapper := prevMapper;
  5153. currentInlineExit := prevInlineExit;
  5154. currentIsInline := wasInline;
  5155. RETURN ~tooComplex
  5156. END InlineProcedureCall;
  5157. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  5158. VAR
  5159. parameters: SyntaxTree.ExpressionList;
  5160. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  5161. designator: SyntaxTree.Designator;
  5162. procedureType: SyntaxTree.ProcedureType;
  5163. formalParameter: SyntaxTree.Parameter;
  5164. operand, returnValue: Operand;
  5165. reg, size, mask, dest: IntermediateCode.Operand;
  5166. saved,saved2: RegisterEntry;
  5167. symbol: SyntaxTree.Symbol;
  5168. variable: SyntaxTree.Variable;
  5169. i, parametersSize, returnTypeSize : LONGINT;
  5170. structuredReturnType: BOOLEAN;
  5171. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5172. tempVariableDesignator: SyntaxTree.Designator;
  5173. gap, alignment: LONGINT; (*fld*)
  5174. (* TODO: remove unnecessary backup variables *)
  5175. oldResult: Operand;
  5176. oldCurrentScope: SyntaxTree.Scope;
  5177. oldArrayDestinationTag: IntermediateCode.Operand;
  5178. oldArrayDestinationDimension: LONGINT;
  5179. oldConstantDeclaration: SyntaxTree.Symbol;
  5180. oldDestination: IntermediateCode.Operand;
  5181. oldCurrentLoop: Label;
  5182. oldConditional: BOOLEAN;
  5183. oldTrueLabel, oldFalseLabel: Label;
  5184. oldLocked: BOOLEAN;
  5185. usedRegisters,oldUsedRegisters: RegisterEntry;
  5186. return: IntermediateCode.Operand;
  5187. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5188. arg: IntermediateCode.Operand;
  5189. dummy: IntermediateCode.Operand;
  5190. recordType: SyntaxTree.RecordType;
  5191. operatorSelectionProcedureOperand: Operand;
  5192. operatorSelectionProcedure: SyntaxTree.Procedure;
  5193. fingerPrint: SyntaxTree.FingerPrint;
  5194. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5195. identifierNumber: LONGINT;
  5196. parameterRegisters: SIZE;
  5197. registers: ARRAY 64 OF WORD;
  5198. procedure: SyntaxTree.Procedure;
  5199. callingConvention: SyntaxTree.CallingConvention;
  5200. type: IntermediateCode.Type;
  5201. PROCEDURE BackupGlobalState;
  5202. BEGIN
  5203. oldResult := result;
  5204. oldCurrentScope := currentScope;
  5205. oldArrayDestinationTag := arrayDestinationTag;
  5206. oldArrayDestinationDimension := arrayDestinationDimension;
  5207. oldConstantDeclaration := constantDeclaration;
  5208. oldDestination := destination;
  5209. oldCurrentLoop := currentLoop;
  5210. oldConditional := conditional;
  5211. oldTrueLabel := trueLabel;
  5212. oldFalseLabel := falseLabel;
  5213. oldLocked := locked;
  5214. oldUsedRegisters := usedRegisters
  5215. END BackupGlobalState;
  5216. PROCEDURE RestoreGlobalState;
  5217. BEGIN
  5218. result := oldResult;
  5219. currentScope := oldCurrentScope;
  5220. arrayDestinationTag := oldArrayDestinationTag;
  5221. arrayDestinationDimension := oldArrayDestinationDimension;
  5222. constantDeclaration := oldConstantDeclaration;
  5223. destination := oldDestination;
  5224. currentLoop := oldCurrentLoop;
  5225. conditional := oldConditional;
  5226. trueLabel := oldTrueLabel;
  5227. falseLabel := oldFalseLabel;
  5228. locked := oldLocked;
  5229. usedRegisters := oldUsedRegisters
  5230. END RestoreGlobalState;
  5231. (** do preparations before parameter push for array-structured object types (ASOTs):
  5232. if ASOT is passed as VAR parameter:
  5233. - allocate temporary variable of math array type
  5234. - copy contents of ASOT to be passed to temporary variable
  5235. - use temporary variable as the actual parameter instead
  5236. - 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)
  5237. **)
  5238. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5239. VAR
  5240. expression: SyntaxTree.Expression;
  5241. BEGIN
  5242. IF actualParameter IS SyntaxTree.Designator THEN
  5243. designator := actualParameter(SyntaxTree.Designator);
  5244. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5245. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5246. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5247. ASSERT(checker # NIL);
  5248. checker.SetCurrentScope(currentScope);
  5249. (* allocate temporary variable *)
  5250. ASSERT(actualParameter.type # NIL);
  5251. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5252. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5253. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5254. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5255. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5256. ASSERT(tempVariableDesignator.type # NIL);
  5257. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5258. (* copy math array stored in actual parameter to temporary variable *)
  5259. BackupGlobalState;
  5260. AssignMathArray(tempVariableDesignator, actualParameter);
  5261. RestoreGlobalState;
  5262. (* use temporary variable as actual parameter instead of the original one *)
  5263. actualParameter := tempVariableDesignator;
  5264. (* create write-back call and store it in linked list *)
  5265. (* create new list entry *)
  5266. IF firstWriteBackCall = NIL THEN
  5267. NEW(firstWriteBackCall);
  5268. currentWriteBackCall := firstWriteBackCall
  5269. ELSE
  5270. ASSERT(currentWriteBackCall # NIL);
  5271. NEW(currentWriteBackCall.next);
  5272. currentWriteBackCall := currentWriteBackCall.next
  5273. END;
  5274. expression := checker.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5275. ASSERT(expression.type = NIL);
  5276. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5277. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5278. (* prepare writeback for any other "normal" indexer *)
  5279. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5280. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5281. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5282. Assign(tempVariableDesignator, actualParameter);
  5283. actualParameter := tempVariableDesignator;
  5284. IF firstWriteBackCall = NIL THEN
  5285. NEW(firstWriteBackCall);
  5286. currentWriteBackCall := firstWriteBackCall
  5287. ELSE
  5288. ASSERT(currentWriteBackCall # NIL);
  5289. NEW(currentWriteBackCall.next);
  5290. currentWriteBackCall := currentWriteBackCall.next
  5291. END;
  5292. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5293. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5294. END
  5295. END
  5296. END PrepareParameter;
  5297. BEGIN
  5298. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5299. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5300. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5301. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5302. IF InlineProcedureCall(x) THEN
  5303. RETURN
  5304. ELSE
  5305. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5306. END
  5307. END;
  5308. END;
  5309. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5310. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5311. callingConvention := procedureType.callingConvention;
  5312. dest := destination; destination := emptyOperand;
  5313. SaveRegisters();ReleaseUsedRegisters(saved);
  5314. parameters := x.parameters;
  5315. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5316. (* an operator is called *)
  5317. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5318. ASSERT(callingConvention = SyntaxTree.OberonCallingConvention);
  5319. (* check if a dynamic operator call should be performed *)
  5320. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5321. ELSE
  5322. isCallOfDynamicOperator := FALSE
  5323. END;
  5324. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5325. Emit(Push(position, ap));
  5326. END;
  5327. alignment := procedureType.stackAlignment;
  5328. IF (callingConvention IN SysvABIorWINAPI) & (system.addressSize = 64) THEN
  5329. alignment := 16 (* bytes *);
  5330. END;
  5331. IF alignment > 1 THEN
  5332. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5333. Emit(Mov(position,reg, sp));
  5334. gap := ParametersSize(system, procedureType,FALSE); (* account for all parameters being pushed *)
  5335. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5336. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN (* in WINAPI 64bit there is at least space for four registers on the stack *)
  5337. gap := 4*ToMemoryUnits(system,system.addressSize);
  5338. END;
  5339. ELSIF (callingConvention IN SysvABI) & (system.addressSize =64) THEN
  5340. gap := gap - 6*ToMemoryUnits(system,system.addressSize); (* the first 6 parameters are passed via registers in SysVABI *)
  5341. IF gap < 0 THEN
  5342. gap := 0
  5343. END;
  5344. ELSE
  5345. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) (* Oberon CC: alignment at the BP in the stack frame *)
  5346. END;
  5347. gap := gap + ToMemoryUnits(system,system.addressSize); (* account for the additionally pushed stack pointer in any case *)
  5348. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5349. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5350. Emit(And(position,sp, sp, mask));
  5351. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5352. Emit(Push(position,reg));
  5353. ReleaseIntermediateOperand(reg);
  5354. END;
  5355. IF (callingConvention IN SysvABI) & (system.addressSize = 32) THEN
  5356. (* align stack to 16-byte boundary *)
  5357. IntermediateCode.InitImmediate(mask,addressType,-16);
  5358. Emit(And(position,sp, sp, mask));
  5359. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5360. IF gap # 0 THEN
  5361. IntermediateCode.InitImmediate(size,addressType,gap);
  5362. Emit(Sub(position,sp,sp,size))
  5363. END;
  5364. END;
  5365. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5366. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5367. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5368. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5369. ELSE
  5370. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5371. END;
  5372. Evaluate(x.left, operand);
  5373. IF symbol IS SyntaxTree.Procedure THEN
  5374. IF (procedureType.selfParameter # NIL) THEN
  5375. Emit(Push(position,operand.tag));
  5376. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5377. Emit(Push(position,operand.tag));
  5378. ELSIF (procedureType.isDelegate) THEN
  5379. Emit(Push(position,operand.tag));
  5380. END;
  5381. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5382. IF (procedureType.selfParameter # NIL) THEN
  5383. Emit(Push(position,operand.tag));
  5384. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5385. Emit(Push(position,operand.tag));
  5386. END;
  5387. ELSE HALT(200);
  5388. END;
  5389. ReleaseIntermediateOperand(operand.tag);
  5390. operand.tag := emptyOperand;
  5391. (* determine if a structured return type is needed *)
  5392. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5393. IF structuredReturnType THEN
  5394. IF resultDesignator # NIL THEN
  5395. d := resultDesignator;
  5396. ELSE
  5397. (* temporary result that might be allocated, must potentially be traced *)
  5398. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5399. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5400. d.SetType(variable.type);
  5401. END;
  5402. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5403. Designate(d,returnValue);
  5404. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5405. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5406. Emit(Push(position,size));
  5407. Emit(Push(position,returnValue.op));
  5408. ReleaseOperand(returnValue);
  5409. ELSE*)
  5410. PushParameter(d,procedureType.returnParameter,callingConvention, FALSE, dummy,-1)
  5411. (*
  5412. END;
  5413. *)
  5414. END;
  5415. firstWriteBackCall := NIL; (* reset write-back call list *)
  5416. IF callingConvention # SyntaxTree.OberonCallingConvention THEN
  5417. parameterRegisters := 0;
  5418. backend.ResetParameterRegisters();
  5419. formalParameter := procedureType.firstParameter;
  5420. FOR i := 0 TO parameters.Length()-1 DO
  5421. IF (formalParameter.kind = SyntaxTree.VarParameter) THEN
  5422. type := addressType;
  5423. ELSIF formalParameter.type.IsRecordType() OR (formalParameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5424. type := addressType;
  5425. ELSE
  5426. type := GetType(system, formalParameter.type);
  5427. END;
  5428. IF backend.GetParameterRegister(callingConvention, type, registers[i]) THEN
  5429. INC(parameterRegisters);
  5430. IF ~PassInRegister(formalParameter,callingConvention) THEN
  5431. Error(actualParameter.position,"cannot be passed by register")
  5432. END;
  5433. ELSE
  5434. registers[i] := -1;
  5435. END;
  5436. formalParameter := formalParameter.nextParameter;
  5437. END;
  5438. formalParameter := procedureType.lastParameter;
  5439. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5440. actualParameter := parameters.GetExpression(i);
  5441. PrepareParameter(actualParameter, formalParameter);
  5442. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy, registers[i]);
  5443. formalParameter := formalParameter.prevParameter;
  5444. END;
  5445. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5446. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5447. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,32)));
  5448. END;
  5449. ELSE
  5450. hasDynamicOperands := FALSE;
  5451. formalParameter := procedureType.firstParameter;
  5452. FOR i := 0 TO parameters.Length() - 1 DO
  5453. actualParameter := parameters.GetExpression(i);
  5454. IF formalParameter # NIL THEN (* TENTATIVE *)
  5455. PrepareParameter(actualParameter, formalParameter);
  5456. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5457. ASSERT(i < 2);
  5458. hasDynamicOperands := TRUE;
  5459. PushParameter(actualParameter, formalParameter, callingConvention, TRUE, parameterBackups[i],-1)
  5460. ELSE
  5461. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5462. END;
  5463. formalParameter := formalParameter.nextParameter;
  5464. END;
  5465. END;
  5466. END;
  5467. IF symbol IS SyntaxTree.Procedure THEN
  5468. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5469. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5470. Emit(Push(position,reg));
  5471. ReleaseIntermediateOperand(reg);
  5472. END;
  5473. parametersSize := ProcParametersSize(symbol(SyntaxTree.Procedure));
  5474. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5475. parametersSize := ParametersSize(system,procedureType, FALSE);
  5476. END;
  5477. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5478. (*
  5479. dynamic operator overloading:
  5480. first push parameters, regularly:
  5481. [self]
  5482. par1
  5483. par2
  5484. then push parameters for GetOperator
  5485. identifier
  5486. ptr1
  5487. tag
  5488. ptr2
  5489. tag
  5490. call GetOperatorRuntimeProc
  5491. call Operator
  5492. *)
  5493. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5494. (* push ID *)
  5495. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5496. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5497. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5498. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5499. formalParameter := procedureType.firstParameter;
  5500. FOR i := 0 TO parameters.Length() - 1 DO
  5501. IF formalParameter.access # SyntaxTree.Hidden THEN
  5502. ASSERT(i < 2);
  5503. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5504. (* push pointer *)
  5505. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5506. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5507. (* add dereference *)
  5508. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5509. (*! better: do refer to stack above than using parameter backups !!*)
  5510. ReleaseIntermediateOperand(parameterBackups[i]);
  5511. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5512. END;
  5513. Emit(Push(position,parameterBackups[i]));
  5514. ReleaseIntermediateOperand(parameterBackups[i]);
  5515. (* push typetag *)
  5516. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5517. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5518. arg := TypeDescriptorAdr(recordType);
  5519. Emit(Push(position,arg));
  5520. ELSE
  5521. (* push 'NonPointer' *)
  5522. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5523. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5524. (* push fingerprint *)
  5525. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5526. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5527. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5528. END
  5529. END;
  5530. formalParameter := formalParameter.nextParameter
  5531. END;
  5532. (* for unary operators: complete the information for the second parameter *)
  5533. IF procedureType.numberParameters < 2 THEN
  5534. (* push 'NonPointer' *)
  5535. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5536. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5537. (* push 'NoType' *)
  5538. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5539. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5540. END;
  5541. (* call operator selection procedure *)
  5542. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5543. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5544. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcParametersSize( operatorSelectionProcedure)));
  5545. ReleaseOperand(operatorSelectionProcedureOperand);
  5546. (* use the address that the operator selection procedure returned as the target address of the call *)
  5547. InitOperand(operand, ModeValue);
  5548. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5549. Emit(Result(position,operand.op))
  5550. END
  5551. END;
  5552. ReleaseParameterRegisters();
  5553. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5554. SaveRegisters();ReleaseUsedRegisters(saved2);
  5555. CallThis(position,"Objects","LeaveA2",0);
  5556. RestoreRegisters(saved2);
  5557. END;
  5558. IF (callingConvention = SyntaxTree.WinAPICallingConvention) OR (callingConvention IN SysvABI) THEN
  5559. Emit(Call(position,operand.op,0));
  5560. ELSE
  5561. Emit(Call(position,operand.op,parametersSize));
  5562. END;
  5563. ReleaseOperand(operand);
  5564. IF procedureType.noReturn THEN
  5565. EmitTrap(position,NoReturnTrap);
  5566. END;
  5567. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5568. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5569. Emit(Result(position,return));
  5570. END;
  5571. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5572. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5573. Emit(Push(position, return));
  5574. CallThis(position,"Objects","ReenterA2",0);
  5575. Emit(Pop(position, return));
  5576. ELSE
  5577. CallThis(position,"Objects","ReenterA2",0);
  5578. END;
  5579. END;
  5580. (* === return parameter space === *)
  5581. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5582. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5583. (* cleanup all space for all parameters *)
  5584. IF parametersSize < 32 THEN
  5585. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5586. parametersSize := 32
  5587. END;
  5588. size := IntermediateCode.Immediate(addressType,parametersSize);
  5589. Emit(Add(position,sp,sp,size))
  5590. END;
  5591. IF (callingConvention IN SysvABI) THEN
  5592. IF parameterRegisters > 0 THEN
  5593. IF parameters.Length() > parameterRegisters THEN
  5594. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5595. ELSE
  5596. parametersSize := 0
  5597. END;
  5598. ELSE
  5599. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5600. INC( parametersSize, (-parametersSize) MOD 16 )
  5601. END;
  5602. IF parametersSize > 0 THEN
  5603. size := IntermediateCode.Immediate(addressType,parametersSize);
  5604. Emit(Add(position,sp,sp,size))
  5605. END;
  5606. END;
  5607. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5608. IF structuredReturnType THEN
  5609. (* stack pointer rewinding done by callee
  5610. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5611. Emit(Add(position,sp,sp,size));
  5612. *)
  5613. RestoreRegisters(saved);
  5614. InitOperand(result,ModeReference);
  5615. Symbol(variable,result);
  5616. ELSE
  5617. RestoreRegisters(saved);
  5618. InitOperand(result,ModeValue);
  5619. result.op := return;
  5620. END;
  5621. END;
  5622. IF alignment > 1 THEN
  5623. Emit(Pop(position,sp));
  5624. END;
  5625. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5626. Emit(Pop(position, ap));
  5627. END;
  5628. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5629. ValueToCondition(result);
  5630. END;
  5631. destination := dest;
  5632. (* perform all write-back calls in the list *)
  5633. BackupGlobalState;
  5634. currentWriteBackCall := firstWriteBackCall;
  5635. WHILE currentWriteBackCall # NIL DO
  5636. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5637. currentWriteBackCall := currentWriteBackCall.next
  5638. END;
  5639. RestoreGlobalState;
  5640. (* TENATIVE *)
  5641. (*
  5642. IF isOperatorCall THEN
  5643. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5644. END;
  5645. *)
  5646. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5647. END VisitProcedureCallDesignator;
  5648. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5649. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5650. td: SyntaxTree.Symbol;
  5651. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5652. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5653. BEGIN
  5654. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5655. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5656. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5657. variable.SetType(system.anyType);
  5658. scope.AddVariable(variable);
  5659. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5660. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5661. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5662. typeDeclaration.SetScope(module.module.moduleScope);
  5663. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5664. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5665. END;
  5666. RETURN hiddenPointerType;
  5667. END GetHiddenPointerType;
  5668. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5669. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5670. BEGIN
  5671. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5672. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5673. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5674. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5675. scope.AddVariable(variable);
  5676. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5677. variable.SetType(system.anyType);
  5678. scope.AddVariable(variable);
  5679. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5680. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5681. typeDeclaration.SetDeclaredType(delegatePointerType);
  5682. typeDeclaration.SetScope(module.module.moduleScope);
  5683. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5684. delegatePointerType.SetState(SyntaxTree.Resolved);
  5685. END;
  5686. RETURN delegatePointerType
  5687. END GetDelegateType;
  5688. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5689. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5690. such as in VAR a: RECORD ... END;
  5691. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5692. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5693. *)
  5694. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5695. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5696. BEGIN (* no code emission *)
  5697. source := NIL;
  5698. x := x.resolved;
  5699. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5700. x := GetHiddenPointerType();
  5701. ELSIF IsDelegate(x) THEN
  5702. x := GetDelegateType();
  5703. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5704. ELSE HALT(200);
  5705. END;
  5706. td := x.typeDeclaration;
  5707. IF td = NIL THEN
  5708. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5709. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5710. ASSERT(td # NIL);
  5711. END;
  5712. GetCodeSectionNameForSymbol(td,name);
  5713. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5714. meta.CheckTypeDeclaration(x);
  5715. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5716. ELSE
  5717. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5718. END;
  5719. IF backend.cooperative OR meta.simple THEN
  5720. offset := 0;
  5721. ELSE
  5722. IF x IS SyntaxTree.CellType THEN
  5723. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5724. IF baseRecord = NIL THEN
  5725. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5726. ELSE
  5727. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5728. END;
  5729. ELSE
  5730. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5731. END;
  5732. END;
  5733. RETURN td
  5734. END GetBackendType;
  5735. BEGIN
  5736. (*td := t.typeDeclaration;*)
  5737. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5738. (*
  5739. IF t IS SyntaxTree.PointerType THEN
  5740. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5741. ELSE
  5742. source := GetBackendType(t);
  5743. END;
  5744. *)
  5745. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5746. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5747. IntermediateCode.SetOffset(res,offset);
  5748. (*
  5749. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5750. make memory should be used when tag is used, not earlier
  5751. *)
  5752. RETURN res
  5753. END TypeDescriptorAdr;
  5754. (*
  5755. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5756. VAR result: IntermediateCode.Operand;
  5757. BEGIN
  5758. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5759. operand.tag := TypeDescriptorAdr(operand.type);
  5760. IntermediateCode.MakeMemory(operand.tag,addressType);
  5761. UseIntermediateOperand(operand.tag);
  5762. END;
  5763. END MakeTypeTag;
  5764. *)
  5765. PROCEDURE ProfilerInit;
  5766. VAR reg: IntermediateCode.Operand;
  5767. BEGIN
  5768. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5769. Emit(Call(position,reg,0));
  5770. END ProfilerInit;
  5771. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5772. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5773. BEGIN
  5774. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5775. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5776. THEN
  5777. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5778. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5779. Emit(Push(position,reg));
  5780. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5781. Emit(Push(position,reg));
  5782. StaticCallOperand(result,procedure);
  5783. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5784. ReleaseOperand(result);
  5785. END;
  5786. END ProfilerEnterExit;
  5787. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5788. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5789. BEGIN
  5790. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5791. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5792. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5793. profileInit.Emit(Push(position,reg));
  5794. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5795. profileInit.Emit(Push(position,reg));
  5796. NEW(string, LEN(name)); COPY(name, string^);
  5797. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5798. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5799. sv.SetType(type);
  5800. Designate(sv,result);
  5801. profileInit.Emit(Push(position,result.tag));
  5802. profileInit.Emit(Push(position,result.op));
  5803. StaticCallOperand(result,procedure);
  5804. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5805. ReleaseOperand(result);
  5806. END;
  5807. END ProfilerAddProcedure;
  5808. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5809. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5810. BEGIN
  5811. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5812. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5813. profileInit.Emit(Push(position,reg));
  5814. profileInitPatchPosition := profileInit.pc;
  5815. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5816. NEW(string, LEN(name)); COPY(name, string^);
  5817. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5818. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5819. sv.SetType(type);
  5820. Designate(sv,result);
  5821. profileInit.Emit(Push(position,result.tag));
  5822. profileInit.Emit(Push(position,result.op));
  5823. StaticCallOperand(result,procedure);
  5824. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5825. ReleaseOperand(result);
  5826. END;
  5827. END ProfilerAddModule;
  5828. PROCEDURE ProfilerPatchInit;
  5829. VAR reg: IntermediateCode.Operand;
  5830. BEGIN
  5831. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5832. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5833. EmitLeave(profileInit,position,NIL,0);
  5834. profileInit.Emit(Exit(position,0,0,0));
  5835. END ProfilerPatchInit;
  5836. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5837. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5838. VAR
  5839. id: LONGINT;
  5840. leftType, rightType: SyntaxTree.Type;
  5841. procedureType: SyntaxTree.ProcedureType;
  5842. runtimeProcedure: SyntaxTree.Procedure;
  5843. runtimeProcedureOperand, operatorOperand: Operand;
  5844. kind: SET;
  5845. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5846. VAR
  5847. arg: IntermediateCode.Operand;
  5848. recordType: SyntaxTree.RecordType;
  5849. fingerPrint: SyntaxTree.FingerPrint;
  5850. BEGIN
  5851. IF type = NIL THEN
  5852. (* no type: push 'NoType' *)
  5853. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5854. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5855. ELSIF IsStrictlyPointerToRecord(type) THEN
  5856. (* pointer to record type: push typetag *)
  5857. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5858. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5859. arg := TypeDescriptorAdr(recordType);
  5860. ELSE
  5861. (* non-pointer to record type: push fingerprint *)
  5862. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5863. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5864. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5865. END;
  5866. operatorInitializationCodeSection.Emit(Push(position,arg))
  5867. END PushTypeInfo;
  5868. BEGIN
  5869. ASSERT(operatorInitializationCodeSection # NIL);
  5870. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5871. procedureType := operator.type(SyntaxTree.ProcedureType);
  5872. (* determine types *)
  5873. leftType := procedureType.firstParameter.type;
  5874. IF procedureType.numberParameters = 2 THEN
  5875. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5876. rightType := procedureType.firstParameter.nextParameter.type;
  5877. ELSE
  5878. rightType := NIL
  5879. END;
  5880. (* determine operator kind *)
  5881. IF IsStrictlyPointerToRecord(leftType) THEN
  5882. kind := {LhsIsPointer}
  5883. ELSE
  5884. kind := {}
  5885. END;
  5886. IF IsStrictlyPointerToRecord(rightType) THEN
  5887. kind := kind + {RhsIsPointer}
  5888. END;
  5889. IF kind # {} THEN (* TODO: to be removed later on *)
  5890. (* at least one of the types is a pointer to record *)
  5891. (* emit a code that registers this specific operator in the runtime *)
  5892. dump := operatorInitializationCodeSection.comments;
  5893. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5894. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5895. (* push ID *)
  5896. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5897. id := Global.GetSymbol(module.module.case, operator.name);
  5898. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5899. (* push kind *)
  5900. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5901. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5902. (* push type infos *)
  5903. PushTypeInfo(leftType);
  5904. PushTypeInfo(rightType);
  5905. (* push operator address *)
  5906. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5907. StaticCallOperand(operatorOperand, operator);
  5908. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5909. ReleaseOperand(operatorOperand);
  5910. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5911. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcParametersSize( runtimeProcedure)));
  5912. ReleaseOperand(runtimeProcedureOperand)
  5913. END
  5914. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5915. END
  5916. END RegisterDynamicOperator;
  5917. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5918. VAR
  5919. traceModule: SyntaxTree.Module;
  5920. procedure: SyntaxTree.Procedure;
  5921. procedureVariable: SyntaxTree.Variable;
  5922. s,msg: Basic.MessageString;
  5923. res: Operand;
  5924. i: LONGINT;
  5925. sv: SyntaxTree.StringValue;
  5926. type: SyntaxTree.Type;
  5927. recordType: SyntaxTree.RecordType;
  5928. printout: Printout.Printer;
  5929. stringWriter: Streams.StringWriter;
  5930. expression: SyntaxTree.Expression;
  5931. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5932. BEGIN
  5933. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5934. IF procedure = NIL THEN
  5935. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5936. END;
  5937. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5938. s := "procedure ";
  5939. Strings.Append(s,backend.traceModuleName);
  5940. Strings.Append(s,".");
  5941. Strings.Append(s,procedureName);
  5942. Strings.Append(s," not present");
  5943. Error(position,s);
  5944. RETURN FALSE
  5945. ELSE
  5946. RETURN TRUE
  5947. END;
  5948. END GetProcedure;
  5949. PROCEDURE CallProcedure;
  5950. VAR size: LONGINT;
  5951. BEGIN
  5952. IF procedure # NIL THEN
  5953. StaticCallOperand(result,procedure);
  5954. size := ProcParametersSize(procedure);
  5955. ELSE
  5956. Symbol(procedureVariable, result);
  5957. LoadValue(result, procedureVariable.type.resolved);
  5958. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5959. END;
  5960. Emit(Call(position,result.op,size));
  5961. END CallProcedure;
  5962. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5963. VAR res: Operand; string: SyntaxTree.String;
  5964. BEGIN
  5965. IF GetProcedure("String") THEN
  5966. NEW(string, LEN(s)); COPY(s, string^);
  5967. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5968. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  5969. sv.SetType(type);
  5970. Designate(sv,res);
  5971. Emit(Push(position,res.tag));
  5972. Emit(Push(position,res.op));
  5973. ReleaseOperand(res);
  5974. CallProcedure;
  5975. END;
  5976. END String;
  5977. PROCEDURE Integer(op: IntermediateCode.Operand);
  5978. BEGIN
  5979. IF GetProcedure("Int") THEN
  5980. Emit(Push(position,op));
  5981. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5982. CallProcedure;
  5983. END;
  5984. END Integer;
  5985. PROCEDURE Float(op: IntermediateCode.Operand);
  5986. BEGIN
  5987. IF GetProcedure("HIntHex") THEN
  5988. Emit(Push(position,op));
  5989. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5990. CallProcedure;
  5991. END;
  5992. END Float;
  5993. PROCEDURE Set(op: IntermediateCode.Operand);
  5994. BEGIN
  5995. IF GetProcedure("Set") THEN
  5996. Emit(Push(position,op));
  5997. (*
  5998. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5999. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  6000. *)
  6001. CallProcedure;
  6002. END;
  6003. END Set;
  6004. PROCEDURE Boolean(op: IntermediateCode.Operand);
  6005. BEGIN
  6006. IF GetProcedure("Boolean") THEN
  6007. Emit(Push(position,op));
  6008. CallProcedure;
  6009. END;
  6010. END Boolean;
  6011. PROCEDURE Char(op: IntermediateCode.Operand);
  6012. BEGIN
  6013. IF GetProcedure("Char") THEN
  6014. Emit(Push(position,op));
  6015. CallProcedure;
  6016. END;
  6017. END Char;
  6018. PROCEDURE Address(op: IntermediateCode.Operand);
  6019. BEGIN
  6020. IF GetProcedure("Address") THEN
  6021. Emit(Push(position,op));
  6022. CallProcedure;
  6023. END;
  6024. END Address;
  6025. PROCEDURE Size(op: IntermediateCode.Operand);
  6026. BEGIN
  6027. IF GetProcedure("Size") THEN
  6028. Emit(Push(position,op));
  6029. CallProcedure;
  6030. END;
  6031. END Size;
  6032. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  6033. VAR len: IntermediateCode.Operand;
  6034. BEGIN
  6035. IF GetProcedure("String") THEN
  6036. len := GetArrayLength(type, op.tag);
  6037. Emit(Push(position,len));
  6038. ReleaseIntermediateOperand(len);
  6039. Emit(Push(position,op.op));
  6040. CallProcedure;
  6041. END;
  6042. END StringOperand;
  6043. PROCEDURE Ln;
  6044. BEGIN
  6045. IF GetProcedure("Ln") THEN
  6046. CallProcedure;
  6047. END;
  6048. END Ln;
  6049. BEGIN
  6050. IF backend.traceModuleName = "" THEN RETURN END;
  6051. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  6052. IF GetProcedure("Enter") THEN
  6053. CallProcedure
  6054. END;
  6055. NEW(stringWriter,LEN(s));
  6056. FOR i := 0 TO x.Length()-1 DO
  6057. msg := "";
  6058. expression := x.GetExpression(i);
  6059. IF currentScope IS SyntaxTree.ProcedureScope THEN
  6060. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  6061. ELSE
  6062. Global.GetModuleName(module.module, s);
  6063. END;
  6064. IF i = 0 THEN
  6065. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  6066. stringWriter.String(":");
  6067. END;
  6068. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  6069. IF ~(expression IS SyntaxTree.StringValue) THEN
  6070. printout.Expression(expression);
  6071. stringWriter.Get(s);
  6072. Strings.Append(msg,s);
  6073. Strings.Append(msg,"= ");
  6074. ELSE stringWriter.Get(s); (* remove from string writer *)
  6075. Strings.Append(msg, s);
  6076. END;
  6077. String(msg);
  6078. IF SemanticChecker.IsStringType(expression.type) THEN
  6079. Designate(expression,res);
  6080. StringOperand(res, expression.type);
  6081. ELSE
  6082. Evaluate(expression,res);
  6083. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  6084. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  6085. Convert(res.op,int64);
  6086. END;
  6087. Integer(res.op);
  6088. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  6089. Boolean(res.op);
  6090. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  6091. Set(res.op);
  6092. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  6093. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  6094. Convert(res.op,float64);
  6095. END;
  6096. Float(res.op);
  6097. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  6098. Char(res.op);
  6099. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  6100. Address(res.op);String("H");
  6101. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  6102. Size(res.op);
  6103. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  6104. Address(res.op);String("H");
  6105. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  6106. Address(res.op);String("H");
  6107. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  6108. String("NIL");
  6109. ELSE HALT(200);
  6110. END;
  6111. END;
  6112. ReleaseOperand(res);
  6113. String("; ");
  6114. END;
  6115. IF GetProcedure("Exit") THEN
  6116. CallProcedure
  6117. ELSE
  6118. Ln;
  6119. END;
  6120. END;
  6121. END SystemTrace;
  6122. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  6123. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  6124. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  6125. BEGIN
  6126. type := type.resolved;
  6127. IF type IS SyntaxTree.RecordType THEN
  6128. WITH type: SyntaxTree.RecordType DO
  6129. baseType := type.baseType;
  6130. IF baseType # NIL THEN
  6131. baseType := baseType.resolved;
  6132. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6133. InitFields(baseType,adr,offset);
  6134. END;
  6135. variable := type.recordScope.firstVariable;
  6136. WHILE variable # NIL DO
  6137. IF variable.initializer # NIL THEN
  6138. Evaluate(variable.initializer,initializerOp);
  6139. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6140. Emit(Mov(position,mem,initializerOp.op));
  6141. ReleaseOperand(initializerOp);
  6142. ReleaseIntermediateOperand(mem);
  6143. END;
  6144. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6145. variable := variable.nextVariable
  6146. END;
  6147. END;
  6148. ELSIF type IS SyntaxTree.CellType THEN
  6149. WITH type: SyntaxTree.CellType DO
  6150. baseType := type.baseType;
  6151. IF baseType # NIL THEN
  6152. baseType := baseType.resolved;
  6153. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6154. InitFields(baseType,adr,offset);
  6155. END;
  6156. variable := type.cellScope.firstVariable;
  6157. WHILE variable # NIL DO
  6158. IF variable.initializer # NIL THEN
  6159. Evaluate(variable.initializer,initializerOp);
  6160. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6161. Emit(Mov(position,mem,initializerOp.op));
  6162. ReleaseOperand(initializerOp);
  6163. ReleaseIntermediateOperand(mem);
  6164. END;
  6165. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6166. variable := variable.nextVariable
  6167. END;
  6168. END;
  6169. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6170. WITH type: SyntaxTree.ArrayType DO
  6171. IF type.form = SyntaxTree.Static THEN
  6172. baseType := type.arrayBase;
  6173. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6174. FOR i := 0 TO type.staticLength-1 DO
  6175. InitFields(baseType,adr,offset+i*size);
  6176. END;
  6177. END;
  6178. END;
  6179. ELSIF type IS SyntaxTree.MathArrayType THEN
  6180. WITH type: SyntaxTree.MathArrayType DO
  6181. IF type.form = SyntaxTree.Open THEN
  6182. dim := DynamicDim(type);
  6183. imm := IntermediateCode.Immediate(addressType,dim);
  6184. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6185. baseType := SemanticChecker.ArrayBase(type,dim);
  6186. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6187. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6188. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6189. ReleaseIntermediateOperand(imm);
  6190. (* flags remain empty (=0) for open array *)
  6191. ELSIF type.form = SyntaxTree.Static THEN
  6192. baseType := type.arrayBase;
  6193. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6194. ASSERT(type.staticLength < 1024*1024*1024);
  6195. FOR i := 0 TO type.staticLength-1 DO
  6196. InitFields(baseType,adr,offset+i*size);
  6197. END;
  6198. END;
  6199. END;
  6200. END;
  6201. END InitFields;
  6202. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6203. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6204. saved: RegisterEntry;
  6205. BEGIN
  6206. type := variable.type.resolved;
  6207. IF (type IS SyntaxTree.MathArrayType) THEN
  6208. WITH type: SyntaxTree.MathArrayType DO
  6209. IF type.form = SyntaxTree.Open THEN
  6210. Symbol(variable,operand);
  6211. InitFields(type, operand.tag,0);
  6212. IF temporary THEN
  6213. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6214. END;
  6215. ELSIF type.form = SyntaxTree.Tensor THEN
  6216. IF temporary & backend.writeBarriers THEN
  6217. SaveRegisters();ReleaseUsedRegisters(saved);
  6218. Symbol(variable, operand);
  6219. Emit(Push(position,operand.op));
  6220. ReleaseOperand(operand);
  6221. Emit(Push(position,nil));
  6222. CallThis(position,"FoxArrayBase","Assign",2);
  6223. RestoreRegisters(saved);
  6224. ELSE
  6225. Symbol(variable, operand);
  6226. MakeMemory(tmp,operand.op,addressType,0);
  6227. ReleaseOperand(operand);
  6228. IF FALSE & temporary THEN
  6229. (* trick -- temporary object from array base *)
  6230. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6231. Symbol(symbol,operand);
  6232. MakeMemory(mem,operand.op,addressType,0);
  6233. ReleaseOperand(operand);
  6234. Emit(Mov(position,tmp, mem) );
  6235. ReleaseOperand(operand);
  6236. ELSE
  6237. Emit(Mov(position,tmp, nil ) );
  6238. END;
  6239. ReleaseIntermediateOperand(tmp)
  6240. END;
  6241. END;
  6242. END;
  6243. ELSE
  6244. Symbol(variable,operand);
  6245. IF variable.initializer # NIL THEN
  6246. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6247. reference.SetType(variable.type.resolved);
  6248. reference.SetAssignable(TRUE);
  6249. Assign(reference,variable.initializer);
  6250. ELSIF temporary THEN
  6251. IF SemanticChecker.IsPointerType(variable.type) THEN
  6252. IF backend.cooperative THEN
  6253. SaveRegisters();ReleaseUsedRegisters(saved);
  6254. Symbol(variable, operand);
  6255. CallAssignPointer(operand.op, nil);
  6256. ReleaseOperand(operand);
  6257. RestoreRegisters(saved);
  6258. ELSIF backend.writeBarriers THEN
  6259. SaveRegisters();ReleaseUsedRegisters(saved);
  6260. Symbol(variable, operand);
  6261. Emit(Push(position,operand.op));
  6262. ReleaseOperand(operand);
  6263. Emit(Push(position,nil));
  6264. CallThis(position,"Heaps","Assign",2);
  6265. RestoreRegisters(saved);
  6266. ELSE
  6267. Symbol(variable, operand);
  6268. MakeMemory(tmp,operand.op,addressType,0);
  6269. ReleaseOperand(operand);
  6270. Emit(Mov(position,tmp, nil ) );
  6271. ReleaseIntermediateOperand(tmp);
  6272. END;
  6273. END;
  6274. END;
  6275. InitFields(type, operand.op,0);
  6276. ReleaseOperand(operand);
  6277. END;
  6278. END InitVariable;
  6279. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6280. VAR end: Label;
  6281. BEGIN
  6282. IF type.form = SyntaxTree.Tensor THEN
  6283. InitOperand(result,ModeValue);
  6284. ReuseCopy(result.op,base);
  6285. end := NewLabel();
  6286. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6287. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6288. SetLabel(end);
  6289. Convert(result.op,lenType);
  6290. ELSE
  6291. InitOperand(result,ModeValue);
  6292. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6293. END
  6294. END MathArrayDim;
  6295. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6296. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6297. BEGIN
  6298. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6299. MakeMemory(mem,base,addressType,offset);
  6300. Emit(Mov(position,mem,value));
  6301. ReleaseIntermediateOperand(mem);
  6302. END PutMathArrayField;
  6303. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6304. VAR mem: IntermediateCode.Operand;
  6305. BEGIN
  6306. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6307. MakeMemory(mem,base,addressType,offset);
  6308. Emit(Mov(position,mem,value));
  6309. ReleaseIntermediateOperand(mem);
  6310. END PutMathArrayFieldOffset;
  6311. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6312. BEGIN
  6313. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6314. MakeMemory(value,base,addressType,offset);
  6315. END GetMathArrayField;
  6316. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6317. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6318. BEGIN
  6319. IF incr THEN
  6320. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6321. ELSE
  6322. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6323. END;
  6324. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6325. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6326. ELSE
  6327. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6328. Emit(Mov(position,reg,dim));
  6329. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6330. Emit(Add(position,reg,reg,base));
  6331. MakeMemory(mem, reg, addressType, offset);
  6332. ReleaseIntermediateOperand(reg);
  6333. Emit(Mov(position,mem,value));
  6334. ReleaseIntermediateOperand(mem);
  6335. END;
  6336. END PutMathArrayLenOrIncr;
  6337. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6338. BEGIN
  6339. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6340. END PutMathArrayLength;
  6341. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6342. BEGIN
  6343. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6344. END PutMathArrayIncrement;
  6345. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6346. BEGIN
  6347. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6348. END GetMathArrayIncrement;
  6349. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6350. BEGIN
  6351. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6352. END GetMathArrayLength;
  6353. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6354. VAR dimOp: IntermediateCode.Operand;
  6355. BEGIN
  6356. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6357. GetMathArrayLength(type, operand, dimOp, check, result);
  6358. END GetMathArrayLengthAt;
  6359. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6360. VAR dimOp: IntermediateCode.Operand;
  6361. BEGIN
  6362. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6363. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6364. END GetMathArrayIncrementAt;
  6365. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6366. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6367. offset: LONGINT;
  6368. BEGIN
  6369. IF increment THEN
  6370. offset := MathIncrOffset;
  6371. ELSE
  6372. offset := MathLenOffset;
  6373. END;
  6374. INC(offset,operand.dimOffset*2);
  6375. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6376. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6377. END;
  6378. (* static dimension *)
  6379. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6380. IF check & (type.form = SyntaxTree.Tensor) THEN
  6381. DimensionCheck(operand.tag,dim,BrltL);
  6382. END;
  6383. val := SHORT(dim.intValue);
  6384. IF type.form # SyntaxTree.Tensor THEN
  6385. t := SemanticChecker.ArrayBase(type,val);
  6386. type := t.resolved(SyntaxTree.MathArrayType);
  6387. IF type.form = SyntaxTree.Static THEN
  6388. IF increment THEN
  6389. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6390. ELSE
  6391. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6392. END;
  6393. InitOperand(result,ModeValue);
  6394. result.op := res;
  6395. RETURN;
  6396. END;
  6397. END;
  6398. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6399. MakeMemory(res,operand.tag,addressType,offset);
  6400. (*
  6401. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6402. *)
  6403. InitOperand(result,ModeValue);
  6404. result.op := res;
  6405. ELSE
  6406. Convert(dim,addressType);
  6407. IF check THEN
  6408. IF type.form = SyntaxTree.Tensor THEN
  6409. DimensionCheck(operand.tag,dim,BrltL);
  6410. ELSIF isUnchecked THEN (* do nothing *)
  6411. ELSE
  6412. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6413. END;
  6414. END;
  6415. end := NewLabel(); next := NIL;
  6416. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6417. Emit(Mov(position,res,dim));
  6418. Convert(res,sizeType);
  6419. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6420. WHILE t IS SyntaxTree.MathArrayType DO
  6421. type := t(SyntaxTree.MathArrayType);
  6422. IF type.form = SyntaxTree.Static THEN
  6423. imm := IntermediateCode.Immediate(sizeType,val);
  6424. next := NewLabel();
  6425. BrneL(next,imm,res);
  6426. IF increment THEN
  6427. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6428. ELSE
  6429. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6430. END;
  6431. Emit(MovReplace(position,res,imm));
  6432. BrL(end);
  6433. ELSE hasDynamicPart := TRUE;
  6434. END;
  6435. t := type.arrayBase.resolved;
  6436. val := val + 1;
  6437. IF next # NIL THEN SetLabel(next) END;
  6438. END;
  6439. IF hasDynamicPart THEN
  6440. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6441. Emit(Mov(position,res2,dim));
  6442. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6443. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6444. Emit(Add(position,res2,res2,imm));
  6445. Emit(Add(position,res2,res2,operand.tag));
  6446. IntermediateCode.MakeMemory(res2,sizeType);
  6447. Emit(MovReplace(position,res,res2));
  6448. ReleaseIntermediateOperand(res2);
  6449. END;
  6450. SetLabel(end);
  6451. Convert(res,sizeType);
  6452. InitOperand(result,ModeValue);
  6453. result.op := res;
  6454. END;
  6455. END MathArrayLenOrIncr;
  6456. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6457. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6458. offset: LONGINT;
  6459. BEGIN
  6460. offset := operand.dimOffset+DynamicDim(type)-1;
  6461. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6462. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6463. val := SHORT(dim.intValue);
  6464. t := SemanticChecker.ArrayBase(type,val);
  6465. type := t.resolved(SyntaxTree.ArrayType);
  6466. IF type.form = SyntaxTree.Static THEN
  6467. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6468. ELSE
  6469. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6470. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6471. END;
  6472. UseIntermediateOperand(res);
  6473. InitOperand(result,ModeValue);
  6474. result.op := res;
  6475. ELSE
  6476. Convert(dim,addressType);
  6477. IF ~isUnchecked THEN
  6478. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6479. END;
  6480. end := NewLabel(); next := NIL;
  6481. (* ReuseCopy(dim,res); *)
  6482. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6483. Emit(Mov(position,res,dim));
  6484. Convert(res,sizeType);
  6485. Convert(res,sizeType);
  6486. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6487. WHILE t IS SyntaxTree.ArrayType DO
  6488. type := t(SyntaxTree.ArrayType);
  6489. IF type.form = SyntaxTree.Static THEN
  6490. imm := IntermediateCode.Immediate(sizeType,val);
  6491. next := NewLabel();
  6492. BrneL(next,imm,res);
  6493. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6494. Emit(MovReplace(position,res,imm));
  6495. BrL(end);
  6496. ELSE hasDynamicPart := TRUE;
  6497. END;
  6498. t := type.arrayBase.resolved;
  6499. val := val + 1;
  6500. IF next # NIL THEN SetLabel(next) END;
  6501. END;
  6502. IF hasDynamicPart THEN
  6503. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6504. Convert(res2,addressType);
  6505. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6506. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6507. Emit(Sub(position,res2,imm,res2));
  6508. Emit(Add(position,res2,res2,operand.tag));
  6509. IntermediateCode.MakeMemory(res2,sizeType);
  6510. Emit(MovReplace(position,res,res2));
  6511. ReleaseIntermediateOperand(res2);
  6512. END;
  6513. SetLabel(end);
  6514. Convert(res,sizeType);
  6515. InitOperand(result,ModeValue);
  6516. result.op := res;
  6517. END;
  6518. END ArrayLen;
  6519. (**
  6520. create a temporary variable in current scope
  6521. **)
  6522. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6523. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6524. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6525. BEGIN
  6526. IF ~register THEN
  6527. v := temporaries.GetFreeVariable(type, untraced, index);
  6528. ELSE
  6529. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6530. END;
  6531. scope := currentScope;
  6532. (*
  6533. v := NIL; (* disable free variable managemenet for the time being *)
  6534. *)
  6535. name := temporaries.GetUID();
  6536. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6537. variable.SetType(type);
  6538. variable.SetAccess(SyntaxTree.Hidden);
  6539. variable.SetUntraced(untraced);
  6540. IF v = NIL THEN
  6541. temporaries.AddVariable(variable);
  6542. IF ~register THEN
  6543. IF scope.lastVariable # NIL THEN
  6544. offset := scope.lastVariable.offsetInBits;
  6545. ELSE
  6546. offset := 0;
  6547. END;
  6548. DEC(offset,system.SizeOf(variable.type));
  6549. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6550. variable(SyntaxTree.Variable).SetOffset(offset);
  6551. scope.AddVariable(variable(SyntaxTree.Variable));
  6552. scope.EnterSymbol(variable, duplicate);
  6553. ASSERT(~duplicate);
  6554. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6555. ELSE
  6556. variable.SetUseRegister(TRUE);
  6557. variable(SyntaxTree.Variable).SetOffset(0);
  6558. END;
  6559. ELSE (* v # NIL *)
  6560. (* reuse slot for new variable, do not create new slot ! *)
  6561. temporaries.SetVariable(index, variable);
  6562. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6563. ASSERT(~register);
  6564. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6565. ASSERT(v.offsetInBits # 0);
  6566. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6567. scope.EnterSymbol(variable, duplicate);
  6568. ASSERT(~duplicate);
  6569. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6570. END;
  6571. RETURN variable(SyntaxTree.Variable)
  6572. END GetTemporaryVariable;
  6573. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6574. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6575. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6576. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6577. i: LONGINT; duplicate: BOOLEAN;
  6578. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6579. VAR variable: SyntaxTree.Variable;
  6580. BEGIN
  6581. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6582. variable.SetType(type);
  6583. recordScope.AddVariable(variable);
  6584. END AddVariable;
  6585. BEGIN
  6586. name := "@ArrayDescriptor";
  6587. Basic.AppendNumber(name,dimensions);
  6588. identifier := SyntaxTree.NewIdentifier(name);
  6589. parentScope := module.module.moduleScope;
  6590. symbol := parentScope.FindSymbol(identifier);
  6591. IF symbol # NIL THEN
  6592. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6593. type := typeDeclaration.declaredType;
  6594. ELSE
  6595. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6596. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6597. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6598. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6599. recordType.SetTypeDeclaration(typeDeclaration);
  6600. recordType.SetState(SyntaxTree.Resolved);
  6601. typeDeclaration.SetDeclaredType(recordType);
  6602. AddVariable("@ptr",system.anyType);
  6603. AddVariable("@adr",system.addressType);
  6604. AddVariable("@flags",system.addressType);
  6605. AddVariable("@dim",system.addressType);
  6606. AddVariable("@elementSize",system.addressType);
  6607. FOR i := 0 TO dimensions-1 DO
  6608. name := "@len";
  6609. Basic.AppendNumber(name,i);
  6610. AddVariable(name,system.addressType);
  6611. name := "@incr";
  6612. Basic.AppendNumber(name,i);
  6613. AddVariable(name,system.addressType);
  6614. END;
  6615. parentScope.AddTypeDeclaration(typeDeclaration);
  6616. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6617. ASSERT(~duplicate);
  6618. type := recordType;
  6619. END;
  6620. RETURN type
  6621. END GetMathArrayDescriptorType;
  6622. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6623. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6624. BEGIN
  6625. type := GetMathArrayDescriptorType(dimensions);
  6626. Emit(Push(position,op.op));
  6627. (* push type descriptor *)
  6628. reg := TypeDescriptorAdr(type);
  6629. Emit(Push(position,reg));
  6630. ReleaseIntermediateOperand(reg);
  6631. (* push realtime flag: false by default *)
  6632. Emit(Push(position,false));
  6633. CallThis(position,"Heaps","NewRec",3);
  6634. END NewMathArrayDescriptor;
  6635. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6636. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6637. BEGIN
  6638. NEW(string, LEN(s)); COPY(s, string^);
  6639. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6640. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6641. sv.SetType(type);
  6642. Designate(sv,res);
  6643. Emit(Push(position,res.tag));
  6644. Emit(Push(position,res.op));
  6645. ReleaseOperand(res);
  6646. END PushConstString;
  6647. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6648. BEGIN
  6649. IF b THEN
  6650. Emit(Push(Basic.invalidPosition, true));
  6651. ELSE
  6652. Emit(Push(Basic.invalidPosition, false));
  6653. END;
  6654. END PushConstBoolean;
  6655. PROCEDURE PushConstSet(v: SET);
  6656. VAR value: SyntaxTree.Value; op: Operand;
  6657. BEGIN
  6658. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6659. value.SetType(system.setType);
  6660. Evaluate(value, op);
  6661. Emit(Push(Basic.invalidPosition, op.op));
  6662. ReleaseOperand(op);
  6663. END PushConstSet;
  6664. PROCEDURE PushConstInteger(v: LONGINT);
  6665. VAR value: SyntaxTree.Value; op: Operand;
  6666. BEGIN
  6667. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6668. value.SetType(system.longintType);
  6669. Evaluate(value, op);
  6670. Emit(Push(Basic.invalidPosition, op.op));
  6671. ReleaseOperand(op);
  6672. END PushConstInteger;
  6673. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6674. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6675. section: IntermediateCode.Section;
  6676. BEGIN
  6677. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6678. Global.GetSymbolSegmentedName(symbol, name);
  6679. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6680. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6681. procedure.SetScope(moduleScope);
  6682. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6683. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6684. procedure.SetAccess(SyntaxTree.Hidden);
  6685. currentScope := procedureScope;
  6686. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6687. EmitEnter(section, Basic.invalidPosition,procedure,0,0);
  6688. RETURN section;
  6689. END OpenInitializer;
  6690. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6691. BEGIN
  6692. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6693. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6694. section := prev;
  6695. END CloseInitializer;
  6696. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6697. VAR name: SyntaxTree.IdentifierString;
  6698. variable: SyntaxTree.Variable;
  6699. parameter: SyntaxTree.Parameter;
  6700. type: SyntaxTree.Type;
  6701. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6702. BEGIN
  6703. InitOperand(op,ModeReference);
  6704. op.op := fp;
  6705. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6706. Dereference(op, x, FALSE);
  6707. result := op;
  6708. Symbol(symbol, op);
  6709. END Field;
  6710. PROCEDURE Direction(direction: LONGINT): SET;
  6711. BEGIN
  6712. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6713. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6714. ELSE HALT(100);
  6715. END;
  6716. END Direction;
  6717. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6718. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6719. BEGIN
  6720. Field(port, op);
  6721. ToMemory(op.op,addressType,0);
  6722. Emit(Push(Basic.invalidPosition, op.op));
  6723. ReleaseOperand(op);
  6724. Basic.GetString(modifier.identifier, name);
  6725. PushConstString(name);
  6726. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6727. ASSERT(SemanticChecker.IsStringType(value.type));
  6728. Designate(value, op);
  6729. Emit(Push(modifier.position, op.tag));
  6730. Emit(Push(modifier.position, op.op));
  6731. ReleaseOperand(op);
  6732. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6733. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6734. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6735. Evaluate(value, op);
  6736. Emit(Push(modifier.position, op.op));
  6737. ReleaseOperand(op);
  6738. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6739. ELSE
  6740. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6741. END;
  6742. END AddPortProperty;
  6743. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6744. VAR modifier: SyntaxTree.Modifier;
  6745. BEGIN
  6746. modifier := parameter.modifiers;
  6747. WHILE modifier # NIL DO
  6748. AddPortProperty(parameter,modifier, modifier.expression);
  6749. modifier := modifier.nextModifier;
  6750. END;
  6751. END AddPortProperties;
  6752. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6753. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6754. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6755. PROCEDURE PushLens(type: SyntaxTree.Type);
  6756. BEGIN
  6757. IF IsSemiDynamicArray(type) THEN
  6758. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6759. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6760. Emit(Push(Basic.invalidPosition, op.op));
  6761. ReleaseOperand(op);
  6762. INC(dim);
  6763. ELSIF IsStaticArray(type) THEN
  6764. len := len * type(SyntaxTree.ArrayType).staticLength;
  6765. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6766. INC(dim);
  6767. ELSE
  6768. baseType := type;
  6769. END;
  6770. END PushLens;
  6771. BEGIN
  6772. (* cell *)
  6773. IF parameter.type IS SyntaxTree.ArrayType THEN
  6774. type := parameter.type;
  6775. dim := 0;
  6776. len := 1;
  6777. PushLens(type);
  6778. portType := baseType.resolved(SyntaxTree.PortType);
  6779. ELSE
  6780. portType := parameter.type(SyntaxTree.PortType);
  6781. END;
  6782. PushSelfPointer();
  6783. (* port / array of ports *)
  6784. IF IsStaticArray(type) THEN
  6785. PushConstInteger(len);
  6786. END;
  6787. Field(parameter, op);
  6788. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6789. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6790. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6791. Designate(d, op);*)
  6792. Emit(Push(Basic.invalidPosition, op.op));
  6793. ReleaseOperand(op);
  6794. (* name *)
  6795. PushConstString(name);
  6796. (* inout *)
  6797. PushConstSet(Direction(portType.direction));
  6798. (* width *)
  6799. PushConstInteger(portType.sizeInBits);
  6800. IF parameter.type IS SyntaxTree.PortType THEN
  6801. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6802. AddPortProperties(parameter);
  6803. ELSIF IsStaticArray(type)THEN
  6804. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6805. ELSIF IsSemiDynamicArray(type) THEN
  6806. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6807. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6808. Emit(Add(position,reg, sp, size));
  6809. (* dim *)
  6810. PushConstInteger(dim);
  6811. (* len array *)
  6812. Emit(Push(position, reg));
  6813. ReleaseIntermediateOperand(reg);
  6814. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6815. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6816. Emit(Add(position, sp,sp, size));
  6817. ELSE
  6818. HALT(100);
  6819. END;
  6820. END Parameter;
  6821. BEGIN
  6822. IF backend.cellsAreObjects THEN
  6823. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6824. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6825. END;
  6826. parameter := x.firstParameter;
  6827. WHILE (parameter # NIL) DO
  6828. type := parameter.type.resolved;
  6829. WHILE (type IS SyntaxTree.ArrayType) DO
  6830. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6831. END;
  6832. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6833. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6834. Parameter(name,parameter);
  6835. END;
  6836. parameter := parameter.nextParameter;
  6837. END;
  6838. ELSE HALT(200)
  6839. END;
  6840. END AddPorts;
  6841. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6842. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6843. BEGIN
  6844. Symbol(cell,op);
  6845. ToMemory(op.op,addressType,0);
  6846. Emit(Push(position,op.op));
  6847. ReleaseOperand(op);
  6848. property.GetName(name);
  6849. (* does not work when inheritance is used:
  6850. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6851. *)
  6852. PushConstString(name);
  6853. IF (value # NIL) THEN
  6854. ASSERT(
  6855. SemanticChecker.IsStringType(property.type)
  6856. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6857. OR (property.type.resolved IS SyntaxTree.FloatType)
  6858. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6859. OR (property.type.resolved IS SyntaxTree.SetType)
  6860. );
  6861. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6862. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6863. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6864. Designate(d, op);
  6865. IF SemanticChecker.IsStringType(property.type) THEN
  6866. Emit(Push(Basic.invalidPosition, op.tag))
  6867. END;
  6868. Emit(Push(Basic.invalidPosition, op.op));
  6869. ReleaseOperand(op);
  6870. END;
  6871. IF value = NIL THEN
  6872. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6873. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6874. ASSERT(SemanticChecker.IsStringType(value.type));
  6875. Designate(value, op);
  6876. PushString(op, value.type);
  6877. ReleaseOperand(op);
  6878. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6879. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6880. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6881. Evaluate(value, op);
  6882. Emit(Push(property.position, op.op));
  6883. ReleaseOperand(op);
  6884. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6885. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6886. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6887. Evaluate(value, op);
  6888. Emit(Push(property.position, op.op));
  6889. ReleaseOperand(op);
  6890. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6891. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6892. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6893. Evaluate(value, op);
  6894. Emit(Push(property.position, op.op));
  6895. ReleaseOperand(op);
  6896. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6897. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6898. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6899. Evaluate(value, op);
  6900. Emit(Push(property.position, op.op));
  6901. ReleaseOperand(op);
  6902. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6903. ELSE
  6904. HALT(200);
  6905. END;
  6906. END AddProperty;
  6907. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6908. VAR symbol: SyntaxTree.Symbol;
  6909. BEGIN
  6910. WHILE modifier # NIL DO
  6911. symbol := cellType.FindProperty(modifier.identifier);
  6912. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6913. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6914. modifier := modifier.nextModifier;
  6915. END;
  6916. END AddModifiers;
  6917. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6918. VAR last: SyntaxTree.Modifier;
  6919. BEGIN
  6920. IF to = NIL THEN
  6921. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6922. ELSE
  6923. last := to;
  6924. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6925. last := last.nextModifier;
  6926. END;
  6927. IF last.identifier # this.identifier THEN
  6928. ASSERT(last.nextModifier = NIL);
  6929. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6930. END;
  6931. END;
  6932. END AppendModifier;
  6933. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6934. BEGIN
  6935. WHILE this # NIL DO
  6936. AppendModifier(to, this);
  6937. this := this.nextModifier;
  6938. END;
  6939. END AppendModifiers;
  6940. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6941. VAR base: SyntaxTree.Type;
  6942. BEGIN
  6943. AppendModifiers(to, c.modifiers);
  6944. base := c.GetBaseValueType();
  6945. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6946. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6947. END;
  6948. END AppendCellTypeModifiers;
  6949. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6950. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6951. BEGIN
  6952. Basic.GetString(modifier.identifier, name);
  6953. PushConstString(name);
  6954. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6955. ASSERT(SemanticChecker.IsStringType(value.type));
  6956. Designate(value, op);
  6957. PushString(op, value.type);
  6958. ReleaseOperand(op);
  6959. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6960. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6961. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6962. Evaluate(value, op);
  6963. Emit(Push(modifier.position, op.op));
  6964. ReleaseOperand(op);
  6965. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6966. ELSE
  6967. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6968. END;
  6969. END AddPortProperty;
  6970. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6971. BEGIN
  6972. WHILE modifier # NIL DO
  6973. AddPortProperty(modifier, modifier.expression);
  6974. modifier := modifier.nextModifier;
  6975. END;
  6976. END AddPortProperties;
  6977. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6978. VAR op: Operand;
  6979. BEGIN
  6980. Evaluate(p, op);
  6981. Emit(Push(p.position, op.op));
  6982. ReleaseOperand(op);
  6983. IF p IS SyntaxTree.Designator THEN
  6984. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  6985. END;
  6986. END PushPort;
  6987. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6988. VAR tmp: IntermediateCode.Operand;
  6989. BEGIN
  6990. actualType := actualType.resolved;
  6991. IF actualType IS SyntaxTree.StringType THEN
  6992. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6993. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6994. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6995. ELSE
  6996. tmp := op.tag;
  6997. IntermediateCode.MakeMemory(tmp,addressType);
  6998. Emit(Push(position,tmp));
  6999. END;
  7000. Emit(Push(position,op.op))
  7001. END PushString;
  7002. (* conservative check if x is potentially on the heap, excluding the module heap
  7003. required for generational garbage collector
  7004. *)
  7005. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  7006. VAR pos: LONGINT; y: SyntaxTree.Expression;
  7007. BEGIN
  7008. RETURN TRUE;
  7009. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  7010. passed by reference.
  7011. pos := x.position.start;
  7012. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  7013. x := x(SyntaxTree.Designator).left;
  7014. END;
  7015. RETURN x # NIL;
  7016. *)
  7017. END OnHeap;
  7018. PROCEDURE VisitBuiltinCallDesignator*(x: SyntaxTree.BuiltinCallDesignator);
  7019. VAR
  7020. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  7021. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  7022. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  7023. tmp:IntermediateCode.Operand;
  7024. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  7025. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  7026. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  7027. dest: IntermediateCode.Operand;
  7028. staticLength: LONGINT; itype: IntermediateCode.Type;
  7029. convert,isTensor: BOOLEAN;
  7030. recordType: SyntaxTree.RecordType;
  7031. baseType: SyntaxTree.Type;
  7032. flags: SET;
  7033. left: SyntaxTree.Expression;
  7034. call: SyntaxTree.Designator;
  7035. procedure: SyntaxTree.Procedure;
  7036. temporaryVariable: SyntaxTree.Variable;
  7037. dummy: IntermediateCode.Operand;
  7038. customBuiltin: SyntaxTree.CustomBuiltin;
  7039. isVarPar: ARRAY 3 OF BOOLEAN;
  7040. callsection: Sections.Section;
  7041. segmentedName: Basic.SegmentedName;
  7042. needsTrace: BOOLEAN;
  7043. n: ARRAY 256 OF CHAR;
  7044. modifier: SyntaxTree.Modifier;
  7045. previous, init: IntermediateCode.Section;
  7046. prevScope: SyntaxTree.Scope;
  7047. firstPar: LONGINT;
  7048. saved: RegisterEntry;
  7049. callingConvention: SyntaxTree.CallingConvention;
  7050. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  7051. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  7052. priority: IntermediateCode.Operand;
  7053. op,callop: Operand;
  7054. BEGIN
  7055. IF type = NIL THEN RETURN END;
  7056. type := type.resolved;
  7057. IF type IS SyntaxTree.PointerType THEN
  7058. type := type(SyntaxTree.PointerType).pointerBase.resolved
  7059. END;
  7060. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  7061. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  7062. recordScope := type(SyntaxTree.RecordType).recordScope;
  7063. IF recordScope.bodyProcedure # NIL THEN
  7064. procedure := recordScope.bodyProcedure;
  7065. body := procedure.procedureScope.body;
  7066. Emit(Push(position,self));
  7067. IF body.isActive THEN
  7068. StaticCallOperand(callop,procedure);
  7069. Emit(Push(position,callop.op));
  7070. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  7071. Convert(priority,sizeType);
  7072. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  7073. END;
  7074. Emit(Push(position,priority));
  7075. ReleaseIntermediateOperand(priority);
  7076. IF backend.cooperative THEN
  7077. Emit(Push(position,self));
  7078. CallThis(position,"Activities","Create",3)
  7079. ELSE
  7080. flags := 0;
  7081. IF body.isSafe THEN
  7082. flags := 1;
  7083. END;
  7084. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  7085. Emit(Push(position,self));
  7086. CallThis(position,"Objects","CreateProcess",4)
  7087. END;
  7088. ELSE
  7089. Emit(Push(position,self));
  7090. StaticCallOperand(callop,procedure);
  7091. Emit(Call(position,callop.op,ProcParametersSize(procedure)));
  7092. END;
  7093. Emit(Pop(position,self));
  7094. END;
  7095. END CallBodies;
  7096. PROCEDURE PushTD(type: SyntaxTree.Type);
  7097. VAR op: IntermediateCode.Operand;
  7098. BEGIN
  7099. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  7100. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  7101. ELSE
  7102. IF type.resolved IS SyntaxTree.PointerType THEN
  7103. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7104. END;
  7105. op := TypeDescriptorAdr(type.resolved);
  7106. Emit(Push(position,op));
  7107. END
  7108. END PushTD;
  7109. BEGIN
  7110. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  7111. dest := destination; destination := emptyOperand;
  7112. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  7113. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  7114. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  7115. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  7116. CASE x.id OF
  7117. (* ---- COPY ----- *)
  7118. |Global.Copy:
  7119. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  7120. (* ---- EXCL, INCL----- *)
  7121. |Global.Excl,Global.Incl:
  7122. Evaluate(p0,s0);
  7123. Evaluate(p1,s1);
  7124. Convert(s1.op,IntermediateCode.GetType(system,t0));
  7125. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7126. TrapC(BrltL,s1.op,IntermediateCode.Immediate(s1.op.type,t0.sizeInBits),IndexCheckTrap);
  7127. END;
  7128. ReuseCopy(res,s0.op);
  7129. ReleaseOperand(s0);
  7130. Reuse1(tmp,s1.op);
  7131. ReleaseOperand(s1);
  7132. Emit(Shl(position,tmp,IntermediateCode.Immediate(s1.op.type,1),s1.op));
  7133. IF x.id = Global.Excl THEN
  7134. Emit(Not(position,tmp,tmp));
  7135. Emit(And(position,res,res,tmp));
  7136. ELSE
  7137. Emit(Or(position,res,res,tmp));
  7138. END;
  7139. ReleaseIntermediateOperand(tmp);
  7140. Designate(p0,s0);
  7141. ToMemory(s0.op,s1.op.type,0);
  7142. Emit(Mov(position,s0.op,res));
  7143. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  7144. (* ---- DISPOSE ----- *)
  7145. |Global.Dispose:
  7146. Designate(p0,s0);
  7147. Emit(Push(position,s0.op));
  7148. ReleaseOperand(s0);
  7149. CallThis(position,"Runtime","Dispose", 1);
  7150. (* ---- GETPROCEDURE ----- *)
  7151. |Global.GetProcedure:
  7152. Designate(p0,s0);
  7153. PushString(s0,p0.type);
  7154. Designate(p1,s1);
  7155. PushString(s1,p1.type);
  7156. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  7157. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  7158. ELSE PushTD(procedureType.firstParameter.type)
  7159. END;
  7160. PushTD(procedureType.returnType);
  7161. Designate(p2,s2);
  7162. Emit(Push(position,s2.op));
  7163. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7164. CallThis(position,"Modules","GetProcedure", 7);
  7165. (* ---- ASH, LSH, ROT ----- *)
  7166. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  7167. Evaluate(p0,s0);
  7168. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  7169. (* make unsigned arguments in order to produced a logical shift *)
  7170. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  7171. convert:= TRUE;
  7172. itype := s0.op.type;
  7173. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  7174. Convert(s0.op,itype);
  7175. ELSE
  7176. convert := FALSE;
  7177. END;
  7178. END;
  7179. Evaluate(p1,s1);
  7180. IF IsIntegerConstant(p1,hint) THEN
  7181. ReuseCopy(reg,s0.op);
  7182. IF hint > 0 THEN
  7183. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  7184. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  7185. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7186. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7187. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7188. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7189. END;
  7190. ELSIF hint < 0 THEN
  7191. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7192. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7193. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7194. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7195. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7196. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7197. END;
  7198. END;
  7199. ReleaseOperand(s0); ReleaseOperand(s1);
  7200. ELSE
  7201. exit := NewLabel();
  7202. end := NewLabel();
  7203. ReuseCopy(reg,s0.op);
  7204. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7205. Reuse1(tmp,s1.op);
  7206. Emit(Neg(position,tmp,s1.op));
  7207. Convert(tmp,s1.op.type);
  7208. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7209. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7210. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7211. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7212. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7213. END;
  7214. ReleaseIntermediateOperand(tmp);
  7215. BrL(end);
  7216. SetLabel(exit);
  7217. ReuseCopy(tmp,s1.op);
  7218. Convert(tmp,s1.op.type);
  7219. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7220. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7221. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7222. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7223. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7224. END;
  7225. ReleaseIntermediateOperand(tmp);
  7226. SetLabel(end);
  7227. ReleaseOperand(s0); ReleaseOperand(s1);
  7228. END;
  7229. InitOperand(result,ModeValue);
  7230. IF convert THEN
  7231. itype := reg.type;
  7232. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7233. Convert(reg,itype);
  7234. END;
  7235. result.op := reg;
  7236. (* ---- CAP ----- *)
  7237. |Global.Cap:
  7238. Evaluate(p0,result);
  7239. ReuseCopy(reg,result.op);
  7240. ReleaseIntermediateOperand(result.op);
  7241. ignore := NewLabel();
  7242. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7243. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7244. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7245. SetLabel(ignore);
  7246. result.op := reg;
  7247. (* ---- CHR ----- *)
  7248. |Global.Chr, Global.Chr32:
  7249. Evaluate(p0,result);
  7250. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7251. |Global.Entier, Global.EntierH:
  7252. Evaluate(p0,result);
  7253. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7254. (* ---- MIN and MAX ----- *)
  7255. |Global.Max,Global.Min:
  7256. Evaluate(p0,s0);
  7257. Evaluate(p1,s1);
  7258. Reuse2(res,s0.op,s1.op);
  7259. else := NewLabel();
  7260. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7261. ELSE BrltL(else,s1.op,s0.op) END;
  7262. Emit(Mov(position,res,s0.op));
  7263. ReleaseOperand(s0);
  7264. end := NewLabel();
  7265. BrL(end);
  7266. SetLabel(else);
  7267. Emit(MovReplace(position,res,s1.op));
  7268. SetLabel(end);
  7269. ReleaseOperand(s1);
  7270. InitOperand(result,ModeValue);
  7271. result.op := res;
  7272. (* ---- ODD ----- *)
  7273. |Global.Odd:
  7274. IF ~conditional THEN
  7275. ConditionToValue(x)
  7276. ELSE
  7277. Evaluate(p0,result);
  7278. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7279. Reuse1(res,result.op);
  7280. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7281. ReleaseIntermediateOperand(result.op);
  7282. result.op := res;
  7283. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  7284. ReleaseOperand(result);
  7285. BrL(falseLabel);
  7286. END;
  7287. (* ---- ORD ----- *)
  7288. |Global.Ord, Global.Ord32:
  7289. Evaluate(p0,result);
  7290. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7291. (* ---- SHORT, LONG ----- *)
  7292. |Global.Short, Global.Long:
  7293. Evaluate(p0,result);
  7294. IF x.type IS SyntaxTree.ComplexType THEN
  7295. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7296. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7297. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7298. ELSE
  7299. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7300. END
  7301. (* ---- HALT, SYSTEM.HALT----- *)
  7302. |Global.Halt, Global.systemHalt:
  7303. val := LONGINT (p0.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7304. EmitTrap (position, val);
  7305. (* ---- ASSERT ----- *)
  7306. |Global.Assert:
  7307. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7308. trueL := NewLabel();
  7309. falseL := NewLabel();
  7310. Condition(p0,trueL,falseL);
  7311. IF p1 = NIL THEN val := AssertTrap
  7312. ELSE val := LONGINT(p1.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7313. END;
  7314. SetLabel(falseL);
  7315. EmitTrap(position,val);
  7316. SetLabel(trueL);
  7317. END;
  7318. (*
  7319. Emit(TrapC(result.op,val);
  7320. *)
  7321. (* ---- INC, DEC----- *)
  7322. |Global.Inc,Global.Dec:
  7323. Expression(p0); adr := result.op;
  7324. LoadValue(result,p0.type); l := result;
  7325. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7326. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7327. END;
  7328. IF x.id = Global.Inc THEN
  7329. Emit(Add(position,l.op,l.op,r.op));
  7330. ELSE
  7331. Emit(Sub(position,l.op,l.op,r.op));
  7332. END;
  7333. ReleaseOperand(l); ReleaseOperand(r);
  7334. (* ---- LEN ----- *)
  7335. |Global.Len: (* dynamic length, static length done by checker *)
  7336. Designate(p0,operand);
  7337. IF p1 = NIL THEN
  7338. InitOperand(l,ModeValue);
  7339. l.op := IntermediateCode.Immediate(sizeType,0);
  7340. ELSE
  7341. Evaluate(p1,l);
  7342. END;
  7343. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7344. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7345. Dereference(operand, p0.type.resolved, FALSE);
  7346. END;
  7347. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7348. ReleaseOperand(operand); ReleaseOperand(l);
  7349. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7350. ASSERT(p1 # NIL);
  7351. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7352. Dereference(operand,p0.type.resolved,FALSE);
  7353. END;
  7354. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7355. ReleaseOperand(operand); ReleaseOperand(l);
  7356. ELSE HALT(100);
  7357. END;
  7358. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7359. (* ---- FIRST ---- *)
  7360. |Global.First:
  7361. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7362. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7363. ELSE
  7364. Designate(p0, result)
  7365. END
  7366. (* ---- LAST ---- *)
  7367. |Global.Last:
  7368. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7369. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7370. ELSE
  7371. Designate(p0, result);
  7372. (* make sure result.op is a register *)
  7373. tmp := result.op;
  7374. ReuseCopy(result.op, result.op);
  7375. ReleaseIntermediateOperand(tmp);
  7376. (* add offset to result.op *)
  7377. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7378. END
  7379. (* ---- STEP ---- *)
  7380. |Global.Step:
  7381. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7382. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7383. ELSE
  7384. Designate(p0, result);
  7385. (* make sure result.op is a register *)
  7386. tmp := result.op;
  7387. ReuseCopy(result.op, result.op);
  7388. ReleaseIntermediateOperand(tmp);
  7389. (* add offset to result.op *)
  7390. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7391. END
  7392. (* ---- RE ---- *)
  7393. |Global.Re:
  7394. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7395. Designate(p0, result)
  7396. ELSE
  7397. Evaluate(p0, result)
  7398. END
  7399. (* ---- IM ---- *)
  7400. |Global.Im:
  7401. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7402. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7403. Designate(p0, result);
  7404. (* make sure result.op is a register *)
  7405. tmp := result.op;
  7406. ReuseCopy(result.op, result.op);
  7407. ReleaseIntermediateOperand(tmp);
  7408. (* add offset to result.op *)
  7409. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7410. (* ---- ABS ----- *)
  7411. |Global.Abs:
  7412. Evaluate(p0,operand);
  7413. type := p0.type.resolved;
  7414. InitOperand(result,ModeValue);
  7415. Reuse1a(result.op,operand.op,dest);
  7416. Emit(Abs(position,result.op,operand.op));
  7417. ReleaseOperand(operand);
  7418. (* ---- WAIT ----- *)
  7419. |Global.Wait:
  7420. Evaluate(p0,operand);
  7421. Emit(Push(position,operand.op));
  7422. ReleaseOperand(operand);
  7423. CallThis(position,"Activities","Wait", 1);
  7424. (* ---- NEW ----- *)
  7425. |Global.New:
  7426. (*! the following code is only correct for "standard" Oberon calling convention *)
  7427. IF x.type # NIL THEN
  7428. type := x.type.resolved;
  7429. firstPar := 0;
  7430. ELSE
  7431. type := p0.type.resolved;
  7432. firstPar := 1;
  7433. END;
  7434. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7435. THEN
  7436. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7437. IF backend.cooperative THEN
  7438. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7439. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7440. IF recordType.isObject THEN
  7441. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7442. IF recordType.IsActive() THEN
  7443. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7444. END;
  7445. IF recordType.IsProtected() THEN
  7446. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7447. END;
  7448. ELSE
  7449. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7450. END;
  7451. END;
  7452. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7453. CallThis(position,"Runtime","New", 1);
  7454. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7455. Emit(Result(position, pointer));
  7456. exit := NewLabel();
  7457. BreqL(exit,pointer,nil);
  7458. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7459. GetRecordTypeName (recordType,name);
  7460. IF ~recordType.isObject THEN
  7461. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7462. END;
  7463. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7464. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7465. IF recordType.isObject THEN
  7466. IF recordType.IsProtected() THEN
  7467. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7468. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7469. END;
  7470. IF recordType.IsActive() THEN
  7471. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7472. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7473. END;
  7474. END;
  7475. END;
  7476. (* initialize fields *)
  7477. IF type(SyntaxTree.PointerType).isPlain THEN
  7478. size := 0;
  7479. ELSIF recordType.isObject THEN
  7480. size := BaseObjectTypeSize;
  7481. ELSE
  7482. size := BaseRecordTypeSize;
  7483. END;
  7484. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7485. (* call initializer *)
  7486. constructor := GetConstructor(recordType);
  7487. IF constructor # NIL THEN
  7488. (*! should be unified with ProcedureCallDesignator *)
  7489. Emit(Push(position,pointer));
  7490. ReleaseIntermediateOperand(pointer);
  7491. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7492. FOR i := firstPar TO x.parameters.Length()-1 DO
  7493. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7494. formalParameter := formalParameter.nextParameter;
  7495. END;
  7496. (* static call of the constructor *)
  7497. GetCodeSectionNameForSymbol(constructor,name);
  7498. ASSERT(~constructor.isInline);
  7499. IF constructor.scope.ownerModule # module.module THEN
  7500. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7501. ELSE
  7502. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7503. END;
  7504. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7505. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7506. Emit(Pop(position,pointer));
  7507. END;
  7508. (* call bodies *)
  7509. CallBodies(pointer,type);
  7510. SetLabel(exit);
  7511. needsTrace := p0.NeedsTrace();
  7512. IF needsTrace THEN ModifyAssignments(true) END;
  7513. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7514. Emit(Push(position, pointer));
  7515. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7516. Emit(Pop(position, pointer));
  7517. END;
  7518. Designate(p0,l);
  7519. IF needsTrace THEN
  7520. CallAssignPointer(l.op, pointer);
  7521. ELSE
  7522. ToMemory(l.op,addressType,0);
  7523. Emit(Mov(position,l.op,pointer));
  7524. END;
  7525. ReleaseIntermediateOperand(pointer);
  7526. ReleaseOperand(l);
  7527. IF needsTrace THEN ModifyAssignments(false) END;
  7528. ELSE (* not cooperative backend *)
  7529. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7530. IF temporaryVariable # NIL THEN
  7531. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7532. ELSE
  7533. Designate(p0,l);
  7534. END;
  7535. (* l.op contains address of pointer to record *)
  7536. Emit(Push(position,l.op)); (* address for use after syscall *)
  7537. Emit(Push(position,l.op));
  7538. ReleaseOperand(l);
  7539. (* push type descriptor *)
  7540. reg := TypeDescriptorAdr(recordType);
  7541. Emit(Push(position,reg));
  7542. ReleaseIntermediateOperand(reg);
  7543. (* push realtime flag *)
  7544. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7545. ELSE Emit(Push(position,false));
  7546. END;
  7547. CallThis(position,"Heaps","NewRec", 3);
  7548. (* check allocation success, if not successful then do not call initializers and bodies *)
  7549. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7550. Emit(Pop(position,pointer));
  7551. MakeMemory(reg,pointer,addressType,0);
  7552. ReleaseIntermediateOperand(pointer);
  7553. pointer := reg;
  7554. exit := NewLabel();
  7555. BreqL(exit,pointer,nil);
  7556. Emit(Push(position,pointer));
  7557. (* initialize fields *)
  7558. InitFields(recordType, pointer,0);
  7559. (* call initializer *)
  7560. constructor := GetConstructor(recordType);
  7561. IF constructor # NIL THEN
  7562. (*! should be unified with ProcedureCallDesignator *)
  7563. Emit(Push(position,pointer));
  7564. ReleaseIntermediateOperand(pointer);
  7565. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7566. FOR i := firstPar TO x.parameters.Length()-1 DO
  7567. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7568. formalParameter := formalParameter.nextParameter;
  7569. END;
  7570. (* static call of the constructor *)
  7571. GetCodeSectionNameForSymbol(constructor,name);
  7572. ASSERT(~constructor.isInline);
  7573. IF constructor.scope.ownerModule # module.module THEN
  7574. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7575. ELSE
  7576. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7577. END;
  7578. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  7579. ELSE
  7580. ReleaseIntermediateOperand(pointer);
  7581. END;
  7582. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7583. Emit(Pop(position,pointer));
  7584. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7585. Designate(p0,l);
  7586. IF backend.writeBarriers & OnHeap(p0) THEN
  7587. SaveRegisters();ReleaseUsedRegisters(saved);
  7588. Emit(Push(position,l.op));
  7589. Emit(Push(position,pointer));
  7590. CallThis(position,"Heaps","Assign",2);
  7591. RestoreRegisters(saved);
  7592. ELSE
  7593. ToMemory(l.op,addressType,0);
  7594. Emit(Mov(position,l.op,pointer));
  7595. END;
  7596. ReleaseOperand(l);
  7597. result.tag := emptyOperand;
  7598. ELSIF (x.type # NIL) THEN
  7599. result := l; (* temporary variable is the result of NEW Type() *)
  7600. END;
  7601. (* call bodies *)
  7602. CallBodies(pointer,type);
  7603. ReleaseIntermediateOperand(pointer);
  7604. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7605. end := NewLabel();
  7606. BrL(end);
  7607. SetLabel(exit);
  7608. Designate(p0,l);
  7609. ToMemory(l.op,addressType,0);
  7610. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7611. ReleaseOperand(l);
  7612. SetLabel(end);
  7613. ELSE
  7614. SetLabel(exit);
  7615. END;
  7616. END;
  7617. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7618. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7619. IF ~backend.cooperative THEN (* simpler version *)
  7620. (*
  7621. push len0
  7622. push len1
  7623. push len2
  7624. push len_size
  7625. push len_adr
  7626. push tag
  7627. push static elements
  7628. push element size
  7629. push adr
  7630. *)
  7631. dim := 0;
  7632. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7633. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7634. parameter := x.parameters.GetExpression(i);
  7635. Evaluate(parameter,r);
  7636. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7637. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7638. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7639. END;
  7640. Emit(Push(position,r.op));
  7641. ReleaseOperand(r);
  7642. INC(dim);
  7643. END;
  7644. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7645. Emit(Mov(position, adr, sp));
  7646. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7647. Emit(Push(position, adr));
  7648. ReleaseIntermediateOperand(adr);
  7649. openDim := dim;
  7650. staticLength := 1;
  7651. IF type IS SyntaxTree.ArrayType THEN
  7652. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7653. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7654. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7655. END;
  7656. END;
  7657. IF SemanticChecker.ContainsPointer(type) THEN
  7658. tmp := TypeDescriptorAdr(type);
  7659. ELSE
  7660. tmp := nil;
  7661. END;
  7662. Emit(Push(position,tmp)); (* type descriptor *)
  7663. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7664. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7665. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7666. Designate(p0,l);
  7667. Emit(Push(position,l.op)); (* address *)
  7668. ReleaseOperand(l);
  7669. CallThis(position,"Heaps","NewArray", 6);
  7670. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7671. Emit(Add(position,sp,sp,tmp));
  7672. ELSE
  7673. dim := 0;
  7674. IntermediateCode.InitOperand(reg);
  7675. IF p1 # NIL THEN
  7676. FOR i := firstPar TO x.parameters.Length()-1 DO
  7677. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7678. parameter := x.parameters.GetExpression(i);
  7679. Evaluate(parameter,r);
  7680. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7681. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7682. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7683. END;
  7684. Emit(Push(position,r.op));
  7685. IF i=1 THEN
  7686. CopyInt(reg,r.op);
  7687. ELSE
  7688. MulInt(reg, reg, r.op);
  7689. END;
  7690. ReleaseOperand(r);
  7691. INC(dim);
  7692. END;
  7693. Convert(reg,addressType);
  7694. ELSE
  7695. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7696. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7697. END;
  7698. openDim := dim;
  7699. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7700. IF backend.cooperative THEN
  7701. size := ToMemoryUnits(system,system.SizeOf(type));
  7702. WHILE type IS SyntaxTree.ArrayType DO
  7703. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7704. END;
  7705. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7706. IF (size # 1) THEN
  7707. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7708. END;
  7709. Emit(Push(position,reg));
  7710. size := ToMemoryUnits(system,system.SizeOf(type));
  7711. IF (size # 1) THEN
  7712. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7713. END;
  7714. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7715. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7716. Emit(Push(position,reg));
  7717. ReleaseIntermediateOperand(reg);
  7718. CallThis(position,"Runtime","New", 1);
  7719. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7720. Emit(Result(position, pointer));
  7721. exit := NewLabel();
  7722. else := NewLabel();
  7723. BreqL(else,pointer,nil);
  7724. IF ~type.hasPointers THEN
  7725. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7726. ELSIF type IS SyntaxTree.RecordType THEN
  7727. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7728. ELSIF type IS SyntaxTree.ProcedureType THEN
  7729. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7730. ELSE
  7731. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7732. END;
  7733. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7734. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7735. 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))));
  7736. IF type IS SyntaxTree.RecordType THEN
  7737. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7738. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7739. ELSE
  7740. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7741. END;
  7742. i := openDim;
  7743. WHILE i > 0 DO
  7744. DEC (i);
  7745. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7746. END;
  7747. needsTrace := p0.NeedsTrace();
  7748. IF needsTrace THEN ModifyAssignments(true) END;
  7749. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7750. Emit(Push(position, pointer));
  7751. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7752. Emit(Pop(position, pointer));
  7753. END;
  7754. Designate(p0,l);
  7755. IF needsTrace THEN
  7756. CallAssignPointer(l.op, pointer);
  7757. ModifyAssignments(false);
  7758. ELSE
  7759. ToMemory(l.op,addressType,0);
  7760. Emit(Mov(position,l.op,pointer));
  7761. END;
  7762. ReleaseIntermediateOperand(pointer);
  7763. ReleaseOperand(l);
  7764. BrL(exit);
  7765. SetLabel(else);
  7766. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7767. Designate(p0,l);
  7768. IF needsTrace THEN
  7769. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7770. ELSE
  7771. ToMemory(l.op,addressType,0);
  7772. Emit(Mov(position,l.op,pointer));
  7773. END;
  7774. ReleaseOperand(l);
  7775. SetLabel(exit);
  7776. ELSE
  7777. (*! the following code is only correct for "standard" Oberon calling convention *)
  7778. IF SemanticChecker.ContainsPointer(type) THEN
  7779. IF type IS SyntaxTree.ArrayType THEN
  7780. staticLength := 1;
  7781. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7782. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7783. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7784. END;
  7785. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7786. MulInt(reg,reg,tmp);
  7787. END;
  7788. Designate(p0,l);
  7789. IF openDim > 0 THEN
  7790. Emit(Push(position,l.op)); (* address for use after syscall *)
  7791. END;
  7792. Emit(Push(position,l.op)); (* address *)
  7793. ReleaseOperand(l);
  7794. tmp := TypeDescriptorAdr(type);
  7795. Emit(Push(position,tmp)); (* type descriptor *)
  7796. ReleaseIntermediateOperand(tmp);
  7797. Emit(Push(position,reg)); (* number Elements *)
  7798. ReleaseIntermediateOperand(reg);
  7799. tmp := IntermediateCode.Immediate(addressType,dim);
  7800. Emit(Push(position,tmp)); (* dimensions *)
  7801. (* push realtime flag *)
  7802. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7803. ELSE Emit(Push(position,false));
  7804. END;
  7805. CallThis(position,"Heaps","NewArr",5)
  7806. ELSE
  7807. size := ToMemoryUnits(system,system.SizeOf(type));
  7808. IF (size # 1) THEN
  7809. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7810. (*
  7811. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7812. *)
  7813. END;
  7814. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7815. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7816. AddInt(reg, reg, tmp);
  7817. (*
  7818. Emit(Add(position,reg,reg,tmp));
  7819. *)
  7820. Designate(p0,l);
  7821. IF openDim >0 THEN
  7822. Emit(Push(position,l.op)); (* address for use after syscall *)
  7823. END;
  7824. Emit(Push(position,l.op)); (* address for syscall *)
  7825. ReleaseOperand(l); (* pointer address *)
  7826. Emit(Push(position,reg)); (* size *)
  7827. ReleaseIntermediateOperand(reg);
  7828. (* push realtime flag *)
  7829. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7830. ELSE Emit(Push(position,false));
  7831. END;
  7832. CallThis(position,"Heaps","NewSys", 3)
  7833. END;
  7834. IF openDim > 0 THEN
  7835. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7836. Emit(Pop(position,adr));
  7837. ToMemory(adr,addressType,0);
  7838. ReuseCopy(tmp,adr);
  7839. ReleaseIntermediateOperand(adr);
  7840. adr := tmp;
  7841. else := NewLabel();
  7842. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7843. i := openDim-1;
  7844. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7845. WHILE (i >= 0) DO
  7846. Emit(Pop(position,reg));
  7847. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7848. Emit(Mov(position,res,reg));
  7849. DEC(i);
  7850. END;
  7851. ReleaseIntermediateOperand(adr);
  7852. ReleaseIntermediateOperand(reg);
  7853. exit := NewLabel();
  7854. BrL(exit);
  7855. SetLabel(else);
  7856. (* else part: array could not be allocated *)
  7857. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7858. Emit(Add(position,sp,sp,tmp));
  7859. SetLabel(exit);
  7860. END;
  7861. END;
  7862. END;
  7863. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7864. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7865. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7866. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7867. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7868. callingConvention := procedureType.callingConvention;
  7869. left.SetType(procedure.type);
  7870. formalParameter := procedureType.firstParameter;
  7871. (* push array to allocate *)
  7872. PushParameter(p0, formalParameter, callingConvention, FALSE, dummy,-1);
  7873. formalParameter :=formalParameter.nextParameter;
  7874. (* push length array *)
  7875. PushParameter(p1, formalParameter, callingConvention, FALSE, dummy,-1);
  7876. (* push size *)
  7877. type := t0;
  7878. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7879. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7880. END;
  7881. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.sizeType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7882. Emit(Push(position,tmp));
  7883. (* *)
  7884. IF SemanticChecker.ContainsPointer(type) THEN
  7885. tmp := TypeDescriptorAdr(type);
  7886. ELSE
  7887. tmp := IntermediateCode.Immediate(addressType, 0);
  7888. END;
  7889. Emit(Push(position,tmp)); (* type descriptor *)
  7890. StaticCallOperand(result,procedure);
  7891. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7892. ReleaseOperand(result);
  7893. END;
  7894. (*
  7895. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7896. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7897. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7898. *)
  7899. ELSE
  7900. (*
  7901. push len0
  7902. push len1
  7903. push len2
  7904. push size
  7905. push len_adr
  7906. push element_size
  7907. push tag
  7908. push adr
  7909. *)
  7910. dim := 0;
  7911. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7912. isTensor := TRUE;
  7913. ELSE
  7914. isTensor := FALSE;
  7915. END;
  7916. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7917. IF ~isTensor THEN
  7918. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7919. END;
  7920. parameter := x.parameters.GetExpression(i);
  7921. Evaluate(parameter,r);
  7922. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7923. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7924. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7925. END;
  7926. Emit(Push(position,r.op));
  7927. ReleaseOperand(r);
  7928. INC(dim);
  7929. END;
  7930. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7931. Emit(Mov(position, adr, sp));
  7932. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7933. Emit(Push(position, adr));
  7934. ReleaseIntermediateOperand(adr);
  7935. openDim := dim;
  7936. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7937. IF isTensor THEN
  7938. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7939. ELSE
  7940. baseType := SemanticChecker.ArrayBase(type,openDim);
  7941. END;
  7942. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7943. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7944. IF SemanticChecker.ContainsPointer(baseType) THEN
  7945. tmp := TypeDescriptorAdr(baseType);
  7946. ELSE
  7947. tmp := nil;
  7948. END;
  7949. Emit(Push(position,tmp)); (* type descriptor *)
  7950. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7951. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7952. ELSE (* error message has already been emited *)
  7953. RETURN;
  7954. END;
  7955. Designate(p0,l);
  7956. IF isTensor THEN
  7957. Emit(Push(position,l.op)); (* address *)
  7958. ELSE
  7959. Emit(Push(position,l.tag)); (* address *)
  7960. END;
  7961. ReleaseOperand(l);
  7962. StaticCallOperand(result,procedure);
  7963. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7964. ReleaseOperand(result);
  7965. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7966. Emit(Add(position,sp,sp,tmp));
  7967. END;
  7968. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7969. THEN
  7970. IF ~backend.cellsAreObjects THEN RETURN END;
  7971. IF InCellScope(currentScope) THEN
  7972. PushSelfPointer()
  7973. ELSE
  7974. Emit(Push(position, nil));
  7975. END;
  7976. (* push temp address *)
  7977. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7978. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7979. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7980. (* l.op contains address of pointer to record *)
  7981. Emit(Push(position,l.op)); (* address for use after syscall *)
  7982. ReleaseOperand(l);
  7983. (* push type descriptor *)
  7984. reg := TypeDescriptorAdr(baseType);
  7985. Emit(Push(position,reg));
  7986. ReleaseIntermediateOperand(reg);
  7987. (* push name *)
  7988. (*Global.GetSymbolName(p0, n);*)
  7989. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7990. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7991. ELSE
  7992. Global.GetModuleName(module.module, n);
  7993. END;
  7994. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  7995. (*type.typeDeclaration.GetName(n);*)
  7996. PushConstString(n);
  7997. (* push cellnet boolean *)
  7998. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7999. (* push engine boolean *)
  8000. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  8001. (* allocate *)
  8002. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  8003. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8004. (* l.op contains address of pointer to record *)
  8005. ToMemory(l.op,addressType,0);
  8006. (* l.op contains value of pointer to record *)
  8007. InitFields(baseType, l.op,0);
  8008. (* add capabilities *)
  8009. modifier := p0(SyntaxTree.Designator).modifiers;
  8010. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  8011. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  8012. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  8013. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  8014. END;
  8015. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  8016. (*
  8017. modifier := baseType(SyntaxTree.CellType).modifiers;
  8018. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  8019. modifier := p0(SyntaxTree.Designator).modifiers;
  8020. *)
  8021. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  8022. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8023. (* l.op contains address of pointer to record *)
  8024. ToMemory(l.op,addressType,0);
  8025. (* l.op contains value of pointer to record *)
  8026. Emit(Push(position,l.op)); (* address for use after syscall *)
  8027. ReleaseOperand(l);
  8028. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  8029. prevScope := currentScope;
  8030. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  8031. previous := section;
  8032. section := init;
  8033. (* add ports *)
  8034. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  8035. CloseInitializer(previous);
  8036. currentScope := prevScope;
  8037. Symbol(temporaryVariable,l);
  8038. ToMemory(l.op,addressType,0);
  8039. Emit(Push(position,l.op));
  8040. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  8041. (*
  8042. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  8043. IF constructor # NIL THEN
  8044. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8045. FOR i := 1 TO x.parameters.Length()-1 DO
  8046. p := x.parameters.GetExpression(i);
  8047. Global.GetSymbolName(parameter,name);
  8048. Evaluate(p, value);
  8049. ASSERT(value.type # NIL);
  8050. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  8051. par := instance.AddParameter(name);
  8052. par.SetInteger(value.integer);
  8053. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  8054. par := instance.AddParameter(name);
  8055. par.SetBoolean(value.boolean);
  8056. ELSE Error(x.position,NotYetImplemented)
  8057. END;
  8058. parameter := parameter.nextParameter
  8059. END;
  8060. END;
  8061. *)
  8062. (* call initializer *)
  8063. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  8064. IF constructor # NIL THEN
  8065. (*! should be unified with ProcedureCallDesignator *)
  8066. IF backend.cellsAreObjects THEN
  8067. Symbol(temporaryVariable,l);
  8068. ToMemory(l.op,addressType,0);
  8069. Emit(Push(position,l.op));
  8070. ReleaseOperand(l);
  8071. END;
  8072. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8073. FOR i := firstPar TO x.parameters.Length()-1 DO
  8074. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8075. formalParameter := formalParameter.nextParameter;
  8076. END;
  8077. (* static call of the constructor *)
  8078. Global.GetSymbolSegmentedName(constructor,name);
  8079. ASSERT(~constructor.isInline);
  8080. IF constructor.scope.ownerModule # module.module THEN
  8081. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8082. ELSE
  8083. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8084. END;
  8085. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  8086. (*ELSE
  8087. ReleaseIntermediateOperand(pointer);*)
  8088. END;
  8089. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8090. ToMemory(l.op, addressType, 0);
  8091. Designate(p0,s0);
  8092. ToMemory(s0.op,addressType,0);
  8093. Emit(Mov(position,s0.op,l.op));
  8094. ReleaseOperand(l);
  8095. ReleaseOperand(s0);
  8096. result.tag := emptyOperand;
  8097. (* start *)
  8098. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  8099. (* push cell *)
  8100. Symbol(temporaryVariable, l);
  8101. ToMemory(l.op,addressType,0);
  8102. Emit(Push(Basic.invalidPosition,l.op));
  8103. (* push delegate *)
  8104. Emit(Push(Basic.invalidPosition,l.op));
  8105. ReleaseOperand(l);
  8106. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  8107. Emit(Push(position, s1.op));
  8108. ReleaseOperand(s1);
  8109. CallThis(position,"ActiveCellsRuntime","Start",3);
  8110. END;
  8111. (*IF temporaryVariable # NIL THEN
  8112. end := NewLabel();
  8113. BrL(end);
  8114. SetLabel(exit);
  8115. Designate(p0,l);
  8116. ToMemory(l.op,addressType,0);
  8117. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  8118. ReleaseOperand(l);
  8119. SetLabel(end);
  8120. ELSE
  8121. SetLabel(exit);
  8122. END;
  8123. *)
  8124. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  8125. ELSE (* no pointer to record, no pointer to array *)
  8126. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  8127. (* ignore new statement *)
  8128. Warning(p0.position, "cannot run on final hardware");
  8129. ELSE
  8130. HALT(200);
  8131. END;
  8132. END;
  8133. (* ---- ADDRESSOF----- *)
  8134. |Global.systemAdr:
  8135. Designate(p0,s0);
  8136. s0.mode := ModeValue;
  8137. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  8138. ReleaseIntermediateOperand(s0.op);
  8139. s0.op := s0.tag;
  8140. IntermediateCode.InitOperand(s0.tag);
  8141. END;
  8142. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  8143. result := s0;
  8144. (* ---- BIT ----- *)
  8145. |Global.systemBit:
  8146. Evaluate(p0,s0);
  8147. ToMemory(s0.op,addressType,0);
  8148. ReuseCopy(res,s0.op);
  8149. ReleaseOperand(s0);
  8150. Evaluate(p1,s1);
  8151. Emit(Ror(position,res,res,s1.op));
  8152. ReleaseOperand(s1);
  8153. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8154. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  8155. IF ~conditional THEN
  8156. InitOperand(result,ModeValue); result.op := res;
  8157. ELSE
  8158. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8159. BrL(falseLabel);
  8160. ReleaseIntermediateOperand(res);
  8161. END;
  8162. (* --- MSK ----*)
  8163. |Global.systemMsk:
  8164. Evaluate(p0,s0);
  8165. Evaluate(p1,s1);
  8166. ReuseCopy(res,s0.op);
  8167. ReleaseOperand(s0);
  8168. Emit(And(position,res,res,s1.op));
  8169. ReleaseOperand(s1);
  8170. InitOperand(result,ModeValue);
  8171. result.op := res;
  8172. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8173. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8174. Evaluate(p0,s0);
  8175. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8176. ReleaseOperand(s0);
  8177. InitOperand(result,ModeValue);
  8178. result.op := res;
  8179. (* ---- SYSTEM.GetStackPointer ----- *)
  8180. |Global.systemGetStackPointer:
  8181. InitOperand(result,ModeValue);
  8182. result.op := sp;
  8183. (* ---- SYSTEM.GetFramePointer ----- *)
  8184. |Global.systemGetFramePointer:
  8185. InitOperand(result,ModeValue);
  8186. result.op := fp;
  8187. (* ---- SYSTEM.GetActivity ----- *)
  8188. |Global.systemGetActivity:
  8189. ASSERT(backend.cooperative);
  8190. InitOperand(result,ModeValue);
  8191. result.op := ap;
  8192. (* ---- SYSTEM.SetStackPointer ----- *)
  8193. |Global.systemSetStackPointer:
  8194. Evaluate(p0,s0); (* *)
  8195. Emit(Mov(position,sp,s0.op));
  8196. ReleaseOperand(s0);
  8197. (* ---- SYSTEM.SetFramePointer ----- *)
  8198. |Global.systemSetFramePointer:
  8199. Evaluate(p0,s0); (* *)
  8200. Emit(Mov(position,fp,s0.op));
  8201. ReleaseOperand(s0);
  8202. (* ---- SYSTEM.Activity ----- *)
  8203. |Global.systemSetActivity:
  8204. ASSERT(backend.cooperative);
  8205. Evaluate(p0,s0); (* *)
  8206. Emit(Mov(position,ap,s0.op));
  8207. ReleaseOperand(s0);
  8208. (* ---- SYSTEM.VAL ----- *)
  8209. |Global.systemVal:
  8210. Expression(p1);
  8211. s1 := result;
  8212. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8213. IF s1.mode = ModeReference THEN
  8214. (* nothing to be done if not record type, just take over new type *)
  8215. IF (type IS SyntaxTree.RecordType) THEN
  8216. ReleaseIntermediateOperand(s1.tag);
  8217. s1.tag := TypeDescriptorAdr(type);
  8218. UseIntermediateOperand(s1.tag);
  8219. END;
  8220. result := s1;
  8221. ELSE (* copy over result to different type, may not use convert *)
  8222. itype := IntermediateCode.GetType(system,type);
  8223. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8224. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8225. Emit(Mov(position,s0.op,s1.op));
  8226. ReleaseOperand(s1);
  8227. InitOperand(result,ModeValue);
  8228. result.op := s0.op;
  8229. ELSE (* different size, must convert *)
  8230. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8231. Convert(s1.op, IntermediateCode.GetType(system,type));
  8232. result := s1;
  8233. END;
  8234. END;
  8235. (* ---- SYSTEM.GET ----- *)
  8236. |Global.systemGet:
  8237. Evaluate(p0,s0); (* adr *)
  8238. Designate(p1,s1); (* variable *)
  8239. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8240. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8241. Emit(Mov(position,s1.op,s0.op));
  8242. ReleaseOperand(s1);
  8243. ReleaseOperand(s0);
  8244. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8245. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8246. Evaluate(p0,s0); (* *)
  8247. Evaluate(p1,s1); (* variable *)
  8248. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8249. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8250. (* real part *)
  8251. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8252. Emit(Mov(position,res, s1.op));
  8253. ReleaseIntermediateOperand(res);
  8254. (* imaginary part *)
  8255. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8256. Emit(Mov(position,res, s1.tag));
  8257. ReleaseIntermediateOperand(res);
  8258. ReleaseOperand(s1);
  8259. ReleaseOperand(s0);
  8260. ELSE
  8261. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8262. ReleaseOperand(s0);
  8263. Emit(Mov(position,res,s1.op));
  8264. ReleaseIntermediateOperand(res);
  8265. ReleaseOperand(s1);
  8266. END;
  8267. (* ---- SYSTEM.MOVE ----- *)
  8268. |Global.systemMove:
  8269. Evaluate(p0,s0);
  8270. Evaluate(p1,s1);
  8271. Evaluate(p2,s2);
  8272. Emit(Copy(position,s1.op,s0.op,s2.op));
  8273. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8274. (* ---- SYSTEM.NEW ----- *)
  8275. |Global.systemNew:
  8276. Designate(p0,s0);
  8277. Emit(Push(position,s0.op));
  8278. ReleaseOperand(s0);
  8279. Evaluate(p1,s1);
  8280. Emit(Push(position,s1.op));
  8281. ReleaseOperand(s1);
  8282. (* push realtime flag: false by default *)
  8283. Emit(Push(position,false));
  8284. CallThis(position,"Heaps","NewSys",3);
  8285. (* ---- SYSTEM.CALL ----- *)
  8286. |Global.systemRef:
  8287. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8288. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8289. s0.mode := ModeValue;
  8290. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8291. result := s0
  8292. (* ---- INCR ----- *)
  8293. |Global.Incr:
  8294. Designate(p0,operand);
  8295. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8296. Dereference(operand,p0.type.resolved,FALSE);
  8297. END;
  8298. ASSERT(p1 # NIL);
  8299. Evaluate(p1,l);
  8300. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8301. ReleaseOperand(operand); ReleaseOperand(l);
  8302. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8303. (* ---- SUM ----- *)
  8304. |Global.Sum: HALT(200);
  8305. (* ---- ALL ----- *)
  8306. |Global.All: HALT(200);
  8307. (* ---- CAS ----- *)
  8308. |Global.Cas:
  8309. needsTrace := p0.NeedsTrace();
  8310. IF needsTrace THEN ModifyAssignments(true) END;
  8311. Designate(p0,s0);
  8312. Evaluate(p1,s1);
  8313. Evaluate(p2,s2);
  8314. IF needsTrace THEN
  8315. Emit(Push(position, s0.op));
  8316. Emit(Push(position, s1.op));
  8317. Emit(Push(position, s2.op));
  8318. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8319. ELSE
  8320. Emit(Cas(position,s0.op,s1.op,s2.op));
  8321. END;
  8322. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8323. IF needsTrace THEN ModifyAssignments(false) END;
  8324. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8325. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  8326. IF conditional THEN
  8327. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8328. BrL(falseLabel);
  8329. ReleaseIntermediateOperand(res);
  8330. END;
  8331. (* ---- DIM ----- *)
  8332. |Global.Dim:
  8333. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8334. Designate(p0,s0);
  8335. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8336. Dereference(s0,p0.type.resolved,FALSE);
  8337. END;
  8338. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8339. ReleaseOperand(s0);
  8340. (* ---- RESHAPE ----- *)
  8341. |Global.Reshape:
  8342. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8343. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8344. left.SetType(procedure.type);
  8345. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8346. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8347. END;
  8348. (* ---- SYSTEM.TYPECODE ----- *)
  8349. |Global.systemTypeCode:
  8350. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8351. IF type.resolved IS SyntaxTree.PointerType THEN
  8352. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8353. END;
  8354. result.op := TypeDescriptorAdr(type);
  8355. Convert(result.op, IntermediateCode.GetType(system,x.type));
  8356. result.mode := ModeValue;
  8357. (* ---- SYSTEM.TRACE ----- *)
  8358. |Global.systemTrace:
  8359. SystemTrace(x.parameters, x.position);
  8360. (* ----- CONNECT ------*)
  8361. |Global.Connect:
  8362. IF backend.cellsAreObjects THEN
  8363. PushPort(p0);
  8364. PushPort(p1);
  8365. IF p2 # NIL THEN
  8366. Evaluate(p2, s2);
  8367. Emit(Push(p2.position, s2.op));
  8368. ReleaseOperand(s2);
  8369. ELSE
  8370. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8371. END;
  8372. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8373. ELSE
  8374. Warning(x.position, "cannot run on final hardware");
  8375. END;
  8376. (* ----- DELEGATE ------*)
  8377. |Global.Delegate:
  8378. IF backend.cellsAreObjects THEN
  8379. PushPort(p0);
  8380. PushPort(p1);
  8381. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8382. ELSE
  8383. Warning(x.position, "cannot run on final hardware");
  8384. END;
  8385. (* ----- SEND ------*)
  8386. |Global.Send:
  8387. Evaluate(p0,s0);
  8388. Evaluate(p1,s1);
  8389. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8390. Emit(Push(position,s0.op));
  8391. Emit(Push(position,s1.op));
  8392. (*
  8393. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8394. *)
  8395. IF ~backend.cellsAreObjects THEN
  8396. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8397. END;
  8398. ReleaseOperand(s0);
  8399. ReleaseOperand(s1);
  8400. IF backend.cellsAreObjects THEN
  8401. CallThis(position,"ActiveCellsRuntime","Send",2);
  8402. ELSE
  8403. CallThis(position,ChannelModuleName,"Send",2);
  8404. END;
  8405. (* ----- RECEIVE ------*)
  8406. |Global.Receive:
  8407. Evaluate(p0,s0);
  8408. Emit(Push(position,s0.op));
  8409. Designate(p1,s1);
  8410. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8411. Emit(Push(position,s1.op));
  8412. IF p2 # NIL THEN
  8413. Designate(p2,s2);
  8414. Emit(Push(position,s2.op));
  8415. END;
  8416. (*
  8417. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8418. *)
  8419. IF ~backend.cellsAreObjects THEN
  8420. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8421. END;
  8422. ReleaseOperand(s0);
  8423. ReleaseOperand(s1);
  8424. ReleaseOperand(s2);
  8425. IF backend.cellsAreObjects THEN
  8426. IF p2 = NIL THEN
  8427. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8428. ELSE
  8429. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8430. END;
  8431. ELSE
  8432. IF p2 = NIL THEN
  8433. CallThis(position,ChannelModuleName,"Receive",2)
  8434. ELSE
  8435. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8436. END;
  8437. END;
  8438. | Global.systemSpecial:
  8439. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8440. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8441. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8442. (* determine if parameters are of the VAR kind *)
  8443. ASSERT(x.parameters.Length() <= 3);
  8444. formalParameter := procedureType.firstParameter;
  8445. FOR i := 0 TO x.parameters.Length() - 1 DO
  8446. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8447. formalParameter := formalParameter.nextParameter
  8448. END;
  8449. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8450. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8451. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8452. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8453. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8454. IF procedureType.returnType # NIL THEN
  8455. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8456. Emit(Result(position, res));
  8457. (*InitOperand(result,ModeValue);
  8458. result.op := res;
  8459. *)
  8460. IF ~conditional THEN
  8461. InitOperand(result,ModeValue); result.op := res;
  8462. ELSE
  8463. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8464. BrL(falseLabel);
  8465. ReleaseIntermediateOperand(res);
  8466. END;
  8467. END
  8468. ELSE (* function not yet implemented *)
  8469. Error(position,"not yet implemented");
  8470. END;
  8471. destination := dest;
  8472. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8473. END VisitBuiltinCallDesignator;
  8474. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  8475. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8476. BEGIN
  8477. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8478. dest := destination; destination := emptyOperand;
  8479. Expression(x.left);
  8480. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8481. ELSIF isUnchecked THEN (* no check *)
  8482. ELSE
  8483. trueL := NewLabel();
  8484. falseL := NewLabel();
  8485. IF IsPointerToRecord(x.left.type,recordType) THEN
  8486. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8487. Emit(Mov(position,tag, result.op));
  8488. IF result.mode # ModeValue THEN
  8489. ptr := tag;
  8490. IntermediateCode.MakeMemory(ptr,addressType);
  8491. Emit(Mov(position,tag, ptr));
  8492. END;
  8493. IF ~backend.cooperative THEN
  8494. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8495. END;
  8496. IntermediateCode.MakeMemory(tag,addressType);
  8497. ELSE
  8498. tag := result.tag;
  8499. UseIntermediateOperand(tag);
  8500. END;
  8501. TypeTest(tag,x.type,trueL,falseL);
  8502. ReleaseIntermediateOperand(tag);
  8503. SetLabel(falseL);
  8504. EmitTrap(position,TypeCheckTrap);
  8505. SetLabel(trueL);
  8506. END;
  8507. destination := dest;
  8508. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8509. END VisitTypeGuardDesignator;
  8510. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8511. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8512. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8513. VAR label: Label; pc: LONGINT;
  8514. BEGIN
  8515. IF backend.cooperative & ~isUnchecked THEN
  8516. pc := section.pc;
  8517. label := NewLabel();
  8518. BrneL(label, operand.op, nil);
  8519. EmitTrap(position, NilPointerTrap);
  8520. SetLabel(label);
  8521. INC(statCoopNilCheck, section.pc - pc);
  8522. END;
  8523. END NilCheck;
  8524. BEGIN
  8525. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8526. ReuseCopy(dereferenced,operand.op);
  8527. ReleaseOperand(operand);
  8528. operand.mode := ModeReference;
  8529. operand.op := dereferenced;
  8530. operand.tag := dereferenced;
  8531. UseIntermediateOperand(operand.tag);
  8532. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8533. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8534. ReleaseIntermediateOperand(operand.tag);
  8535. operand.tag := TypeDescriptorAdr(type);
  8536. ELSE
  8537. IF ~backend.cooperative THEN
  8538. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8539. END;
  8540. IntermediateCode.MakeMemory(operand.tag,addressType);
  8541. END;
  8542. NilCheck(operand.op);
  8543. ELSIF type IS SyntaxTree.ArrayType THEN
  8544. IF isUnsafe THEN
  8545. NilCheck(operand.op);
  8546. ReleaseIntermediateOperand(operand.tag);
  8547. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8548. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8549. ELSE
  8550. operand.tag := emptyOperand;
  8551. END;
  8552. ELSE
  8553. NilCheck(operand.op);
  8554. IF backend.cooperative THEN
  8555. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8556. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8557. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8558. ELSE
  8559. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8560. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8561. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8562. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8563. END;
  8564. END;
  8565. ELSIF type IS SyntaxTree.MathArrayType THEN
  8566. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8567. IntermediateCode.MakeMemory(operand.op,addressType);
  8568. ELSE HALT(100);
  8569. END;
  8570. END Dereference;
  8571. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  8572. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8573. BEGIN
  8574. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8575. dest := destination; destination := emptyOperand;
  8576. Evaluate(x.left,d);
  8577. type := x.type.resolved;
  8578. prevIsUnchecked := isUnchecked;
  8579. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8580. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8581. END;
  8582. Dereference(d,type,IsUnsafePointer(x.left.type));
  8583. isUnchecked := prevIsUnchecked;
  8584. result := d;
  8585. 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
  8586. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8587. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8588. END;
  8589. END;
  8590. destination := dest;
  8591. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8592. END VisitDereferenceDesignator;
  8593. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  8594. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8595. BEGIN
  8596. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8597. dest := destination; destination := emptyOperand;
  8598. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8599. tag := result.op;
  8600. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8601. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8602. StaticCallOperand(result,procedure.super);
  8603. ReleaseIntermediateOperand(result.tag);
  8604. UseIntermediateOperand(tag); (* necessary ? *)
  8605. result.tag := tag;
  8606. destination := dest;
  8607. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8608. END VisitSupercallDesignator;
  8609. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  8610. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8611. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8612. name: Basic.SegmentedName;
  8613. procedure: SyntaxTree.Procedure;
  8614. procedureType: SyntaxTree.ProcedureType;
  8615. BEGIN
  8616. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8617. dest := destination; destination := emptyOperand;
  8618. scope := currentScope;
  8619. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8620. scope := scope.outerScope;
  8621. END;
  8622. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8623. moduleSection := meta.ModuleSection();
  8624. IF backend.cooperative THEN
  8625. moduleOffset := 0;
  8626. ELSE
  8627. moduleOffset := moduleSection.pc;
  8628. END;
  8629. result.mode := ModeValue;
  8630. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8631. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8632. result.mode := ModeValue;
  8633. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8634. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8635. ELSE
  8636. GetBaseRegister(basereg,currentScope,scope);
  8637. InitOperand(result,ModeReference);
  8638. result.op := basereg;
  8639. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8640. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8641. parametersSize := ProcParametersSize(procedure);
  8642. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8643. IF backend.cooperative THEN
  8644. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8645. END;
  8646. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8647. MakeMemory(result.op, result.op, addressType, 0);
  8648. END;
  8649. (* tag must be loaded when dereferencing SELF pointer *)
  8650. END;
  8651. destination := dest;
  8652. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8653. END VisitSelfDesignator;
  8654. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  8655. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8656. BEGIN
  8657. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8658. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8659. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8660. parameter := procedureType.returnParameter;
  8661. IF currentIsInline THEN
  8662. map := currentMapper.Get(NIL);
  8663. IF map # NIL THEN
  8664. Designate(map.to, result);
  8665. ELSE
  8666. HALT(200);
  8667. END;
  8668. RETURN;
  8669. END;
  8670. VisitParameter(parameter);
  8671. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8672. END VisitResultDesignator;
  8673. (** values *)
  8674. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  8675. BEGIN
  8676. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8677. IF conditional THEN
  8678. IF x.value THEN BrL(trueLabel)
  8679. ELSE BrL(falseLabel)
  8680. END;
  8681. ELSE
  8682. InitOperand(result,ModeValue);
  8683. IF x.value THEN result.op := true ELSE result.op := false END;
  8684. END;
  8685. END VisitBooleanValue;
  8686. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8687. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8688. BEGIN
  8689. Global.GetModuleSegmentedName(module.module, name);
  8690. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8691. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8692. RETURN section
  8693. END GetDataSection;
  8694. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8695. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8696. BEGIN
  8697. type := vop.type;
  8698. data := GetDataSection();
  8699. pc := EnterImmediate(data,vop);
  8700. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8701. IntermediateCode.MakeMemory(vop, type);
  8702. END GetImmediateMem;
  8703. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  8704. BEGIN
  8705. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8706. InitOperand(result,ModeValue);
  8707. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8708. IF ~supportedImmediate(result.op) &~inData THEN
  8709. GetImmediateMem(result.op)
  8710. END;
  8711. END VisitIntegerValue;
  8712. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  8713. BEGIN
  8714. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8715. InitOperand(result,ModeValue);
  8716. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8717. END VisitCharacterValue;
  8718. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  8719. BEGIN
  8720. IF Trace THEN TraceEnter("VisitSetValue") END;
  8721. InitOperand(result,ModeValue);
  8722. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  8723. END VisitSetValue;
  8724. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  8725. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8726. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8727. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8728. BEGIN
  8729. numberElements := x.elements.Length();
  8730. FOR i := 0 TO numberElements-1 DO
  8731. expression := x.elements.GetExpression(i);
  8732. IF expression IS SyntaxTree.MathArrayExpression THEN
  8733. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8734. ELSE
  8735. inData := TRUE;
  8736. Evaluate(expression,op);
  8737. irv.Emit(Data(position,op.op));
  8738. inData := FALSE;
  8739. ReleaseOperand(op);
  8740. END;
  8741. END;
  8742. END RecursiveData;
  8743. BEGIN
  8744. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8745. IF ~TryConstantDeclaration() THEN
  8746. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8747. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8748. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8749. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8750. ELSE
  8751. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8752. END;
  8753. RecursiveData(x.array);
  8754. InitOperand(result,ModeReference);
  8755. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8756. END
  8757. END VisitMathArrayValue;
  8758. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8759. VAR constant: Sections.Section;
  8760. BEGIN
  8761. IF constantDeclaration = NIL THEN
  8762. RETURN FALSE
  8763. ELSE
  8764. (* Is a constant in this module: did we generate it already? *)
  8765. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8766. IF constant # NIL THEN
  8767. InitOperand(result,ModeReference);
  8768. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8769. RETURN TRUE;
  8770. END;
  8771. END;
  8772. RETURN FALSE
  8773. END TryConstantDeclaration;
  8774. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  8775. BEGIN
  8776. constantDeclaration := x;
  8777. x.value.resolved.Accept(SELF);
  8778. END VisitConstant;
  8779. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  8780. BEGIN
  8781. IF Trace THEN TraceEnter("VisitRealValue") END;
  8782. InitOperand(result,ModeValue);
  8783. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8784. END VisitRealValue;
  8785. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  8786. VAR
  8787. componentType: SyntaxTree.Type;
  8788. BEGIN
  8789. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8790. ASSERT(x.type IS SyntaxTree.ComplexType);
  8791. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8792. InitOperand(result,ModeValue);
  8793. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8794. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8795. END VisitComplexValue;
  8796. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  8797. VAR i: LONGINT; name: Basic.SegmentedName;
  8798. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8799. BEGIN
  8800. IF Trace THEN TraceEnter("VisitStringValue") END;
  8801. IF ~TryConstantDeclaration() THEN
  8802. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8803. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8804. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8805. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8806. ELSE
  8807. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8808. END;
  8809. FOR i := 0 TO x.length-1 DO
  8810. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8811. irv.Emit(Data(position,op));
  8812. END;
  8813. InitOperand(result,ModeReference);
  8814. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8815. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8816. END
  8817. END VisitStringValue;
  8818. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  8819. BEGIN
  8820. IF Trace THEN TraceEnter("VisitNilValue") END;
  8821. InitOperand(result,ModeValue);
  8822. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8823. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8824. END VisitNilValue;
  8825. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  8826. BEGIN
  8827. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8828. InitOperand(result,ModeValue);
  8829. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8830. END VisitEnumerationValue;
  8831. (** symbols *)
  8832. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  8833. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8834. END VisitImport;
  8835. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8836. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8837. BEGIN
  8838. IF scope # baseScope THEN
  8839. (* left := [fp+8] *)
  8840. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8841. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8842. ReuseCopy(left,right);
  8843. ReleaseIntermediateOperand(right);
  8844. scope := scope.outerScope; DEC(level);
  8845. (* { left := [left+8] } *)
  8846. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8847. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8848. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8849. Emit(Mov(position,left,right));
  8850. scope := scope.outerScope; DEC(level);
  8851. END;
  8852. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8853. result := left;
  8854. ELSE
  8855. result := fp;
  8856. END;
  8857. END GetBaseRegister;
  8858. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  8859. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8860. BEGIN
  8861. IF Trace THEN TraceEnter("VisitVariable"); END;
  8862. type := x.type.resolved;
  8863. IF (x.useRegister) THEN
  8864. InitOperand(result, ModeValue);
  8865. IF x.registerNumber < 0 THEN
  8866. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8867. reg := x.registerNumber;
  8868. ELSE
  8869. reg := registerUsageCount.Map(x.registerNumber);
  8870. UseRegister(reg);
  8871. END;
  8872. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8873. ELSIF x.externalName # NIL THEN
  8874. InitOperand(result,ModeReference);
  8875. Basic.ToSegmentedName(x.externalName^, name);
  8876. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8877. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8878. InitOperand(result,ModeReference);
  8879. GetBaseRegister(result.op,currentScope,x.scope);
  8880. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8881. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8882. InitOperand(result,ModeReference);
  8883. GetCodeSectionNameForSymbol(x,name);
  8884. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8885. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8886. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8887. InitOperand(result,ModeReference);
  8888. GetCodeSectionNameForSymbol(x,name);
  8889. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8890. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8891. ELSE (* field, left designator must have been emitted *)
  8892. ASSERT(result.mode = ModeReference);
  8893. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8894. ReuseCopy(temp,result.op);
  8895. ReleaseIntermediateOperand(result.op);
  8896. result.op := temp;
  8897. END;
  8898. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8899. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8900. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8901. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8902. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8903. END;
  8904. END;
  8905. END;
  8906. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8907. ValueToCondition(result);
  8908. ELSIF type IS SyntaxTree.ProcedureType THEN
  8909. ReleaseIntermediateOperand(result.tag);
  8910. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8911. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8912. UseIntermediateOperand(result.tag);
  8913. ELSE
  8914. result.tag := nil; (* nil *)
  8915. END;
  8916. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8917. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8918. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8919. ReleaseIntermediateOperand(result.tag);
  8920. Global.GetSymbolSegmentedName(x,name);
  8921. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8922. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8923. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8924. ELSE
  8925. END;
  8926. ELSE
  8927. ReleaseIntermediateOperand(result.tag);
  8928. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8929. END;
  8930. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8931. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8932. ReleaseIntermediateOperand(result.tag);
  8933. result.tag := result.op;
  8934. UseIntermediateOperand(result.tag);
  8935. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8936. IntermediateCode.MakeMemory(result.op,addressType);
  8937. END;
  8938. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8939. ReleaseIntermediateOperand(result.tag);
  8940. result.tag := TypeDescriptorAdr(type);
  8941. UseIntermediateOperand(result.tag);
  8942. (* tag for pointer type computed not here but during dereferencing *)
  8943. END;
  8944. IF Trace THEN TraceExit("VisitVariable") END;
  8945. END VisitVariable;
  8946. PROCEDURE VisitProperty*(property: SyntaxTree.Property);
  8947. BEGIN
  8948. VisitVariable(property);
  8949. END VisitProperty;
  8950. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  8951. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8952. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT; temp: IntermediateCode.Operand;
  8953. BEGIN
  8954. type := x.type.resolved;
  8955. IF Trace THEN TraceEnter("VisitParameter") END;
  8956. IF x.ownerType IS SyntaxTree.CellType THEN
  8957. ptype := x.type.resolved;
  8958. IF backend.cellsAreObjects THEN
  8959. ASSERT(result.mode = ModeReference);
  8960. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8961. ReuseCopy(temp,result.op);
  8962. ReleaseIntermediateOperand(result.op);
  8963. result.op := temp;
  8964. END;
  8965. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8966. RETURN;
  8967. ELSE
  8968. InitOperand(result,ModeReference);
  8969. GetCodeSectionNameForSymbol(x,name);
  8970. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8971. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8972. RETURN;
  8973. END;
  8974. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8975. InitOperand(result,ModeReference);
  8976. GetCodeSectionNameForSymbol(x,name);
  8977. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8978. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8979. RETURN
  8980. ELSE
  8981. GetBaseRegister(basereg,currentScope,x.scope);
  8982. InitOperand(result,ModeReference);
  8983. result.op := basereg;
  8984. END;
  8985. IF IsOpenArray(type) THEN
  8986. result.tag := basereg;
  8987. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8988. IntermediateCode.MakeMemory(result.op,addressType);
  8989. IF Global.IsOberonProcedure(x.ownerType) THEN
  8990. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8991. UseIntermediateOperand(result.tag);
  8992. ELSE
  8993. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8994. END;
  8995. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8996. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8997. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8998. ELSIF IsStaticArray(type) THEN
  8999. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9000. IntermediateCode.MakeMemory(result.op,addressType);
  9001. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9002. ELSIF type IS SyntaxTree.MathArrayType THEN
  9003. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9004. WITH type: SyntaxTree.MathArrayType DO
  9005. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9006. IF type.form = SyntaxTree.Tensor THEN
  9007. ELSIF type.form = SyntaxTree.Open THEN
  9008. result.tag := result.op;
  9009. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9010. IntermediateCode.MakeMemory(result.op,addressType);
  9011. UseIntermediateOperand(result.tag);
  9012. ELSIF type.form = SyntaxTree.Static THEN
  9013. IF x.kind = SyntaxTree.ConstParameter THEN
  9014. IntermediateCode.MakeMemory(result.op,addressType);
  9015. END;
  9016. ELSE HALT(100)
  9017. END;
  9018. ELSIF x.kind = SyntaxTree.VarParameter THEN
  9019. IF type.form = SyntaxTree.Tensor THEN
  9020. ToMemory(result.op,addressType,0);
  9021. ELSIF type.form = SyntaxTree.Open THEN
  9022. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  9023. ReuseCopy(result.tag, mem);
  9024. ReleaseIntermediateOperand(mem);
  9025. ReleaseIntermediateOperand(result.op);
  9026. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9027. ELSIF type.form = SyntaxTree.Static THEN
  9028. IntermediateCode.MakeMemory(result.op,addressType);
  9029. ELSE HALT(100)
  9030. END;
  9031. ELSE HALT(100)
  9032. END;
  9033. END;
  9034. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  9035. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9036. IntermediateCode.MakeMemory(result.op,addressType);
  9037. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9038. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9039. END;
  9040. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  9041. ValueToCondition(result);
  9042. ELSIF type IS SyntaxTree.ProcedureType THEN
  9043. ReleaseIntermediateOperand(result.tag);
  9044. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  9045. IF x.kind = SyntaxTree.VarParameter THEN
  9046. ReuseCopy(result.tag,result.op);
  9047. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  9048. IntermediateCode.MakeMemory(result.tag,addressType);
  9049. ELSE
  9050. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9051. UseIntermediateOperand(result.tag);
  9052. END;
  9053. ELSE
  9054. result.tag := nil;
  9055. END;
  9056. (* tag for pointer type computed not here but during dereferencing *)
  9057. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  9058. ReleaseIntermediateOperand(result.tag);
  9059. result.tag := basereg;
  9060. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  9061. IntermediateCode.MakeMemory(result.tag,addressType);
  9062. UseIntermediateOperand(result.tag);
  9063. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  9064. ReleaseIntermediateOperand(result.tag);
  9065. result.tag := TypeDescriptorAdr(type);
  9066. UseIntermediateOperand(result.tag);
  9067. END;
  9068. IF Trace THEN TraceExit("VisitParameter") END;
  9069. END VisitParameter;
  9070. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9071. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  9072. BEGIN
  9073. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  9074. (* left.p: left already emitted *)
  9075. tag := result.op; (* value of pointer to left *)
  9076. (* get type desc *)
  9077. tmp := result.tag;
  9078. IntermediateCode.MakeMemory(tmp,addressType);
  9079. (* get method adr *)
  9080. Reuse1(reg,tmp);
  9081. ReleaseIntermediateOperand(tmp);
  9082. IF backend.cooperative THEN
  9083. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9084. WHILE recordType.baseType # NIL DO
  9085. recordType := recordType.GetBaseRecord ();
  9086. END;
  9087. GetRecordTypeName (recordType,name);
  9088. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  9089. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  9090. offset := 0;
  9091. ELSE
  9092. offset := 2;
  9093. END;
  9094. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  9095. ELSIF meta.simple THEN
  9096. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber)))));
  9097. ELSE
  9098. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  9099. END;
  9100. InitOperand(operand,ModeReference);
  9101. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  9102. operand.op := reg;
  9103. operand.tag := tag;
  9104. IF Trace THEN TraceExit("DynamicCallOperand") END;
  9105. END DynamicCallOperand;
  9106. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9107. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  9108. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  9109. BEGIN
  9110. IF Trace THEN TraceEnter("StaticCallOperand") END;
  9111. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  9112. tag := operand.op;
  9113. ReleaseIntermediateOperand(operand.tag);
  9114. ELSE tag := nil
  9115. END;
  9116. IF x.isInline THEN
  9117. sectionType := Sections.InlineCodeSection;
  9118. ELSE
  9119. sectionType := Sections.CodeSection;
  9120. END;
  9121. IF x.externalName # NIL THEN
  9122. Basic.ToSegmentedName(x.externalName^, name);
  9123. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  9124. ELSE
  9125. GetCodeSectionNameForSymbol(x, name);
  9126. IF (x.scope.ownerModule = module.module) THEN
  9127. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9128. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  9129. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9130. IF source.pc = 0 THEN (* no code yet *)
  9131. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  9132. END;
  9133. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  9134. bits := x.procedureScope.body.code.inlineCode;
  9135. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  9136. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  9137. binary.CopyBits(bits, 0, bits.GetSize());
  9138. source.SetResolved(binary);
  9139. ELSE
  9140. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  9141. END;
  9142. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  9143. END;
  9144. InitOperand(operand,ModeValue);
  9145. operand.op := reg;
  9146. operand.tag := tag;
  9147. IF Trace THEN TraceExit("StaticCallOperand") END;
  9148. END StaticCallOperand;
  9149. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  9150. (* handle expressions of the form designator.procedure or procedure *)
  9151. BEGIN
  9152. IF Trace THEN TraceEnter("VisitProcedure") END;
  9153. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  9154. DynamicCallOperand(result,x);
  9155. ELSIF x.isInline THEN
  9156. StaticCallOperand(result,x);
  9157. ELSE
  9158. StaticCallOperand(result,x);
  9159. END;
  9160. IF Trace THEN TraceExit("VisitProcedure") END;
  9161. END VisitProcedure;
  9162. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  9163. BEGIN
  9164. VisitProcedure(x);
  9165. END VisitOperator;
  9166. (** statements *)
  9167. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  9168. BEGIN
  9169. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  9170. Expression(x.call);
  9171. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  9172. ReleaseOperand(result)
  9173. END;
  9174. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  9175. END VisitProcedureCallStatement;
  9176. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  9177. VAR leftType, rightType: SyntaxTree.MathArrayType;
  9178. leftBase, rightBase: SyntaxTree.Type;
  9179. procedureName,s: SyntaxTree.IdentifierString;
  9180. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  9181. size: LONGINT; rightKind: LONGINT;
  9182. dummy: IntermediateCode.Operand;
  9183. CONST moduleName = "FoxArrayBase";
  9184. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  9185. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  9186. BEGIN
  9187. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  9188. IF base IS SyntaxTree.MathArrayType THEN
  9189. base := OpenArray(base(SyntaxTree.MathArrayType));
  9190. END;
  9191. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  9192. result.SetArrayBase(base);
  9193. RETURN result
  9194. END OpenArray;
  9195. BEGIN
  9196. IF AddImport(moduleName,arrayBase,TRUE) THEN
  9197. SaveRegisters();ReleaseUsedRegisters(saved);
  9198. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  9199. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  9200. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  9201. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  9202. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  9203. IF leftType.form = SyntaxTree.Tensor THEN
  9204. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  9205. ELSIF leftType.form = SyntaxTree.Open THEN
  9206. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  9207. ELSIF leftType.form = SyntaxTree.Static THEN
  9208. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  9209. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  9210. END;
  9211. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  9212. IF procedure = NIL THEN
  9213. s := "Instruction not supported on target, emulation procedure ";
  9214. Strings.Append(s,moduleName);
  9215. Strings.Append(s,".");
  9216. Strings.Append(s,procedureName);
  9217. Strings.Append(s," not present");
  9218. Error(position,s);
  9219. ELSE
  9220. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  9221. parameter.SetType(leftType);
  9222. parameter.SetAccess(SyntaxTree.Internal);
  9223. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9224. parameter.SetKind(rightKind);
  9225. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9226. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  9227. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  9228. StaticCallOperand(result,procedure);
  9229. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  9230. ReleaseOperand(result);
  9231. END;
  9232. RestoreRegisters(saved);
  9233. END;
  9234. END AssignMathArray;
  9235. VAR modifyAssignmentCounter := 0: LONGINT;
  9236. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  9237. VAR processor,mem,dst: IntermediateCode.Operand;
  9238. BEGIN
  9239. IF value.intValue = true.intValue THEN
  9240. INC(modifyAssignmentCounter);
  9241. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  9242. modifyAssignmentsPC := section.pc;
  9243. ELSE
  9244. DEC(modifyAssignmentCounter);
  9245. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  9246. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  9247. END;
  9248. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  9249. dst := NewRegisterOperand (addressType);
  9250. Emit(Mov(position,dst, processor));
  9251. IntermediateCode.InitMemory(mem,bool, dst, 0);
  9252. Emit(Mov(position,mem, value));
  9253. ReleaseIntermediateOperand(dst);
  9254. END ModifyAssignments;
  9255. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9256. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9257. BEGIN
  9258. type := left.type.resolved;
  9259. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9260. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9261. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9262. IF procedureType.returnParameter = parameter THEN
  9263. (* this is the only case where the destination can be dynamically smaller than the source
  9264. in all other cases the dynamic size has to be taken
  9265. *)
  9266. IF backend.cooperative THEN
  9267. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  9268. ELSE
  9269. MakeMemory(mem, tag, addressType, 0);
  9270. END;
  9271. RETURN mem;
  9272. END;
  9273. END;
  9274. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9275. END CopySize;
  9276. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9277. VAR
  9278. leftO, rightO: Operand;
  9279. arg,mem, sizeOp: IntermediateCode.Operand;
  9280. leftType, rightType, componentType, base: SyntaxTree.Type;
  9281. size: LONGINT;
  9282. parameters: SyntaxTree.ExpressionList;
  9283. procedure: SyntaxTree.Procedure;
  9284. call: SyntaxTree.ProcedureCallDesignator;
  9285. designator: SyntaxTree.Designator;
  9286. saved: RegisterEntry;
  9287. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9288. VAR procedureType: SyntaxTree.ProcedureType;
  9289. BEGIN
  9290. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9291. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9292. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9293. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9294. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9295. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9296. IF right.id = Global.Reshape THEN RETURN TRUE
  9297. END;
  9298. END;
  9299. END;
  9300. END;
  9301. RETURN FALSE
  9302. END CanPassAsResultParameter;
  9303. BEGIN
  9304. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9305. leftType := left.type.resolved; rightType:= right.type.resolved;
  9306. IF backend.cooperative & left.NeedsTrace() THEN
  9307. ModifyAssignments(true);
  9308. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9309. Designate(right, rightO);
  9310. Designate(left, leftO);
  9311. ASSERT(leftO.mode = ModeReference);
  9312. TransferToRegister(leftO.op, leftO.op);
  9313. TransferToRegister(rightO.op, rightO.op);
  9314. Emit(Push(position, leftO.op));
  9315. Emit(Push(position, rightO.op));
  9316. CallAssignMethod(leftO.op, rightO.op, left.type);
  9317. Emit(Pop(position, rightO.op));
  9318. Emit(Pop(position, leftO.op));
  9319. sizeOp := CopySize(left, leftO.tag);
  9320. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9321. ReleaseIntermediateOperand(sizeOp);
  9322. ReleaseOperand(leftO);
  9323. ReleaseOperand(rightO);
  9324. ELSE
  9325. Evaluate(right,rightO);
  9326. Designate(left,leftO);
  9327. ASSERT(leftO.mode = ModeReference);
  9328. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9329. (* copy procedure address first *)
  9330. MakeMemory(mem,leftO.op,addressType,0);
  9331. Emit(Mov(position,mem,rightO.op));
  9332. ReleaseIntermediateOperand(mem);
  9333. (* copy pointer address *)
  9334. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9335. CallAssignPointer(leftO.tag, rightO.tag);
  9336. ELSE
  9337. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9338. CallAssignPointer(leftO.op, rightO.op);
  9339. END;
  9340. ReleaseOperand(leftO);
  9341. ReleaseOperand(rightO);
  9342. END;
  9343. ModifyAssignments(false);
  9344. RETURN;
  9345. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  9346. SaveRegisters();ReleaseUsedRegisters(saved);
  9347. IF SemanticChecker.IsPointerType(leftType) THEN
  9348. Evaluate(right,rightO);
  9349. Designate(left,leftO);
  9350. Emit(Push(position,leftO.op));
  9351. ReleaseOperand(leftO);
  9352. Emit(Push(position,rightO.op));
  9353. ReleaseOperand(rightO);
  9354. CallThis(position,"Heaps","Assign",2);
  9355. ELSIF leftType.IsRecordType() THEN
  9356. Designate(right,rightO);
  9357. Designate(left,leftO);
  9358. Emit(Push(position,leftO.op));
  9359. Emit(Push(position,leftO.tag)); (* type desc *)
  9360. ReleaseOperand(leftO);
  9361. Emit(Push(position,rightO.op));
  9362. ReleaseOperand(rightO);
  9363. CallThis(position,"Heaps","AssignRecord",3);
  9364. ELSIF IsStaticArray(leftType) THEN
  9365. size := StaticArrayNumElements(leftType);
  9366. base := StaticArrayBaseType(leftType);
  9367. Designate(right,rightO);
  9368. Designate(left,leftO);
  9369. Emit(Push(position,leftO.op));
  9370. ReleaseOperand(leftO);
  9371. arg := TypeDescriptorAdr(base);
  9372. Emit(Push(position,arg));
  9373. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9374. Emit(Push(position,rightO.op));
  9375. ReleaseOperand(rightO);
  9376. CallThis(position,"Heaps","AssignArray",4);
  9377. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  9378. size := StaticMathArrayNumElements(leftType);
  9379. base := StaticMathArrayBaseType(leftType);
  9380. Designate(right,rightO);
  9381. Designate(left,leftO);
  9382. Emit(Push(position,leftO.op));
  9383. ReleaseOperand(leftO);
  9384. arg := TypeDescriptorAdr(base);
  9385. Emit(Push(position,arg));
  9386. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9387. Emit(Push(position,rightO.op));
  9388. ReleaseOperand(rightO);
  9389. CallThis(position,"Heaps","AssignArray",4);
  9390. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9391. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9392. Evaluate(right,rightO);
  9393. Designate(left,leftO);
  9394. MakeMemory(mem,leftO.op,addressType,0);
  9395. Emit(Mov(position,mem,rightO.op));
  9396. ReleaseIntermediateOperand(mem);
  9397. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9398. Emit (Push(position, leftO.tag));
  9399. ReleaseOperand(leftO);
  9400. Emit (Push(position, rightO.tag));
  9401. ReleaseOperand(rightO);
  9402. CallThis(position,"Heaps","Assign", 2);
  9403. ELSE HALT(100); (* missing ? *)
  9404. END;
  9405. RestoreRegisters(saved);
  9406. RETURN;
  9407. END;
  9408. IF CanPassAsResultParameter(right) THEN
  9409. procedureResultDesignator := left(SyntaxTree.Designator);
  9410. Expression(right);
  9411. procedureResultDesignator := NIL;
  9412. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9413. (* left <-- ALIAS OF right: zerocopy *)
  9414. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9415. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9416. designator.SetType(procedure.type);
  9417. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9418. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9419. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9420. END;
  9421. ELSIF leftType IS SyntaxTree.RangeType THEN
  9422. (* LHS is of array range type *)
  9423. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9424. Evaluate(right, rightO);
  9425. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9426. (* first *)
  9427. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  9428. Emit(Mov(position,mem, rightO.op));
  9429. ReleaseIntermediateOperand(mem);
  9430. (* last *)
  9431. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9432. Emit(Mov(position,mem, rightO.tag));
  9433. ReleaseIntermediateOperand(mem);
  9434. (* step *)
  9435. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9436. Emit(Mov(position,mem, rightO.extra));
  9437. ReleaseIntermediateOperand(mem);
  9438. ReleaseOperand(rightO);
  9439. ReleaseOperand(leftO)
  9440. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9441. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9442. Evaluate(right, rightO);
  9443. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9444. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9445. (* real part *)
  9446. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9447. Emit(Mov(position,mem, rightO.op));
  9448. ReleaseIntermediateOperand(mem);
  9449. (* imaginary part *)
  9450. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9451. Emit(Mov(position,mem, rightO.tag));
  9452. ReleaseIntermediateOperand(mem);
  9453. ReleaseOperand(rightO);
  9454. ReleaseOperand(leftO)
  9455. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9456. OR (leftType IS SyntaxTree.PortType) THEN
  9457. (* rightO := leftO;*)
  9458. Evaluate(right,rightO);
  9459. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9460. Designate(left,leftO);
  9461. IF leftO.mode = ModeReference THEN
  9462. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9463. destination := mem;
  9464. ELSE
  9465. destination := leftO.op;
  9466. END;
  9467. ReleaseOperand(leftO);
  9468. IF destination.mode # IntermediateCode.Undefined THEN
  9469. Emit(Mov(position,destination,rightO.op));
  9470. END;
  9471. ReleaseOperand(rightO);
  9472. ReleaseIntermediateOperand(mem);
  9473. IntermediateCode.InitOperand(destination);
  9474. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9475. Evaluate(right,rightO);
  9476. Designate(left,leftO);
  9477. MakeMemory(mem,leftO.op,addressType,0);
  9478. Emit(Mov(position,mem,rightO.op));
  9479. ReleaseIntermediateOperand(mem);
  9480. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9481. (* delegate *)
  9482. (*
  9483. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9484. *)
  9485. Emit(Mov(position,leftO.tag,rightO.tag));
  9486. END;
  9487. ReleaseOperand(leftO);
  9488. ReleaseOperand(rightO);
  9489. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9490. Designate(right,rightO);
  9491. Designate(left,leftO);
  9492. sizeOp := CopySize(left, leftO.tag);
  9493. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9494. ReleaseIntermediateOperand(sizeOp);
  9495. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9496. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9497. IF (rightType IS SyntaxTree.StringType) THEN
  9498. CopyString(left,right);
  9499. 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
  9500. Designate(right,rightO);
  9501. Designate(left,leftO);
  9502. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9503. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9504. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9505. ELSE
  9506. HALT(201)
  9507. END;
  9508. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9509. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9510. Designate(right,rightO);
  9511. Designate(left,leftO);
  9512. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9513. IF IntermediateCode.IsVectorRegister(leftO.op) THEN
  9514. MakeMemory(mem, rightO.op, leftO.op.type,0);
  9515. Emit(Mov(position, leftO.op, mem));
  9516. ReleaseIntermediateOperand(mem);
  9517. ELSE
  9518. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9519. END;
  9520. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9521. ELSE
  9522. AssignMathArray(left,right);
  9523. END;
  9524. ELSE
  9525. HALT(200);
  9526. END;
  9527. END Assign;
  9528. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  9529. BEGIN
  9530. IF Trace THEN TraceEnter("VisitAssignment") END;
  9531. Assign(x.left,x.right);
  9532. IF Trace THEN TraceExit("VisitAssignment") END;
  9533. END VisitAssignment;
  9534. PROCEDURE EmitCooperativeSwitch;
  9535. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9536. BEGIN
  9537. ASSERT (cooperativeSwitches);
  9538. pc := section.pc;
  9539. IF lastSwitchPC = section.pc THEN RETURN END;
  9540. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9541. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9542. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9543. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9544. INC(statCoopSwitch, section.pc - pc);
  9545. END EmitCooperativeSwitch;
  9546. PROCEDURE VisitCommunicationStatement*(communication: SyntaxTree.CommunicationStatement);
  9547. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9548. BEGIN
  9549. p0 := communication.left; p1 := communication.right;
  9550. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9551. Evaluate(p0,s0);
  9552. Evaluate(p1,s1);
  9553. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9554. Emit(Push(position,s0.op));
  9555. Emit(Push(position,s1.op));
  9556. (*
  9557. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9558. *)
  9559. IF ~backend.cellsAreObjects THEN
  9560. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9561. END;
  9562. ReleaseOperand(s0);
  9563. ReleaseOperand(s1);
  9564. IF backend.cellsAreObjects THEN
  9565. CallThis(position,"ActiveCellsRuntime","Send",2);
  9566. ELSE
  9567. CallThis(position,ChannelModuleName,"Send",2);
  9568. END;
  9569. (* ----- RECEIVE ------*)
  9570. ELSE
  9571. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9572. tmp := p0; p0 := p1; p1 := tmp;
  9573. END;
  9574. Evaluate(p0,s0);
  9575. Emit(Push(position,s0.op));
  9576. Designate(p1,s1);
  9577. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9578. Emit(Push(position,s1.op));
  9579. (*
  9580. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9581. *)
  9582. IF ~backend.cellsAreObjects THEN
  9583. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9584. END;
  9585. ReleaseOperand(s0);
  9586. ReleaseOperand(s1);
  9587. IF backend.cellsAreObjects THEN
  9588. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9589. ELSE
  9590. CallThis(position,ChannelModuleName,"Receive",2)
  9591. END;
  9592. END;
  9593. END VisitCommunicationStatement;
  9594. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  9595. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9596. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9597. VAR true, false: Label; condition, value: BOOLEAN;
  9598. BEGIN
  9599. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9600. IF condition THEN
  9601. true := NewLabel();
  9602. false := NewLabel();
  9603. Condition(if.condition,true,false);
  9604. SetLabel(true);
  9605. StatementSequence(if.statements);
  9606. BrL(end);
  9607. SetLabel(false);
  9608. ELSE
  9609. IF value THEN (* always true *)
  9610. escape := TRUE;
  9611. StatementSequence(if.statements);
  9612. (* no branch necessary -- rest skipped *)
  9613. END;
  9614. END;
  9615. END IfPart;
  9616. BEGIN
  9617. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9618. end := NewLabel();
  9619. elsifs := x.ElsifParts();
  9620. IfPart(x.ifPart);
  9621. FOR i := 0 TO elsifs-1 DO
  9622. IF ~escape THEN
  9623. elsif := x.GetElsifPart(i);
  9624. IfPart(elsif);
  9625. END;
  9626. END;
  9627. IF (x.elsePart # NIL) & ~escape THEN
  9628. StatementSequence(x.elsePart);
  9629. END;
  9630. SetLabel(end);
  9631. IF Trace THEN TraceExit("VisitIfStatement") END;
  9632. END VisitIfStatement;
  9633. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9634. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9635. BEGIN
  9636. (*IF x.variable.type.resolved = x.type.resolved THEN
  9637. (* always true, do nothing *)
  9638. ELSE*)
  9639. Designate(x.variable,res);
  9640. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9641. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9642. END;
  9643. trueL := NewLabel();
  9644. TypeTest(res.tag,x.type,trueL,falseL);
  9645. ReleaseOperand(res);
  9646. SetLabel(trueL);
  9647. StatementSequence(x.statements);
  9648. BrL(endL);
  9649. END WithPart;
  9650. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  9651. VAR endL,falseL: Label;i: LONGINT;
  9652. BEGIN
  9653. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9654. endL := NewLabel();
  9655. FOR i := 0 TO x.WithParts()-1 DO
  9656. falseL := NewLabel();
  9657. WithPart(x.GetWithPart(i),falseL,endL);
  9658. SetLabel(falseL);
  9659. END;
  9660. IF x.elsePart = NIL THEN
  9661. IF ~isUnchecked THEN
  9662. EmitTrap(position,WithTrap);
  9663. END;
  9664. ELSE
  9665. StatementSequence(x.elsePart)
  9666. END;
  9667. SetLabel(endL);
  9668. IF Trace THEN TraceExit("VisitWithStatement") END;
  9669. END VisitWithStatement;
  9670. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  9671. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; range, j: Basic.Integer; i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9672. out,else: Label; label: Label;
  9673. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9674. symbol: SyntaxTree.Symbol;
  9675. BEGIN
  9676. (*! split case statement into if-elsif statements for large case label lists *)
  9677. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9678. range := x.max-x.min+1;
  9679. IF (range<0) OR (range > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9680. END;
  9681. size := LONGINT(range);
  9682. Evaluate(x.variable,var);
  9683. ReuseCopy(tmp,var.op);
  9684. ReleaseIntermediateOperand(var.op);
  9685. var.op := tmp;
  9686. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9687. Convert(var.op,addressType);
  9688. else := NewLabel();
  9689. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9690. (*
  9691. UniqueId(name,module.module,"case",caseId);
  9692. *)
  9693. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9694. Global.GetModuleSegmentedName(module.module, name);
  9695. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9696. symbol := SyntaxTree.NewSymbol(name[1]);
  9697. symbol.SetScope(moduleScope);
  9698. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9699. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9700. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9701. ReuseCopy(res,var.op);
  9702. ReleaseOperand(var);
  9703. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9704. Emit(Add(position,res,res,jmp));
  9705. IntermediateCode.MakeMemory(res,addressType);
  9706. Emit(Br(position,res));
  9707. ReleaseIntermediateOperand(res);
  9708. out := NewLabel();
  9709. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9710. part := x.GetCasePart(i);
  9711. constant := part.firstConstant;
  9712. label := NewLabel();
  9713. SetLabel(label);
  9714. WHILE(constant # NIL) DO (* case labels for this case part *)
  9715. FOR j := constant.min TO constant.max DO
  9716. fixups[j-x.min] := label;
  9717. END;
  9718. constant := constant.next;
  9719. END;
  9720. StatementSequence(part.statements);
  9721. BrL(out);
  9722. END;
  9723. SetLabel(else);
  9724. FOR i := 0 TO size-1 DO
  9725. IF fixups[i] = NIL THEN
  9726. fixups[i] := else;
  9727. END;
  9728. END;
  9729. IF x.elsePart # NIL THEN
  9730. StatementSequence(x.elsePart);
  9731. ELSIF ~isUnchecked THEN
  9732. EmitTrap(position,CaseTrap);
  9733. END;
  9734. SetLabel(out);
  9735. FOR i := 0 TO size-1 DO
  9736. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9737. section.Emit(Data(position,op));
  9738. END;
  9739. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9740. END VisitCaseStatement;
  9741. PROCEDURE VisitWhileStatement*(x: SyntaxTree.WhileStatement);
  9742. VAR start: Label; true,false: Label;
  9743. BEGIN
  9744. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9745. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9746. start := NewLabel();
  9747. true := NewLabel();
  9748. false := NewLabel();
  9749. SetLabel(start);
  9750. Condition(x.condition,true,false);
  9751. SetLabel(true);
  9752. StatementSequence(x.statements);
  9753. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9754. BrL(start);
  9755. SetLabel(false);
  9756. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9757. END VisitWhileStatement;
  9758. PROCEDURE VisitRepeatStatement*(x: SyntaxTree.RepeatStatement);
  9759. VAR false,true: Label;
  9760. BEGIN
  9761. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9762. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9763. true := NewLabel();
  9764. false := NewLabel();
  9765. SetLabel(false);
  9766. StatementSequence(x.statements);
  9767. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9768. Condition(x.condition,true,false);
  9769. SetLabel(true);
  9770. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9771. END VisitRepeatStatement;
  9772. PROCEDURE VisitForStatement*(x: SyntaxTree.ForStatement);
  9773. VAR
  9774. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9775. temporaryVariable: SyntaxTree.Variable;
  9776. temporaryVariableDesignator : SyntaxTree.Designator;
  9777. BEGIN
  9778. IF Trace THEN TraceEnter("VisitForStatement") END;
  9779. true := NewLabel();
  9780. false := NewLabel();
  9781. start := NewLabel();
  9782. Assign(x.variable,x.from);
  9783. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9784. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9785. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9786. Assign(temporaryVariableDesignator,x.to);
  9787. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).value END;
  9788. IF by > 0 THEN
  9789. cmp := Scanner.LessEqual
  9790. ELSE
  9791. cmp := Scanner.GreaterEqual
  9792. END;
  9793. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9794. binary.SetType(system.booleanType);
  9795. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9796. SetLabel(start);
  9797. Condition(binary,true,false);
  9798. SetLabel(true);
  9799. StatementSequence(x.statements);
  9800. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9801. binary.SetType(x.variable.type);
  9802. Assign(x.variable,binary);
  9803. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9804. BrL(start);
  9805. SetLabel(false);
  9806. IF Trace THEN TraceExit("VisitForStatement") END;
  9807. END VisitForStatement;
  9808. PROCEDURE VisitExitableBlock*(x: SyntaxTree.ExitableBlock);
  9809. VAR prevLoop: Label;
  9810. BEGIN
  9811. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9812. prevLoop := currentLoop;
  9813. currentLoop := NewLabel();
  9814. StatementSequence(x.statements);
  9815. SetLabel(currentLoop);
  9816. currentLoop := prevLoop;
  9817. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9818. END VisitExitableBlock;
  9819. PROCEDURE VisitLoopStatement*(x: SyntaxTree.LoopStatement);
  9820. VAR prevLoop,start: Label;
  9821. BEGIN
  9822. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9823. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9824. start := NewLabel();
  9825. prevLoop := currentLoop;
  9826. SetLabel(start);
  9827. currentLoop := NewLabel();
  9828. StatementSequence(x.statements);
  9829. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9830. BrL(start);
  9831. SetLabel(currentLoop);
  9832. currentLoop := prevLoop;
  9833. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9834. END VisitLoopStatement;
  9835. PROCEDURE VisitExitStatement*(x: SyntaxTree.ExitStatement);
  9836. VAR outer: SyntaxTree.Statement;
  9837. BEGIN
  9838. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9839. IF locked THEN (* r if we jump out of an exclusive block *)
  9840. outer := x.outer;
  9841. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9842. outer := outer.outer;
  9843. END;
  9844. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9845. Lock(FALSE);
  9846. END;
  9847. END;
  9848. BrL(currentLoop);
  9849. IF Trace THEN TraceExit("VisitExitStatement") END;
  9850. END VisitExitStatement;
  9851. PROCEDURE VisitReturnStatement*(x: SyntaxTree.ReturnStatement);
  9852. VAR
  9853. expression, parameterDesignator: SyntaxTree.Expression;
  9854. type, componentType: SyntaxTree.Type;
  9855. res, right: Operand;
  9856. left, mem, reg: IntermediateCode.Operand;
  9857. parameter: SyntaxTree.Parameter;
  9858. procedure: SyntaxTree.Procedure;
  9859. procedureType: SyntaxTree.ProcedureType;
  9860. returnTypeOffset: LONGINT;
  9861. delegate: BOOLEAN;
  9862. map: SymbolMap;
  9863. callingConvention, parametersSize: LONGINT;
  9864. BEGIN
  9865. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9866. expression := x.returnValue;
  9867. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9868. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9869. IF currentIsInline THEN
  9870. IF expression # NIL THEN
  9871. map := currentMapper.Get(NIL);
  9872. IF map # NIL THEN
  9873. Assign(map.to, expression);
  9874. ELSE
  9875. Evaluate(expression,res);
  9876. Emit(Return(position,res.op));
  9877. ReleaseOperand(res);
  9878. END;
  9879. END;
  9880. BrL(currentInlineExit);
  9881. RETURN;
  9882. END;
  9883. IF expression # NIL THEN
  9884. type := expression.type.resolved;
  9885. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9886. IF locked THEN Lock(FALSE) END;
  9887. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9888. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9889. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9890. 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) THEN
  9891. (* return without structured return parameter *)
  9892. Evaluate(expression,res);
  9893. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9894. IF locked OR profile THEN
  9895. Emit(Push(position,res.op));
  9896. IF delegate THEN HALT(200) END;
  9897. ReleaseOperand(res);
  9898. IF locked THEN Lock(FALSE) END;
  9899. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9900. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9901. reg := NewRegisterOperand(res.op.type);
  9902. Emit(Pop(position,reg));
  9903. Emit(Return(position,reg));
  9904. ReleaseIntermediateOperand(reg);
  9905. ELSE
  9906. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9907. Emit(Return(position,res.op));
  9908. ReleaseOperand(res);
  9909. END;
  9910. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9911. THEN
  9912. (* return using structured return parameter *)
  9913. 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)
  9914. OR SemanticChecker.IsPointerType(type));
  9915. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9916. parameter :=procedureType.returnParameter;
  9917. ASSERT(parameter # NIL);
  9918. returnTypeOffset := parameter.offsetInBits;
  9919. (*
  9920. IF parameter# NIL THEN
  9921. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9922. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9923. ELSE
  9924. returnTypeOffset := system.offsetFirstParameter
  9925. END;
  9926. *)
  9927. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9928. IF type IS SyntaxTree.RangeType THEN
  9929. (* array range type *)
  9930. Evaluate(expression, right);
  9931. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  9932. Emit(Mov(position,mem, right.op)); (* first *)
  9933. ReleaseIntermediateOperand(mem);
  9934. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9935. Emit(Mov(position,mem, right.tag)); (* last *)
  9936. ReleaseIntermediateOperand(mem);
  9937. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9938. Emit(Mov(position,mem, right.extra)); (* step *)
  9939. ReleaseIntermediateOperand(mem);
  9940. ReleaseOperand(right);
  9941. ELSIF type IS SyntaxTree.ComplexType THEN
  9942. Evaluate(expression, right);
  9943. componentType := type(SyntaxTree.ComplexType).componentType;
  9944. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9945. Emit(Mov(position,mem, right.op)); (* real part *)
  9946. ReleaseIntermediateOperand(mem);
  9947. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9948. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9949. ReleaseIntermediateOperand(mem);
  9950. ReleaseOperand(right);
  9951. ELSE (* covers cases: pointer / record / array *)
  9952. parameter := procedureType.returnParameter;
  9953. checker.SetCurrentScope(currentScope);
  9954. ASSERT(parameter # NIL);
  9955. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9956. Assign(parameterDesignator,expression);
  9957. END;
  9958. ReleaseIntermediateOperand(left);
  9959. IF locked THEN Lock(FALSE) END;
  9960. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9961. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9962. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9963. parameter := procedureType.returnParameter;
  9964. checker.SetCurrentScope(currentScope);
  9965. IF parameter = NIL THEN
  9966. Error(procedure.position, "structured return of parameter of procedure not found");
  9967. ELSE
  9968. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9969. Assign(parameterDesignator,expression);
  9970. END;
  9971. IF locked THEN Lock(FALSE) END;
  9972. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9973. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9974. ELSE
  9975. HALT(200);
  9976. END;
  9977. ELSE
  9978. IF locked THEN Lock(FALSE) END;
  9979. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9980. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9981. END;
  9982. IF backend.cooperative THEN
  9983. BrL(exitLabel);
  9984. ELSE
  9985. callingConvention := procedureType.callingConvention;
  9986. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  9987. parametersSize := ProcedureParametersSize(backend.system,procedure);
  9988. ELSE
  9989. parametersSize := 0;
  9990. END;
  9991. EmitLeave(section, position,procedure, callingConvention);
  9992. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  9993. END;
  9994. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9995. END VisitReturnStatement;
  9996. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9997. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9998. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9999. statements: SyntaxTree.StatementSequence;
  10000. name, suffix: SyntaxTree.IdentifierString;
  10001. BEGIN
  10002. Strings.IntToStr(awaitProcCounter,suffix);
  10003. Strings.Concat("@AwaitProcedure",suffix,name);
  10004. identifier := SyntaxTree.NewIdentifier(name);
  10005. INC(awaitProcCounter);
  10006. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  10007. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  10008. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  10009. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  10010. procedure.SetAccess(SyntaxTree.Hidden);
  10011. procedure.SetScope(currentScope);
  10012. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  10013. procedureType.SetReturnType(system.booleanType);
  10014. procedure.SetType(procedureType);
  10015. body := SyntaxTree.NewBody(x.position,procedureScope);
  10016. procedureScope.SetBody(body);
  10017. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  10018. returnStatement.SetReturnValue(x.condition);
  10019. statements := SyntaxTree.NewStatementSequence();
  10020. statements.AddStatement(returnStatement);
  10021. body.SetStatementSequence(statements);
  10022. currentScope.AddProcedure(procedure);
  10023. RETURN procedure
  10024. END MakeAwaitProcedure;
  10025. PROCEDURE VisitAwaitStatement*(x: SyntaxTree.AwaitStatement);
  10026. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  10027. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  10028. BEGIN
  10029. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  10030. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10031. IF backend.cooperative THEN
  10032. start := NewLabel();
  10033. true := NewLabel();
  10034. false := NewLabel();
  10035. SetLabel(start);
  10036. Condition(x.condition,true,false);
  10037. SetLabel(false);
  10038. PushSelfPointer();
  10039. CallThis(position,"ExclusiveBlocks","Await",1);
  10040. BrL(start);
  10041. SetLabel(true);
  10042. PushSelfPointer();
  10043. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  10044. ELSE
  10045. proc := MakeAwaitProcedure(x);
  10046. Emit(Push(position,fp));
  10047. GetCodeSectionNameForSymbol(proc,name);
  10048. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10049. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  10050. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  10051. Emit(Call(position,call,ProcParametersSize(proc)));
  10052. Emit(Result(position,res));
  10053. (*
  10054. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10055. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10056. *)
  10057. InitOperand(result,ModeValue);
  10058. result.op := res;
  10059. label := NewLabel();
  10060. BreqL(label, result.op, SELF.true);
  10061. ReleaseOperand(result);
  10062. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10063. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  10064. Emit(Push(position,res));
  10065. Emit(Push(position,fp));
  10066. PushSelfPointer();
  10067. Emit(Push(position,nil));
  10068. CallThis(position,"Objects","Await",4);
  10069. SetLabel(label);
  10070. END;
  10071. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10072. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  10073. END VisitAwaitStatement;
  10074. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  10075. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  10076. BEGIN
  10077. FOR i := 0 TO x.Length() - 1 DO
  10078. statement := x.GetStatement( i );
  10079. Statement(statement);
  10080. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  10081. END;
  10082. END StatementSequence;
  10083. PROCEDURE PushSelfPointer;
  10084. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  10085. procedureType: SyntaxTree.ProcedureType;
  10086. BEGIN
  10087. scope := currentScope;
  10088. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  10089. scope := scope.outerScope;
  10090. END;
  10091. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  10092. moduleSection := meta.ModuleSection();
  10093. IF backend.cooperative THEN
  10094. moduleOffset := 0;
  10095. ELSE
  10096. moduleOffset := moduleSection.pc;
  10097. END;
  10098. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  10099. ELSE
  10100. GetBaseRegister(op.op,currentScope,scope);
  10101. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10102. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10103. parametersSize := ProcParametersSize(procedure);
  10104. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  10105. IF backend.cooperative THEN
  10106. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  10107. END;
  10108. IntermediateCode.MakeMemory(op.op,addressType);
  10109. END;
  10110. Emit(Push(position,op.op));
  10111. ReleaseOperand(op);
  10112. END PushSelfPointer;
  10113. PROCEDURE Lock(lock: BOOLEAN);
  10114. BEGIN
  10115. IF Trace THEN TraceEnter("Lock") END;
  10116. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10117. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  10118. ASSERT(modifyAssignmentCounter = 0);
  10119. IF dump # NIL THEN
  10120. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  10121. dump.Ln;dump.Update;
  10122. END;
  10123. PushSelfPointer;
  10124. IF backend.cooperative THEN
  10125. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  10126. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  10127. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  10128. END;
  10129. ELSE
  10130. Emit(Push(position,true));
  10131. IF lock THEN CallThis(position,"Objects","Lock",2)
  10132. ELSE CallThis(position,"Objects","Unlock",2);
  10133. END;
  10134. END;
  10135. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10136. IF Trace THEN TraceExit("Lock") END;
  10137. END Lock;
  10138. PROCEDURE VisitStatementBlock*(x: SyntaxTree.StatementBlock);
  10139. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN; end: Label;
  10140. BEGIN
  10141. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  10142. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10143. previouslyUnchecked := isUnchecked;
  10144. isUnchecked := isUnchecked OR x.isUnchecked;
  10145. previouslyCooperativeSwitches := cooperativeSwitches;
  10146. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  10147. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  10148. IF x.statements # NIL THEN
  10149. StatementSequence(x.statements);
  10150. END;
  10151. IF (x IS SyntaxTree.Body) THEN
  10152. IF (x(SyntaxTree.Body).finally # NIL) THEN
  10153. section.SetFinally(section.pc);
  10154. StatementSequence(x(SyntaxTree.Body).finally)
  10155. ELSIF x.isExclusive THEN
  10156. end := NewLabel();
  10157. BrL(end);
  10158. section.SetFinally(section.pc);
  10159. Lock(FALSE);
  10160. EmitTrap(position,RethrowTrap);
  10161. SetLabel(end);
  10162. END;
  10163. END;
  10164. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  10165. isUnchecked := previouslyUnchecked;
  10166. cooperativeSwitches := previouslyCooperativeSwitches;
  10167. IF Trace THEN TraceExit("VisitStatementBlock") END;
  10168. END VisitStatementBlock;
  10169. PROCEDURE VisitCode*(x: SyntaxTree.Code);
  10170. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  10171. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  10172. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  10173. procedure: SyntaxTree.Procedure;
  10174. map: SymbolMap;
  10175. callingConvention, parametersSize: LONGINT;
  10176. BEGIN
  10177. scope := currentScope;
  10178. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  10179. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10180. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10181. return := emptyOperand;
  10182. IF Trace THEN TraceEnter("VisitCode") END;
  10183. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  10184. NEW(in, x.inRules.Length());
  10185. FOR i := 0 TO LEN(in)-1 DO
  10186. statement := x.inRules.GetStatement(i);
  10187. WITH statement: SyntaxTree.Assignment DO
  10188. Evaluate(statement.right, operand);
  10189. result := operand.op;
  10190. NEW(str, 64);
  10191. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  10192. in[i] := result; IntermediateCode.SetString(in[i], str);
  10193. ReleaseIntermediateOperand(operand.tag);
  10194. END;
  10195. END;
  10196. ELSE in := NIL
  10197. END;
  10198. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  10199. NEW(out, x.outRules.Length());
  10200. FOR i := 0 TO LEN(out)-1 DO
  10201. statement := x.outRules.GetStatement(i);
  10202. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  10203. WITH statement: SyntaxTree.Assignment DO
  10204. Designate(statement.left, operand);
  10205. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  10206. NEW(str, 64);
  10207. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  10208. out[i] := result; IntermediateCode.SetString(out[i], str);
  10209. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  10210. |statement: SyntaxTree.ReturnStatement DO
  10211. NEW(str, 64);
  10212. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  10213. IF currentIsInline THEN
  10214. map := currentMapper.Get(NIL);
  10215. Designate(map.to, operand);
  10216. IF map.isAddress THEN
  10217. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10218. ELSE
  10219. result := operand.op;
  10220. END;
  10221. (*! only if it does not fit into register
  10222. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10223. *)
  10224. (*Evaluate(map.to, operand);*)
  10225. out[i] := result;
  10226. ELSE
  10227. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  10228. END;
  10229. IntermediateCode.SetString(out[i], str);
  10230. ReleaseIntermediateOperand(operand.tag);
  10231. return := out[i];
  10232. ELSE
  10233. END;
  10234. END;
  10235. ELSE out := NIL
  10236. END;
  10237. Emit(Asm(x.position,x.sourceCode, in, out));
  10238. IF in # NIL THEN
  10239. FOR i := 0 TO LEN(in)-1 DO
  10240. ReleaseIntermediateOperand(in[i]);
  10241. END;
  10242. END;
  10243. IF out # NIL THEN
  10244. FOR i := 0 TO LEN(out)-1 DO
  10245. WITH statement: SyntaxTree.Assignment DO
  10246. ReleaseIntermediateOperand(out[i]);
  10247. |statement: SyntaxTree.ReturnStatement DO
  10248. (* release happens below *)
  10249. ELSE
  10250. END;
  10251. statement := x.outRules.GetStatement(i);
  10252. END;
  10253. END;
  10254. IF return.mode # IntermediateCode.Undefined THEN
  10255. IF currentIsInline THEN
  10256. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  10257. Symbol(procedureType.returnParameter, par);
  10258. MakeMemory(mem, par.op, return.type, 0);
  10259. ReleaseOperand(par);
  10260. Emit(Mov(position, mem, return));
  10261. ReleaseIntermediateOperand(mem);
  10262. ELSE
  10263. Emit(Return(position,return));
  10264. END;
  10265. ReleaseIntermediateOperand(return);
  10266. IF currentIsInline THEN RETURN END;
  10267. callingConvention := procedureType(SyntaxTree.ProcedureType).callingConvention;
  10268. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10269. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10270. ELSE
  10271. parametersSize := 0;
  10272. END;
  10273. EmitLeave(section, position,procedure, callingConvention);
  10274. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10275. END;
  10276. IF Trace THEN TraceExit("VisitCode") END;
  10277. END VisitCode;
  10278. PROCEDURE ProcParametersSize(procedure: SyntaxTree.Procedure): LONGINT;
  10279. BEGIN
  10280. RETURN ProcedureParametersSize(system, procedure);
  10281. END ProcParametersSize;
  10282. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  10283. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  10284. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  10285. const, call: IntermediateCode.Operand;
  10286. parameterDesignator: SyntaxTree.Expression;
  10287. saved: RegisterEntry;
  10288. name: Basic.SegmentedName;
  10289. BEGIN
  10290. IF Trace THEN TraceEnter("ParameterCopies") END;
  10291. parameter := x.firstParameter;
  10292. WHILE parameter # NIL DO
  10293. IF parameter.kind = SyntaxTree.ValueParameter THEN
  10294. type := parameter.type.resolved;
  10295. IF IsOpenArray(type) THEN
  10296. VisitParameter(parameter);
  10297. op := result;
  10298. IF backend.cooperative & parameter.NeedsTrace() THEN
  10299. length := GetArrayLength(type, op.tag);
  10300. size := NewRegisterOperand(addressType);
  10301. base := ArrayBaseType(type);
  10302. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10303. Emit(Mul(position, size, length, const));
  10304. dst := NewRegisterOperand (addressType);
  10305. Emit(Mov(position, dst, size));
  10306. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10307. Emit(Sub(position,dst,sp,dst));
  10308. Emit(And(position,dst,dst,const));
  10309. Emit(Mov(position,sp,dst));
  10310. par := fp;
  10311. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10312. IntermediateCode.InitImmediate(null, byteType, 0);
  10313. Emit(Fill(position, dst, size, null));
  10314. ReleaseIntermediateOperand(dst);
  10315. ReleaseIntermediateOperand(length);
  10316. SaveRegisters();ReleaseUsedRegisters(saved);
  10317. (* register dst has been freed before SaveRegisters already *)
  10318. base := ArrayBaseType(type);
  10319. (* assign method of open array *)
  10320. IF base.IsRecordType() THEN
  10321. Emit (Push(position, length));
  10322. Emit (Push(position, dst));
  10323. Emit (Push(position, op.op));
  10324. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10325. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10326. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10327. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10328. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10329. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10330. Emit (Push(position,length));
  10331. Emit (Push(position, dst));
  10332. Emit (Push(position, length));
  10333. Emit (Push(position, op.op));
  10334. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10335. ELSE
  10336. Emit (Push(position, length));
  10337. Emit (Push(position, dst));
  10338. Emit (Push(position, length));
  10339. Emit (Push(position, op.op));
  10340. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10341. ASSERT(ArrayBaseType(type).IsPointer());
  10342. END;
  10343. RestoreRegisters(saved);
  10344. ELSE
  10345. temp := GetDynamicSize(type,op.tag);
  10346. ReuseCopy(size,temp);
  10347. ReleaseIntermediateOperand(temp);
  10348. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10349. Emit(Sub(position,size,sp,size));
  10350. Emit(And(position,size,size,const));
  10351. Emit(Mov(position,sp,size));
  10352. par := fp;
  10353. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10354. ReleaseIntermediateOperand(size);
  10355. size := GetDynamicSize(type,op.tag);
  10356. END;
  10357. Emit(Copy(position,sp,op.op,size));
  10358. ReleaseIntermediateOperand(size);
  10359. ReleaseOperand(op);
  10360. IntermediateCode.MakeMemory(par,addressType);
  10361. Emit(Mov(position,par,sp));
  10362. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10363. checker.SetCurrentScope(currentScope);
  10364. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10365. Assign(parameterDesignator,parameterDesignator);
  10366. END;
  10367. END;
  10368. parameter := parameter.nextParameter;
  10369. END;
  10370. IF Trace THEN TraceExit("ParameterCopies") END;
  10371. END ParameterCopies;
  10372. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10373. VAR x: SyntaxTree.Variable;
  10374. BEGIN
  10375. x := scope.firstVariable;
  10376. WHILE x # NIL DO
  10377. InitVariable(x,FALSE);
  10378. x := x.nextVariable;
  10379. END;
  10380. END InitVariables;
  10381. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10382. BEGIN
  10383. IF (symbol # NIL) THEN
  10384. RETURN fingerPrinter.SymbolFP(symbol).public
  10385. ELSE
  10386. RETURN 0
  10387. END;
  10388. END GetFingerprint;
  10389. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10390. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10391. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10392. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10393. name: Basic.SegmentedName;
  10394. offset: LONGINT;
  10395. BEGIN
  10396. IF Trace THEN TraceEnter("Body") END;
  10397. ReleaseUsedRegisters(saved); (* just in case ... *)
  10398. section := ir;
  10399. exitLabel := NewLabel ();
  10400. IF moduleBody THEN moduleBodySection := section END;
  10401. IF ir.comments # NIL THEN
  10402. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10403. commentPrintout.SingleStatement(TRUE);
  10404. dump := ir.comments;
  10405. ELSE
  10406. commentPrintout := NIL;
  10407. dump := NIL;
  10408. END;
  10409. prevScope := currentScope;
  10410. currentScope := scope;
  10411. lastSwitchPC := 0;
  10412. cooperativeSwitches := backend.cooperative;
  10413. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10414. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10415. IF x # NIL THEN
  10416. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10417. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10418. IF moduleBody THEN
  10419. ProfilerInit();
  10420. ELSE
  10421. Basic.SegmentedNameToString(ir.name, string);
  10422. ProfilerAddProcedure(numberProcedures,string);
  10423. ProfilerEnterExit(numberProcedures,TRUE);
  10424. END;
  10425. END;
  10426. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10427. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10428. END;
  10429. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10430. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10431. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10432. IF procedure = cellScope.bodyProcedure THEN
  10433. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10434. StaticCallOperand(op, cellScope.constructor);
  10435. Emit(Call(position,op.op,0));
  10436. END;
  10437. END;
  10438. END;
  10439. InitVariables(scope);
  10440. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10441. GetCodeSectionNameForSymbol(procedure, name);
  10442. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10443. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10444. IF ProtectModulesPointers THEN
  10445. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10446. ELSE
  10447. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10448. END;
  10449. IntermediateCode.SetOffset(right,offset); (* tag *)
  10450. IntermediateCode.InitMemory(left,addressType,fp,0);
  10451. Emit(Mov(position, left, right));
  10452. END;
  10453. IF HasPointers (procedure.procedureScope) & backend.writeBarriers THEN ResetVariables2(procedure.procedureScope,TRUE) END;
  10454. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10455. ParameterCopies(procedureType);
  10456. IF x.code = NIL THEN
  10457. VisitStatementBlock(x);
  10458. ELSE
  10459. VisitCode(x.code)
  10460. END;
  10461. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10462. IF ~backend.cooperative THEN
  10463. ProfilerEnterExit(numberProcedures,FALSE);
  10464. END;
  10465. INC(numberProcedures);
  10466. END;
  10467. END;
  10468. IF backend.cooperative THEN
  10469. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10470. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10471. END;
  10472. IF x # NIL THEN
  10473. SELF.position := x.position;
  10474. END;
  10475. CheckRegistersFree();
  10476. ASSERT(modifyAssignmentCounter = 0);
  10477. currentScope := prevScope;
  10478. IF Trace THEN TraceExit("Body") END;
  10479. END Body;
  10480. END ImplementationVisitor;
  10481. MetaDataGenerator=OBJECT
  10482. VAR
  10483. implementationVisitor: ImplementationVisitor;
  10484. declarationVisitor: DeclarationVisitor;
  10485. module: Sections.Module;
  10486. moduleName: ARRAY 128 OF CHAR;
  10487. moduleNamePool: Basic.HashTableInt;
  10488. moduleNamePoolSection: IntermediateCode.Section;
  10489. modulePointerSection: IntermediateCode.Section;
  10490. modulePointerSizePC: LONGINT;
  10491. modulePointerSectionOffset: LONGINT;
  10492. modulePointers: LONGINT;
  10493. simple: BOOLEAN; (* simple = no module loading, no reflection *)
  10494. RecordBaseOffset: LONGINT;
  10495. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10496. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10497. TypeTags: LONGINT; (* type extension level support *)
  10498. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10499. patchInfoPC: LONGINT;
  10500. patchCRC: LONGINT;
  10501. CONST
  10502. EmptyBlockOffset = 2;
  10503. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10504. BEGIN
  10505. IF implementationVisitor.backend.cooperative THEN
  10506. TypeTags := MAX(LONGINT);
  10507. BaseTypesTableOffset := 0;
  10508. MethodTableOffset := 2;
  10509. TypeRecordBaseOffset := 0;
  10510. RecordBaseOffset := 0;
  10511. ELSIF simple THEN
  10512. TypeTags := 3; (* only 3 extensions allowed *)
  10513. BaseTypesTableOffset := 1;
  10514. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10515. TypeRecordBaseOffset := 0;
  10516. RecordBaseOffset := 1;
  10517. ELSE
  10518. TypeTags := 16;
  10519. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10520. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10521. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10522. (* change this when Heaps.HeapBlock is modified *)
  10523. IF implementationVisitor.system.addressType.sizeInBits = 64 THEN
  10524. RecordBaseOffset := 8; (* addresses *)
  10525. ELSE
  10526. RecordBaseOffset := 9; (* addresses *)
  10527. END;
  10528. END;
  10529. SELF.simple := simple;
  10530. SELF.implementationVisitor := implementationVisitor;
  10531. SELF.declarationVisitor := declarationVisitor;
  10532. implementationVisitor.meta := SELF;
  10533. declarationVisitor.meta := SELF;
  10534. END InitMetaDataGenerator;
  10535. PROCEDURE SetModule(module: Sections.Module);
  10536. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10537. BEGIN
  10538. SELF.module := module;
  10539. Global.GetModuleName(module.module,moduleName);
  10540. Global.GetSymbolSegmentedName(module.module, name);
  10541. IF ReflectionSupport & ~simple & ~implementationVisitor.backend.cooperative THEN
  10542. NEW(moduleNamePool, 32);
  10543. (*! require GC protection *)
  10544. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10545. IF ProtectModulesPointers THEN
  10546. name := "Heaps.AnyPtr";
  10547. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10548. (* set base pointer *)
  10549. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10550. END;
  10551. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10552. modulePointers := 0;
  10553. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10554. AddPointer(moduleNamePoolSection, namePoolOffset);
  10555. END;
  10556. END SetModule;
  10557. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10558. BEGIN
  10559. IF ~implementationVisitor.backend.cooperative THEN
  10560. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  10561. INC(modulePointers);
  10562. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10563. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10564. END;
  10565. END AddPointer;
  10566. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10567. BEGIN
  10568. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10569. END GetTypeRecordBaseOffset;
  10570. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10571. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10572. BEGIN
  10573. (* change this when Heaps.HeapBlock is modified *)
  10574. INC(dataAdrOffset,7);
  10575. Info(section,"headerAdr");
  10576. Address(section,0);
  10577. Info(section,"typeDesc");
  10578. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10579. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10580. NamedSymbol(section, name, symbol, 0, offset);
  10581. Info(section,"mark: LONGINT;");
  10582. Longint(section,-1);
  10583. Info(section,"refCount: LONGINT;");
  10584. Longint(section,0);
  10585. (*
  10586. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10587. *)
  10588. Info(section,"dataAdr-: ADDRESS");
  10589. Symbol(section,section, dataAdrOffset,0);
  10590. Info(section,"size-: SIZE");
  10591. Address(section,0);
  10592. Info(section,"nextMark: HeapBlock;");
  10593. Address(section,0);
  10594. END HeapBlock;
  10595. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10596. VAR i: LONGINT;
  10597. BEGIN
  10598. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10599. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10600. Info(section,"count*: LONGINT");
  10601. Longint(section,0);
  10602. Info(section,"locked*: BOOLEAN");
  10603. Longint(section,0);
  10604. Info(section,"awaitingLock*: ProcessQueue");
  10605. Address(section,0);
  10606. Address(section,0);
  10607. Info(section,"awaitingCond*: ProcessQueue");
  10608. Address(section,0);
  10609. Address(section,0);
  10610. Info(section,"lockedBy*: ANY");
  10611. Address(section,0);
  10612. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10613. Longint(section,1);
  10614. FOR i := 2 TO 6 DO
  10615. Longint(section,0);
  10616. END;
  10617. Info(section,"lock*: ANY");
  10618. Address(section,0);
  10619. END ProtectedHeapBlock;
  10620. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10621. BEGIN
  10622. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10623. END Info;
  10624. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10625. VAR op: IntermediateCode.Operand;
  10626. BEGIN
  10627. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10628. section.Emit(Data(Basic.invalidPosition,op));
  10629. END Address;
  10630. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10631. VAR op: IntermediateCode.Operand;
  10632. BEGIN
  10633. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10634. section.Emit(Data(Basic.invalidPosition,op));
  10635. END Size;
  10636. PROCEDURE Set(section: IntermediateCode.Section; value: Basic.Set);
  10637. VAR op: IntermediateCode.Operand;
  10638. BEGIN
  10639. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.setType),SYSTEM.VAL(Basic.Integer,value));
  10640. section.Emit(Data(Basic.invalidPosition,op));
  10641. END Set;
  10642. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10643. VAR op: IntermediateCode.Operand;
  10644. BEGIN
  10645. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10646. section.Emit(Data(Basic.invalidPosition,op));
  10647. END Longint;
  10648. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10649. VAR op,noOperand: IntermediateCode.Operand;
  10650. BEGIN
  10651. IntermediateCode.InitOperand(noOperand);
  10652. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10653. section.PatchOperands(pc,op,noOperand,noOperand);
  10654. END PatchAddress;
  10655. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10656. VAR op,noOperand: IntermediateCode.Operand;
  10657. BEGIN
  10658. IntermediateCode.InitOperand(noOperand);
  10659. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10660. section.PatchOperands(pc,op,noOperand,noOperand);
  10661. END PatchSize;
  10662. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10663. VAR op,noOperand: IntermediateCode.Operand;
  10664. BEGIN
  10665. IntermediateCode.InitOperand(noOperand);
  10666. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10667. section.PatchOperands(pc,op,noOperand,noOperand);
  10668. END PatchLongint;
  10669. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10670. VAR op, noOperand: IntermediateCode.Operand;
  10671. BEGIN
  10672. IntermediateCode.InitOperand(noOperand);
  10673. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10674. section.PatchOperands(pc,op,noOperand,noOperand);
  10675. END PatchSymbol;
  10676. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10677. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10678. BEGIN
  10679. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10680. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10681. section.Emit(Data(Basic.invalidPosition,op));
  10682. END Boolean;
  10683. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10684. VAR op: IntermediateCode.Operand;
  10685. BEGIN
  10686. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10687. section.Emit(Data(Basic.invalidPosition,op));
  10688. END Char;
  10689. PROCEDURE Integer(section: IntermediateCode.Section; int: LONGINT);
  10690. VAR op: IntermediateCode.Operand;
  10691. BEGIN
  10692. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.integerType),int);
  10693. section.Emit(Data(Basic.invalidPosition,op));
  10694. END Integer;
  10695. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10696. VAR i: LONGINT;
  10697. BEGIN
  10698. Info(section,str);
  10699. i := 0;
  10700. WHILE(str[i] # 0X) DO
  10701. Char(section,str[i]);
  10702. INC(i);
  10703. END;
  10704. Char(section,0X);
  10705. END String;
  10706. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10707. VAR s: Basic.SectionName;
  10708. BEGIN
  10709. StringPool.GetString(str, s);
  10710. String(section, s);
  10711. END String0;
  10712. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10713. VAR op: IntermediateCode.Operand;
  10714. BEGIN
  10715. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10716. IntermediateCode.SetOffset(op,realOffset);
  10717. section.Emit(Data(Basic.invalidPosition,op));
  10718. END NamedSymbol;
  10719. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10720. VAR op: IntermediateCode.Operand;
  10721. BEGIN
  10722. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10723. IntermediateCode.SetOffset(op,realOffset);
  10724. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10725. END NamedSymbolAt;
  10726. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10727. BEGIN
  10728. IF symbol= NIL THEN
  10729. Address( section, realOffset);
  10730. ASSERT(virtualOffset = 0);
  10731. ELSE
  10732. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10733. END;
  10734. END Symbol;
  10735. (* OutPointers delivers
  10736. {pointerOffset}
  10737. *)
  10738. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10739. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10740. BEGIN
  10741. type := type.resolved;
  10742. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10743. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10744. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10745. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10746. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10747. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10748. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10749. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10750. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10751. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10752. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10753. ELSIF (type IS SyntaxTree.RecordType) THEN
  10754. (* never treat a record like a pointer, even if the pointer field is set! *)
  10755. WITH type: SyntaxTree.RecordType DO
  10756. base := type.GetBaseRecord();
  10757. IF base # NIL THEN
  10758. Pointers(offset,symbol,section, base,numberPointers);
  10759. END;
  10760. variable := type.recordScope.firstVariable;
  10761. WHILE(variable # NIL) DO
  10762. IF ~(variable.untraced) THEN
  10763. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10764. END;
  10765. variable := variable.nextVariable;
  10766. END;
  10767. END;
  10768. ELSIF (type IS SyntaxTree.CellType) THEN
  10769. WITH type: SyntaxTree.CellType DO
  10770. base := type.GetBaseRecord();
  10771. IF base # NIL THEN
  10772. Pointers(offset,symbol,section, base,numberPointers);
  10773. END;
  10774. variable := type.cellScope.firstVariable;
  10775. WHILE(variable # NIL) DO
  10776. IF ~(variable.untraced) THEN
  10777. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10778. END;
  10779. variable := variable.nextVariable;
  10780. END;
  10781. property := type.firstProperty;
  10782. WHILE(property # NIL) DO
  10783. IF ~(property.untraced) THEN
  10784. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10785. END;
  10786. property := property.nextProperty;
  10787. END;
  10788. parameter := type.firstParameter;
  10789. WHILE(parameter # NIL) DO
  10790. IF ~(parameter.untraced) THEN
  10791. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10792. END;
  10793. parameter := parameter.nextParameter;
  10794. END;
  10795. END;
  10796. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10797. WITH type: SyntaxTree.ArrayType DO
  10798. IF type.form= SyntaxTree.Static THEN
  10799. n := type.staticLength;
  10800. base := type.arrayBase.resolved;
  10801. WHILE(base IS SyntaxTree.ArrayType) DO
  10802. type := base(SyntaxTree.ArrayType);
  10803. n := n* type.staticLength;
  10804. base := type.arrayBase.resolved;
  10805. END;
  10806. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10807. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  10808. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10809. FOR i := 0 TO n-1 DO
  10810. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10811. END;
  10812. END;
  10813. ELSE
  10814. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10815. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10816. END;
  10817. END;
  10818. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10819. WITH type: SyntaxTree.MathArrayType DO
  10820. IF type.form = SyntaxTree.Static THEN
  10821. n := type.staticLength;
  10822. base := type.arrayBase.resolved;
  10823. WHILE(base IS SyntaxTree.MathArrayType) DO
  10824. type := base(SyntaxTree.MathArrayType);
  10825. n := n* type.staticLength;
  10826. base := type.arrayBase.resolved;
  10827. END;
  10828. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10829. IF SemanticChecker.ContainsPointer(base) THEN
  10830. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10831. FOR i := 0 TO n-1 DO
  10832. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10833. END;
  10834. END;
  10835. ELSE
  10836. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10837. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10838. END
  10839. END;
  10840. (* ELSE no pointers in type *)
  10841. END;
  10842. END Pointers;
  10843. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10844. VAR position,i: LONGINT; ch: CHAR;
  10845. BEGIN
  10846. IF pool.Has(index) THEN
  10847. RETURN pool.GetInt(index)
  10848. ELSE
  10849. position := source.pc;
  10850. pool.PutInt(index, position);
  10851. Info(source, name);
  10852. i := 0;
  10853. REPEAT
  10854. ch := name[i]; INC(i);
  10855. Char( source, ch);
  10856. UNTIL ch = 0X;
  10857. END;
  10858. RETURN position;
  10859. END EnterDynamicName;
  10860. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10861. VAR name: Basic.SectionName; position: LONGINT;
  10862. BEGIN
  10863. IF pool.Has(index) THEN
  10864. RETURN pool.GetInt(index)
  10865. ELSE
  10866. StringPool.GetString(index, name);
  10867. position := EnterDynamicName(source,name,index, pool);
  10868. END;
  10869. RETURN position;
  10870. END DynamicName;
  10871. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10872. VAR section: IntermediateCode.Section;
  10873. BEGIN
  10874. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10875. IF implementationVisitor.backend.cooperative THEN
  10876. Info(section, "TypeDescriptor");
  10877. Basic.ToSegmentedName("BaseTypes.Array", name);
  10878. NamedSymbol(section, name,NIL, 0, 0);
  10879. BasePointer(section);
  10880. offset := 0;
  10881. ELSE
  10882. IF ProtectModulesPointers THEN
  10883. HeapBlock(mName,typeName,section,2);
  10884. END;
  10885. Info(section, "HeapBlock");
  10886. IF ProtectModulesPointers THEN
  10887. Symbol(section,section,2,0);
  10888. ELSE
  10889. Address(section,0);
  10890. END;
  10891. Info(section, "TypeDescriptor");
  10892. Address(section,0);
  10893. offset := section.pc;
  10894. END;
  10895. RETURN section
  10896. END NamedBlock;
  10897. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10898. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10899. BEGIN
  10900. COPY(moduleName,name);
  10901. Strings.Append(name,suffix);
  10902. Basic.ToSegmentedName(name, pooledName);
  10903. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10904. END Block;
  10905. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10906. VAR name: Basic.SegmentedName;
  10907. BEGIN
  10908. Info(source,"ArrayHeader");
  10909. IF implementationVisitor.backend.cooperative THEN
  10910. sizePC := source.pc;
  10911. Address(source,0);
  10912. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10913. IF baseType # "" THEN
  10914. Basic.ToSegmentedName(baseType, name);
  10915. NamedSymbol(source, name,NIL, 0, 0);
  10916. ELSE
  10917. Address(source,0);
  10918. END;
  10919. Address(source,0);
  10920. ELSE
  10921. Address(source,0);
  10922. Address(source,0);
  10923. (* first pointer for GC *)
  10924. IF hasPointer THEN
  10925. (* points to first element in the array, this is NOT the base type descriptor *)
  10926. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  10927. ELSE
  10928. Address(source,0);
  10929. END;
  10930. sizePC := source.pc;
  10931. Address(source,0);
  10932. Info(source,"array data");
  10933. END;
  10934. END ArrayBlock;
  10935. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10936. BEGIN
  10937. IF implementationVisitor.backend.cooperative THEN
  10938. PatchSize(section, pc, size);
  10939. PatchSize(section, pc + 3, size);
  10940. ELSE
  10941. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  10942. PatchSize(section, pc, size);
  10943. END;
  10944. END PatchArray;
  10945. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10946. VAR
  10947. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10948. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10949. poolMap: Basic.HashTableInt;
  10950. namePool: IntermediateCode.Section;
  10951. namePoolOffset: LONGINT;
  10952. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10953. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10954. BEGIN
  10955. Basic.SegmentedNameToString(s1.name,n1);
  10956. Basic.SegmentedNameToString(s2.name,n2);
  10957. index := 0;
  10958. ch1 := n1[index];
  10959. ch2 := n2[index];
  10960. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10961. INC(index);
  10962. ch1 := n1[index];
  10963. ch2 := n2[index];
  10964. END;
  10965. RETURN ch1 < ch2;
  10966. END Compare;
  10967. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10968. VAR
  10969. i, j: LONGINT;
  10970. x, t: Sections.Section;
  10971. BEGIN
  10972. IF lo < hi THEN
  10973. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10974. WHILE i <= j DO
  10975. WHILE Compare(list[i], x) DO INC(i) END;
  10976. WHILE Compare(x, list[j]) DO DEC(j) END;
  10977. IF i <= j THEN
  10978. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10979. INC(i); DEC(j)
  10980. END
  10981. END;
  10982. IF lo < j THEN QuickSort(list, lo, j) END;
  10983. IF i < hi THEN QuickSort(list, i, hi) END
  10984. END;
  10985. END QuickSort;
  10986. (*
  10987. ExportDesc* = RECORD
  10988. fp*: ADDRESS;
  10989. name* {UNTRACED}: DynamicName;
  10990. adr*: ADDRESS;
  10991. exports*: LONGINT;
  10992. dsc* {UNTRACED}: ExportArray
  10993. END;
  10994. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10995. *)
  10996. PROCEDURE ExportDesc2(
  10997. source: IntermediateCode.Section;
  10998. namePool: IntermediateCode.Section;
  10999. fingerPrinter: FingerPrinter.FingerPrinter;
  11000. symbol: Sections.Section;
  11001. name: StringPool.Index;
  11002. VAR patchAdr: LONGINT
  11003. ): BOOLEAN;
  11004. VAR fingerPrint: SyntaxTree.FingerPrint;
  11005. BEGIN
  11006. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  11007. & (symbol.type # Sections.InlineCodeSection)
  11008. THEN
  11009. *)
  11010. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection)
  11011. & (symbol.type # Sections.ExitCodeSection)
  11012. & (symbol.type # Sections.InlineCodeSection))
  11013. THEN
  11014. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  11015. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  11016. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  11017. Longint(source,fingerPrint.public);
  11018. ELSE
  11019. Longint(source, 0);
  11020. END;
  11021. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  11022. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  11023. Symbol(source, symbol,0,0);
  11024. patchAdr := source.pc;
  11025. Longint(source, 0);
  11026. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  11027. Address(source,0);
  11028. END;
  11029. RETURN TRUE
  11030. ELSE
  11031. RETURN FALSE
  11032. END;
  11033. END ExportDesc2;
  11034. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  11035. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  11036. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  11037. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  11038. nextPatch: LONGINT;
  11039. TYPE
  11040. Scope = RECORD
  11041. elements: LONGINT;
  11042. gelements: LONGINT;
  11043. section: IntermediateCode.Section;
  11044. patchAdr: LONGINT;
  11045. arraySizePC: LONGINT;
  11046. beginPC: LONGINT; (* current scope start pc *)
  11047. END;
  11048. BEGIN
  11049. Basic.InitSegmentedName(prev);
  11050. olevel := -1;
  11051. scopes[0].section := source;
  11052. scopes[0].arraySizePC := MIN(LONGINT);
  11053. FOR s := 0 TO LEN(sections)-1 DO
  11054. symbol := sections[s];
  11055. 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
  11056. this := sections[s].name;
  11057. level := 0;
  11058. WHILE (level < LEN(this)) & (this[level] > 0) DO
  11059. WHILE (level < LEN(this)) & (this[level] > 0) & (prev[level] = this[level]) DO
  11060. INC(level);
  11061. END;
  11062. WHILE level < olevel DO
  11063. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11064. IF olevel > 0 THEN
  11065. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11066. nextPatch := scopes[olevel-1].patchAdr+1;
  11067. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11068. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11069. END;
  11070. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11071. DEC(olevel);
  11072. END;
  11073. IF (level < LEN(this)) & (this[level] > 0) THEN
  11074. IF level > olevel THEN
  11075. (*TRACE("opening",level); *)
  11076. IF scopes[level].section = NIL THEN
  11077. arrayName := ".@ExportArray";
  11078. Strings.AppendInt(arrayName, level);
  11079. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  11080. AddPointer(scopes[level].section,offset);
  11081. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  11082. END;
  11083. scopes[level].beginPC := scopes[level].section.pc;
  11084. olevel := level;
  11085. scopes[olevel].elements := 0;
  11086. END;
  11087. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  11088. sym := sections[s];
  11089. ELSE
  11090. sym := NIL;
  11091. END;
  11092. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  11093. THEN
  11094. INC(scopes[olevel].elements);
  11095. END;
  11096. (* enter string in scope *)
  11097. INC(level);
  11098. END;
  11099. END;
  11100. Basic.SegmentedNameToString(this, name);
  11101. prev := this;
  11102. END;
  11103. END;
  11104. WHILE 0 <= olevel DO
  11105. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11106. IF olevel > 0 THEN
  11107. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11108. nextPatch := scopes[olevel-1].patchAdr+1;
  11109. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11110. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11111. END;
  11112. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11113. DEC(olevel);
  11114. END;
  11115. level := 0;
  11116. WHILE (level < LEN(scopes)) DO
  11117. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  11118. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  11119. END;
  11120. INC(level);
  11121. END;
  11122. END Export;
  11123. BEGIN
  11124. NEW(fingerPrinter);
  11125. NEW(poolMap, 64);
  11126. (* 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 *)
  11127. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  11128. NEW(sectionArray, module.allSections.Length());
  11129. FOR i := 0 TO module.allSections.Length() - 1 DO
  11130. section := module.allSections.GetSection(i);
  11131. sectionArray[i] := section;
  11132. END;
  11133. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  11134. Export(sectionArray^);
  11135. END ExportDesc;
  11136. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  11137. VAR
  11138. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  11139. BEGIN
  11140. Info(source, "exception table offsets array descriptor");
  11141. size := 0;
  11142. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  11143. Info(source, "exception table content");
  11144. FOR i := 0 TO module.allSections.Length() - 1 DO
  11145. p := module.allSections.GetSection(i);
  11146. IF p.type = Sections.CodeSection THEN
  11147. finallyPC := p(IntermediateCode.Section).finally;
  11148. IF finallyPC>=0 THEN
  11149. Symbol( source, p, 0,0);
  11150. Symbol( source, p, finallyPC, 0);
  11151. Symbol( source, p, finallyPC,0);
  11152. INC(size);
  11153. END;
  11154. END
  11155. END;
  11156. PatchArray(source,sizePC,size);
  11157. END ExceptionArray;
  11158. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  11159. VAR i: LONGINT; ch: CHAR;
  11160. BEGIN
  11161. i := 0;
  11162. REPEAT
  11163. ch := name[i]; INC(i);
  11164. Char( section, ch);
  11165. UNTIL ch = 0X;
  11166. WHILE i < 32 DO
  11167. Char( section, 0X); INC(i);
  11168. END;
  11169. END Name;
  11170. PROCEDURE References(section: IntermediateCode.Section);
  11171. CONST
  11172. sfTypeNone = 0X;
  11173. sfTypeCHAR = 01X;
  11174. sfTypeCHAR8 = 02X;
  11175. sfTypeCHAR16 = 03X;
  11176. sfTypeCHAR32 = 04X;
  11177. sfTypeRANGE = 05X;
  11178. sfTypeSHORTINT = 06X;
  11179. sfTypeINTEGER = 07X;
  11180. sfTypeLONGINT = 08X;
  11181. sfTypeHUGEINT = 09X;
  11182. sfTypeWORD = 0AX;
  11183. sfTypeLONGWORD = 0BX;
  11184. sfTypeSIGNED8 = 0CX;
  11185. sfTypeSIGNED16 = 0DX;
  11186. sfTypeSIGNED32 = 0EX;
  11187. sfTypeSIGNED64 = 0FX;
  11188. sfTypeUNSIGNED8 = 10X;
  11189. sfTypeUNSIGNED16 = 11X;
  11190. sfTypeUNSIGNED32 = 12X;
  11191. sfTypeUNSIGNED64 = 13X;
  11192. sfTypeREAL = 14X;
  11193. sfTypeLONGREAL = 15X;
  11194. sfTypeCOMPLEX = 16X;
  11195. sfTypeLONGCOMPLEX = 17X;
  11196. sfTypeBOOLEAN = 18X;
  11197. sfTypeSET = 19X;
  11198. sfTypeANY = 1AX;
  11199. sfTypeOBJECT = 1BX;
  11200. sfTypeBYTE = 1CX;
  11201. sfTypeADDRESS = 1DX;
  11202. sfTypeSIZE = 1EX;
  11203. sfTypeIndirect = 1FX;
  11204. sfTypeRecord = 20X;
  11205. sfTypePointerToRecord = 21X;
  11206. sfTypePointerToArray = 22X;
  11207. sfTypeOpenArray = 23X;
  11208. sfTypeStaticArray = 24X;
  11209. sfTypeDynamicArray = 25X;
  11210. sfTypeMathStaticArray = 26X;
  11211. sfTypeMathOpenArray = 27X;
  11212. sfTypeMathTensor = 28X;
  11213. sfTypeProcedure = 29X;
  11214. sfTypeDelegate = 2AX;
  11215. sfTypeENUM = 2BX;
  11216. sfTypeCELL = 2CX;
  11217. sfTypePORT = 2DX;
  11218. sfIN = 0X;
  11219. sfOUT = 1X;
  11220. flagDelegate = 0;
  11221. flagConstructor = 1;
  11222. (* variable / parameter addressing modes *)
  11223. sfAbsolute = 0X; (* global vars *)
  11224. sfRelative = 1X; (* variables, value parameters *)
  11225. sfIndirect = 2X; (* var parameters *)
  11226. sfScopeBegin = 0F0X;
  11227. sfScopeEnd = 0F1X;
  11228. sfProcedure = 0F2X;
  11229. sfVariable = 0F3X;
  11230. sfTypeDeclaration = 0F4X;
  11231. sfModule = 0FFX;
  11232. RefInfo = TRUE;
  11233. VAR
  11234. s: Sections.Section; sizePC, i, startPC, lastOffset: LONGINT;
  11235. indirectTypes: Basic.HashTable;
  11236. PROCEDURE CurrentIndex(): LONGINT;
  11237. VAR i: LONGINT;
  11238. BEGIN
  11239. FOR i := startPC TO section.pc -1 DO
  11240. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  11241. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  11242. END;
  11243. startPC := section.pc;
  11244. RETURN lastOffset;
  11245. END CurrentIndex;
  11246. (*
  11247. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11248. Module = sfModule prevSymbol:SIZE name:String Scope.
  11249. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11250. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  11251. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11252. Type =
  11253. sfTypePointerToRecord
  11254. | sfTypePointerToArray Type
  11255. | sfTypeOpenArray Type
  11256. | sfTypeDynamicArray Type
  11257. | sfTypeStaticArray length:SIZE Type
  11258. | sfTypeMathOpenArray Type
  11259. | sfTypeMathStaticArray length:SIZE Type
  11260. | sfTypeMathTensor Type
  11261. | sfTypeRecord tdAdr:ADDRESS
  11262. | sfTypeProcedure {Parameter} return:Type
  11263. | sfTypeDelegate {Parameter} return:Type
  11264. | sfTypePort (sfIN | sfOUT)
  11265. | sfTypeBOOLEAN
  11266. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  11267. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  11268. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  11269. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  11270. | sfTypeWORD | sfTypeLONGWORD
  11271. | sfTypeREAL | sfTypeLONGREAL
  11272. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  11273. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  11274. | sfTypeIndirect offset:SIZE.
  11275. *)
  11276. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  11277. VAR offset: SIZE;
  11278. BEGIN
  11279. IF indirectTypes.Has(type) THEN
  11280. offset := indirectTypes.GetInt(type);
  11281. Char(section, sfTypeIndirect);
  11282. Size(section, offset);
  11283. RETURN TRUE;
  11284. ELSE
  11285. indirectTypes.PutInt(type, CurrentIndex());
  11286. RETURN FALSE;
  11287. END;
  11288. END Indirect;
  11289. PROCEDURE NType(type: SyntaxTree.Type);
  11290. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  11291. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  11292. BEGIN
  11293. IF type = NIL THEN
  11294. Char(section, sfTypeNone)
  11295. ELSE
  11296. type := type.resolved;
  11297. size := type.sizeInBits;
  11298. WITH type:SyntaxTree.PointerType DO
  11299. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11300. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11301. Char(section, sfTypePointerToRecord);
  11302. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11303. ELSE
  11304. IF RefInfo THEN Info(section,"PointerToArray") END;
  11305. Char(section, sfTypePointerToArray);
  11306. NType(type.pointerBase);
  11307. END;
  11308. | type: SyntaxTree.ArrayType DO
  11309. IF ~Indirect(type) THEN
  11310. IF type.form = SyntaxTree.Open THEN
  11311. IF RefInfo THEN Info(section,"OpenArray") END;
  11312. Char(section, sfTypeOpenArray);
  11313. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11314. IF RefInfo THEN Info(section,"DynamicArray") END;
  11315. Char(section, sfTypeDynamicArray);
  11316. ELSIF type.form = SyntaxTree.Static THEN
  11317. IF RefInfo THEN Info(section,"StaticArray") END;
  11318. Char(section, sfTypeStaticArray);
  11319. Size(section, type.staticLength);
  11320. ELSE
  11321. HALT(100);
  11322. END;
  11323. NType(type.arrayBase);
  11324. END;
  11325. | type: SyntaxTree.MathArrayType DO
  11326. IF ~Indirect(type) THEN
  11327. IF type.form = SyntaxTree.Open THEN
  11328. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11329. Char(section, sfTypeMathOpenArray);
  11330. ELSIF type.form = SyntaxTree.Static THEN
  11331. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11332. Char(section, sfTypeMathStaticArray);
  11333. Size(section, type.staticLength);
  11334. ELSIF type.form = SyntaxTree.Tensor THEN
  11335. IF RefInfo THEN Info(section,"MathTensor") END;
  11336. Char(section, sfTypeMathTensor);
  11337. ELSE
  11338. HALT(100);
  11339. END;
  11340. NType(type.arrayBase);
  11341. END;
  11342. | type: SyntaxTree.RecordType DO
  11343. IF ~Indirect(type) THEN
  11344. IF type.pointerType # NIL (* OBJECT *) THEN
  11345. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11346. Char(section, sfTypePointerToRecord)
  11347. ELSE
  11348. IF RefInfo THEN Info(section,"Record") END;
  11349. Char(section, sfTypeRecord);
  11350. td := type.typeDeclaration;
  11351. IF RefInfo THEN Info(section,"TD") END;
  11352. IF (td # NIL) THEN
  11353. Global.GetSymbolSegmentedName(td,segmentedName);
  11354. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11355. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11356. ELSE
  11357. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11358. END;
  11359. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11360. Symbol(section, tir, 0, offset);
  11361. ELSE
  11362. Address(section, 0);
  11363. END;
  11364. END;
  11365. END;
  11366. | type: SyntaxTree.CellType DO
  11367. IF ~Indirect(type) THEN
  11368. IF RefInfo THEN Info(section,"Record") END;
  11369. Char(section, sfTypeRecord);
  11370. td := type.typeDeclaration;
  11371. IF RefInfo THEN Info(section,"TD") END;
  11372. IF (td # NIL) THEN
  11373. Global.GetSymbolSegmentedName(td,segmentedName);
  11374. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11375. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11376. ELSE
  11377. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11378. END;
  11379. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11380. Symbol(section, tir, 0, offset);
  11381. ELSE
  11382. Address(section, 0);
  11383. END;
  11384. END;
  11385. | type: SyntaxTree.PortType DO
  11386. Char(section, sfTypePORT);
  11387. IF type.direction = SyntaxTree.OutPort THEN
  11388. Char(section, sfOUT)
  11389. ELSE
  11390. Char(section, sfIN)
  11391. END;
  11392. | type: SyntaxTree.ProcedureType DO
  11393. IF ~Indirect(type) THEN
  11394. IF type.isDelegate THEN
  11395. Char(section, sfTypeDelegate);
  11396. ELSE
  11397. Char(section, sfTypeProcedure);
  11398. END;
  11399. parameter := type.firstParameter;
  11400. WHILE(parameter # NIL) DO
  11401. NParameter(parameter, -1);
  11402. parameter := parameter.nextParameter;
  11403. END;
  11404. NType(type.returnType);
  11405. END;
  11406. | type:SyntaxTree.EnumerationType DO
  11407. Char(section, sfTypeENUM);
  11408. | type: SyntaxTree.BasicType DO
  11409. WITH type: SyntaxTree.BooleanType DO
  11410. IF RefInfo THEN Info(section,"Boolean") END;
  11411. Char(section, sfTypeBOOLEAN);
  11412. | type: SyntaxTree.CharacterType DO
  11413. IF type = module.system.characterType THEN
  11414. IF RefInfo THEN Info(section,"CHAR") END;
  11415. Char(section, sfTypeCHAR);
  11416. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11417. IF RefInfo THEN Info(section,"CHAR8") END;
  11418. Char(section, sfTypeCHAR8)
  11419. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11420. IF RefInfo THEN Info(section,"CHAR16") END;
  11421. Char(section, sfTypeCHAR16);
  11422. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11423. IF RefInfo THEN Info(section,"CHAR32") END;
  11424. Char(section, sfTypeCHAR32);
  11425. ELSE
  11426. HALT(100);
  11427. END;
  11428. |type: SyntaxTree.IntegerType DO
  11429. IF type(SyntaxTree.IntegerType).signed THEN
  11430. IF (type = module.system.shortintType) THEN
  11431. IF RefInfo THEN Info(section,"SHORTINT") END;
  11432. Char(section, sfTypeSHORTINT)
  11433. ELSIF (type = module.system.integerType) THEN
  11434. IF RefInfo THEN Info(section,"INTEGER") END;
  11435. Char(section, sfTypeINTEGER)
  11436. ELSIF (type = module.system.longintType) THEN
  11437. IF RefInfo THEN Info(section,"LONGINT") END;
  11438. Char(section, sfTypeLONGINT)
  11439. ELSIF (type = module.system.hugeintType) THEN
  11440. IF RefInfo THEN Info(section,"HUGEINT") END;
  11441. Char(section, sfTypeHUGEINT)
  11442. ELSIF (type = module.system.wordType) THEN
  11443. IF RefInfo THEN Info(section,"WORD") END;
  11444. Char(section, sfTypeWORD)
  11445. ELSIF (type = module.system.longWordType) THEN
  11446. IF RefInfo THEN Info(section,"LONGWORD") END;
  11447. Char(section, sfTypeLONGWORD);
  11448. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11449. IF RefInfo THEN Info(section,"SIGNED8") END;
  11450. Char(section, sfTypeSIGNED8)
  11451. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11452. IF RefInfo THEN Info(section,"SIGNED16") END;
  11453. Char(section, sfTypeSIGNED16)
  11454. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11455. IF RefInfo THEN Info(section,"SIGNED32") END;
  11456. Char(section, sfTypeSIGNED32)
  11457. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11458. IF RefInfo THEN Info(section,"SIGNED64") END;
  11459. Char(section, sfTypeSIGNED64)
  11460. ELSE
  11461. HALT(100);
  11462. END
  11463. ELSE (* unsigned *)
  11464. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11465. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11466. Char(section, sfTypeUNSIGNED8)
  11467. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11468. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11469. Char(section, sfTypeUNSIGNED16)
  11470. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11471. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11472. Char(section, sfTypeUNSIGNED32)
  11473. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11474. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11475. Char(section, sfTypeUNSIGNED64)
  11476. ELSE
  11477. HALT(100)
  11478. END
  11479. END;
  11480. | type: SyntaxTree.FloatType DO
  11481. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11482. IF RefInfo THEN Info(section,"REAL") END;
  11483. Char(section, sfTypeREAL);
  11484. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11485. IF RefInfo THEN Info(section,"LONGREAL") END;
  11486. Char(section, sfTypeLONGREAL);
  11487. ELSE
  11488. HALT(100);
  11489. END;
  11490. |type: SyntaxTree.ComplexType DO
  11491. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11492. IF RefInfo THEN Info(section,"COMPLEX") END;
  11493. Char(section, sfTypeCOMPLEX);
  11494. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11495. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11496. Char(section, sfTypeLONGCOMPLEX);
  11497. ELSE
  11498. HALT(100);
  11499. END;
  11500. |type:SyntaxTree.SetType DO
  11501. IF RefInfo THEN Info(section,"SET") END;
  11502. Char(section, sfTypeSET);
  11503. |type:SyntaxTree.AnyType DO
  11504. IF RefInfo THEN Info(section,"ANY") END;
  11505. Char(section, sfTypeANY);
  11506. |type:SyntaxTree.ObjectType DO
  11507. IF RefInfo THEN Info(section,"OBJECT") END;
  11508. Char(section, sfTypeOBJECT);
  11509. |type:SyntaxTree.ByteType DO
  11510. IF RefInfo THEN Info(section,"BYTE") END;
  11511. Char(section, sfTypeBYTE);
  11512. |type:SyntaxTree.RangeType DO
  11513. IF RefInfo THEN Info(section,"RANGE") END;
  11514. Char(section, sfTypeRANGE)
  11515. |type:SyntaxTree.AddressType DO
  11516. IF RefInfo THEN Info(section,"ADDRESS") END;
  11517. Char(section, sfTypeADDRESS)
  11518. |type:SyntaxTree.SizeType DO
  11519. IF RefInfo THEN Info(section,"SIZE") END;
  11520. Char(section, sfTypeSIZE)
  11521. ELSE
  11522. HALT(100)
  11523. END;
  11524. ELSE HALT(101);
  11525. END;
  11526. END;
  11527. END NType;
  11528. (*
  11529. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11530. *)
  11531. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11532. VAR pos: LONGINT; type: SyntaxTree.Type;
  11533. BEGIN
  11534. IF RefInfo THEN Info(section, "Parameter") END;
  11535. Char(section, sfVariable);
  11536. Size(section, procOffset);
  11537. String0(section, parameter.name);
  11538. type := parameter.type.resolved;
  11539. IF parameter.kind = SyntaxTree.VarParameter THEN
  11540. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11541. ELSE Char(section, sfIndirect)
  11542. END;
  11543. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11544. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11545. Char(section, sfIndirect);
  11546. ELSE
  11547. Char(section, sfRelative);
  11548. END;
  11549. ELSE
  11550. Char(section, sfRelative);
  11551. END;
  11552. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11553. NType(parameter.type);
  11554. END NParameter;
  11555. (*
  11556. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11557. *)
  11558. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11559. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11560. flags: SET;
  11561. BEGIN
  11562. IF procedure.externalName # NIL THEN RETURN END;
  11563. IF RefInfo THEN Info(section, "Procedure") END;
  11564. pos := CurrentIndex();
  11565. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11566. Char(section, sfProcedure);
  11567. Size(section, scopeOffset);
  11568. String0(section,procedure.name);
  11569. s := module.allSections.FindBySymbol(procedure);
  11570. Symbol(section,s,0,0); (* start *)
  11571. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11572. flags := {};
  11573. IF procedureType.isDelegate THEN
  11574. INCL(flags, flagDelegate);
  11575. END;
  11576. IF procedure.isConstructor THEN
  11577. INCL(flags, flagConstructor);
  11578. END;
  11579. Set(section, flags);
  11580. IF RefInfo THEN Info(section, "Parameters") END;
  11581. parameter := procedureType.firstParameter;
  11582. WHILE(parameter # NIL) DO
  11583. NParameter(parameter, pos);
  11584. parameter := parameter.nextParameter;
  11585. END;
  11586. IF procedureType.returnParameter # NIL THEN
  11587. NParameter(procedureType.returnParameter, pos);
  11588. END;
  11589. IF procedureType.selfParameter # NIL THEN
  11590. NParameter(procedureType.selfParameter, pos);
  11591. END;
  11592. IF RefInfo THEN Info(section, "ReturnType") END;
  11593. NType(procedureType.returnType);
  11594. NScope(procedure.procedureScope, pos);
  11595. END NProcedure;
  11596. (*
  11597. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11598. *)
  11599. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11600. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11601. BEGIN
  11602. IF RefInfo THEN Info(section, "Variable") END;
  11603. pos := CurrentIndex();
  11604. Char(section, sfVariable);
  11605. Size(section, scopeOffset);
  11606. String0(section, variable.name);
  11607. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11608. Char(section, sfAbsolute);
  11609. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11610. NamedSymbol(section, sn,variable, 0,0);
  11611. ELSE
  11612. Char(section, sfRelative);
  11613. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11614. END;
  11615. NType(variable.type);
  11616. s := module.allSections.FindBySymbol(variable);
  11617. END NVariable;
  11618. (*
  11619. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11620. *)
  11621. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11622. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11623. BEGIN
  11624. IF typeDeclaration = NIL THEN RETURN END;
  11625. pos := CurrentIndex();
  11626. s := module.allSections.FindBySymbol(typeDeclaration);
  11627. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11628. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11629. Char(section, sfTypeDeclaration);
  11630. Size(section, scopeOffset);
  11631. String0(section, typeDeclaration.name);
  11632. declared := typeDeclaration.declaredType.resolved;
  11633. IF (declared IS SyntaxTree.PointerType) THEN
  11634. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11635. END;
  11636. WITH declared: SyntaxTree.RecordType DO
  11637. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11638. Symbol(section, s, 0, offset);
  11639. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11640. Basic.AppendToSegmentedName(name,".@Info");
  11641. s := module.allSections.FindByName(name);
  11642. IF s # NIL THEN (* does not work for coop *)
  11643. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11644. END;
  11645. NScope(declared.recordScope, pos);
  11646. |declared: SyntaxTree.CellType DO
  11647. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11648. Symbol(section, s, 0, offset);
  11649. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11650. Basic.AppendToSegmentedName(name,".@Info");
  11651. s := module.allSections.FindByName(name);
  11652. IF s # NIL THEN
  11653. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11654. END;
  11655. NScope(declared.cellScope, pos);
  11656. ELSE
  11657. Address(section, 0);
  11658. END;
  11659. END NTypeDeclaration;
  11660. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11661. VAR pos: LONGINT;
  11662. BEGIN
  11663. pos := CurrentIndex();
  11664. Char(section,sfModule);
  11665. Size(section, prevSymbol);
  11666. String0(section, module.name);
  11667. NScope(module.moduleScope, pos);
  11668. END NModule;
  11669. (*
  11670. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11671. *)
  11672. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11673. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration; pos: LONGINT;
  11674. BEGIN
  11675. IF scope = NIL THEN RETURN END;
  11676. IF RefInfo THEN Info(section, "Scope") END;
  11677. Char(section, sfScopeBegin);
  11678. variable := scope.firstVariable;
  11679. WHILE (variable # NIL) DO
  11680. NVariable(variable, prevSymbol);
  11681. variable := variable.nextVariable;
  11682. END;
  11683. WITH scope: SyntaxTree.ModuleScope DO
  11684. bodyProcedure := scope.bodyProcedure;
  11685. |scope: SyntaxTree.RecordScope DO
  11686. bodyProcedure := scope.bodyProcedure;
  11687. ELSE
  11688. bodyProcedure := NIL;
  11689. END;
  11690. IF bodyProcedure # NIL THEN
  11691. NProcedure(bodyProcedure, prevSymbol)
  11692. END;
  11693. procedure := scope.firstProcedure;
  11694. WHILE procedure # NIL DO
  11695. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11696. procedure := procedure.nextProcedure;
  11697. END;
  11698. typeDeclaration := scope.firstTypeDeclaration;
  11699. WHILE typeDeclaration # NIL DO
  11700. NTypeDeclaration(typeDeclaration, prevSymbol);
  11701. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11702. END;
  11703. Char(section, sfScopeEnd); (* scope ends *)
  11704. END NScope;
  11705. BEGIN
  11706. NEW(indirectTypes, 32);
  11707. ArrayBlock(section,sizePC,"", FALSE);
  11708. startPC := section.pc;
  11709. NModule(module.module, -1);
  11710. PatchArray(section,sizePC,CurrentIndex());
  11711. END References;
  11712. (*
  11713. Command* = RECORD
  11714. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11715. name*: Name; (* name of the procedure *)
  11716. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11717. entryAdr* : ADDRESS; (* entry address of procedure *)
  11718. END;
  11719. *)
  11720. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11721. VAR
  11722. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11723. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11724. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11725. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11726. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11727. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11728. BEGIN
  11729. RETURN
  11730. (type = NIL) OR
  11731. (type.resolved IS SyntaxTree.RecordType) OR
  11732. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11733. (type.resolved IS SyntaxTree.AnyType);
  11734. END TypeAllowed;
  11735. BEGIN
  11736. numberParameters := procedureType.numberParameters;
  11737. RETURN
  11738. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11739. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11740. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11741. END GetProcedureAllowed;
  11742. PROCEDURE WriteType(type : SyntaxTree.Type);
  11743. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11744. name: Basic.SegmentedName; offset: LONGINT;
  11745. BEGIN
  11746. IF type = NIL THEN
  11747. Address(source,0);
  11748. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11749. Address(source,1);
  11750. ELSE
  11751. type := type.resolved;
  11752. IF type IS SyntaxTree.PointerType THEN
  11753. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11754. END;
  11755. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11756. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11757. name[0] := typeDeclaration.name; name[1] := -1;
  11758. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11759. ASSERT(section # NIL);
  11760. ELSE
  11761. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11762. (* TODO *)
  11763. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11764. END;
  11765. IF implementationVisitor.backend.cooperative THEN
  11766. offset := 0;
  11767. ELSE
  11768. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11769. END;
  11770. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11771. END;
  11772. END WriteType;
  11773. BEGIN
  11774. Info(source, "command array descriptor");
  11775. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11776. numberCommands := 0;
  11777. Info(source, "command array content");
  11778. FOR i := 0 TO module.allSections.Length() - 1 DO
  11779. p := module.allSections.GetSection(i);
  11780. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11781. procedure := p.symbol(SyntaxTree.Procedure);
  11782. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11783. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11784. procedure.GetName(name);
  11785. Name(source,name);
  11786. numberParameters := procedureType.numberParameters;
  11787. (* offset of type of first parameter *)
  11788. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11789. ELSE WriteType(procedureType.firstParameter.type)
  11790. END;
  11791. (* offset of type of return parameter *)
  11792. WriteType(procedureType.returnType);
  11793. (* command name *)
  11794. (* command code offset *)
  11795. Symbol(source,p,0,0);
  11796. INC(numberCommands);
  11797. IF Trace THEN
  11798. D.Ln;
  11799. END;
  11800. END;
  11801. END
  11802. END;
  11803. PatchArray(source,sizePC,numberCommands);
  11804. END CommandArray;
  11805. (* to prevent from double import of different module aliases *)
  11806. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11807. VAR i: SyntaxTree.Import;
  11808. BEGIN
  11809. i := module.module.moduleScope.firstImport;
  11810. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11811. i := i.nextImport;
  11812. END;
  11813. RETURN i = import
  11814. END IsFirstDirectOccurence;
  11815. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11816. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11817. BEGIN
  11818. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11819. ArrayBlock(source,pc,"", FALSE);
  11820. Info(source, "import module array data");
  11821. IF implementationVisitor.backend.cooperative THEN
  11822. offset := 0;
  11823. ELSE
  11824. IF module.system.addressType.sizeInBits = 64 THEN
  11825. (* change this when Heaps.HeapBlock is modified *)
  11826. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11827. ELSE
  11828. (* change this when Heaps.HeapBlock is modified *)
  11829. offset := ToMemoryUnits(module.system, 23* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11830. END;
  11831. END;
  11832. import := module.module.moduleScope.firstImport;
  11833. numberImports := 0;
  11834. WHILE import # NIL DO
  11835. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11836. Global.GetModuleSegmentedName(import.module,name);
  11837. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11838. NamedSymbol(source, name, NIL, 0, offset);
  11839. INC(numberImports);
  11840. END;
  11841. import := import.nextImport
  11842. END;
  11843. PatchArray(source,pc,numberImports);
  11844. END ImportsArray;
  11845. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11846. VAR
  11847. p: Sections.Section; sizePC, size, i: LONGINT;
  11848. BEGIN
  11849. Info(source, "Type info section");
  11850. size := 0;
  11851. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11852. FOR i := 0 TO module.allSections.Length() - 1 DO
  11853. p := module.allSections.GetSection(i);
  11854. WITH p: IntermediateCode.Section DO
  11855. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11856. Symbol(source,p,EmptyBlockOffset,0);
  11857. INC(size);
  11858. END;
  11859. END
  11860. END;
  11861. PatchArray(source,sizePC,size);
  11862. END TypeInfoSection;
  11863. (*
  11864. ProcTableEntry* = RECORD
  11865. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11866. noPtr*: LONGINT;
  11867. END;
  11868. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11869. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11870. *)
  11871. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11872. VAR
  11873. numberPointers: LONGINT;
  11874. procedure: SyntaxTree.Procedure;
  11875. BEGIN
  11876. Info(section,"pcFrom");
  11877. Symbol(section,procedureSection,0,0);
  11878. Info(section,"pcTo");
  11879. Symbol(section, procedureSection, procedureSection.pc, 0);
  11880. Info(section,"pointer to offsets array");
  11881. Symbol(section, section,section.pc+1,0);
  11882. Info(section,"offsets array");
  11883. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11884. PointerArray(section, procedure.procedureScope, numberPointers);
  11885. END ProcedureDescriptor;
  11886. (* only for tracing, the descriptor is otherwise not complete ! *)
  11887. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11888. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; offset: LONGINT; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11889. BEGIN
  11890. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11891. name := procedureSection.name;
  11892. Basic.AppendToSegmentedName(name,".@Info");
  11893. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11894. Address(section,0);
  11895. Symbol(section,section,2,0);
  11896. (*
  11897. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11898. descSize: SIZE;
  11899. sentinel: ADDRESS; (* = MPO-4 *)
  11900. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11901. flags*: SET;
  11902. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11903. name*: Name;
  11904. END;
  11905. *)
  11906. Size(section, 0);
  11907. Address(section,0);
  11908. Address(section,0);
  11909. Set(section,{});
  11910. moduleSection := ModuleSection();
  11911. Symbol( section, moduleSection, moduleSection.pc,0);
  11912. IF procedureSection.symbol = NIL THEN
  11913. Basic.SegmentedNameToString(procedureSection.name, infoName);
  11914. ELSE
  11915. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  11916. END;
  11917. Name(section, infoName);
  11918. Size(section, 0);
  11919. RETURN section;
  11920. END MakeProcedureDescriptorTag;
  11921. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11922. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  11923. BEGIN
  11924. name := procedureSection.name;
  11925. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  11926. IF implementationVisitor.backend.cooperative THEN
  11927. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11928. Info(section, "TypeDescriptor");
  11929. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  11930. NamedSymbol(dest, name,NIL, 0, 0);
  11931. BaseRecord(dest);
  11932. offset := 0;
  11933. ELSIF CreateProcedureDescInfo THEN
  11934. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11935. Address(dest,0);
  11936. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  11937. offset := dest.pc;
  11938. ELSE
  11939. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  11940. END;
  11941. ProcedureDescriptor(dest, procedureSection);
  11942. Symbol(section, dest, offset, 0);
  11943. END ProcedureDescriptorPointer;
  11944. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  11945. VAR sizePC, i: LONGINT; destination: Sections.Section;
  11946. BEGIN
  11947. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  11948. numberProcs := 0;
  11949. FOR i := 0 TO module.allSections.Length() - 1 DO
  11950. destination := module.allSections.GetSection(i);
  11951. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11952. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  11953. INC(numberProcs);
  11954. END
  11955. END;
  11956. PatchArray(section, sizePC, numberProcs);
  11957. END ProcedureDescriptorArray;
  11958. (*
  11959. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11960. VAR
  11961. next*: Module; (** once a module is published, all fields are read-only *)
  11962. name*: Name;
  11963. init, published: BOOLEAN;
  11964. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11965. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  11966. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11967. command*: POINTER TO ARRAY OF Command;
  11968. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11969. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11970. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11971. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11972. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11973. data*, code*: Bytes;
  11974. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11975. export*: ExportDesc;
  11976. term*: TerminationHandler;
  11977. exTable*: ExceptionTable;
  11978. noProcs*: LONGINT;
  11979. firstProc*: ADDRESS; <- done by loader
  11980. maxPtrs*: LONGINT;
  11981. crc*: LONGINT;
  11982. *)
  11983. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11984. BEGIN
  11985. Info(section, "cycle");
  11986. Size(section,0);
  11987. Info(section, "references");
  11988. Size(section,0);
  11989. Info(section, "nextMarked");
  11990. Address(section,0);
  11991. Info(section, "nextWatched");
  11992. Address(section,0);
  11993. END BasePointer;
  11994. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11995. BEGIN
  11996. BasePointer(section);
  11997. Info(section, "action");
  11998. Address(section,0);
  11999. Info(section, "monitor");
  12000. Address(section,0);
  12001. END BaseObject;
  12002. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  12003. BEGIN
  12004. BasePointer(section);
  12005. Info(section, "action");
  12006. Address(section,0);
  12007. Info(section, "monitor");
  12008. Address(section,0);
  12009. END BaseRecord;
  12010. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  12011. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  12012. pooledName: Basic.SegmentedName;
  12013. symbol: SyntaxTree.Symbol;
  12014. BEGIN
  12015. Global.GetModuleName(module.module,name);
  12016. Strings.Append(name,".@Module.@Descriptor");
  12017. Basic.ToSegmentedName(name, pooledName);
  12018. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12019. Symbol(section,descriptorSection,0,0);
  12020. Info(descriptorSection, "descriptor");
  12021. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12022. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  12023. Address(descriptorSection,0);
  12024. Global.GetModuleName(module.module,name);
  12025. Strings.Append(name,".@Trace");
  12026. Basic.ToSegmentedName(name, pooledName);
  12027. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12028. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  12029. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12030. END ModuleDescriptor;
  12031. PROCEDURE ModuleSection(): IntermediateCode.Section;
  12032. VAR name: ARRAY 128 OF CHAR;
  12033. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  12034. symbol: SyntaxTree.Symbol;
  12035. BEGIN
  12036. Global.GetModuleName(module.module,name);
  12037. Strings.Append(name,".@Module");
  12038. Basic.ToSegmentedName(name, pooledName);
  12039. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12040. moduleSection.SetExported(TRUE);
  12041. IF moduleSection.pc = 0 THEN
  12042. IF implementationVisitor.backend.cooperative THEN
  12043. Info(moduleSection, "descriptor");
  12044. ModuleDescriptor(moduleSection);
  12045. BaseObject(moduleSection);
  12046. implementationVisitor.CreateTraceModuleMethod(module.module);
  12047. ELSE
  12048. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  12049. Info(moduleSection, "HeapBlock");
  12050. Symbol(moduleSection,moduleSection,2,0);
  12051. Info(moduleSection, "TypeDescriptor");
  12052. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12053. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  12054. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  12055. END;
  12056. END;
  12057. RETURN moduleSection;
  12058. END ModuleSection;
  12059. PROCEDURE NewModuleInfo();
  12060. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12061. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12062. sectionName: Basic.SectionName;
  12063. CONST MPO=-40000000H;
  12064. BEGIN
  12065. (*
  12066. TypeDesc* = POINTER TO RECORD
  12067. descSize: SIZE;
  12068. sentinel: LONGINT; (* = MPO-4 *)
  12069. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12070. flags*: SET;
  12071. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12072. name*: Name;
  12073. refsOffset: SIZE;
  12074. END;
  12075. *)
  12076. (*name is missing prefixes sometimes*)
  12077. Global.GetModuleSegmentedName(module.module,name);
  12078. Basic.AppendToSegmentedName(name,".@Info");
  12079. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12080. IF ~implementationVisitor.backend.cooperative THEN
  12081. Info(source, "HeapBlock");
  12082. Address(source,0); (* an empty heap block prevents GC marking *)
  12083. Info(source, "TypeDescriptor");
  12084. Address(source,0);
  12085. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12086. END;
  12087. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12088. Address(source,MPO-4);
  12089. Info(source, "type tag pointer");
  12090. Address( source,0);
  12091. Info(source, "type flags");
  12092. flags := {};
  12093. Set( source, flags);
  12094. Info(source, "pointer to module");
  12095. moduleSection := ModuleSection();
  12096. Symbol( source, moduleSection, moduleSection.pc,0);
  12097. Info(source, "type name");
  12098. i := 0;
  12099. sectionName := "@Self";
  12100. (*
  12101. Global.GetSymbolSegmentedName(td,name);
  12102. Basic.SegmentedNameToString(name, sectionName);
  12103. *)
  12104. Name(source,sectionName);
  12105. patchInfoPC := source.pc;
  12106. Size(source, 0);
  12107. END NewModuleInfo;
  12108. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  12109. VAR
  12110. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  12111. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  12112. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  12113. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, maxPointers, numberProcs,temp,
  12114. referenceSectionOffset : LONGINT;
  12115. name: Basic.SegmentedName; offset: LONGINT;
  12116. flags: SET;
  12117. BEGIN
  12118. NewModuleInfo();
  12119. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  12120. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  12121. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  12122. ImportsArray(importSection);
  12123. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  12124. CommandArray(commandsSection);
  12125. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  12126. ExceptionArray(exceptionSection);
  12127. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  12128. AddPointer(typeInfoSection, typeInfoSectionOffset);
  12129. TypeInfoSection(typeInfoSection);
  12130. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  12131. referenceSection.SetExported(TRUE);
  12132. References(referenceSection);
  12133. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  12134. ProcedureDescriptorArray(procTableSection, numberProcs);
  12135. IF ProtectModulesPointers THEN
  12136. name := "Heaps.AnyPtr";
  12137. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  12138. (* set base pointer *)
  12139. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  12140. END;
  12141. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  12142. ArrayBlock(emptyArraySection,temp,"", FALSE);
  12143. moduleSection := ModuleSection();
  12144. Info(moduleSection, "nextRoot*: RootObject");
  12145. Address(moduleSection,0);
  12146. Info(moduleSection, "next*: Module");
  12147. Address(moduleSection,0);
  12148. Info(moduleSection, "name*: Name");
  12149. Name(moduleSection,moduleName);
  12150. Info(moduleSection, "init, published: BOOLEAN");
  12151. Boolean(moduleSection,FALSE);
  12152. Boolean(moduleSection,FALSE);
  12153. Info(moduleSection,"filler"); (*! introduce alignment! *)
  12154. Boolean(moduleSection,FALSE);
  12155. Boolean(moduleSection,FALSE);
  12156. Info(moduleSection, "refcnt*: LONGINT");
  12157. Longint(moduleSection,0);
  12158. Info(moduleSection, "sb*: ADDRESS");
  12159. Address(moduleSection,0);
  12160. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  12161. Address(moduleSection,0);
  12162. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  12163. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  12164. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  12165. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  12166. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  12167. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  12168. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  12169. Symbol(moduleSection,importSection,importSectionOffset,0);
  12170. Info(moduleSection, "procTable*: ProcTable");
  12171. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  12172. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  12173. Address(moduleSection,0);
  12174. Address(moduleSection,0);
  12175. Address(moduleSection,0);
  12176. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  12177. Info(moduleSection, "export*: ExportDesc");
  12178. ExportDesc(moduleSection);
  12179. Info(moduleSection, "term*: TerminationHandler");
  12180. Address(moduleSection,0);
  12181. Info(moduleSection, "exTable*: ExceptionTable");
  12182. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  12183. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  12184. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  12185. Info(moduleSection, "crc*: LONGINT");
  12186. patchCRC:= moduleSection.pc;
  12187. Longint(moduleSection, 0); (*! must be implemented *)
  12188. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  12189. Info(moduleSection, "body*: ADDRESS");
  12190. Symbol(moduleSection, bodyProc, 0,0);
  12191. Info(moduleSection, "module flags");
  12192. flags := {};
  12193. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  12194. Set( moduleSection, flags);
  12195. IF implementationVisitor.backend.cooperative THEN
  12196. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  12197. Info(moduleSection, "monitor.owner");
  12198. Address(moduleSection,0);
  12199. Info(moduleSection, "monitor.nestingLevel");
  12200. Address(moduleSection,0);
  12201. Info(moduleSection, "monitor.blockedQueue");
  12202. Address(moduleSection,0); Address(moduleSection,0);
  12203. Info(moduleSection, "monitor.waitingQueue");
  12204. Address(moduleSection,0); Address(moduleSection,0);
  12205. Info(moduleSection, "monitor.waitingSentinel");
  12206. Address(moduleSection,0);
  12207. END;
  12208. END Module;
  12209. PROCEDURE PatchCRC(crc: LONGINT);
  12210. BEGIN
  12211. IF ~simple THEN
  12212. PatchLongint(ModuleSection(), patchCRC, crc);
  12213. END;
  12214. END PatchCRC;
  12215. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  12216. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  12217. BEGIN
  12218. ArrayBlock(source,pc,"",FALSE);
  12219. Info(source, "pointer offsets array data");
  12220. IF scope IS SyntaxTree.RecordScope THEN
  12221. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  12222. ELSIF scope IS SyntaxTree.CellScope THEN
  12223. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  12224. ELSIF scope IS SyntaxTree.ModuleScope THEN
  12225. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  12226. WHILE variable # NIL DO
  12227. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12228. symbol := module.allSections.FindBySymbol(variable);
  12229. ASSERT(symbol # NIL);
  12230. Pointers(0,symbol, source,variable.type,numberPointers);
  12231. END;
  12232. variable := variable.nextVariable;
  12233. END;
  12234. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  12235. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12236. WHILE parameter # NIL DO
  12237. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN (* immutable or variable parameters do not need tracing *)
  12238. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  12239. END;
  12240. parameter := parameter.nextParameter;
  12241. END;
  12242. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  12243. parametersSize := implementationVisitor.ProcParametersSize(scope(SyntaxTree.ProcedureScope).ownerProcedure);
  12244. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12245. IF implementationVisitor.backend.preciseGC THEN
  12246. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12247. END;
  12248. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  12249. END;
  12250. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  12251. WHILE(variable # NIL) DO
  12252. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12253. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  12254. END;
  12255. variable := variable.nextVariable
  12256. END;
  12257. END;
  12258. PatchArray(source,pc,numberPointers);
  12259. END PointerArray;
  12260. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  12261. VAR
  12262. name: Basic.SegmentedName;
  12263. section: IntermediateCode.Section;
  12264. BEGIN
  12265. Global.GetSymbolSegmentedName(symbol,name);
  12266. Basic.AppendToSegmentedName(name,suffix);
  12267. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL,declarationVisitor.dump);
  12268. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  12269. Info(section, "HeapBlock");
  12270. Address(section,0); (* empty such that GC does not go on traversing *)
  12271. Info(section, suffix);
  12272. Address(section,0);
  12273. pc := section.pc;
  12274. RETURN section;
  12275. END SymbolSection;
  12276. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  12277. VAR recordType: SyntaxTree.RecordType;
  12278. tir, tdInfo: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  12279. section: Sections.Section; cellType: SyntaxTree.CellType;
  12280. tdInfoOffset: LONGINT;
  12281. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  12282. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12283. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12284. sectionName: Basic.SectionName;
  12285. CONST MPO=-40000000H;
  12286. BEGIN
  12287. (*
  12288. TypeDesc* = POINTER TO RECORD
  12289. descSize: SIZE;
  12290. sentinel: LONGINT; (* = MPO-4 *)
  12291. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12292. flags*: SET;
  12293. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12294. name*: Name;
  12295. refsOffset: SIZE;
  12296. END;
  12297. *)
  12298. (* source := module.sections.FindByName(...) *)
  12299. Global.GetSymbolSegmentedName(td,name);
  12300. Basic.AppendToSegmentedName(name,".@Info");
  12301. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12302. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12303. Address(source,0);
  12304. Info(source, "TypeDescriptor");
  12305. Address(source,0);
  12306. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12307. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12308. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12309. Info(source, "type tag pointer");
  12310. Symbol( source, tag, offset, 0);
  12311. Info(source, "type flags");
  12312. flags := {};
  12313. IF isProtected THEN INCL(flags,31) END;
  12314. Set( source, flags);
  12315. Info(source, "pointer to module");
  12316. moduleSection := ModuleSection();
  12317. Symbol( source, moduleSection, moduleSection.pc,0);
  12318. Info(source, "type name");
  12319. i := 0;
  12320. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12321. (*
  12322. Global.GetSymbolSegmentedName(td,name);
  12323. Basic.SegmentedNameToString(name, sectionName);
  12324. *)
  12325. Name(source,sectionName);
  12326. Size(source, 0);
  12327. RETURN source;
  12328. END NewTypeDescriptorInfo;
  12329. PROCEDURE NewTypeDescriptor;
  12330. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12331. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12332. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12333. numberPointers: LONGINT; padding, i, tdInfoOffset: LONGINT;
  12334. CONST MPO=-40000000H;
  12335. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12336. VAR i: LONGINT;
  12337. PROCEDURE Td(record: SyntaxTree.RecordType);
  12338. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12339. BEGIN
  12340. IF record # NIL THEN
  12341. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12342. baseTD := record.typeDeclaration;
  12343. Global.GetSymbolSegmentedName(baseTD,name);
  12344. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12345. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12346. ELSE
  12347. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12348. END;
  12349. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12350. Symbol(source, tir, 0, offset);
  12351. IF reverse THEN Td(record.GetBaseRecord()) END;
  12352. END;
  12353. END Td;
  12354. BEGIN
  12355. Info(source, "tag table");
  12356. baseRecord := recordType;
  12357. i := 0;
  12358. WHILE baseRecord # NIL DO
  12359. INC(i);
  12360. baseRecord := baseRecord.GetBaseRecord();
  12361. END;
  12362. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12363. IF ~reverse THEN Td(recordType) END;
  12364. WHILE i < size DO
  12365. Address(source,0);
  12366. INC(i);
  12367. END;
  12368. IF reverse THEN Td(recordType) END;
  12369. END TdTable;
  12370. PROCEDURE MethodTable(reverse: BOOLEAN);
  12371. VAR i,methods: LONGINT;
  12372. BEGIN
  12373. Info(source, "method table");
  12374. IF recordType # NIL THEN
  12375. methods := recordType.recordScope.numberMethods;
  12376. IF reverse THEN
  12377. FOR i := methods-1 TO 0 BY -1 DO
  12378. procedure := recordType.recordScope.FindMethod(i);
  12379. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12380. NamedSymbol(source, name,procedure, 0,0);
  12381. END;
  12382. ELSE
  12383. FOR i := 0 TO methods-1 DO
  12384. procedure := recordType.recordScope.FindMethod(i);
  12385. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12386. NamedSymbol(source, name,procedure, 0,0);
  12387. END;
  12388. END;
  12389. END;
  12390. END MethodTable;
  12391. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12392. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12393. BEGIN
  12394. Info(source, "method table");
  12395. baseRecord := recordType;
  12396. WHILE baseRecord.baseType # NIL DO
  12397. baseRecord := baseRecord.GetBaseRecord ();
  12398. END;
  12399. GetRecordTypeName (baseRecord, name);
  12400. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12401. IF name = stackFrame THEN
  12402. start := 0;
  12403. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12404. baseRecord := recordType;
  12405. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12406. baseRecord := baseRecord.GetBaseRecord ();
  12407. END;
  12408. IF baseRecord # NIL THEN
  12409. GetRecordTypeName (baseRecord, name);
  12410. IF pointer & ~baseRecord.isObject THEN
  12411. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12412. END;
  12413. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12414. ELSIF recordType.isObject THEN
  12415. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12416. ELSIF pointer THEN
  12417. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12418. ELSE
  12419. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12420. END;
  12421. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12422. Symbol(source, tir, 0, 0);
  12423. start := 0;
  12424. baseRecord := recordType;
  12425. WHILE (baseRecord # NIL) DO
  12426. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12427. baseRecord := baseRecord.GetBaseRecord ();
  12428. END;
  12429. ELSE
  12430. (* explicit trace method: *)
  12431. procedure := recordType.recordScope.FindMethod(0);
  12432. IF ~procedure.isFinalizer THEN
  12433. Global.GetSymbolSegmentedName(procedure, name);
  12434. NamedSymbol(source, name,procedure, 0,0);
  12435. END;
  12436. start := 1;
  12437. END;
  12438. IF (name # stackFrame) & recordType.isObject THEN
  12439. baseRecord := recordType;
  12440. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12441. baseRecord := baseRecord.GetBaseRecord ();
  12442. END;
  12443. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12444. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12445. ELSE
  12446. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12447. END;
  12448. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12449. Symbol(source, tir, 0, 0);
  12450. END;
  12451. methods := recordType.recordScope.numberMethods;
  12452. FOR i := start TO methods-1 DO
  12453. procedure := recordType.recordScope.FindMethod(i);
  12454. IF ~procedure.isFinalizer THEN
  12455. Global.GetSymbolSegmentedName(procedure, name);
  12456. NamedSymbol(source, name,procedure, 0,0);
  12457. END;
  12458. END;
  12459. END CooperativeMethodTable;
  12460. BEGIN
  12461. Global.GetSymbolSegmentedName(td,name);
  12462. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12463. source.SetExported(IsExported(td));
  12464. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12465. IF implementationVisitor.backend.cooperative THEN
  12466. base := NIL;
  12467. baseRecord := recordType.GetBaseRecord();
  12468. IF baseRecord # NIL THEN
  12469. baseTD := baseRecord.typeDeclaration;
  12470. END;
  12471. IF ~recordType.isObject THEN
  12472. Info(source, "parent");
  12473. IF baseRecord # NIL THEN
  12474. Global.GetSymbolSegmentedName(baseTD,name);
  12475. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12476. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12477. ELSE
  12478. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12479. END;
  12480. Symbol(source, tir, 0, 0);
  12481. ELSE
  12482. Address(source,0);
  12483. END;
  12484. Info(source, "record size");
  12485. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12486. CooperativeMethodTable(FALSE);
  12487. base := source;
  12488. Global.GetSymbolSegmentedName(td,name);
  12489. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12490. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12491. source.SetExported(IsExported(td));
  12492. END;
  12493. Info(source, "parent");
  12494. IF baseRecord # NIL THEN
  12495. Global.GetSymbolSegmentedName(baseTD,name);
  12496. sym := baseTD;
  12497. IF ~recordType.isObject THEN
  12498. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12499. sym := NIL;
  12500. END;
  12501. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12502. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12503. ELSE
  12504. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12505. END;
  12506. Symbol(source, tir, 0, 0);
  12507. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12508. Address(source,0);
  12509. ELSE
  12510. IF recordType.isObject THEN
  12511. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12512. ELSE
  12513. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12514. END;
  12515. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12516. Symbol(source, tir, 0, 0);
  12517. END;
  12518. Info(source, "base record descriptor");
  12519. Symbol(source, base, 0, 0);
  12520. CooperativeMethodTable(TRUE);
  12521. IF recordType.hasPointers THEN
  12522. IF ~HasExplicitTraceMethod (recordType) THEN
  12523. implementationVisitor.CreateTraceMethod(recordType);
  12524. END;
  12525. implementationVisitor.CreateResetProcedure(recordType);
  12526. implementationVisitor.CreateAssignProcedure(recordType);
  12527. END;
  12528. ELSIF ~simple THEN
  12529. (*
  12530. MethodEnd = MPO
  12531. ---
  12532. methods (# methods)
  12533. ---
  12534. tags (16)
  12535. ---
  12536. TypeDesc = TypeInfoAdr
  12537. ---
  12538. td adr ---> rec size
  12539. ----
  12540. pointer offsets
  12541. ----
  12542. (padding)
  12543. -----
  12544. empty [2 addresses aligned]
  12545. empty
  12546. empty
  12547. numPtrs
  12548. ---
  12549. pointer offsets
  12550. ---
  12551. *)
  12552. Info(source, "MethodEnd = MPO");
  12553. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12554. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12555. MethodTable(TRUE);
  12556. TdTable(TypeTags, TRUE);
  12557. Info(source, "type descriptor info pointer");
  12558. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12559. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12560. IF (cellType # NIL) THEN
  12561. IF cellType.sizeInBits < 0 THEN
  12562. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12563. END;
  12564. Info(source, "cell size");
  12565. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12566. ELSE
  12567. Info(source, "record size");
  12568. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12569. END;
  12570. Info(source, "pointer offsets pointer");
  12571. padding := 1- source.pc MOD 2;
  12572. Symbol(source, source, source.pc+1+padding,0);
  12573. IF padding >0 THEN
  12574. Info(source, "padding");
  12575. FOR i := 1 TO padding DO Address(source,0) END;
  12576. END;
  12577. IF cellType # NIL THEN
  12578. PointerArray(source, cellType.cellScope, numberPointers);
  12579. ELSE
  12580. PointerArray(source, recordType.recordScope, numberPointers);
  12581. END;
  12582. ELSE
  12583. (*
  12584. simple:
  12585. td adr --> size
  12586. tag(1)
  12587. tag(2)
  12588. tag(3)
  12589. methods ->
  12590. *)
  12591. Info(source, "record size");
  12592. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12593. TdTable(TypeTags, FALSE);
  12594. MethodTable(FALSE);
  12595. END;
  12596. END NewTypeDescriptor;
  12597. BEGIN
  12598. x := x.resolved;
  12599. IF (x IS SyntaxTree.PointerType) THEN
  12600. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12601. END;
  12602. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12603. recordType := x(SyntaxTree.RecordType);
  12604. td := x.typeDeclaration;
  12605. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12606. ASSERT(td # NIL);
  12607. section := module.allSections.FindBySymbol(td); (* TODO *)
  12608. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12609. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12610. NewTypeDescriptor
  12611. END;
  12612. END;
  12613. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12614. cellType := x(SyntaxTree.CellType);
  12615. td := x.typeDeclaration;
  12616. section := module.allSections.FindBySymbol(td); (* TODO *)
  12617. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12618. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12619. NewTypeDescriptor
  12620. END;
  12621. END;
  12622. END
  12623. END CheckTypeDeclaration
  12624. END MetaDataGenerator;
  12625. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12626. VAR
  12627. trace-: BOOLEAN;
  12628. traceString-: SyntaxTree.IdentifierString;
  12629. traceModuleName-: SyntaxTree.IdentifierString;
  12630. profile-: BOOLEAN;
  12631. noRuntimeChecks: BOOLEAN;
  12632. simpleMetaData-: BOOLEAN;
  12633. noAsserts: BOOLEAN;
  12634. optimize-: BOOLEAN;
  12635. cooperative-: BOOLEAN;
  12636. preregisterStatic-: BOOLEAN;
  12637. dump-: Basic.Writer;
  12638. cellsAreObjects: BOOLEAN;
  12639. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12640. experiment: BOOLEAN;
  12641. PROCEDURE &InitIntermediateBackend*;
  12642. BEGIN
  12643. simpleMetaData := FALSE;
  12644. InitBackend;
  12645. SetBuiltinsModuleName(DefaultBuiltinsModuleName);
  12646. SetTraceModuleName(DefaultTraceModuleName);
  12647. END InitIntermediateBackend;
  12648. (* must be overwritten by actual backend, if parameter registers should be used *)
  12649. PROCEDURE GetParameterRegister*(callingConvention: SyntaxTree.CallingConvention; type: IntermediateCode.Type; VAR register: WORD): BOOLEAN;
  12650. BEGIN
  12651. register := -1;
  12652. RETURN FALSE;
  12653. END GetParameterRegister;
  12654. PROCEDURE ResetParameterRegisters*;
  12655. BEGIN
  12656. END ResetParameterRegisters;
  12657. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12658. VAR
  12659. declarationVisitor: DeclarationVisitor;
  12660. implementationVisitor: ImplementationVisitor;
  12661. module: Sections.Module;
  12662. name, platformName: SyntaxTree.IdentifierString;
  12663. meta: MetaDataGenerator;
  12664. crc: CRC.CRC32Stream;
  12665. BEGIN
  12666. ResetError;
  12667. Global.GetSymbolName(x,name);
  12668. NEW(module,x,system); (* backend structures *)
  12669. Global.GetModuleName(x, name);
  12670. module.SetModuleName(name);
  12671. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, builtinsModuleName, SELF);
  12672. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12673. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12674. declarationVisitor.Module(x,module);
  12675. IF ~meta.simple THEN
  12676. meta.Module(implementationVisitor.moduleBodySection);
  12677. END;
  12678. GetDescription(platformName);
  12679. module.SetPlatformName(platformName);
  12680. NEW(crc);
  12681. module.allSections.WriteRaw(crc);
  12682. crc.Update;
  12683. meta.PatchCRC(crc.GetCRC());
  12684. RETURN module
  12685. END GenerateIntermediate;
  12686. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12687. BEGIN RETURN TRUE
  12688. END SupportedImmediate;
  12689. PROCEDURE ProcessSyntaxTreeModule*(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12690. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12691. END ProcessSyntaxTreeModule;
  12692. PROCEDURE ProcessIntermediateCodeModule*(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12693. VAR
  12694. result: Sections.Module;
  12695. traceName: Basic.MessageString;
  12696. BEGIN
  12697. ASSERT(intermediateCodeModule IS Sections.Module);
  12698. result := intermediateCodeModule(Sections.Module);
  12699. IF trace THEN
  12700. traceName := "intermediate code trace: ";
  12701. Strings.Append(traceName,traceString);
  12702. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12703. IF (traceString="") OR (traceString="*") THEN
  12704. result.Dump(dump);
  12705. dump.Update
  12706. ELSE
  12707. Sections.DumpFiltered(dump, result, traceString);
  12708. END
  12709. END;
  12710. RETURN result
  12711. END ProcessIntermediateCodeModule;
  12712. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12713. BEGIN instructionSet := "Intermediate";
  12714. END GetDescription;
  12715. PROCEDURE SetSimpleMetaData*(simpleMetaData: BOOLEAN);
  12716. BEGIN
  12717. SELF.simpleMetaData := simpleMetaData;
  12718. END SetSimpleMetaData;
  12719. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12720. BEGIN COPY(name, traceModuleName)
  12721. END SetTraceModuleName;
  12722. PROCEDURE DefineOptions*(options: Options.Options);
  12723. BEGIN
  12724. DefineOptions^(options);
  12725. options.Add(0X,"trace",Options.String);
  12726. options.Add(0X,"builtinsModule",Options.String);
  12727. options.Add(0X,"traceModule",Options.String);
  12728. options.Add(0X,"profile",Options.Flag);
  12729. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12730. options.Add(0X,"noAsserts",Options.Flag);
  12731. options.Add(0X,"metaData",Options.String);
  12732. options.Add('o',"optimize", Options.Flag);
  12733. options.Add(0X,"preregisterStatic", Options.Flag);
  12734. options.Add(0X,"cellsAreObjects", Options.Flag);
  12735. options.Add(0X,"preciseGC", Options.Flag);
  12736. options.Add(0X,"trackLeave", Options.Flag);
  12737. options.Add(0X,"writeBarriers", Options.Flag);
  12738. options.Add(0X,"experiment", Options.Flag);
  12739. END DefineOptions;
  12740. PROCEDURE GetOptions*(options: Options.Options);
  12741. VAR name,string: SyntaxTree.IdentifierString;
  12742. BEGIN
  12743. GetOptions^(options);
  12744. trace := options.GetString("trace",traceString);
  12745. profile := options.GetFlag("profile");
  12746. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12747. noAsserts := options.GetFlag("noAsserts");
  12748. cooperative := options.GetFlag("cooperative");
  12749. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12750. simpleMetaData := TRUE
  12751. END;
  12752. IF options.GetString("metaData",string) THEN
  12753. IF string = "simple" THEN simpleMetaData := TRUE
  12754. ELSIF string ="full" THEN simpleMetaData := FALSE
  12755. END;
  12756. END;
  12757. IF options.GetString("builtinsModule",name) THEN SetBuiltinsModuleName(name) END;
  12758. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12759. optimize := options.GetFlag("optimize");
  12760. preregisterStatic := options.GetFlag("preregisterStatic");
  12761. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12762. preciseGC := options.GetFlag("preciseGC");
  12763. trackLeave := options.GetFlag("trackLeave");
  12764. writeBarriers := options.GetFlag("writeBarriers");
  12765. experiment := options.GetFlag("experiment");
  12766. END GetOptions;
  12767. PROCEDURE DefaultSymbolFileFormat*(): Formats.SymbolFileFormat;
  12768. BEGIN RETURN SymbolFileFormat.Get()
  12769. END DefaultSymbolFileFormat;
  12770. END IntermediateBackend;
  12771. (* ----------------------------------- register allocation ------------------------------------- *)
  12772. (* register mapping scheme
  12773. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12774. spill offset
  12775. part(n) --> ticket <--> physical register
  12776. spill offset
  12777. *)
  12778. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12779. emptyOperand: IntermediateCode.Operand;
  12780. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12781. statCoopResetVariables: LONGINT;
  12782. statCoopModifyAssignments: LONGINT;
  12783. modifyAssignmentsPC : LONGINT;
  12784. statCoopNilCheck: LONGINT;
  12785. statCoopSwitch: LONGINT;
  12786. statCoopAssignProcedure: LONGINT;
  12787. statCoopTraceMethod: LONGINT;
  12788. statCoopResetProcedure: LONGINT;
  12789. statCoopTraceModule: LONGINT;
  12790. PROCEDURE ResetStatistics*;
  12791. BEGIN
  12792. statCoopResetVariables := 0;
  12793. statCoopModifyAssignments := 0;
  12794. statCoopNilCheck:= 0;
  12795. statCoopSwitch:= 0;
  12796. statCoopAssignProcedure:= 0;
  12797. statCoopTraceMethod:= 0;
  12798. statCoopResetProcedure:= 0;
  12799. statCoopTraceModule:= 0;
  12800. END ResetStatistics;
  12801. PROCEDURE Statistics*;
  12802. BEGIN
  12803. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12804. TRACE(statCoopNilCheck, statCoopSwitch);
  12805. TRACE(statCoopAssignProcedure,
  12806. statCoopTraceMethod,
  12807. statCoopResetProcedure,
  12808. statCoopTraceModule)
  12809. END Statistics;
  12810. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12811. VAR h: LONGINT;
  12812. BEGIN
  12813. WHILE b # 0 DO
  12814. h := a MOD b;
  12815. a := b;
  12816. b := h;
  12817. END;
  12818. RETURN a
  12819. END GCD;
  12820. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12821. BEGIN
  12822. RETURN a*b DIV GCD(a,b)
  12823. END SCM;
  12824. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12825. BEGIN
  12826. (*TRACE(a,b);*)
  12827. IF a = 0 THEN RETURN b
  12828. ELSIF b = 0 THEN RETURN a
  12829. ELSE RETURN SCM(a,b)
  12830. END;
  12831. END CommonAlignment;
  12832. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12833. BEGIN
  12834. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12835. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12836. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12837. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12838. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12839. END
  12840. END PassBySingleReference;
  12841. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12842. BEGIN
  12843. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter,callingConvention)
  12844. END PassInRegister;
  12845. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12846. VAR new: RegisterEntry;
  12847. BEGIN
  12848. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12849. IF queue = NIL THEN
  12850. queue := new
  12851. ELSE
  12852. new.next := queue;
  12853. IF queue#NIL THEN queue.prev := new END;
  12854. queue := new
  12855. END;
  12856. END AddRegisterEntry;
  12857. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12858. VAR this: RegisterEntry;
  12859. BEGIN
  12860. this := queue;
  12861. WHILE (this # NIL) & (this.register # register) DO
  12862. this := this.next;
  12863. END;
  12864. IF this = NIL THEN
  12865. RETURN FALSE
  12866. END;
  12867. ASSERT(this # NIL);
  12868. IF this = queue THEN queue := queue.next END;
  12869. IF this.prev # NIL THEN this.prev.next := this.next END;
  12870. IF this.next # NIL THEN this.next.prev := this.prev END;
  12871. RETURN TRUE
  12872. END RemoveRegisterEntry;
  12873. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12874. BEGIN ASSERT(cond);
  12875. END Assert;
  12876. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12877. BEGIN
  12878. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12879. END ReusableRegister;
  12880. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12881. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12882. BEGIN
  12883. procedure := moduleScope.bodyProcedure;
  12884. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12885. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12886. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12887. procedure.SetScope(moduleScope);
  12888. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12889. procedure.SetAccess(SyntaxTree.Hidden);
  12890. moduleScope.SetBodyProcedure(procedure);
  12891. moduleScope.AddProcedure(procedure);
  12892. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12893. END;
  12894. END EnsureBodyProcedure;
  12895. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12896. VAR import: SyntaxTree.Import;
  12897. selfName: SyntaxTree.IdentifierString;
  12898. module: SyntaxTree.Module;
  12899. BEGIN
  12900. scope.ownerModule.GetName(selfName);
  12901. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12902. module := scope.ownerModule
  12903. ELSE
  12904. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12905. IF import = NIL THEN
  12906. RETURN NIL
  12907. ELSIF import.module = NIL THEN
  12908. RETURN NIL
  12909. ELSE module := import.module
  12910. END;
  12911. END;
  12912. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12913. END GetSymbol;
  12914. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12915. BEGIN
  12916. op.mode := mode;
  12917. IntermediateCode.InitOperand(op.op);
  12918. IntermediateCode.InitOperand(op.tag);
  12919. IntermediateCode.InitOperand(op.extra);
  12920. op.dimOffset := 0;
  12921. END InitOperand;
  12922. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12923. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12924. BEGIN RETURN IntermediateCode.GetType(system, type)
  12925. END GetType;
  12926. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12927. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12928. BEGIN
  12929. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12930. (*
  12931. UniqueId(name,module,name,adr);
  12932. *)
  12933. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  12934. constant.SetValue(value);
  12935. constant.SetAccess(SyntaxTree.Hidden);
  12936. module.moduleScope.AddConstant(constant);
  12937. constant.SetScope(module.moduleScope);
  12938. RETURN constant
  12939. END BuildConstant;
  12940. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12941. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12942. BEGIN
  12943. variable := scope.firstVariable;
  12944. WHILE variable # NIL DO
  12945. IF variable.NeedsTrace() THEN
  12946. RETURN TRUE;
  12947. END;
  12948. variable := variable.nextVariable;
  12949. END;
  12950. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12951. WHILE parameter # NIL DO
  12952. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  12953. RETURN TRUE;
  12954. END;
  12955. parameter := parameter.nextParameter;
  12956. END;
  12957. RETURN FALSE;
  12958. END HasPointers;
  12959. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12960. 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));
  12961. END IsVariableParameter;
  12962. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12963. VAR parameter: SyntaxTree.Parameter;
  12964. BEGIN
  12965. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12966. WHILE parameter # NIL DO
  12967. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12968. IF parameter.movable THEN RETURN TRUE END;
  12969. parameter := parameter.nextParameter;
  12970. END;
  12971. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12972. END HasVariableParameters;
  12973. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12974. BEGIN
  12975. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12976. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12977. END HasExplicitTraceMethod;
  12978. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12979. BEGIN
  12980. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12981. IF (expression IS SyntaxTree.IntegerValue) THEN
  12982. val := expression(SyntaxTree.IntegerValue).value;
  12983. RETURN TRUE
  12984. ELSE
  12985. RETURN FALSE
  12986. END;
  12987. END IsIntegerConstant;
  12988. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12989. BEGIN
  12990. IF val <= 0 THEN RETURN FALSE END;
  12991. exp := 0;
  12992. WHILE ~ODD(val) DO
  12993. val := val DIV 2;
  12994. INC(exp)
  12995. END;
  12996. RETURN val = 1
  12997. END PowerOf2;
  12998. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12999. VAR procedure: SyntaxTree.Procedure;
  13000. BEGIN
  13001. procedure := record.recordScope.constructor;
  13002. IF procedure = NIL THEN
  13003. record := record.GetBaseRecord();
  13004. IF record # NIL THEN
  13005. procedure := GetConstructor(record)
  13006. END;
  13007. END;
  13008. RETURN procedure;
  13009. END GetConstructor;
  13010. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  13011. BEGIN
  13012. value := SHORT(op.intValue);
  13013. RETURN op.mode = IntermediateCode.ModeImmediate;
  13014. END IsIntegerImmediate;
  13015. (** whether a type strictily is a pointer to record or object type
  13016. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  13017. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  13018. BEGIN
  13019. IF type = NIL THEN
  13020. RETURN FALSE
  13021. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  13022. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  13023. ELSE
  13024. RETURN FALSE
  13025. END
  13026. END IsStrictlyPointerToRecord;
  13027. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  13028. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  13029. END IsUnsafePointer;
  13030. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  13031. BEGIN type := type.resolved;
  13032. IF type IS SyntaxTree.PointerType THEN
  13033. type := type(SyntaxTree.PointerType).pointerBase;
  13034. type := type.resolved;
  13035. IF type IS SyntaxTree.RecordType THEN
  13036. recordType := type(SyntaxTree.RecordType);
  13037. RETURN TRUE
  13038. ELSE
  13039. RETURN FALSE
  13040. END
  13041. ELSIF type IS SyntaxTree.RecordType THEN
  13042. recordType := type(SyntaxTree.RecordType);
  13043. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  13044. ELSIF type IS SyntaxTree.ObjectType THEN
  13045. RETURN TRUE
  13046. ELSIF type IS SyntaxTree.AnyType THEN
  13047. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  13048. ELSE
  13049. RETURN FALSE
  13050. END;
  13051. END IsPointerToRecord;
  13052. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  13053. BEGIN
  13054. type := type.resolved;
  13055. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  13056. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  13057. END IsArrayOfSystemByte;
  13058. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  13059. BEGIN
  13060. IF type = NIL THEN RETURN FALSE END;
  13061. type := type.resolved;
  13062. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  13063. END IsOpenArray;
  13064. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  13065. BEGIN
  13066. IF type = NIL THEN RETURN FALSE END;
  13067. type := type.resolved;
  13068. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  13069. END IsSemiDynamicArray;
  13070. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  13071. BEGIN
  13072. IF type = NIL THEN RETURN FALSE END;
  13073. type := type.resolved;
  13074. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  13075. END IsStaticArray;
  13076. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  13077. BEGIN
  13078. IF type = NIL THEN RETURN FALSE END;
  13079. type := type.resolved;
  13080. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  13081. END IsStaticMathArray;
  13082. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13083. BEGIN
  13084. WHILE (IsStaticMathArray(type)) DO
  13085. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13086. END;
  13087. RETURN type;
  13088. END StaticMathArrayBaseType;
  13089. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13090. VAR size: LONGINT;
  13091. BEGIN
  13092. size := 1;
  13093. WHILE (IsStaticArray(type)) DO
  13094. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  13095. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13096. END;
  13097. RETURN size;
  13098. END StaticArrayNumElements;
  13099. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13100. VAR size: LONGINT;
  13101. BEGIN
  13102. size := 1;
  13103. WHILE (IsStaticMathArray(type)) DO
  13104. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  13105. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13106. END;
  13107. RETURN size;
  13108. END StaticMathArrayNumElements;
  13109. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13110. BEGIN
  13111. WHILE (IsStaticArray(type)) DO
  13112. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13113. END;
  13114. RETURN type;
  13115. END StaticArrayBaseType;
  13116. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13117. BEGIN
  13118. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  13119. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13120. END;
  13121. RETURN type;
  13122. END ArrayBaseType;
  13123. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  13124. BEGIN
  13125. IF type = NIL THEN RETURN FALSE END;
  13126. type := type.resolved;
  13127. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  13128. END IsDelegate;
  13129. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  13130. VAR i: LONGINT;
  13131. BEGIN
  13132. i := 0; type := type.resolved;
  13133. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13134. INC(i);
  13135. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  13136. END;
  13137. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13138. INC(i);
  13139. type := type(SyntaxTree.MathArrayType).arrayBase;
  13140. IF type # NIL THEN type := type.resolved END;
  13141. END;
  13142. RETURN i
  13143. END DynamicDim;
  13144. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  13145. BEGIN
  13146. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13147. type := type(SyntaxTree.ArrayType).arrayBase;
  13148. END;
  13149. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13150. type := type(SyntaxTree.MathArrayType).arrayBase;
  13151. END;
  13152. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  13153. END StaticSize;
  13154. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  13155. BEGIN
  13156. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  13157. END IsImmediate;
  13158. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  13159. BEGIN
  13160. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  13161. END IsAddress;
  13162. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  13163. BEGIN
  13164. RETURN (x.mode = IntermediateCode.ModeRegister);
  13165. END IsRegister;
  13166. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  13167. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  13168. BEGIN
  13169. typeDeclaration := recordType.typeDeclaration;
  13170. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13171. Global.GetSymbolSegmentedName(typeDeclaration,name);
  13172. END GetRecordTypeName;
  13173. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  13174. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  13175. BEGIN
  13176. parSize := 0;
  13177. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  13178. parameter := procedureType.returnParameter;
  13179. INC(parSize,system.SizeOfParameter(parameter));
  13180. parSize := parSize + (-parSize) MOD system.addressSize;
  13181. END;
  13182. parameter :=procedureType.lastParameter;
  13183. WHILE (parameter # NIL) DO
  13184. IF procedureType.callingConvention IN SysvABIorWINAPI THEN
  13185. INC(parSize, system.addressSize);
  13186. ELSE
  13187. INC(parSize,system.SizeOfParameter(parameter));
  13188. parSize := parSize + (-parSize) MOD system.addressSize;
  13189. END;
  13190. parameter := parameter.prevParameter;
  13191. END;
  13192. IF procedureType.selfParameter # NIL THEN
  13193. parameter := procedureType.selfParameter;
  13194. INC(parSize,system.SizeOfParameter(parameter));
  13195. parSize := parSize + (-parSize) MOD system.addressSize;
  13196. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  13197. END; (* method => self pointer *)
  13198. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  13199. RETURN ToMemoryUnits(system,parSize)
  13200. END ParametersSize;
  13201. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  13202. BEGIN
  13203. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  13204. END IsNested;
  13205. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  13206. BEGIN
  13207. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  13208. scope := scope.outerScope;
  13209. END;
  13210. RETURN scope # NIL;
  13211. END InCellScope;
  13212. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  13213. BEGIN
  13214. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType), IsNested(procedure));
  13215. END ProcedureParametersSize;
  13216. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  13217. VAR dataUnit: LONGINT;
  13218. BEGIN dataUnit := system.dataUnit;
  13219. ASSERT(size MOD system.dataUnit = 0);
  13220. RETURN LONGINT(size DIV system.dataUnit)
  13221. END ToMemoryUnits;
  13222. PROCEDURE Get*(): Backend.Backend;
  13223. VAR backend: IntermediateBackend;
  13224. BEGIN NEW(backend); RETURN backend
  13225. END Get;
  13226. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  13227. VAR instruction: IntermediateCode.Instruction;
  13228. BEGIN
  13229. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  13230. RETURN instruction
  13231. END Nop;
  13232. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13233. VAR instruction: IntermediateCode.Instruction;
  13234. BEGIN
  13235. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  13236. RETURN instruction
  13237. END Mov;
  13238. (* like Mov but ensures that no new register will be allocated for dest *)
  13239. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13240. VAR instruction: IntermediateCode.Instruction;
  13241. BEGIN
  13242. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  13243. RETURN instruction
  13244. END MovReplace;
  13245. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13246. VAR instruction: IntermediateCode.Instruction;
  13247. BEGIN
  13248. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  13249. RETURN instruction
  13250. END Conv;
  13251. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  13252. VAR instruction: IntermediateCode.Instruction;
  13253. BEGIN
  13254. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  13255. RETURN instruction
  13256. END Call;
  13257. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  13258. VAR op1, op2, op3: IntermediateCode.Operand;
  13259. VAR instruction: IntermediateCode.Instruction;
  13260. BEGIN
  13261. IntermediateCode.InitNumber(op1,pcOffset);
  13262. IntermediateCode.InitNumber(op2,callingConvention);
  13263. IntermediateCode.InitNumber(op3,unwind);
  13264. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  13265. RETURN instruction
  13266. END Exit;
  13267. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13268. VAR instruction: IntermediateCode.Instruction;
  13269. BEGIN
  13270. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  13271. RETURN instruction
  13272. END Return;
  13273. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13274. VAR instruction: IntermediateCode.Instruction;
  13275. BEGIN
  13276. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  13277. RETURN instruction
  13278. END Result;
  13279. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  13280. VAR op1: IntermediateCode.Operand;
  13281. VAR instruction: IntermediateCode.Instruction;
  13282. BEGIN
  13283. IntermediateCode.InitNumber(op1,nr);
  13284. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  13285. RETURN instruction
  13286. END Trap;
  13287. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  13288. VAR instruction: IntermediateCode.Instruction;
  13289. BEGIN
  13290. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  13291. RETURN instruction
  13292. END Br;
  13293. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13294. VAR instruction: IntermediateCode.Instruction;
  13295. BEGIN
  13296. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  13297. RETURN instruction
  13298. END Breq;
  13299. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13300. VAR instruction: IntermediateCode.Instruction;
  13301. BEGIN
  13302. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13303. RETURN instruction
  13304. END Brne;
  13305. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13306. VAR instruction: IntermediateCode.Instruction;
  13307. BEGIN
  13308. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13309. RETURN instruction
  13310. END Brge;
  13311. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13312. VAR instruction: IntermediateCode.Instruction;
  13313. BEGIN
  13314. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13315. RETURN instruction
  13316. END Brlt;
  13317. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13318. VAR instruction: IntermediateCode.Instruction;
  13319. BEGIN
  13320. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13321. RETURN instruction
  13322. END Pop;
  13323. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13324. VAR instruction: IntermediateCode.Instruction;
  13325. BEGIN
  13326. ASSERT(op.mode # IntermediateCode.Undefined);
  13327. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13328. RETURN instruction
  13329. END Push;
  13330. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13331. VAR instruction: IntermediateCode.Instruction;
  13332. BEGIN
  13333. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13334. RETURN instruction
  13335. END Neg;
  13336. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13337. VAR instruction: IntermediateCode.Instruction;
  13338. BEGIN
  13339. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13340. RETURN instruction
  13341. END Not;
  13342. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13343. VAR instruction: IntermediateCode.Instruction;
  13344. BEGIN
  13345. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13346. RETURN instruction
  13347. END Abs;
  13348. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13349. VAR instruction: IntermediateCode.Instruction;
  13350. BEGIN
  13351. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13352. ASSERT(~IsImmediate(instruction.op1));
  13353. RETURN instruction
  13354. END Mul;
  13355. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13356. VAR instruction: IntermediateCode.Instruction;
  13357. BEGIN
  13358. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13359. RETURN instruction
  13360. END Div;
  13361. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13362. VAR instruction: IntermediateCode.Instruction;
  13363. BEGIN
  13364. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13365. RETURN instruction
  13366. END Mod;
  13367. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13368. VAR instruction: IntermediateCode.Instruction;
  13369. BEGIN
  13370. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13371. RETURN instruction
  13372. END Sub;
  13373. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13374. VAR instruction: IntermediateCode.Instruction;
  13375. BEGIN
  13376. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13377. RETURN instruction
  13378. END Add;
  13379. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13380. VAR instruction: IntermediateCode.Instruction;
  13381. BEGIN
  13382. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13383. RETURN instruction
  13384. END And;
  13385. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13386. VAR instruction: IntermediateCode.Instruction;
  13387. BEGIN
  13388. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13389. RETURN instruction
  13390. END Or;
  13391. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13392. VAR instruction: IntermediateCode.Instruction;
  13393. BEGIN
  13394. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13395. RETURN instruction
  13396. END Xor;
  13397. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13398. VAR instruction: IntermediateCode.Instruction;
  13399. BEGIN
  13400. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13401. RETURN instruction
  13402. END Shl;
  13403. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13404. VAR instruction: IntermediateCode.Instruction;
  13405. BEGIN
  13406. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13407. RETURN instruction
  13408. END Shr;
  13409. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13410. VAR instruction: IntermediateCode.Instruction;
  13411. BEGIN
  13412. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13413. RETURN instruction
  13414. END Rol;
  13415. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13416. VAR instruction: IntermediateCode.Instruction;
  13417. BEGIN
  13418. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13419. RETURN instruction
  13420. END Ror;
  13421. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13422. VAR instruction: IntermediateCode.Instruction;
  13423. BEGIN
  13424. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13425. RETURN instruction
  13426. END Cas;
  13427. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13428. VAR instruction: IntermediateCode.Instruction;
  13429. BEGIN
  13430. ASSERT(~IntermediateCode.IsVectorRegister(dest));
  13431. ASSERT(~IntermediateCode.IsVectorRegister(src));
  13432. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13433. RETURN instruction
  13434. END Copy;
  13435. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13436. VAR instruction: IntermediateCode.Instruction;
  13437. BEGIN
  13438. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13439. RETURN instruction
  13440. END Fill;
  13441. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13442. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13443. BEGIN
  13444. string := IntermediateCode.String(s);
  13445. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13446. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13447. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13448. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13449. RETURN instruction
  13450. END Asm;
  13451. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13452. VAR instruction: IntermediateCode.Instruction;
  13453. BEGIN
  13454. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13455. RETURN instruction
  13456. END Data;
  13457. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13458. VAR instruction: IntermediateCode.Instruction;
  13459. BEGIN
  13460. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13461. IntermediateCode.SetSubType(instruction, subtype);
  13462. RETURN instruction
  13463. END SpecialInstruction;
  13464. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13465. VAR op1: IntermediateCode.Operand;
  13466. VAR instruction: IntermediateCode.Instruction;
  13467. BEGIN
  13468. (*! generate a warning if size exceeds a certain limit *)
  13469. (*
  13470. ASSERT(bytes < 1000000); (* sanity check *)
  13471. *)
  13472. ASSERT(0 <= units); (* sanity check *)
  13473. IntermediateCode.InitNumber(op1,units);
  13474. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13475. RETURN instruction
  13476. END Reserve;
  13477. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13478. VAR op1: IntermediateCode.Operand;
  13479. VAR instruction: IntermediateCode.Instruction;
  13480. BEGIN
  13481. IntermediateCode.InitNumber(op1,position.start);
  13482. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13483. RETURN instruction
  13484. END LabelInstruction;
  13485. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13486. VAR pc: LONGINT;
  13487. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13488. BEGIN
  13489. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13490. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13491. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13492. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13493. IF instr.op1.type.form = IntermediateCode.Float THEN
  13494. RETURN instr.op1.floatValue = op.floatValue
  13495. ELSE
  13496. RETURN instr.op1.intValue = op.intValue
  13497. END;
  13498. END ProvidesValue;
  13499. BEGIN
  13500. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13501. pc := 0;
  13502. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13503. INC(pc);
  13504. END;
  13505. IF pc = data.pc THEN
  13506. data.Emit(Data(Basic.invalidPosition,vop));
  13507. END;
  13508. RETURN pc
  13509. END EnterImmediate;
  13510. PROCEDURE Init;
  13511. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13512. BEGIN
  13513. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13514. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13515. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13516. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13517. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13518. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13519. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13520. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13521. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13522. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13523. IntermediateCode.InitOperand(emptyOperand);
  13524. FOR i := 0 TO NumberSystemCalls-1 DO
  13525. name := "@SystemCall";
  13526. Basic.AppendNumber(name,i);
  13527. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13528. END;
  13529. END Init;
  13530. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13531. BEGIN
  13532. RETURN (symbol # NIL) & symbol.NeedsSection();
  13533. END IsExported;
  13534. BEGIN
  13535. Init;
  13536. END FoxIntermediateBackend.
  13537. Compiler.Compile -p=Win32 FoxIntermediateBackend.Mod ~
  13538. # Release.Build --path="/temp/obg/" Win32 ~
  13539. # 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 ~
  13540. FStols.CloseFiles A2Z.exe ~
  13541. System.FreeDownTo FoxIntermediateBackend ~
  13542. Compiler.Compile -p=Win32 --destPath=/temp/obg/ --traceModule=Trace
  13543. I386.Builtins.Mod Trace.Mod Windows.I386.Kernel32.Mod Windows.I386.Machine.Mod Heaps.Mod
  13544. Modules.Mod Windows.I386.Objects.Mod Windows.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13545. Commands.Mod I386.Reals.Mod Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13546. Windows.I386.Traps.Mod Locks.Mod Windows.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13547. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13548. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Windows.User32.Mod
  13549. Windows.WinTrace.Mod Windows.ODBC.Mod Windows.Shell32.Mod Windows.SQL.Mod Windows.WinFS.Mod
  13550. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13551. GenericLinker.Mod Loader.Mod BootConsole.Mod