FoxIntermediateBackend.Mod 574 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200620162026203620462056206620762086209621062116212621362146215621662176218621962206221622262236224622562266227622862296230623162326233623462356236623762386239624062416242624362446245624662476248624962506251625262536254625562566257625862596260626162626263626462656266626762686269627062716272627362746275627662776278627962806281628262836284628562866287628862896290629162926293629462956296629762986299630063016302630363046305630663076308630963106311631263136314631563166317631863196320632163226323632463256326632763286329633063316332633363346335633663376338633963406341634263436344634563466347634863496350635163526353635463556356635763586359636063616362636363646365636663676368636963706371637263736374637563766377637863796380638163826383638463856386638763886389639063916392639363946395639663976398639964006401640264036404640564066407640864096410641164126413641464156416641764186419642064216422642364246425642664276428642964306431643264336434643564366437643864396440644164426443644464456446644764486449645064516452645364546455645664576458645964606461646264636464646564666467646864696470647164726473647464756476647764786479648064816482648364846485648664876488648964906491649264936494649564966497649864996500650165026503650465056506650765086509651065116512651365146515651665176518651965206521652265236524652565266527652865296530653165326533653465356536653765386539654065416542654365446545654665476548654965506551655265536554655565566557655865596560656165626563656465656566656765686569657065716572657365746575657665776578657965806581658265836584658565866587658865896590659165926593659465956596659765986599660066016602660366046605660666076608660966106611661266136614661566166617661866196620662166226623662466256626662766286629663066316632663366346635663666376638663966406641664266436644664566466647664866496650665166526653665466556656665766586659666066616662666366646665666666676668666966706671667266736674667566766677667866796680668166826683668466856686668766886689669066916692669366946695669666976698669967006701670267036704670567066707670867096710671167126713671467156716671767186719672067216722672367246725672667276728672967306731673267336734673567366737673867396740674167426743674467456746674767486749675067516752675367546755675667576758675967606761676267636764676567666767676867696770677167726773677467756776677767786779678067816782678367846785678667876788678967906791679267936794679567966797679867996800680168026803680468056806680768086809681068116812681368146815681668176818681968206821682268236824682568266827682868296830683168326833683468356836683768386839684068416842684368446845684668476848684968506851685268536854685568566857685868596860686168626863686468656866686768686869687068716872687368746875687668776878687968806881688268836884688568866887688868896890689168926893689468956896689768986899690069016902690369046905690669076908690969106911691269136914691569166917691869196920692169226923692469256926692769286929693069316932693369346935693669376938693969406941694269436944694569466947694869496950695169526953695469556956695769586959696069616962696369646965696669676968696969706971697269736974697569766977697869796980698169826983698469856986698769886989699069916992699369946995699669976998699970007001700270037004700570067007700870097010701170127013701470157016701770187019702070217022702370247025702670277028702970307031703270337034703570367037703870397040704170427043704470457046704770487049705070517052705370547055705670577058705970607061706270637064706570667067706870697070707170727073707470757076707770787079708070817082708370847085708670877088708970907091709270937094709570967097709870997100710171027103710471057106710771087109711071117112711371147115711671177118711971207121712271237124712571267127712871297130713171327133713471357136713771387139714071417142714371447145714671477148714971507151715271537154715571567157715871597160716171627163716471657166716771687169717071717172717371747175717671777178717971807181718271837184718571867187718871897190719171927193719471957196719771987199720072017202720372047205720672077208720972107211721272137214721572167217721872197220722172227223722472257226722772287229723072317232723372347235723672377238723972407241724272437244724572467247724872497250725172527253725472557256725772587259726072617262726372647265726672677268726972707271727272737274727572767277727872797280728172827283728472857286728772887289729072917292729372947295729672977298729973007301730273037304730573067307730873097310731173127313731473157316731773187319732073217322732373247325732673277328732973307331733273337334733573367337733873397340734173427343734473457346734773487349735073517352735373547355735673577358735973607361736273637364736573667367736873697370737173727373737473757376737773787379738073817382738373847385738673877388738973907391739273937394739573967397739873997400740174027403740474057406740774087409741074117412741374147415741674177418741974207421742274237424742574267427742874297430743174327433743474357436743774387439744074417442744374447445744674477448744974507451745274537454745574567457745874597460746174627463746474657466746774687469747074717472747374747475747674777478747974807481748274837484748574867487748874897490749174927493749474957496749774987499750075017502750375047505750675077508750975107511751275137514751575167517751875197520752175227523752475257526752775287529753075317532753375347535753675377538753975407541754275437544754575467547754875497550755175527553755475557556755775587559756075617562756375647565756675677568756975707571757275737574757575767577757875797580758175827583758475857586758775887589759075917592759375947595759675977598759976007601760276037604760576067607760876097610761176127613761476157616761776187619762076217622762376247625762676277628762976307631763276337634763576367637763876397640764176427643764476457646764776487649765076517652765376547655765676577658765976607661766276637664766576667667766876697670767176727673767476757676767776787679768076817682768376847685768676877688768976907691769276937694769576967697769876997700770177027703770477057706770777087709771077117712771377147715771677177718771977207721772277237724772577267727772877297730773177327733773477357736773777387739774077417742774377447745774677477748774977507751775277537754775577567757775877597760776177627763776477657766776777687769777077717772777377747775777677777778777977807781778277837784778577867787778877897790779177927793779477957796779777987799780078017802780378047805780678077808780978107811781278137814781578167817781878197820782178227823782478257826782778287829783078317832783378347835783678377838783978407841784278437844784578467847784878497850785178527853785478557856785778587859786078617862786378647865786678677868786978707871787278737874787578767877787878797880788178827883788478857886788778887889789078917892789378947895789678977898789979007901790279037904790579067907790879097910791179127913791479157916791779187919792079217922792379247925792679277928792979307931793279337934793579367937793879397940794179427943794479457946794779487949795079517952795379547955795679577958795979607961796279637964796579667967796879697970797179727973797479757976797779787979798079817982798379847985798679877988798979907991799279937994799579967997799879998000800180028003800480058006800780088009801080118012801380148015801680178018801980208021802280238024802580268027802880298030803180328033803480358036803780388039804080418042804380448045804680478048804980508051805280538054805580568057805880598060806180628063806480658066806780688069807080718072807380748075807680778078807980808081808280838084808580868087808880898090809180928093809480958096809780988099810081018102810381048105810681078108810981108111811281138114811581168117811881198120812181228123812481258126812781288129813081318132813381348135813681378138813981408141814281438144814581468147814881498150815181528153815481558156815781588159816081618162816381648165816681678168816981708171817281738174817581768177817881798180818181828183818481858186818781888189819081918192819381948195819681978198819982008201820282038204820582068207820882098210821182128213821482158216821782188219822082218222822382248225822682278228822982308231823282338234823582368237823882398240824182428243824482458246824782488249825082518252825382548255825682578258825982608261826282638264826582668267826882698270827182728273827482758276827782788279828082818282828382848285828682878288828982908291829282938294829582968297829882998300830183028303830483058306830783088309831083118312831383148315831683178318831983208321832283238324832583268327832883298330833183328333833483358336833783388339834083418342834383448345834683478348834983508351835283538354835583568357835883598360836183628363836483658366836783688369837083718372837383748375837683778378837983808381838283838384838583868387838883898390839183928393839483958396839783988399840084018402840384048405840684078408840984108411841284138414841584168417841884198420842184228423842484258426842784288429843084318432843384348435843684378438843984408441844284438444844584468447844884498450845184528453845484558456845784588459846084618462846384648465846684678468846984708471847284738474847584768477847884798480848184828483848484858486848784888489849084918492849384948495849684978498849985008501850285038504850585068507850885098510851185128513851485158516851785188519852085218522852385248525852685278528852985308531853285338534853585368537853885398540854185428543854485458546854785488549855085518552855385548555855685578558855985608561856285638564856585668567856885698570857185728573857485758576857785788579858085818582858385848585858685878588858985908591859285938594859585968597859885998600860186028603860486058606860786088609861086118612861386148615861686178618861986208621862286238624862586268627862886298630863186328633863486358636863786388639864086418642864386448645864686478648864986508651865286538654865586568657865886598660866186628663866486658666866786688669867086718672867386748675867686778678867986808681868286838684868586868687868886898690869186928693869486958696869786988699870087018702870387048705870687078708870987108711871287138714871587168717871887198720872187228723872487258726872787288729873087318732873387348735873687378738873987408741874287438744874587468747874887498750875187528753875487558756875787588759876087618762876387648765876687678768876987708771877287738774877587768777877887798780878187828783878487858786878787888789879087918792879387948795879687978798879988008801880288038804880588068807880888098810881188128813881488158816881788188819882088218822882388248825882688278828882988308831883288338834883588368837883888398840884188428843884488458846884788488849885088518852885388548855885688578858885988608861886288638864886588668867886888698870887188728873887488758876887788788879888088818882888388848885888688878888888988908891889288938894889588968897889888998900890189028903890489058906890789088909891089118912891389148915891689178918891989208921892289238924892589268927892889298930893189328933893489358936893789388939894089418942894389448945894689478948894989508951895289538954895589568957895889598960896189628963896489658966896789688969897089718972897389748975897689778978897989808981898289838984898589868987898889898990899189928993899489958996899789988999900090019002900390049005900690079008900990109011901290139014901590169017901890199020902190229023902490259026902790289029903090319032903390349035903690379038903990409041904290439044904590469047904890499050905190529053905490559056905790589059906090619062906390649065906690679068906990709071907290739074907590769077907890799080908190829083908490859086908790889089909090919092909390949095909690979098909991009101910291039104910591069107910891099110911191129113911491159116911791189119912091219122912391249125912691279128912991309131913291339134913591369137913891399140914191429143914491459146914791489149915091519152915391549155915691579158915991609161916291639164916591669167916891699170917191729173917491759176917791789179918091819182918391849185918691879188918991909191919291939194919591969197919891999200920192029203920492059206920792089209921092119212921392149215921692179218921992209221922292239224922592269227922892299230923192329233923492359236923792389239924092419242924392449245924692479248924992509251925292539254925592569257925892599260926192629263926492659266926792689269927092719272927392749275927692779278927992809281928292839284928592869287928892899290929192929293929492959296929792989299930093019302930393049305930693079308930993109311931293139314931593169317931893199320932193229323932493259326932793289329933093319332933393349335933693379338933993409341934293439344934593469347934893499350935193529353935493559356935793589359936093619362936393649365936693679368936993709371937293739374937593769377937893799380938193829383938493859386938793889389939093919392939393949395939693979398939994009401940294039404940594069407940894099410941194129413941494159416941794189419942094219422942394249425942694279428942994309431943294339434943594369437943894399440944194429443944494459446944794489449945094519452945394549455945694579458945994609461946294639464946594669467946894699470947194729473947494759476947794789479948094819482948394849485948694879488948994909491949294939494949594969497949894999500950195029503950495059506950795089509951095119512951395149515951695179518951995209521952295239524952595269527952895299530953195329533953495359536953795389539954095419542954395449545954695479548954995509551955295539554955595569557955895599560956195629563956495659566956795689569957095719572957395749575957695779578957995809581958295839584958595869587958895899590959195929593959495959596959795989599960096019602960396049605960696079608960996109611961296139614961596169617961896199620962196229623962496259626962796289629963096319632963396349635963696379638963996409641964296439644964596469647964896499650965196529653965496559656965796589659966096619662966396649665966696679668966996709671967296739674967596769677967896799680968196829683968496859686968796889689969096919692969396949695969696979698969997009701970297039704970597069707970897099710971197129713971497159716971797189719972097219722972397249725972697279728972997309731973297339734973597369737973897399740974197429743974497459746974797489749975097519752975397549755975697579758975997609761976297639764976597669767976897699770977197729773977497759776977797789779978097819782978397849785978697879788978997909791979297939794979597969797979897999800980198029803980498059806980798089809981098119812981398149815981698179818981998209821982298239824982598269827982898299830983198329833983498359836983798389839984098419842984398449845984698479848984998509851985298539854985598569857985898599860986198629863986498659866986798689869987098719872987398749875987698779878987998809881988298839884988598869887988898899890989198929893989498959896989798989899990099019902990399049905990699079908990999109911991299139914991599169917991899199920992199229923992499259926992799289929993099319932993399349935993699379938993999409941994299439944994599469947994899499950995199529953995499559956995799589959996099619962996399649965996699679968996999709971997299739974997599769977997899799980998199829983998499859986998799889989999099919992999399949995999699979998999910000100011000210003100041000510006100071000810009100101001110012100131001410015100161001710018100191002010021100221002310024100251002610027100281002910030100311003210033100341003510036100371003810039100401004110042100431004410045100461004710048100491005010051100521005310054100551005610057100581005910060100611006210063100641006510066100671006810069100701007110072100731007410075100761007710078100791008010081100821008310084100851008610087100881008910090100911009210093100941009510096100971009810099101001010110102101031010410105101061010710108101091011010111101121011310114101151011610117101181011910120101211012210123101241012510126101271012810129101301013110132101331013410135101361013710138101391014010141101421014310144101451014610147101481014910150101511015210153101541015510156101571015810159101601016110162101631016410165101661016710168101691017010171101721017310174101751017610177101781017910180101811018210183101841018510186101871018810189101901019110192101931019410195101961019710198101991020010201102021020310204102051020610207102081020910210102111021210213102141021510216102171021810219102201022110222102231022410225102261022710228102291023010231102321023310234102351023610237102381023910240102411024210243102441024510246102471024810249102501025110252102531025410255102561025710258102591026010261102621026310264102651026610267102681026910270102711027210273102741027510276102771027810279102801028110282102831028410285102861028710288102891029010291102921029310294102951029610297102981029910300103011030210303103041030510306103071030810309103101031110312103131031410315103161031710318103191032010321103221032310324103251032610327103281032910330103311033210333103341033510336103371033810339103401034110342103431034410345103461034710348103491035010351103521035310354103551035610357103581035910360103611036210363103641036510366103671036810369103701037110372103731037410375103761037710378103791038010381103821038310384103851038610387103881038910390103911039210393103941039510396103971039810399104001040110402104031040410405104061040710408104091041010411104121041310414104151041610417104181041910420104211042210423104241042510426104271042810429104301043110432104331043410435104361043710438104391044010441104421044310444104451044610447104481044910450104511045210453104541045510456104571045810459104601046110462104631046410465104661046710468104691047010471104721047310474104751047610477104781047910480104811048210483104841048510486104871048810489104901049110492104931049410495104961049710498104991050010501105021050310504105051050610507105081050910510105111051210513105141051510516105171051810519105201052110522105231052410525105261052710528105291053010531105321053310534105351053610537105381053910540105411054210543105441054510546105471054810549105501055110552105531055410555105561055710558105591056010561105621056310564105651056610567105681056910570105711057210573105741057510576105771057810579105801058110582105831058410585105861058710588105891059010591105921059310594105951059610597105981059910600106011060210603106041060510606106071060810609106101061110612106131061410615106161061710618106191062010621106221062310624106251062610627106281062910630106311063210633106341063510636106371063810639106401064110642106431064410645106461064710648106491065010651106521065310654106551065610657106581065910660106611066210663106641066510666106671066810669106701067110672106731067410675106761067710678106791068010681106821068310684106851068610687106881068910690106911069210693106941069510696106971069810699107001070110702107031070410705107061070710708107091071010711107121071310714107151071610717107181071910720107211072210723107241072510726107271072810729107301073110732107331073410735107361073710738107391074010741107421074310744107451074610747107481074910750107511075210753107541075510756107571075810759107601076110762107631076410765107661076710768107691077010771107721077310774107751077610777107781077910780107811078210783107841078510786107871078810789107901079110792107931079410795107961079710798107991080010801108021080310804108051080610807108081080910810108111081210813108141081510816108171081810819108201082110822108231082410825108261082710828108291083010831108321083310834108351083610837108381083910840108411084210843108441084510846108471084810849108501085110852108531085410855108561085710858108591086010861108621086310864108651086610867108681086910870108711087210873108741087510876108771087810879108801088110882108831088410885108861088710888108891089010891108921089310894108951089610897108981089910900109011090210903109041090510906109071090810909109101091110912109131091410915109161091710918109191092010921109221092310924109251092610927109281092910930109311093210933109341093510936109371093810939109401094110942109431094410945109461094710948109491095010951109521095310954109551095610957109581095910960109611096210963109641096510966109671096810969109701097110972109731097410975109761097710978109791098010981109821098310984109851098610987109881098910990109911099210993109941099510996109971099810999110001100111002110031100411005110061100711008110091101011011110121101311014110151101611017110181101911020110211102211023110241102511026110271102811029110301103111032110331103411035110361103711038110391104011041110421104311044110451104611047110481104911050110511105211053110541105511056110571105811059110601106111062110631106411065110661106711068110691107011071110721107311074110751107611077110781107911080110811108211083110841108511086110871108811089110901109111092110931109411095110961109711098110991110011101111021110311104111051110611107111081110911110111111111211113111141111511116111171111811119111201112111122111231112411125111261112711128111291113011131111321113311134111351113611137111381113911140111411114211143111441114511146111471114811149111501115111152111531115411155111561115711158111591116011161111621116311164111651116611167111681116911170111711117211173111741117511176111771117811179111801118111182111831118411185111861118711188111891119011191111921119311194111951119611197111981119911200112011120211203112041120511206112071120811209112101121111212112131121411215112161121711218112191122011221112221122311224112251122611227112281122911230112311123211233112341123511236112371123811239112401124111242112431124411245112461124711248112491125011251112521125311254112551125611257112581125911260112611126211263112641126511266112671126811269112701127111272112731127411275112761127711278112791128011281112821128311284112851128611287112881128911290112911129211293112941129511296112971129811299113001130111302113031130411305113061130711308113091131011311113121131311314113151131611317113181131911320113211132211323113241132511326113271132811329113301133111332113331133411335113361133711338113391134011341113421134311344113451134611347113481134911350113511135211353113541135511356113571135811359113601136111362113631136411365113661136711368113691137011371113721137311374113751137611377113781137911380113811138211383113841138511386113871138811389113901139111392113931139411395113961139711398113991140011401114021140311404114051140611407114081140911410114111141211413114141141511416114171141811419114201142111422114231142411425114261142711428114291143011431114321143311434114351143611437114381143911440114411144211443114441144511446114471144811449114501145111452114531145411455114561145711458114591146011461114621146311464114651146611467114681146911470114711147211473114741147511476114771147811479114801148111482114831148411485114861148711488114891149011491114921149311494114951149611497114981149911500115011150211503115041150511506115071150811509115101151111512115131151411515115161151711518115191152011521115221152311524115251152611527115281152911530115311153211533115341153511536115371153811539115401154111542115431154411545115461154711548115491155011551115521155311554115551155611557115581155911560115611156211563115641156511566115671156811569115701157111572115731157411575115761157711578115791158011581115821158311584115851158611587115881158911590115911159211593115941159511596115971159811599116001160111602116031160411605116061160711608116091161011611116121161311614116151161611617116181161911620116211162211623116241162511626116271162811629116301163111632116331163411635116361163711638116391164011641116421164311644116451164611647116481164911650116511165211653116541165511656116571165811659116601166111662116631166411665116661166711668116691167011671116721167311674116751167611677116781167911680116811168211683116841168511686116871168811689116901169111692116931169411695116961169711698116991170011701117021170311704117051170611707117081170911710117111171211713117141171511716117171171811719117201172111722117231172411725117261172711728117291173011731117321173311734117351173611737117381173911740117411174211743117441174511746117471174811749117501175111752117531175411755117561175711758117591176011761117621176311764117651176611767117681176911770117711177211773117741177511776117771177811779117801178111782117831178411785117861178711788117891179011791117921179311794117951179611797117981179911800118011180211803118041180511806118071180811809118101181111812118131181411815118161181711818118191182011821118221182311824118251182611827118281182911830118311183211833118341183511836118371183811839118401184111842118431184411845118461184711848118491185011851118521185311854118551185611857118581185911860118611186211863118641186511866118671186811869118701187111872118731187411875118761187711878118791188011881118821188311884118851188611887118881188911890118911189211893118941189511896118971189811899119001190111902119031190411905119061190711908119091191011911119121191311914119151191611917119181191911920119211192211923119241192511926119271192811929119301193111932119331193411935119361193711938119391194011941119421194311944119451194611947119481194911950119511195211953119541195511956119571195811959119601196111962119631196411965119661196711968119691197011971119721197311974119751197611977119781197911980119811198211983119841198511986119871198811989119901199111992119931199411995119961199711998119991200012001120021200312004120051200612007120081200912010120111201212013120141201512016120171201812019120201202112022120231202412025120261202712028120291203012031120321203312034120351203612037120381203912040120411204212043120441204512046120471204812049120501205112052120531205412055120561205712058120591206012061120621206312064120651206612067120681206912070120711207212073120741207512076120771207812079120801208112082120831208412085120861208712088120891209012091120921209312094120951209612097120981209912100121011210212103121041210512106121071210812109121101211112112121131211412115121161211712118121191212012121121221212312124121251212612127121281212912130121311213212133121341213512136121371213812139121401214112142121431214412145121461214712148121491215012151121521215312154121551215612157121581215912160121611216212163121641216512166121671216812169121701217112172121731217412175121761217712178121791218012181121821218312184121851218612187121881218912190121911219212193121941219512196121971219812199122001220112202122031220412205122061220712208122091221012211122121221312214122151221612217122181221912220122211222212223122241222512226122271222812229122301223112232122331223412235122361223712238122391224012241122421224312244122451224612247122481224912250122511225212253122541225512256122571225812259122601226112262122631226412265122661226712268122691227012271122721227312274122751227612277122781227912280122811228212283122841228512286122871228812289122901229112292122931229412295122961229712298122991230012301123021230312304123051230612307123081230912310123111231212313123141231512316123171231812319123201232112322123231232412325123261232712328123291233012331123321233312334123351233612337123381233912340123411234212343123441234512346123471234812349123501235112352123531235412355123561235712358123591236012361123621236312364123651236612367123681236912370123711237212373123741237512376123771237812379123801238112382123831238412385123861238712388123891239012391123921239312394123951239612397123981239912400124011240212403124041240512406124071240812409124101241112412124131241412415124161241712418124191242012421124221242312424124251242612427124281242912430124311243212433124341243512436124371243812439124401244112442124431244412445124461244712448124491245012451124521245312454124551245612457124581245912460124611246212463124641246512466124671246812469124701247112472124731247412475124761247712478124791248012481124821248312484124851248612487124881248912490124911249212493124941249512496124971249812499125001250112502125031250412505125061250712508125091251012511125121251312514125151251612517125181251912520125211252212523125241252512526125271252812529125301253112532125331253412535125361253712538125391254012541125421254312544125451254612547125481254912550125511255212553125541255512556125571255812559125601256112562125631256412565125661256712568125691257012571125721257312574125751257612577125781257912580125811258212583125841258512586125871258812589125901259112592125931259412595125961259712598125991260012601126021260312604126051260612607126081260912610126111261212613126141261512616126171261812619126201262112622126231262412625126261262712628126291263012631126321263312634126351263612637126381263912640126411264212643126441264512646126471264812649126501265112652126531265412655126561265712658126591266012661126621266312664126651266612667126681266912670126711267212673126741267512676126771267812679126801268112682126831268412685126861268712688126891269012691126921269312694126951269612697126981269912700127011270212703127041270512706127071270812709127101271112712127131271412715127161271712718127191272012721127221272312724127251272612727127281272912730127311273212733127341273512736127371273812739127401274112742127431274412745127461274712748127491275012751127521275312754127551275612757127581275912760127611276212763127641276512766127671276812769127701277112772127731277412775127761277712778127791278012781127821278312784127851278612787127881278912790127911279212793127941279512796127971279812799128001280112802128031280412805128061280712808128091281012811128121281312814128151281612817128181281912820128211282212823128241282512826128271282812829128301283112832128331283412835128361283712838128391284012841128421284312844128451284612847128481284912850128511285212853128541285512856128571285812859128601286112862128631286412865128661286712868128691287012871128721287312874128751287612877128781287912880128811288212883128841288512886128871288812889128901289112892128931289412895128961289712898128991290012901129021290312904129051290612907129081290912910129111291212913129141291512916129171291812919129201292112922129231292412925129261292712928129291293012931129321293312934129351293612937129381293912940129411294212943129441294512946129471294812949129501295112952129531295412955129561295712958129591296012961129621296312964129651296612967129681296912970129711297212973129741297512976129771297812979129801298112982129831298412985129861298712988129891299012991129921299312994129951299612997129981299913000130011300213003130041300513006130071300813009130101301113012130131301413015130161301713018130191302013021130221302313024130251302613027130281302913030130311303213033130341303513036130371303813039130401304113042130431304413045130461304713048130491305013051130521305313054130551305613057130581305913060130611306213063130641306513066130671306813069130701307113072130731307413075130761307713078130791308013081130821308313084130851308613087130881308913090130911309213093130941309513096130971309813099131001310113102131031310413105131061310713108131091311013111131121311313114131151311613117131181311913120131211312213123131241312513126131271312813129131301313113132131331313413135131361313713138131391314013141131421314313144131451314613147131481314913150131511315213153131541315513156131571315813159131601316113162131631316413165131661316713168131691317013171131721317313174131751317613177131781317913180131811318213183131841318513186131871318813189131901319113192131931319413195131961319713198131991320013201132021320313204132051320613207132081320913210132111321213213132141321513216132171321813219132201322113222132231322413225132261322713228132291323013231132321323313234132351323613237132381323913240132411324213243132441324513246132471324813249132501325113252132531325413255132561325713258132591326013261132621326313264132651326613267132681326913270132711327213273132741327513276132771327813279132801328113282132831328413285132861328713288132891329013291132921329313294132951329613297132981329913300133011330213303133041330513306133071330813309133101331113312133131331413315133161331713318133191332013321133221332313324133251332613327133281332913330133311333213333133341333513336133371333813339133401334113342133431334413345133461334713348133491335013351133521335313354133551335613357133581335913360133611336213363133641336513366133671336813369133701337113372133731337413375133761337713378133791338013381133821338313384133851338613387133881338913390133911339213393133941339513396133971339813399134001340113402134031340413405134061340713408134091341013411134121341313414134151341613417134181341913420134211342213423134241342513426134271342813429134301343113432134331343413435134361343713438134391344013441134421344313444134451344613447134481344913450134511345213453134541345513456134571345813459134601346113462134631346413465134661346713468134691347013471134721347313474134751347613477134781347913480134811348213483134841348513486134871348813489134901349113492134931349413495134961349713498134991350013501135021350313504135051350613507135081350913510135111351213513135141351513516135171351813519135201352113522135231352413525135261352713528135291353013531135321353313534135351353613537135381353913540135411354213543135441354513546135471354813549135501355113552135531355413555135561355713558135591356013561135621356313564135651356613567135681356913570135711357213573135741357513576135771357813579135801358113582135831358413585135861358713588135891359013591135921359313594135951359613597135981359913600136011360213603136041360513606136071360813609136101361113612136131361413615136161361713618136191362013621136221362313624136251362613627136281362913630136311363213633136341363513636136371363813639136401364113642136431364413645136461364713648136491365013651136521365313654136551365613657136581365913660136611366213663136641366513666136671366813669136701367113672136731367413675136761367713678136791368013681136821368313684136851368613687136881368913690136911369213693136941369513696136971369813699137001370113702137031370413705137061370713708137091371013711137121371313714137151371613717137181371913720137211372213723137241372513726137271372813729137301373113732137331373413735137361373713738137391374013741137421374313744137451374613747137481374913750137511375213753137541375513756137571375813759137601376113762137631376413765137661376713768137691377013771137721377313774137751377613777137781377913780137811378213783137841378513786137871378813789137901379113792137931379413795137961379713798137991380013801138021380313804138051380613807138081380913810138111381213813138141381513816138171381813819138201382113822138231382413825138261382713828138291383013831138321383313834138351383613837138381383913840138411384213843138441384513846138471384813849138501385113852138531385413855138561385713858138591386013861138621386313864138651386613867138681386913870138711387213873138741387513876138771387813879138801388113882138831388413885138861388713888138891389013891138921389313894138951389613897138981389913900139011390213903139041390513906139071390813909139101391113912139131391413915139161391713918139191392013921139221392313924139251392613927139281392913930139311393213933139341393513936139371393813939139401394113942139431394413945139461394713948139491395013951139521395313954139551395613957139581395913960139611396213963139641396513966139671396813969139701397113972139731397413975139761397713978139791398013981139821398313984139851398613987139881398913990139911399213993139941399513996139971399813999140001400114002140031400414005140061400714008140091401014011140121401314014140151401614017140181401914020140211402214023140241402514026140271402814029140301403114032140331403414035140361403714038140391404014041140421404314044140451404614047140481404914050140511405214053140541405514056140571405814059140601406114062140631406414065140661406714068140691407014071140721407314074140751407614077140781407914080140811408214083140841408514086140871408814089140901409114092140931409414095140961409714098140991410014101141021410314104141051410614107141081410914110141111411214113141141411514116141171411814119141201412114122141231412414125141261412714128141291413014131141321413314134141351413614137141381413914140141411414214143141441414514146141471414814149141501415114152141531415414155141561415714158141591416014161141621416314164141651416614167141681416914170141711417214173141741417514176141771417814179141801418114182141831418414185141861418714188141891419014191141921419314194141951419614197141981419914200142011420214203142041420514206142071420814209142101421114212142131421414215142161421714218142191422014221142221422314224142251422614227142281422914230142311423214233142341423514236142371423814239142401424114242142431424414245142461424714248142491425014251142521425314254142551425614257142581425914260142611426214263142641426514266142671426814269142701427114272142731427414275142761427714278142791428014281142821428314284142851428614287142881428914290142911429214293142941429514296142971429814299143001430114302143031430414305143061430714308143091431014311143121431314314143151431614317143181431914320143211432214323143241432514326143271432814329143301433114332143331433414335143361433714338143391434014341143421434314344143451434614347143481434914350143511435214353143541435514356143571435814359143601436114362143631436414365143661436714368143691437014371143721437314374143751437614377143781437914380143811438214383143841438514386143871438814389143901439114392143931439414395143961439714398143991440014401144021440314404144051440614407144081440914410144111441214413144141441514416144171441814419144201442114422144231442414425144261442714428144291443014431144321443314434144351443614437144381443914440144411444214443144441444514446144471444814449144501445114452144531445414455144561445714458144591446014461144621446314464144651446614467144681446914470144711447214473144741447514476144771447814479144801448114482144831448414485144861448714488144891449014491144921449314494144951449614497144981449914500145011450214503145041450514506145071450814509145101451114512145131451414515145161451714518145191452014521145221452314524145251452614527145281452914530145311453214533145341453514536145371453814539145401454114542145431454414545145461454714548145491455014551145521455314554145551455614557145581455914560145611456214563145641456514566145671456814569145701457114572145731457414575145761457714578145791458014581145821458314584145851458614587145881458914590145911459214593145941459514596145971459814599146001460114602146031460414605146061460714608146091461014611146121461314614146151461614617146181461914620146211462214623146241462514626146271462814629146301463114632146331463414635146361463714638146391464014641146421464314644146451464614647146481464914650146511465214653146541465514656146571465814659146601466114662146631466414665146661466714668146691467014671146721467314674146751467614677146781467914680146811468214683146841468514686
  1. MODULE FoxIntermediateBackend; (** AUTHOR ""; PURPOSE ""; *)
  2. IMPORT Basic := FoxBasic, SyntaxTree := FoxSyntaxTree, SemanticChecker := FoxSemanticChecker, Backend := FoxBackend, Global := FoxGlobal,
  3. Scanner := FoxScanner, IntermediateCode := FoxIntermediateCode, Sections := FoxSections, BinaryCode := FoxBinaryCode, Printout := FoxPrintout,
  4. SYSTEM, Diagnostics, Strings, Options, Streams, Compiler, Formats := FoxFormats, SymbolFileFormat := FoxTextualSymbolFile, D := Debugging,
  5. FingerPrinter := FoxFingerPrinter, StringPool, CRC;
  6. CONST
  7. (* operand modes *)
  8. ModeUndefined = 0;
  9. ModeReference = 1;
  10. ModeValue = 2;
  11. (* heap data offsets *)
  12. ArrayDimTable = 3; (* dimension table in dyn arrays *)
  13. (* math array offsets *)
  14. MathPtrOffset=0;
  15. MathAdrOffset=1;
  16. MathFlagsOffset=2;
  17. MathDimOffset=3;
  18. MathElementSizeOffset=4;
  19. MathLenOffset=5;
  20. MathIncrOffset=6;
  21. SysDataArrayOffset* = 0; (* array offset in system bl ock, for 32 byte alignment *)
  22. ArrDataArrayOffset*= 16*8; (* 16 bytes array offset in array block, to be compatible with the GC scheme of POINTER TO ARRAY OF ... *)
  23. TensorFlag* = 0; (* flag indicating a tensor array *)
  24. RangeFlag* = 1; (* flag indicating a range, e.g. an array derived from A[..,..] *)
  25. StackFlag* = 2; (* flag indicates temporary result *)
  26. StaticFlag* = 1; (* flag indicating a static array, may not be reallocated *)
  27. (** compiler generated traps *)
  28. WithTrap* = 1; (* generated when a WITH statement fails *)
  29. CaseTrap* = 2; (* generated when a case statement without else block fails *)
  30. ReturnTrap* = 3;
  31. TypeEqualTrap* = 5;
  32. TypeCheckTrap* = 6;
  33. IndexCheckTrap* = 7; (* generated when index is out of bounds or range is invalid *)
  34. AssertTrap* = 8; (* generated when an assert fails *)
  35. ArraySizeTrap* = 9;
  36. ArrayFormTrap*=10; (* indicates that array cannot be (re-)allocated since shape, type or size does not match *)
  37. SetElementTrap*=11; (* indicates that a set element is out of MIN(SET)...MAX(SET) *)
  38. NegativeDivisorTrap*=12;
  39. NoReturnTrap*=16; (* indicates that a procedure marked no return did return *)
  40. NilPointerTrap*=17; (* indicates that a nil pointer was being dereferenced *)
  41. Trace = FALSE;
  42. TraceRegisterUsageCount=TRUE;
  43. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  44. (** system call numbers *)
  45. NumberSystemCalls* = 12;
  46. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  47. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  48. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  49. DefaultRuntimeModuleName ="Runtime";
  50. DefaultTraceModuleName ="KernelLog";
  51. ChannelModuleName = "Channels";
  52. NonPointer = -1; (* special pointer values *)
  53. NoType = 0; (* special type info values *)
  54. LhsIsPointer = 0; (* for the operator kind *)
  55. RhsIsPointer = 1;
  56. (* priority values, lower means higher priority *)
  57. EntryPriority=-4;
  58. FirstPriority=-3;
  59. InitPriority=-2;
  60. ExitPriority=-1;
  61. BasePointerTypeSize = 5;
  62. BaseArrayTypeSize = BasePointerTypeSize + 3;
  63. LengthOffset = BasePointerTypeSize + 0;
  64. DataOffset = BasePointerTypeSize + 1;
  65. DescriptorOffset = BasePointerTypeSize + 2;
  66. BaseRecordTypeSize = BasePointerTypeSize + 2;
  67. ActionOffset = BasePointerTypeSize + 0;
  68. MonitorOffset = BasePointerTypeSize + 1;
  69. BaseObjectTypeSize = BaseRecordTypeSize;
  70. ActionTypeSize = 3;
  71. MonitorTypeSize = 7;
  72. ProcessorOffset = BaseObjectTypeSize + 1;
  73. StackLimitOffset* = BaseObjectTypeSize + 3;
  74. QuantumOffset = BaseObjectTypeSize + 4;
  75. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  76. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  77. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  78. Size2Flag = 4; (* size = 2 *)
  79. Size3Flag = 5; (* size = 3 *)
  80. Size4Flag = 6; (* size = 4 *)
  81. Size5Flag = 7; (* size = 5 *)
  82. Size6Flag = 8; (* size = 6 *)
  83. Size7Flag = 9; (* size = 7 *)
  84. Size8Flag = 10; (* size = 8 *)
  85. ReflectionSupport = TRUE;
  86. (* Solution for identifying procedure descriptors on the stack and for being able to differentiate "old school" stack frames from the underlying operating system stack frames:
  87. push a procedure desriptor plus one to where the BP pointer would be located. The misalignment of the procedure descriptor makes it possible to identify that it is not
  88. a base pointer but a procedure descriptor. The base pointer itself is in such cases located at BP + address size.
  89. *)
  90. (* I am not 100% sure if it is necessary or not -- so I keep a flag to be able to re-enable this *)
  91. ProtectModulesPointers = FALSE;
  92. CreateProcedureDescInfo = TRUE;
  93. WarningDynamicLoading = FALSE;
  94. TYPE
  95. Position=SyntaxTree.Position;
  96. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  97. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  98. Operand = RECORD
  99. mode: SHORTINT;
  100. op: IntermediateCode.Operand;
  101. tag: IntermediateCode.Operand;
  102. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  103. dimOffset: LONGINT;
  104. END;
  105. Fixup= POINTER TO RECORD
  106. pc: LONGINT;
  107. nextFixup: Fixup;
  108. END;
  109. WriteBackCall = POINTER TO RECORD
  110. call: SyntaxTree.ProcedureCallDesignator;
  111. next: WriteBackCall;
  112. END;
  113. Label= OBJECT
  114. VAR
  115. fixups: Fixup;
  116. section: IntermediateCode.Section;
  117. pc: LONGINT;
  118. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  119. BEGIN
  120. SELF.section := section; pc := -1;
  121. END InitLabel;
  122. PROCEDURE Resolve(pc: LONGINT);
  123. VAR at: LONGINT;
  124. BEGIN
  125. SELF.pc := pc;
  126. WHILE(fixups # NIL) DO
  127. at := fixups.pc;
  128. section.PatchAddress(at,pc);
  129. fixups := fixups.nextFixup;
  130. END;
  131. END Resolve;
  132. PROCEDURE AddFixup(at: LONGINT);
  133. VAR fixup: Fixup;
  134. BEGIN
  135. ASSERT(pc=-1);
  136. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  137. END AddFixup;
  138. END Label;
  139. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  140. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  141. VAR
  142. backend: IntermediateBackend;
  143. implementationVisitor: ImplementationVisitor;
  144. meta: MetaDataGenerator;
  145. system: Global.System;
  146. currentScope: SyntaxTree.Scope;
  147. module: Sections.Module;
  148. moduleSelf: SyntaxTree.Variable;
  149. dump: BOOLEAN;
  150. forceModuleBody: BOOLEAN;
  151. addressType: IntermediateCode.Type;
  152. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  153. BEGIN
  154. currentScope := NIL; module := NIL; moduleSelf := NIL;
  155. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  156. SELF.dump := dump;
  157. SELF.backend := backend;
  158. SELF.forceModuleBody := forceModuleBody;
  159. addressType := IntermediateCode.GetType(system,system.addressType)
  160. END Init;
  161. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  162. BEGIN
  163. backend.Error(module.module.sourceName, position, Diagnostics.Invalid, s);
  164. END Error;
  165. PROCEDURE Type(x: SyntaxTree.Type);
  166. BEGIN
  167. x.Accept(SELF);
  168. END Type;
  169. (** types **)
  170. PROCEDURE VisitBasicType(x: SyntaxTree.BasicType);
  171. BEGIN (* no code emission *) END VisitBasicType;
  172. PROCEDURE VisitCharacterType(x: SyntaxTree.CharacterType);
  173. BEGIN (* no code emission *) END VisitCharacterType;
  174. PROCEDURE VisitIntegerType(x: SyntaxTree.IntegerType);
  175. BEGIN (* no code emission *) END VisitIntegerType;
  176. PROCEDURE VisitFloatType(x: SyntaxTree.FloatType);
  177. BEGIN (* no code emission *) END VisitFloatType;
  178. PROCEDURE VisitComplexType(x: SyntaxTree.ComplexType);
  179. BEGIN (* no code emission *) END VisitComplexType;
  180. PROCEDURE VisitQualifiedType(x: SyntaxTree.QualifiedType);
  181. VAR type: SyntaxTree.Type;
  182. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  183. type := x.resolved;
  184. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  185. meta.CheckTypeDeclaration(type);
  186. END;
  187. END VisitQualifiedType;
  188. PROCEDURE VisitStringType(x: SyntaxTree.StringType);
  189. BEGIN (* no code emission *) END VisitStringType;
  190. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  191. BEGIN (* no code emission *)
  192. END VisitArrayRangeType;
  193. PROCEDURE VisitArrayType(x: SyntaxTree.ArrayType);
  194. BEGIN (* no code emission *) END VisitArrayType;
  195. PROCEDURE VisitPortType(x: SyntaxTree.PortType);
  196. BEGIN (* no code emission *) END VisitPortType;
  197. PROCEDURE VisitMathArrayType(x: SyntaxTree.MathArrayType);
  198. BEGIN
  199. meta.CheckTypeDeclaration(x);
  200. END VisitMathArrayType;
  201. PROCEDURE VisitPointerType(x: SyntaxTree.PointerType);
  202. BEGIN
  203. meta.CheckTypeDeclaration(x);
  204. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  205. END VisitPointerType;
  206. PROCEDURE VisitRecordType(x: SyntaxTree.RecordType);
  207. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  208. BEGIN (* no code emission *)
  209. meta.CheckTypeDeclaration(x);
  210. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  211. IF x.pointerType.typeDeclaration # NIL THEN
  212. td := x.pointerType.typeDeclaration
  213. ELSE
  214. td := x.typeDeclaration
  215. END;
  216. Global.GetSymbolName(td,name);
  217. (* code section for object *)
  218. END;
  219. Scope(x.recordScope);
  220. END VisitRecordType;
  221. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  222. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  223. BEGIN
  224. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  225. WHILE (this # NIL) & (this.identifier# id) DO
  226. this := this.nextModifier;
  227. END;
  228. RETURN this # NIL
  229. END HasFlag;
  230. PROCEDURE VisitCellType(x: SyntaxTree.CellType);
  231. VAR port,adr: LONGINT; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  232. BEGIN
  233. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  234. capabilities := {};
  235. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  236. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  237. backend.SetCapabilities(capabilities);
  238. IF ~implementationVisitor.checker.SkipImplementation(x) THEN
  239. Scope(x.cellScope);
  240. END;
  241. END VisitCellType;
  242. PROCEDURE VisitProcedureType(x: SyntaxTree.ProcedureType);
  243. BEGIN (* no code emission *) END VisitProcedureType;
  244. PROCEDURE VisitEnumerationType(x: SyntaxTree.EnumerationType);
  245. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  246. END VisitEnumerationType;
  247. (* symbols *)
  248. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  249. BEGIN
  250. Procedure(x);
  251. END VisitProcedure;
  252. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  253. BEGIN
  254. Procedure(x);
  255. END VisitOperator;
  256. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  257. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, dim, i: LONGINT;
  258. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  259. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  260. BEGIN
  261. type := type.resolved;
  262. IF type IS SyntaxTree.RecordType THEN
  263. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  264. ELSIF (type IS SyntaxTree.ArrayType) THEN
  265. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  266. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  267. END;
  268. ELSIF type IS SyntaxTree.MathArrayType THEN
  269. WITH type: SyntaxTree.MathArrayType DO
  270. IF type.form = SyntaxTree.Open THEN
  271. RETURN TRUE
  272. ELSIF type.form = SyntaxTree.Static THEN
  273. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  274. END;
  275. END;
  276. END;
  277. RETURN FALSE
  278. END TypeNeedsInitialization;
  279. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  280. VAR variable: SyntaxTree.Variable;
  281. BEGIN
  282. variable := scope.firstVariable;
  283. WHILE variable # NIL DO
  284. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  285. IF variable.initializer # NIL THEN RETURN TRUE END;
  286. variable := variable.nextVariable;
  287. END;
  288. RETURN FALSE
  289. END ScopeNeedsInitialization;
  290. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset:LONGINT);
  291. VAR size: LONGINT;
  292. BEGIN
  293. size := offset - lastUpdated;
  294. IF size > 0 THEN
  295. irv.Emit(Reserve(x.position,size));
  296. END;
  297. irv.Emit(Data(x.position, op));
  298. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  299. END SingleInitialize;
  300. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset:LONGINT);
  301. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable; i: LONGINT; size:LONGINT;
  302. BEGIN
  303. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  304. WITH type: SyntaxTree.RecordType DO
  305. baseType := type.baseType;
  306. IF baseType # NIL THEN
  307. baseType := baseType.resolved;
  308. IF baseType IS SyntaxTree.PointerType THEN
  309. baseType := baseType(SyntaxTree.PointerType).pointerBase
  310. END;
  311. Initialize(baseType,NIL, offset);
  312. END;
  313. variable := type.recordScope.firstVariable;
  314. WHILE variable # NIL DO
  315. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  316. variable := variable.nextVariable
  317. END;
  318. | type: SyntaxTree.ArrayType DO
  319. IF type.form = SyntaxTree.Static THEN
  320. baseType := type.arrayBase;
  321. IF TypeNeedsInitialization(baseType) THEN
  322. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  323. FOR i := 0 TO type.staticLength-1 DO
  324. Initialize(baseType,NIL,offset+i*size);
  325. END;
  326. END;
  327. END;
  328. | type: SyntaxTree.MathArrayType DO
  329. IF type.form = SyntaxTree.Open THEN
  330. dim := DynamicDim(type);
  331. baseType := SemanticChecker.ArrayBase(type,dim);
  332. imm := IntermediateCode.Immediate(addressType,dim);
  333. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  334. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  335. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  336. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  337. (* flags remain empty (=0) for open array *)
  338. ELSIF type.form = SyntaxTree.Static THEN
  339. baseType := type.arrayBase;
  340. IF TypeNeedsInitialization(baseType) THEN
  341. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  342. ASSERT(type.staticLength < 1024*1024*1024);
  343. FOR i := 0 TO type.staticLength-1 DO
  344. Initialize(baseType,NIL,offset+i*size);
  345. END;
  346. END;
  347. END;
  348. ELSE
  349. IF initializer # NIL THEN
  350. implementationVisitor.Evaluate(initializer, op);
  351. SingleInitialize(op.op, offset);
  352. END;
  353. END;
  354. END Initialize;
  355. BEGIN
  356. IF x.externalName # NIL THEN RETURN END;
  357. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  358. (* code section for variable *)
  359. Global.GetSymbolSegmentedName(x,name);
  360. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  361. irv.SetExported(IsExported(x));
  362. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  363. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  364. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  365. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  366. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  367. FOR i := 0 TO DynamicDim(x.type)-1 DO
  368. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  369. END;
  370. ELSE
  371. lastUpdated:= 0;
  372. IF implementationVisitor.newObjectFile & ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  373. Initialize(x.type, x.initializer, 0);
  374. END;
  375. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  376. IF size > 0 THEN
  377. irv.Emit(Reserve(x.position,size));
  378. END;
  379. IF ~x.fixed THEN
  380. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  381. ELSE
  382. align := x.alignment;
  383. END;
  384. irv.SetPositionOrAlignment(x.fixed, align);
  385. meta.CheckTypeDeclaration(x.type);
  386. END;
  387. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  388. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  389. END;
  390. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  391. END VisitVariable;
  392. PROCEDURE VisitProperty(x: SyntaxTree.Property);
  393. BEGIN
  394. VisitVariable(x)
  395. END VisitProperty;
  396. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  397. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i, dim: LONGINT;
  398. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  399. BEGIN
  400. ASSERT(currentScope IS SyntaxTree.CellScope);
  401. Global.GetSymbolSegmentedName(x,name);
  402. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  403. irv.SetExported(IsExported(x));
  404. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  405. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  406. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  407. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  408. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  409. FOR i := 0 TO DynamicDim(x.type)-1 DO
  410. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  411. END;
  412. ELSE
  413. lastUpdated:= 0;
  414. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  415. IF size > 0 THEN
  416. irv.Emit(Reserve(x.position,size));
  417. END;
  418. IF ~x.fixed THEN
  419. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  420. ELSE
  421. align := x.alignment;
  422. END;
  423. irv.SetPositionOrAlignment(x.fixed, align);
  424. meta.CheckTypeDeclaration(x.type);
  425. END;
  426. END VisitParameter;
  427. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  428. BEGIN
  429. Type(x.declaredType); (* => code in objects *)
  430. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  431. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  432. END;
  433. END VisitTypeDeclaration;
  434. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  435. BEGIN
  436. IF (SyntaxTree.Public * x.access # {}) THEN
  437. implementationVisitor.VisitConstant(x);
  438. END;
  439. END VisitConstant;
  440. PROCEDURE Scope(x: SyntaxTree.Scope);
  441. VAR procedure: SyntaxTree.Procedure;
  442. constant: SyntaxTree.Constant;
  443. variable: SyntaxTree.Variable;
  444. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  445. cell: SyntaxTree.CellType;
  446. parameter: SyntaxTree.Parameter;
  447. property: SyntaxTree.Property;
  448. BEGIN
  449. prevScope := currentScope;
  450. currentScope := x;
  451. (* constants treated in implementation visitor *)
  452. WITH x: SyntaxTree.CellScope DO
  453. cell := x.ownerCell;
  454. parameter := cell.firstParameter;
  455. WHILE parameter # NIL DO
  456. VisitParameter(parameter);
  457. parameter := parameter.nextParameter;
  458. END;
  459. property := cell.firstProperty;
  460. WHILE property # NIL DO
  461. VisitProperty(property);
  462. property := property.nextProperty;
  463. END;
  464. ELSE
  465. END;
  466. typeDeclaration := x.firstTypeDeclaration;
  467. WHILE typeDeclaration # NIL DO
  468. VisitTypeDeclaration(typeDeclaration);
  469. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  470. END;
  471. variable := x.firstVariable;
  472. WHILE variable # NIL DO
  473. VisitVariable(variable);
  474. variable := variable.nextVariable;
  475. END;
  476. procedure := x.firstProcedure;
  477. WHILE procedure # NIL DO
  478. VisitProcedure(procedure);
  479. procedure := procedure.nextProcedure;
  480. END;
  481. constant := x.firstConstant;
  482. WHILE constant # NIL DO
  483. VisitConstant(constant);
  484. constant := constant.nextConstant;
  485. END;
  486. currentScope := prevScope;
  487. END Scope;
  488. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  489. VAR parameter: SyntaxTree.Parameter;
  490. BEGIN
  491. parameter := first;
  492. WHILE parameter # NIL DO
  493. VisitParameter(parameter);
  494. parameter := parameter.nextParameter;
  495. END;
  496. END Parameters;
  497. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  498. VAR scope: SyntaxTree.ProcedureScope;
  499. prevScope: SyntaxTree.Scope;
  500. inline, finalizer: BOOLEAN;
  501. procedureType: SyntaxTree.ProcedureType;
  502. pc: LONGINT;
  503. stackSize: LONGINT;
  504. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  505. null,size,src,dest,fp,res: IntermediateCode.Operand;
  506. cc: LONGINT;
  507. cellType: SyntaxTree.CellType;
  508. registerNumber: LONGINT;
  509. registerParameter: Backend.Registers;
  510. registerParameters: LONGINT;
  511. registerClass: IntermediateCode.RegisterClass;
  512. type: IntermediateCode.Type;
  513. formalParameter: SyntaxTree.Parameter;
  514. recordType: SyntaxTree.RecordType;
  515. isModuleBody: BOOLEAN;
  516. parametersSize: LONGINT;
  517. position: LONGINT;
  518. PROCEDURE Signature;
  519. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  520. BEGIN
  521. procedureType := x.type(SyntaxTree.ProcedureType);
  522. returnType := procedureType.returnType;
  523. IF returnType # NIL THEN
  524. meta.CheckTypeDeclaration(returnType)
  525. END;
  526. parameter := procedureType.firstParameter;
  527. WHILE parameter # NIL DO
  528. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  529. parameter := parameter.nextParameter;
  530. END;
  531. END Signature;
  532. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  533. VAR result: BOOLEAN;
  534. BEGIN
  535. result := FALSE;
  536. IF x = SyntaxTree.invalidExpression THEN
  537. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  538. result := TRUE;
  539. value := x.resolved(SyntaxTree.IntegerValue).value;
  540. ELSE
  541. Error(x.position,"expression is not an integer constant");
  542. END;
  543. RETURN result;
  544. END CheckIntegerValue;
  545. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  546. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  547. BEGIN
  548. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  549. WHILE (this # NIL) & (this.identifier # id) DO
  550. this := this.nextModifier;
  551. END;
  552. IF this # NIL THEN
  553. IF this.expression = NIL THEN
  554. Error(this.position,"expected expression value");
  555. ELSIF CheckIntegerValue(this.expression,value) THEN
  556. END;
  557. RETURN TRUE
  558. ELSE RETURN FALSE
  559. END;
  560. END HasValue;
  561. CONST DefaultDataMemorySize=512;
  562. BEGIN
  563. IF x.externalName # NIL THEN RETURN END;
  564. (*
  565. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  566. *)
  567. (* code section for this procedure *)
  568. position := x.position.start;
  569. scope := x.procedureScope;
  570. prevScope := currentScope;
  571. currentScope := scope;
  572. procedureType := x.type(SyntaxTree.ProcedureType);
  573. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  574. implementationVisitor.temporaries.Init;
  575. implementationVisitor.usedRegisters := NIL;
  576. implementationVisitor.registerUsageCount.Init;
  577. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  578. IF (scope.body # NIL) & (x.isInline) THEN
  579. inline := TRUE;
  580. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  581. ir.SetExported(IsExported(x));
  582. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  583. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  584. IF backend.cellsAreObjects THEN
  585. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  586. ir.SetExported(IsExported(x));
  587. ELSE
  588. RETURN; (* cellnet cannot be compiled for final static hardware *)
  589. END;
  590. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  591. inline := FALSE;
  592. AddBodyCallStub(x);
  593. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  594. ir.SetExported(IsExported(x));
  595. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  596. inline := FALSE;
  597. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  598. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := DefaultDataMemorySize END;
  599. AddBodyCallStub(x);
  600. AddStackAllocation(x,stackSize);
  601. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  602. ir.SetExported(IsExported(x));
  603. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  604. inline := FALSE;
  605. Parameters(procedureType.firstParameter);
  606. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  607. ir.SetExported(IsExported(x));
  608. ELSE
  609. inline := FALSE;
  610. IF x.isEntry OR x.isExit THEN
  611. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,x,dump);
  612. ir.SetExported(TRUE);
  613. IF x.isEntry THEN ir.SetPriority(EntryPriority) ELSE ir.SetPriority(ExitPriority) END;
  614. ELSE
  615. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  616. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  617. END;
  618. END;
  619. cc := procedureType.callingConvention;
  620. IF cc = SyntaxTree.WinAPICallingConvention THEN
  621. parametersSize := ProcedureParametersSize(backend.system,x);
  622. ELSE
  623. parametersSize := 0;
  624. END;
  625. IF scope.body # NIL THEN
  626. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  627. registerNumber := 0;
  628. IF ~inline THEN
  629. IF scope.lastVariable = NIL THEN
  630. stackSize := 0
  631. ELSE
  632. stackSize := scope.lastVariable.offsetInBits;
  633. IF stackSize <0 THEN stackSize := -stackSize END;
  634. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  635. END;
  636. (*
  637. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  638. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  639. *)
  640. (*
  641. ir.Emit(Nop(position)); (* placeholder for fill *)
  642. *)
  643. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  644. registerParameter := backend.GetParameterRegisters(procedureType.callingConvention);
  645. IF registerParameter = NIL THEN registerParameters := 0
  646. ELSE registerParameters := LEN(registerParameter)
  647. END;
  648. formalParameter := procedureType.lastParameter;
  649. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  650. IF ~PassInRegister(formalParameter) THEN
  651. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  652. ELSE
  653. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, registerParameter[registerNumber]);
  654. IF formalParameter.type.IsRecordType() THEN
  655. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  656. type := addressType;
  657. ELSE
  658. type := GetType(system, formalParameter.type);
  659. END;
  660. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  661. IntermediateCode.InitMemory(dest,type,implementationVisitor.sp,ToMemoryUnits(system,formalParameter.offsetInBits - system.addressSize));
  662. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  663. implementationVisitor.ReleaseIntermediateOperand(src);
  664. INC(registerNumber);
  665. formalParameter := formalParameter.prevParameter;
  666. END;
  667. END;
  668. END;
  669. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  670. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  671. END;
  672. pc := ir.pc-1;
  673. END;
  674. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  675. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  676. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  677. IF scope.lastVariable # NIL THEN
  678. stackSize := scope.lastVariable.offsetInBits;
  679. IF stackSize <0 THEN stackSize := -stackSize END;
  680. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  681. END;
  682. END;
  683. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  684. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  685. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  686. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  687. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  688. ir.EmitAt(pc,Push(size));
  689. implementationVisitor.StaticCallOperand(result,procedure);
  690. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  691. END;
  692. *)
  693. END;
  694. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  695. IF stackSize > 0 THEN
  696. IF (stackSize MOD system.addressSize = 0) THEN
  697. null := IntermediateCode.Immediate(addressType,0);
  698. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  699. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  700. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  701. ELSE
  702. null := IntermediateCode.Immediate(int8,0);
  703. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  704. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  705. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  706. END;
  707. (*! should potentially be called by backend -- enter might initialize
  708. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  709. *)
  710. END;
  711. IF procedureType.callingConvention = SyntaxTree.WinAPICallingConvention THEN
  712. parametersSize := ProcedureParametersSize(backend.system,x);
  713. ELSE
  714. parametersSize := 0;
  715. END;
  716. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  717. finalizer := FALSE;
  718. IF backend.cooperative & x.isFinalizer THEN
  719. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  720. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  721. GetRecordTypeName(recordType,name);
  722. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  723. END;
  724. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  725. IF backend.cooperative THEN
  726. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  727. IF implementationVisitor.profile & ~isModuleBody THEN
  728. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  729. END;
  730. END;
  731. implementationVisitor.EmitLeave(ir, x.position,x,cc);
  732. IF finalizer THEN
  733. IF backend.hasLinkRegister THEN
  734. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  735. END;
  736. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  737. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  738. ir.Emit(Br(x.position,dest));
  739. ELSE
  740. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  741. END;
  742. ELSE
  743. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  744. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  745. END;
  746. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  747. IF backend.cooperative THEN
  748. IF HasPointers (scope) THEN
  749. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  750. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  751. ir.Emit(Result(x.position, res));
  752. ir.Emit(Push(x.position, res));
  753. implementationVisitor.ResetVariables(scope);
  754. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  755. ir.Emit(Pop(x.position, res));
  756. ir.Emit(Return(x.position, res));
  757. ELSE
  758. implementationVisitor.ResetVariables(scope);
  759. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  760. END;
  761. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  762. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  763. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  764. ir.Emit(Result(x.position, res));
  765. ir.Emit(Push(x.position, res));
  766. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  767. ir.Emit(Pop(x.position, res));
  768. ir.Emit(Return(x.position, res));
  769. ELSE
  770. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  771. END;
  772. END;
  773. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  774. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  775. ELSE
  776. ir.Emit(Nop(x.position));
  777. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  778. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  779. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  780. END;
  781. END;
  782. END
  783. END;
  784. ELSE (* force body for procedures *)
  785. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  786. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  787. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  788. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  789. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  790. END;
  791. Scope(scope);
  792. Signature;
  793. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  794. currentScope := prevScope;
  795. END Procedure;
  796. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  797. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  798. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  799. BEGIN
  800. ASSERT (bodyProcedure # NIL);
  801. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  802. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  803. procedure.SetScope(bodyProcedure.scope);
  804. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  805. procedure.SetAccess(SyntaxTree.Hidden);
  806. Global.GetSymbolSegmentedName (procedure,name);
  807. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  808. ir.SetExported(TRUE);
  809. ir.SetPriority(InitPriority);
  810. Global.GetSymbolSegmentedName (bodyProcedure,name);
  811. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  812. implementationVisitor.currentScope := module.module.moduleScope;
  813. implementationVisitor.section := ir;
  814. implementationVisitor.PushSelfPointer();
  815. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  816. ELSIF backend.preregisterStatic THEN
  817. implementationVisitor.currentScope := module.module.moduleScope;
  818. implementationVisitor.section := ir;
  819. implementationVisitor.PushSelfPointer();
  820. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  821. ELSE
  822. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  823. ir.Emit(Call(bodyProcedure.position,op, 0));
  824. END;
  825. END AddBodyCallStub;
  826. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  827. VAR name: Basic.SegmentedName;
  828. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  829. BEGIN
  830. Global.GetSymbolSegmentedName (symbol,name);
  831. Basic.RemoveSuffix(name);
  832. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  833. ir := implementationVisitor.NewSection(module.allSections,Sections.InitCodeSection,name,NIL,dump);
  834. ir.SetExported(TRUE);
  835. ir.SetPriority(FirstPriority);
  836. IntermediateCode.InitImmediate(op,addressType,initStack);
  837. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  838. END AddStackAllocation;
  839. (** entry function to visit a complete module *)
  840. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  841. VAR
  842. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  843. hasDynamicOperatorDeclarations: BOOLEAN;
  844. operator: SyntaxTree.Operator;
  845. import: SyntaxTree.Import;
  846. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  847. BEGIN
  848. type := type.resolved;
  849. IF type IS SyntaxTree.RecordType THEN
  850. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  851. ELSIF (type IS SyntaxTree.ArrayType) THEN
  852. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  853. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  854. END;
  855. ELSIF type IS SyntaxTree.MathArrayType THEN
  856. WITH type: SyntaxTree.MathArrayType DO
  857. IF type.form = SyntaxTree.Open THEN
  858. RETURN TRUE
  859. ELSIF type.form = SyntaxTree.Static THEN
  860. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  861. END;
  862. END;
  863. END;
  864. RETURN FALSE
  865. END TypeNeedsInitialization;
  866. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  867. VAR variable: SyntaxTree.Variable;
  868. BEGIN
  869. variable := scope.firstVariable;
  870. WHILE variable # NIL DO
  871. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  872. IF variable.initializer # NIL THEN RETURN TRUE END;
  873. variable := variable.nextVariable;
  874. END;
  875. RETURN FALSE
  876. END ScopeNeedsInitialization;
  877. BEGIN
  878. ASSERT(x # NIL); ASSERT(module # NIL);
  879. SELF.module := module;
  880. (* add import names to the generated Sections.Module *)
  881. import := x.moduleScope.firstImport;
  882. WHILE import # NIL DO
  883. import.module.GetName(idstr);
  884. module.imports.AddName(idstr);
  885. import := import.nextImport
  886. END;
  887. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  888. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  889. moduleSelf := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@moduleSelf"));
  890. moduleSelf.SetType(system.anyType);
  891. moduleSelf.SetScope(x.moduleScope);
  892. moduleSelf.SetUntraced(TRUE);
  893. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  894. ir.SetExported(TRUE);
  895. IntermediateCode.InitImmediate(op,addressType,0);
  896. ir.Emit(Data(Basic.invalidPosition,op));
  897. END;
  898. implementationVisitor.module := module;
  899. implementationVisitor.moduleScope := x.moduleScope;
  900. implementationVisitor.moduleSelf := moduleSelf;
  901. implementationVisitor.canBeLoaded := TRUE;
  902. meta.SetModule(module);
  903. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  904. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  905. END;
  906. IF backend.profile THEN
  907. EnsureBodyProcedure(x.moduleScope);
  908. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  909. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  910. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  911. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  912. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  913. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0,0);
  914. Global.GetModuleName(module.module,idstr);
  915. implementationVisitor.ProfilerAddModule(idstr);
  916. implementationVisitor.numberProcedures := 0;
  917. END;
  918. implementationVisitor.profile := backend.profile;
  919. (* check if there is at least one dynamic operator locally defined *)
  920. hasDynamicOperatorDeclarations := FALSE;
  921. operator := x.moduleScope.firstOperator;
  922. WHILE operator # NIL DO
  923. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  924. operator := operator.nextOperator
  925. END;
  926. (* add operator initialization code section *)
  927. IF hasDynamicOperatorDeclarations THEN
  928. EnsureBodyProcedure(x.moduleScope);
  929. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  930. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  931. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0,0);
  932. END;
  933. Scope(x.moduleScope);
  934. IF hasDynamicOperatorDeclarations THEN
  935. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  936. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  937. END;
  938. IF backend.profile THEN
  939. implementationVisitor.ProfilerPatchInit;
  940. END;
  941. END Module;
  942. END DeclarationVisitor;
  943. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  944. RegisterUsageCount*=OBJECT
  945. VAR used: UsedArray; count: LONGINT;
  946. PROCEDURE &Init;
  947. VAR i: LONGINT;
  948. BEGIN
  949. count := 0;
  950. IF used = NIL THEN NEW(used,64); END;
  951. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  952. END Init;
  953. PROCEDURE Grow;
  954. VAR new: UsedArray; size,i: LONGINT;
  955. BEGIN
  956. size := LEN(used)*2;
  957. NEW(new,size);
  958. FOR i := 0 TO LEN(used)-1 DO
  959. new[i].count := used[i].count;
  960. new[i].type := used[i].type;
  961. new[i].map := used[i].map
  962. END;
  963. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  964. used := new
  965. END Grow;
  966. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  967. BEGIN
  968. INC(count);
  969. IF count = LEN(used) THEN Grow END;
  970. used[count].type := type;
  971. used[count].class := class;
  972. used[count].map := count;
  973. RETURN count;
  974. END Next;
  975. PROCEDURE IncUse(register: LONGINT);
  976. BEGIN
  977. INC(used[register].count);
  978. (*
  979. IF (register = 1) & (count > 30) THEN
  980. D.TraceBack;
  981. END;
  982. *)
  983. END IncUse;
  984. PROCEDURE DecUse(register: LONGINT);
  985. BEGIN
  986. DEC(used[register].count);
  987. END DecUse;
  988. PROCEDURE Map(register: LONGINT): LONGINT;
  989. VAR map : LONGINT;
  990. BEGIN
  991. IF register > 0 THEN
  992. map := used[register].map;
  993. WHILE register # map DO register := map; map := used[register].map END;
  994. END;
  995. RETURN register
  996. END Map;
  997. PROCEDURE Use(register: LONGINT): LONGINT;
  998. BEGIN
  999. IF register< LEN(used) THEN
  1000. RETURN used[register].count
  1001. ELSE
  1002. RETURN 0
  1003. END
  1004. END Use;
  1005. END RegisterUsageCount;
  1006. RegisterEntry = POINTER TO RECORD
  1007. prev,next: RegisterEntry;
  1008. register: LONGINT;
  1009. registerClass: IntermediateCode.RegisterClass;
  1010. type: IntermediateCode.Type;
  1011. END;
  1012. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1013. Variables = OBJECT (Basic.List)
  1014. VAR
  1015. inUse: VariableUse;
  1016. registerIndex: LONGINT;
  1017. nameIndex: LONGINT;
  1018. PROCEDURE & Init;
  1019. VAR i: LONGINT;
  1020. BEGIN
  1021. InitList(16);
  1022. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1023. registerIndex := 1024;
  1024. nameIndex := 0;
  1025. END Init;
  1026. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1027. VAR string: SyntaxTree.IdentifierString ;
  1028. BEGIN
  1029. COPY("@hiddenIRVar",string);
  1030. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1031. RETURN SyntaxTree.NewIdentifier(string);
  1032. END GetUID;
  1033. PROCEDURE GetUsage(VAR use: VariableUse);
  1034. BEGIN
  1035. use := inUse;
  1036. END GetUsage;
  1037. PROCEDURE SetUsage(CONST use: VariableUse);
  1038. BEGIN
  1039. inUse := use;
  1040. END SetUsage;
  1041. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1042. VAR any: ANY;
  1043. BEGIN
  1044. any := Get(i);;
  1045. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1046. END GetVariable;
  1047. PROCEDURE Occupy(pos: LONGINT);
  1048. BEGIN
  1049. INCL(inUse[pos DIV 32], pos MOD 32);
  1050. END Occupy;
  1051. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1052. BEGIN
  1053. Occupy(Length());
  1054. Add(v);
  1055. END AddVariable;
  1056. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1057. BEGIN
  1058. t1 := t1.resolved;
  1059. t2 := t2.resolved;
  1060. RETURN
  1061. (t1.SameType(t2))
  1062. OR
  1063. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1064. OR
  1065. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits = t2.sizeInBits)
  1066. OR
  1067. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1068. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1069. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1070. OR
  1071. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1072. (DynamicDim(t1) = DynamicDim(t2))
  1073. );
  1074. END CompatibleType;
  1075. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1076. VAR var : SyntaxTree.Variable;
  1077. BEGIN
  1078. FOR pos := 0 TO Length()-1 DO
  1079. IF ~((pos MOD 32) IN inUse[pos DIV 32]) THEN
  1080. var := GetVariable(pos);
  1081. IF CompatibleType(type, var.type) & (var.untraced = untraced) THEN
  1082. Occupy(pos); RETURN var
  1083. END;
  1084. END;
  1085. END;
  1086. pos := Length();
  1087. RETURN NIL
  1088. END GetFreeVariable;
  1089. END Variables;
  1090. SymbolMap = POINTER TO RECORD
  1091. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1092. isAddress: BOOLEAN;
  1093. END;
  1094. SymbolMapper = OBJECT
  1095. VAR
  1096. first: SymbolMap;
  1097. PROCEDURE & Init;
  1098. BEGIN
  1099. first := NIL;
  1100. END Init;
  1101. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1102. VAR new: SymbolMap;
  1103. BEGIN
  1104. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1105. new.next := first; first := new;
  1106. END Add;
  1107. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1108. VAR s: SymbolMap;
  1109. BEGIN
  1110. s := first;
  1111. WHILE (s # NIL) & (s.this # this) DO
  1112. s := s.next
  1113. END;
  1114. RETURN s
  1115. END Get;
  1116. END SymbolMapper;
  1117. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1118. VAR
  1119. system: Global.System;
  1120. section: IntermediateCode.Section;
  1121. module: Sections.Module;
  1122. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1123. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1124. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1125. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1126. checker: SemanticChecker.Checker;
  1127. backend: IntermediateBackend;
  1128. meta: MetaDataGenerator;
  1129. position: Position;
  1130. moduleSelf: SyntaxTree.Variable;
  1131. (* variables for hand over of variables / temporary state *)
  1132. currentScope: SyntaxTree.Scope;
  1133. constantDeclaration : SyntaxTree.Symbol;
  1134. result: Operand; (* result of the most recent expression / statement *)
  1135. destination: IntermediateCode.Operand;
  1136. arrayDestinationTag: IntermediateCode.Operand;
  1137. arrayDestinationDimension:LONGINT;
  1138. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1139. conditional: BOOLEAN;
  1140. trueLabel, falseLabel, exitLabel: Label;
  1141. locked: BOOLEAN;
  1142. (*
  1143. usedRegisters: Registers;
  1144. *)
  1145. registerUsageCount: RegisterUsageCount;
  1146. usedRegisters: RegisterEntry;
  1147. (* useful operands and types *)
  1148. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1149. bool,addressType,setType, sizeType, byteType: IntermediateCode.Type;
  1150. commentPrintout: Printout.Printer;
  1151. dump: Streams.Writer;
  1152. tagsAvailable : BOOLEAN;
  1153. supportedInstruction: SupportedInstructionProcedure;
  1154. supportedImmediate: SupportedImmediateProcedure;
  1155. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1156. emitLabels: BOOLEAN;
  1157. runtimeModuleName : SyntaxTree.IdentifierString;
  1158. newObjectFile: BOOLEAN;
  1159. indexCounter: LONGINT;
  1160. profile: BOOLEAN;
  1161. profileId, profileInit: IntermediateCode.Section;
  1162. profileInitPatchPosition: LONGINT;
  1163. numberProcedures: LONGINT;
  1164. procedureResultDesignator : SyntaxTree.Designator;
  1165. operatorInitializationCodeSection: IntermediateCode.Section;
  1166. fingerPrinter: FingerPrinter.FingerPrinter;
  1167. temporaries: Variables;
  1168. canBeLoaded : BOOLEAN;
  1169. currentIsInline: BOOLEAN;
  1170. currentMapper: SymbolMapper;
  1171. currentInlineExit: Label;
  1172. moduleBodySection: IntermediateCode.Section;
  1173. NeedDescriptor : BOOLEAN;
  1174. cooperativeSwitches: BOOLEAN;
  1175. lastSwitchPC: LONGINT;
  1176. isUnchecked: BOOLEAN;
  1177. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1178. newObjectFile: BOOLEAN);
  1179. BEGIN
  1180. SELF.system := system;
  1181. SELF.runtimeModuleName := runtime;
  1182. currentScope := NIL;
  1183. hiddenPointerType := NIL;
  1184. delegatePointerType := NIL;
  1185. awaitProcCounter := 0;
  1186. labelId := 0; constId := 0; labelId := 0;
  1187. SELF.checker := checker;
  1188. SELF.backend := backend;
  1189. position := Basic.invalidPosition;
  1190. conditional := FALSE;
  1191. locked := FALSE;
  1192. InitOperand(result,ModeUndefined);
  1193. addressType := IntermediateCode.GetType(system,system.addressType);
  1194. setType := IntermediateCode.GetType(system,system.setType);
  1195. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1196. byteType := IntermediateCode.GetType(system, system.byteType);
  1197. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1198. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1199. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1200. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1201. nil := IntermediateCode.Immediate(addressType,0);
  1202. one := IntermediateCode.Immediate(addressType,1);
  1203. IntermediateCode.InitOperand(destination);
  1204. tagsAvailable := TRUE;
  1205. supportedInstruction := supportedInstructionProcedure;
  1206. supportedImmediate := supportedImmediateProcedure;
  1207. inData := FALSE;
  1208. SELF.emitLabels := emitLabels;
  1209. IntermediateCode.InitOperand(arrayDestinationTag);
  1210. bool := IntermediateCode.GetType(system,system.booleanType);
  1211. IntermediateCode.InitImmediate(false,bool,0);
  1212. IntermediateCode.InitImmediate(true,bool,1);
  1213. SELF.newObjectFile := newObjectFile;
  1214. indexCounter := 0;
  1215. NEW(registerUsageCount);
  1216. usedRegisters := NIL;
  1217. procedureResultDesignator := NIL;
  1218. NEW(fingerPrinter);
  1219. NEW(temporaries);
  1220. currentIsInline := FALSE;
  1221. NeedDescriptor := FALSE;
  1222. isUnchecked := backend.noRuntimeChecks;
  1223. END Init;
  1224. TYPE Context = RECORD
  1225. section: IntermediateCode.Section;
  1226. registerUsageCount: RegisterUsageCount;
  1227. usedRegisters: RegisterEntry;
  1228. END;
  1229. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1230. VAR context: Context;
  1231. BEGIN
  1232. context.section := section;
  1233. context.registerUsageCount := registerUsageCount;
  1234. context.usedRegisters := usedRegisters;
  1235. section := new;
  1236. NEW(registerUsageCount);
  1237. usedRegisters := NIL;
  1238. RETURN context;
  1239. END SwitchContext;
  1240. PROCEDURE ReturnToContext(context: Context);
  1241. BEGIN
  1242. section := context.section;
  1243. registerUsageCount := context.registerUsageCount;
  1244. usedRegisters := context.usedRegisters;
  1245. END ReturnToContext;
  1246. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1247. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1248. BEGIN
  1249. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1250. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1251. END;
  1252. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1253. section.SetExported(IsExported(syntaxTreeSymbol));
  1254. RETURN section
  1255. END NewSection;
  1256. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1257. VAR new: LONGINT;
  1258. BEGIN
  1259. new := registerUsageCount.Next(type,class);
  1260. UseRegister(new);
  1261. RETURN new
  1262. END AcquireRegister;
  1263. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1264. VAR
  1265. fingerPrint: SyntaxTree.FingerPrint;
  1266. fingerPrintString: ARRAY 32 OF CHAR;
  1267. BEGIN
  1268. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1269. string := "[";
  1270. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1271. Strings.Append(string, fingerPrintString);
  1272. Strings.Append(string, "]");
  1273. END GetFingerprintString;
  1274. (** get the name for the code section that represens a certain symbol
  1275. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1276. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1277. VAR string: ARRAY 32 OF CHAR;
  1278. BEGIN
  1279. Global.GetSymbolSegmentedName(symbol, name);
  1280. (* if the symbol is an operator, then append the fingerprint to the name *)
  1281. IF symbol IS SyntaxTree.Operator THEN
  1282. GetFingerprintString(symbol, string);
  1283. Basic.AppendToSegmentedName(name,string);
  1284. END
  1285. END GetCodeSectionNameForSymbol;
  1286. (** get the name for the code section that represens a certain symbol
  1287. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1288. PROCEDURE GetCodeSectionNameForSymbolInScope(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope; VAR name: ARRAY OF CHAR);
  1289. VAR string: ARRAY 32 OF CHAR;
  1290. BEGIN
  1291. Global.GetSymbolNameInScope(symbol, scope, name);
  1292. (* if the symbol is an operator, then append the fingerprint to the name *)
  1293. IF symbol IS SyntaxTree.Operator THEN
  1294. GetFingerprintString(symbol, string);
  1295. Strings.Append(name, string);
  1296. END
  1297. END GetCodeSectionNameForSymbolInScope;
  1298. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1299. BEGIN
  1300. IF dump # NIL THEN
  1301. dump.String("enter "); dump.String(s); dump.Ln;
  1302. END;
  1303. END TraceEnter;
  1304. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1305. BEGIN
  1306. IF dump # NIL THEN
  1307. dump.String("exit "); dump.String(s); dump.Ln;
  1308. END;
  1309. END TraceExit;
  1310. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1311. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1312. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1313. VAR i: LONGINT;
  1314. BEGIN
  1315. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1316. IF op.rule # NIL THEN
  1317. FOR i := 0 TO LEN(op.rule)-1 DO
  1318. CheckRegister(op.rule[i])
  1319. END;
  1320. END;
  1321. END CheckRegister;
  1322. BEGIN
  1323. CheckRegister(instruction.op1);
  1324. CheckRegister(instruction.op2);
  1325. CheckRegister(instruction.op3);
  1326. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1327. ELSE section.Emit(instruction);
  1328. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1329. END;
  1330. END Emit;
  1331. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1332. BEGIN
  1333. IF backend.cooperative THEN
  1334. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1335. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1336. ELSE
  1337. Emit(Trap(position,trapNo));
  1338. END;
  1339. END EmitTrap;
  1340. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1341. VAR name: Basic.SegmentedName;
  1342. VAR op1, op2, reg: IntermediateCode.Operand;
  1343. VAR call, nocall: Label;
  1344. VAR parametersSize: LONGINT;
  1345. VAR prevSection: IntermediateCode.Section;
  1346. VAR prevDump: Streams.Writer;
  1347. VAR body: SyntaxTree.Body;
  1348. VAR procedureType: SyntaxTree.ProcedureType;
  1349. BEGIN
  1350. IF procedure # NIL THEN
  1351. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1352. ELSE procedureType := NIL;
  1353. END;
  1354. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1355. prevSection := SELF.section;
  1356. SELF.section := section;
  1357. prevDump := dump;
  1358. dump := section.comments;
  1359. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1360. IF backend.hasLinkRegister THEN
  1361. Emit(Push(Basic.invalidPosition, lr));
  1362. END;
  1363. Emit(Push(Basic.invalidPosition,fp));
  1364. IF procedure # NIL THEN
  1365. body := procedure.procedureScope.body;
  1366. ELSE
  1367. body := NIL;
  1368. END;
  1369. IF backend.cooperative THEN
  1370. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1371. GetCodeSectionNameForSymbol(procedure, name);
  1372. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1373. ELSE
  1374. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1375. END;
  1376. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1377. IntermediateCode.AddOffset(op1, 1);
  1378. Emit(Push(Basic.invalidPosition,op1));
  1379. Emit(Mov(Basic.invalidPosition,fp, sp));
  1380. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1381. NEW(call, section);
  1382. NEW(nocall, section);
  1383. reg := NewRegisterOperand(addressType);
  1384. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1385. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1386. BrltL(call, sp, reg);
  1387. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1388. BrgeL(nocall, sp, op2);
  1389. call.Resolve(section.pc);
  1390. Emit(Push(Basic.invalidPosition, reg));
  1391. ReleaseIntermediateOperand(reg);
  1392. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1393. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1394. Emit(Push(Basic.invalidPosition, op2));
  1395. CallThis(position, "Activities","ExpandStack",2);
  1396. Emit(Result(Basic.invalidPosition, sp));
  1397. nocall.Resolve(section.pc);
  1398. END;
  1399. ELSE
  1400. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1401. Emit(Push(Basic.invalidPosition, one)) ;
  1402. procedureType.SetParametersOffset(1);
  1403. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1404. END;
  1405. Emit(Mov(Basic.invalidPosition, fp, sp));
  1406. END;
  1407. END;
  1408. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1409. SELF.section := prevSection;
  1410. dump := prevDump;
  1411. END EmitEnter;
  1412. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1413. VAR op1,op2: IntermediateCode.Operand;
  1414. VAR instruction: IntermediateCode.Instruction;
  1415. BEGIN
  1416. IntermediateCode.InitNumber(op1,callconv);
  1417. IntermediateCode.InitNumber(op2,varSize);
  1418. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1419. RETURN instruction
  1420. END Enter;
  1421. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1422. VAR op1: IntermediateCode.Operand;
  1423. VAR instruction: IntermediateCode.Instruction;
  1424. BEGIN
  1425. IntermediateCode.InitNumber(op1,callconv);
  1426. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1427. RETURN instruction
  1428. END Leave;
  1429. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1430. VAR prevSection: IntermediateCode.Section;
  1431. VAR op2, size: IntermediateCode.Operand;
  1432. VAR body: SyntaxTree.Body;
  1433. BEGIN
  1434. prevSection := SELF.section;
  1435. SELF.section := section;
  1436. Emit(Leave(position, callconv));
  1437. IF procedure # NIL THEN
  1438. body := procedure.procedureScope.body;
  1439. ELSE
  1440. body := NIL;
  1441. END;
  1442. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1443. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1444. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1445. Emit(Add(position, sp, fp, op2));
  1446. ELSE
  1447. Emit(Mov(position, sp, fp));
  1448. END;
  1449. Emit(Pop(position, fp));
  1450. END;
  1451. SELF.section := prevSection;
  1452. END EmitLeave;
  1453. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1454. VAR m: SymbolMap;
  1455. BEGIN
  1456. position := x.position;
  1457. IF currentIsInline THEN
  1458. m := currentMapper.Get(x);
  1459. IF m # NIL THEN
  1460. (*
  1461. Printout.Info("mapping from", x);
  1462. Printout.Info("mapping to ", m.to);
  1463. *)
  1464. m.to.Accept(SELF);
  1465. op := result;
  1466. IF m.tag # NIL THEN
  1467. ReleaseIntermediateOperand(result.tag);
  1468. m.tag.Accept(SELF);
  1469. op.tag := result.op;
  1470. ReleaseIntermediateOperand(result.tag);
  1471. END;
  1472. RETURN
  1473. END;
  1474. END;
  1475. x.Accept(SELF);
  1476. op := result;
  1477. END Symbol;
  1478. PROCEDURE Expression(x: SyntaxTree.Expression);
  1479. BEGIN
  1480. position := x.position;
  1481. constantDeclaration := NIL;
  1482. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1483. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1484. END;
  1485. IF x.resolved # NIL THEN
  1486. x.resolved.Accept(SELF)
  1487. ELSE
  1488. x.Accept(SELF)
  1489. END;
  1490. (* check this, was commented out in ActiveCells3 *)
  1491. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1492. Error(x.position, "unsupported modifier");
  1493. END;
  1494. END Expression;
  1495. (*
  1496. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1497. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1498. BEGIN
  1499. temporaries.GetUsage(current);
  1500. FOR i := 0 TO LEN(current)-1 DO
  1501. set := current[i] - previous[i];
  1502. IF set # {} THEN
  1503. FOR j := 0 TO MAX(SET)-1 DO
  1504. IF j IN set THEN
  1505. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1506. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1507. Symbol(variable, op);
  1508. MakeMemory(tmp,op.op,addressType,0);
  1509. ReleaseOperand(op);
  1510. Emit(Mov(position,tmp, nil ) );
  1511. ReleaseIntermediateOperand(tmp);
  1512. END;
  1513. END;
  1514. END;
  1515. END;
  1516. END;
  1517. END ResetUsedTemporaries;
  1518. *)
  1519. PROCEDURE Statement(x: SyntaxTree.Statement);
  1520. VAR use: VariableUse;
  1521. BEGIN
  1522. temporaries.GetUsage(use);
  1523. position := x.position;
  1524. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1525. IF commentPrintout # NIL THEN
  1526. commentPrintout.Statement(x);
  1527. dump.Ln;
  1528. (*dump.Update;*)
  1529. END;
  1530. x.Accept(SELF);
  1531. (*
  1532. CheckRegistersFree();
  1533. *)
  1534. (*ResetUsedTemporaries(use);*)
  1535. temporaries.SetUsage(use);
  1536. END Statement;
  1537. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1538. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1539. *)
  1540. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1541. BEGIN
  1542. ASSERT(op.mode # IntermediateCode.Undefined);
  1543. IF op.mode = IntermediateCode.ModeMemory THEN
  1544. ReuseCopy(res,op);
  1545. ELSE
  1546. res := op;
  1547. UseIntermediateOperand(res);
  1548. END;
  1549. IntermediateCode.AddOffset(res,offset);
  1550. IntermediateCode.MakeMemory(res,type);
  1551. END MakeMemory;
  1552. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1553. VAR mem: IntermediateCode.Operand;
  1554. BEGIN
  1555. MakeMemory(mem,res,type,offset);
  1556. ReleaseIntermediateOperand(res);
  1557. res := mem;
  1558. END ToMemory;
  1559. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1560. VAR mem: IntermediateCode.Operand;
  1561. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1562. componentType: SyntaxTree.Type;
  1563. BEGIN
  1564. type := type.resolved;
  1565. IF operand.mode = ModeReference THEN
  1566. IF type IS SyntaxTree.RangeType THEN
  1567. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.longintType), 0);
  1568. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1569. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1570. ReleaseOperand(operand);
  1571. operand.op := firstOp;
  1572. operand.tag := lastOp;
  1573. operand.extra := stepOp;
  1574. ELSIF type IS SyntaxTree.ComplexType THEN
  1575. componentType := type(SyntaxTree.ComplexType).componentType;
  1576. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1577. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1578. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1579. ReleaseOperand(operand);
  1580. operand.op := firstOp;
  1581. operand.tag := lastOp
  1582. ELSE
  1583. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1584. ReleaseIntermediateOperand(operand.op);
  1585. operand.op := mem;
  1586. END;
  1587. operand.mode := ModeValue;
  1588. END;
  1589. ASSERT(operand.mode = ModeValue);
  1590. END LoadValue;
  1591. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1592. VAR prevConditional: BOOLEAN;
  1593. BEGIN
  1594. prevConditional := conditional;
  1595. conditional := FALSE;
  1596. InitOperand(result, ModeUndefined);
  1597. Expression(x);
  1598. op := result;
  1599. LoadValue(op,x.type.resolved);
  1600. conditional := prevConditional;
  1601. END Evaluate;
  1602. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1603. VAR prevConditional: BOOLEAN;
  1604. BEGIN
  1605. prevConditional := conditional;
  1606. conditional := FALSE;
  1607. InitOperand(result,ModeUndefined);
  1608. Expression(x);
  1609. op := result;
  1610. (*
  1611. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1612. *)
  1613. conditional := prevConditional;
  1614. END Designate;
  1615. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1616. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1617. BEGIN
  1618. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1619. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1620. conditional := TRUE;
  1621. trueLabel := trueL; falseLabel := falseL;
  1622. Expression(x);
  1623. trueL := trueLabel; falseL := falseLabel;
  1624. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1625. END Condition;
  1626. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1627. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1628. BEGIN
  1629. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1630. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1631. RETURN op
  1632. END NewRegisterOperand;
  1633. PROCEDURE UnuseRegister(register: LONGINT);
  1634. BEGIN
  1635. IF (register > 0) THEN
  1636. register := registerUsageCount.Map(register);
  1637. registerUsageCount.DecUse(register);
  1638. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1639. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1640. END;
  1641. IF registerUsageCount.Use(register)=0 THEN
  1642. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1643. Warning(position, "register cannot be removed");
  1644. END;
  1645. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1646. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1647. END;
  1648. ELSIF registerUsageCount.Use(register)<0 THEN
  1649. Warning(position, "register removed too often");
  1650. IF dump # NIL THEN
  1651. dump.String("register removed too often"); dump.Ln; dump.Update;
  1652. END;
  1653. END;
  1654. END;
  1655. END UnuseRegister;
  1656. PROCEDURE UseRegister(register: LONGINT);
  1657. BEGIN
  1658. IF (register > 0) THEN
  1659. register := registerUsageCount.Map(register);
  1660. registerUsageCount.IncUse(register);
  1661. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1662. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1663. END;
  1664. IF registerUsageCount.Use(register)=1 THEN
  1665. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1666. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1667. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1668. END;
  1669. END;
  1670. END;
  1671. END UseRegister;
  1672. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1673. BEGIN
  1674. UnuseRegister(op.register)
  1675. END ReleaseIntermediateOperand;
  1676. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1677. BEGIN
  1678. UseRegister(op.register)
  1679. END UseIntermediateOperand;
  1680. PROCEDURE ReleaseOperand(CONST op: Operand);
  1681. BEGIN
  1682. UnuseRegister(op.op.register);
  1683. UnuseRegister(op.tag.register);
  1684. UnuseRegister(op.extra.register);
  1685. END ReleaseOperand;
  1686. (* save registers marked in array "markedRegisters" to the stack
  1687. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1688. *)
  1689. PROCEDURE SaveRegisters();
  1690. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1691. BEGIN
  1692. entry := usedRegisters;
  1693. WHILE entry # NIL DO
  1694. type := registerUsageCount.used[entry.register].type;
  1695. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1696. Emit(Push(position,op));
  1697. entry := entry.next;
  1698. END;
  1699. END SaveRegisters;
  1700. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1701. BEGIN
  1702. saved := usedRegisters;
  1703. usedRegisters := NIL;
  1704. END ReleaseUsedRegisters;
  1705. (** remove parameter registers from used queue *)
  1706. PROCEDURE ReleaseParameterRegisters;
  1707. VAR entry,prev,next: RegisterEntry;
  1708. BEGIN
  1709. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1710. WHILE entry # NIL DO
  1711. next := entry.next;
  1712. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1713. registerUsageCount.DecUse(entry.register);
  1714. ASSERT(registerUsageCount.Use(entry.register)=0);
  1715. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1716. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1717. END;
  1718. ELSIF prev = NIL THEN
  1719. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1720. ELSE
  1721. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1722. END;
  1723. entry := next;
  1724. END;
  1725. END ReleaseParameterRegisters;
  1726. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1727. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1728. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1729. BEGIN
  1730. entry := saved;
  1731. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1732. entry := prev;
  1733. WHILE entry # NIL DO
  1734. prev := entry.prev;
  1735. type := entry.type;
  1736. class := entry.registerClass;
  1737. IntermediateCode.InitRegister(op,type,class,entry.register);
  1738. (*
  1739. new := registerUsageCount.Next(type,class);
  1740. registerUsageCount.Remap(entry.register,new);
  1741. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1742. dump.String("remap register "); dump.Int(entry.register,1);
  1743. dump.String("to "); dump.Int(new,1);
  1744. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1745. END;
  1746. entry.register := new;
  1747. *)
  1748. Emit(Pop(position,op));
  1749. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1750. entry := prev;
  1751. END;
  1752. (*
  1753. usedRegisters := saved;
  1754. *)
  1755. END RestoreRegisters;
  1756. PROCEDURE CheckRegistersFree;
  1757. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1758. BEGIN
  1759. IF usedRegisters # NIL THEN
  1760. r := usedRegisters;
  1761. WHILE r # NIL DO
  1762. warning := "register ";
  1763. Strings.AppendInt(warning, r.register);
  1764. Strings.Append(warning, " not released.");
  1765. Warning(position,warning);
  1766. r := r .next;
  1767. END;
  1768. END;
  1769. FOR i := 0 TO registerUsageCount.count-1 DO
  1770. IF registerUsageCount.used[i].count < 0 THEN
  1771. warning := "register ";
  1772. Strings.AppendInt(warning, i);
  1773. Strings.Append(warning, " unused too often.");
  1774. Warning(position,warning);
  1775. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1776. warning := "register ";
  1777. Strings.AppendInt(warning, i);
  1778. Strings.Append(warning, " not unused often enough.");
  1779. Warning(position,warning);
  1780. END;
  1781. END;
  1782. END CheckRegistersFree;
  1783. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1784. Otherwise allocate a new register.
  1785. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1786. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1787. BEGIN
  1788. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1789. UseIntermediateOperand(result);
  1790. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1791. UseIntermediateOperand(result);
  1792. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1793. END;
  1794. END Reuse2;
  1795. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1796. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1797. If not then allocate a new register.
  1798. Does NOT necessarily keep the content of src1 or src2 in result!
  1799. *)
  1800. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1801. BEGIN
  1802. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1803. UseIntermediateOperand(result);
  1804. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1805. UseIntermediateOperand(result);
  1806. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1807. result := alternative; alternative := emptyOperand;
  1808. UseIntermediateOperand(result);
  1809. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1810. END;
  1811. END Reuse2a;
  1812. (* like reuse2 but only one source *)
  1813. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1814. BEGIN
  1815. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1816. UseIntermediateOperand(result);
  1817. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1818. END;
  1819. END Reuse1;
  1820. (* like reuse2a but only one source *)
  1821. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1822. BEGIN
  1823. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1824. UseIntermediateOperand(result);
  1825. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1826. UseIntermediateOperand(result);
  1827. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1828. END;
  1829. END Reuse1a;
  1830. (* like reuse1 but guarantees that content of src1 is in result *)
  1831. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1832. BEGIN
  1833. IF ReusableRegister(src1) THEN
  1834. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1835. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1836. UseIntermediateOperand(result);
  1837. ELSE
  1838. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1839. Emit(Mov(position,result,src1));
  1840. END
  1841. END ReuseCopy;
  1842. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1843. BEGIN
  1844. IF ReusableRegister(src) THEN
  1845. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1846. ELSE
  1847. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1848. Emit(Mov(position,result,src));
  1849. ReleaseIntermediateOperand(src);
  1850. END
  1851. END TransferToRegister;
  1852. (** labels and branches **)
  1853. PROCEDURE NewLabel(): Label;
  1854. VAR label: Label;
  1855. BEGIN
  1856. NEW(label,section); RETURN label;
  1857. END NewLabel;
  1858. PROCEDURE SetLabel(label: Label);
  1859. BEGIN label.Resolve(section.pc);
  1860. END SetLabel;
  1861. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1862. BEGIN
  1863. ASSERT(label # NIL);
  1864. IF label.pc < 0 THEN (* label not yet set *)
  1865. label.AddFixup(section.pc);
  1866. END;
  1867. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1868. END LabelOperand;
  1869. PROCEDURE BrL(label: Label);
  1870. BEGIN
  1871. Emit(Br(position,LabelOperand(label)));
  1872. END BrL;
  1873. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1874. BEGIN
  1875. Emit(Brge(position,LabelOperand(label),left,right));
  1876. END BrgeL;
  1877. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1878. BEGIN
  1879. Emit(Brlt(position,LabelOperand(label),left,right));
  1880. END BrltL;
  1881. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1882. BEGIN
  1883. Emit(Breq(position,LabelOperand(label),left,right));
  1884. END BreqL;
  1885. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1886. BEGIN
  1887. Emit(Brne(position,LabelOperand(label),left,right));
  1888. END BrneL;
  1889. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1890. VAR new: IntermediateCode.Operand;
  1891. BEGIN
  1892. IF Trace THEN TraceEnter("Convert") END;
  1893. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1894. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1895. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1896. & (operand.offset = 0)
  1897. THEN
  1898. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1899. Emit(Conv(position,new,operand));
  1900. ELSE
  1901. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1902. Emit(Conv(position,new,operand));
  1903. ReleaseIntermediateOperand(operand);
  1904. END;
  1905. operand := new;
  1906. 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
  1907. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1908. ELSE
  1909. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1910. Emit(Conv(position,new,operand));
  1911. ReleaseIntermediateOperand(operand);
  1912. operand := new;
  1913. END;
  1914. IF Trace THEN TraceExit("Convert") END;
  1915. END Convert;
  1916. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1917. VAR exit: Label;
  1918. BEGIN
  1919. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1920. exit := NewLabel();
  1921. br(exit,left,right);
  1922. EmitTrap(position,trapNo);
  1923. SetLabel(exit);
  1924. END TrapC;
  1925. (** expressions *)
  1926. (** emit necessary runtime check for set elements **)
  1927. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1928. VAR max: IntermediateCode.Operand;
  1929. BEGIN
  1930. IF isUnchecked THEN RETURN END;
  1931. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1932. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1933. TrapC(BrgeL, max, o, SetElementTrap);
  1934. END;
  1935. END CheckSetElement;
  1936. (** the set that a range represents **)
  1937. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1938. VAR
  1939. operand: Operand;
  1940. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1941. BEGIN
  1942. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1943. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1944. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1945. one := IntermediateCode.Immediate(setType, 1);
  1946. Evaluate(x, operand);
  1947. Convert(operand.op, setType);
  1948. Convert(operand.tag, setType);
  1949. CheckSetElement(operand.op);
  1950. CheckSetElement(operand.tag);
  1951. (* create mask for lower bound
  1952. i.e. shift 11111111 to the left by the value of the lower bound
  1953. *)
  1954. Reuse1(temp, operand.op);
  1955. Emit(Shl(position,temp, allBits, operand.op));
  1956. ReleaseIntermediateOperand(operand.op);
  1957. operand.op := temp;
  1958. (* create mask for upper bound
  1959. i.e. shift 11111111 to the right by the difference between the
  1960. upper bound and the maximum number of set elements
  1961. *)
  1962. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1963. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1964. Reuse1(temp, operand.tag);
  1965. ELSE
  1966. Reuse1(temp, operand.tag);
  1967. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1968. Emit(Sub(position,temp, size, operand.tag));
  1969. END;
  1970. Emit(Shr(position,temp, allBits, operand.tag));
  1971. ReleaseIntermediateOperand(operand.tag);
  1972. operand.tag := temp;
  1973. Reuse2(resultingSet, operand.op, operand.tag);
  1974. (* intersect the two masks *)
  1975. Emit(And(position,resultingSet, operand.op, operand.tag));
  1976. ReleaseOperand(operand);
  1977. RETURN resultingSet
  1978. END SetFromRange;
  1979. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1980. VAR
  1981. res, operand: Operand;
  1982. temp, one, noBits, dest: IntermediateCode.Operand;
  1983. expression: SyntaxTree.Expression;
  1984. i: LONGINT;
  1985. BEGIN
  1986. IF Trace THEN TraceEnter("VisitSet") END;
  1987. dest := destination;
  1988. destination := emptyOperand;
  1989. noBits := IntermediateCode.Immediate(setType, 0);
  1990. one := IntermediateCode.Immediate(setType, 1);
  1991. (* start off with the empty set *)
  1992. InitOperand(res, ModeValue);
  1993. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1994. Emit(Mov(position,res.op, noBits));
  1995. FOR i := 0 TO x.elements.Length() - 1 DO
  1996. expression := x.elements.GetExpression(i);
  1997. IF expression IS SyntaxTree.RangeExpression THEN
  1998. (* range of set elements *)
  1999. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2000. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2001. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2002. ReleaseIntermediateOperand(temp)
  2003. ELSE
  2004. (* singelton element *)
  2005. Evaluate(expression, operand);
  2006. Convert(operand.op, setType);
  2007. CheckSetElement(operand.op);
  2008. (* create subset containing single element *)
  2009. Reuse1(temp, operand.op);
  2010. Emit(Shl(position,temp, one, operand.op));
  2011. ReleaseOperand(operand);
  2012. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2013. ReleaseIntermediateOperand(temp);
  2014. END
  2015. END;
  2016. result := res;
  2017. destination := dest;
  2018. IF Trace THEN TraceExit("VisitSet") END;
  2019. END VisitSet;
  2020. (* math arrays of the form [a,b,c]
  2021. x is a static array and thus does not provide any pointers
  2022. *)
  2023. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  2024. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2025. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2026. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2027. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2028. element: SyntaxTree.IntegerValue;
  2029. BEGIN
  2030. numberElements := x.elements.Length();
  2031. expression := index.parameters.GetExpression(dim);
  2032. element := expression(SyntaxTree.IntegerValue);
  2033. FOR i := 0 TO numberElements-1 DO
  2034. expression := x.elements.GetExpression(i);
  2035. element.SetValue(i);
  2036. IF expression IS SyntaxTree.MathArrayExpression THEN
  2037. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2038. ELSE
  2039. Assign(index,expression);
  2040. END;
  2041. END;
  2042. END RecursiveAssignment;
  2043. BEGIN
  2044. (*static math array not providing pointers anyway *)
  2045. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2046. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2047. designator.SetType(variable.type);
  2048. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  2049. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2050. FOR i := 0 TO dim-1 DO
  2051. element := SyntaxTree.NewIntegerValue(x.position,0);
  2052. element.SetType(system.longintType);
  2053. index.parameters.AddExpression(element);
  2054. END;
  2055. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2056. RecursiveAssignment(x,0);
  2057. Expression(designator);
  2058. END VisitMathArrayExpression;
  2059. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  2060. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2061. BEGIN
  2062. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2063. dest := destination; destination := emptyOperand;
  2064. IF x.operator = Scanner.Not THEN
  2065. IF conditional THEN
  2066. Condition(x.left,falseLabel,trueLabel)
  2067. ELSE
  2068. Evaluate(x.left,operand);
  2069. InitOperand(result,ModeValue);
  2070. Reuse1a(result.op,operand.op,dest);
  2071. Emit(Xor(position,result.op,operand.op,true));
  2072. ReleaseOperand(operand);
  2073. END;
  2074. ELSIF x.operator = Scanner.Minus THEN
  2075. Evaluate(x.left,operand);
  2076. InitOperand(result,ModeValue);
  2077. Reuse1a(result.op,operand.op,dest);
  2078. type := x.left.type.resolved;
  2079. IF type IS SyntaxTree.SetType THEN
  2080. Emit(Not(position,result.op,operand.op));
  2081. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2082. Reuse1(result.tag,operand.tag);
  2083. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2084. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2085. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2086. Emit(Neg(position,result.op,operand.op));
  2087. ELSE HALT(200)
  2088. END;
  2089. ReleaseOperand(operand);
  2090. ELSIF x.operator = Scanner.Address THEN
  2091. Designate(x.left,operand);
  2092. operand.mode := ModeValue;
  2093. t0 := x.left.type.resolved;
  2094. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2095. ReleaseIntermediateOperand(operand.op);
  2096. operand.op := operand.tag;
  2097. IntermediateCode.InitOperand(operand.tag);
  2098. END;
  2099. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2100. result := operand;
  2101. ELSE HALT(100)
  2102. END;
  2103. destination := dest;
  2104. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2105. END VisitUnaryExpression;
  2106. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2107. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2108. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2109. BEGIN
  2110. type := type.resolved;
  2111. originalType := type;
  2112. IF type IS SyntaxTree.PointerType THEN
  2113. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2114. END;
  2115. IF type IS SyntaxTree.ObjectType THEN
  2116. BrL(trueL);
  2117. ELSE
  2118. ASSERT(type IS SyntaxTree.RecordType);
  2119. (*
  2120. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2121. *)
  2122. ReuseCopy(left,tag);
  2123. right := TypeDescriptorAdr(type);
  2124. IF ~newObjectFile THEN
  2125. IntermediateCode.MakeMemory(right,addressType);
  2126. END;
  2127. IF backend.cooperative THEN
  2128. repeatL := NewLabel();
  2129. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2130. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2131. END;
  2132. SetLabel(repeatL);
  2133. BreqL(trueL,left,right);
  2134. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2135. BrneL(repeatL,left,nil);
  2136. ELSIF meta.simple THEN
  2137. level := type(SyntaxTree.RecordType).Level();
  2138. (* get type desc tag of level relative to base tag *)
  2139. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2140. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2141. IntermediateCode.MakeMemory(left,addressType);
  2142. BreqL(trueL,left,right);
  2143. ELSE
  2144. level := type(SyntaxTree.RecordType).Level();
  2145. (* get type desc tag of level relative to base tag *)
  2146. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2147. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2148. IntermediateCode.MakeMemory(left,addressType);
  2149. BreqL(trueL,left,right);
  2150. END;
  2151. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2152. BrL(falseL);
  2153. END;
  2154. END TypeTest;
  2155. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2156. BEGIN
  2157. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  2158. IF dump # NIL THEN
  2159. dump.String(s); dump.Ln;
  2160. END;
  2161. END Error;
  2162. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2163. BEGIN
  2164. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2165. IF dump # NIL THEN
  2166. dump.String(s); dump.Ln; dump.Update;
  2167. END;
  2168. END Warning;
  2169. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2170. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2171. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2172. operand:Operand;
  2173. BEGIN
  2174. previousSection := section;
  2175. Global.GetModuleName(mod,name);
  2176. Strings.Append(name,".@Trace");
  2177. Basic.ToSegmentedName(name, pooledName);
  2178. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2179. IF dump # NIL THEN dump := section.comments END;
  2180. IF backend.hasLinkRegister THEN
  2181. Emit(Push(Basic.invalidPosition, lr));
  2182. END;
  2183. variable := mod.moduleScope.firstVariable;
  2184. WHILE variable # NIL DO
  2185. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2186. Symbol(variable, operand);
  2187. register := operand.op;
  2188. CallTraceMethod(register, variable.type);
  2189. ReleaseIntermediateOperand(register);
  2190. END;
  2191. variable := variable.nextVariable;
  2192. END;
  2193. IF backend.hasLinkRegister THEN
  2194. Emit(Pop(Basic.invalidPosition, lr));
  2195. END;
  2196. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2197. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2198. Emit(Br(position,op));
  2199. INC(statCoopTraceModule, section.pc);
  2200. section := previousSection;
  2201. IF dump # NIL THEN dump := section.comments END;
  2202. END CreateTraceModuleMethod;
  2203. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2204. BEGIN
  2205. Emit (Push(position, dst));
  2206. Emit (Push(position, src));
  2207. CallThis(position,"GarbageCollector","Assign", 2);
  2208. END CallAssignPointer;
  2209. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2210. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2211. BEGIN
  2212. IF SemanticChecker.IsPointerType (type) THEN
  2213. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2214. ELSIF type.IsRecordType() THEN
  2215. Emit (Push(position,dst));
  2216. Emit (Push(position,src));
  2217. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2218. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2219. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2220. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2221. ELSIF IsStaticArray(type) THEN
  2222. size := StaticArrayNumElements(type);
  2223. base := StaticArrayBaseType(type);
  2224. IF base.IsRecordType() THEN
  2225. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2226. Emit (Push(position, dst));
  2227. Emit (Push(position, src));
  2228. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2229. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2230. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2231. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2232. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2233. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2234. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2235. Emit (Push(position, dst));
  2236. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2237. Emit (Push(position, src));
  2238. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2239. ELSE
  2240. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2241. Emit (Push(position, dst));
  2242. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2243. Emit (Push(position, src));
  2244. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2245. ASSERT(StaticArrayBaseType(type).IsPointer());
  2246. END;
  2247. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2248. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2249. Emit (Push(position, dst));
  2250. Emit (Push(position, src));
  2251. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2252. ELSE HALT(100); (* missing ? *)
  2253. END;
  2254. END CallAssignMethod;
  2255. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2256. VAR name: Basic.SegmentedName;
  2257. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2258. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2259. context: Context;
  2260. BEGIN
  2261. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2262. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2263. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2264. GetRecordTypeName (recordType,name);
  2265. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2266. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2267. IF dump # NIL THEN dump := section.comments END;
  2268. IF backend.hasLinkRegister THEN
  2269. Emit(Push(Basic.invalidPosition, lr));
  2270. END;
  2271. variable := recordType.recordScope.firstVariable;
  2272. WHILE variable # NIL DO
  2273. IF variable.NeedsTrace() THEN
  2274. dst := NewRegisterOperand (addressType);
  2275. src := NewRegisterOperand (addressType);
  2276. Emit (Mov(position, dst, parameter1));
  2277. Emit (Mov(position, src, parameter2));
  2278. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2279. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2280. CallAssignMethod(dst, src, variable.type);
  2281. ReleaseIntermediateOperand(src);
  2282. ReleaseIntermediateOperand(dst);
  2283. END;
  2284. variable := variable.nextVariable;
  2285. END;
  2286. recordBase := recordType.GetBaseRecord();
  2287. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2288. IF backend.hasLinkRegister THEN
  2289. Emit(Pop(Basic.invalidPosition, lr));
  2290. END;
  2291. GetRecordTypeName (recordBase,name);
  2292. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2293. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2294. Emit(Br(position,op));
  2295. ELSE
  2296. Emit(Exit(position,0,0, 0));
  2297. END;
  2298. IF ~recordType.isObject THEN
  2299. GetRecordTypeName (recordType,name);
  2300. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2301. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2302. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2303. NEW(registerUsageCount);
  2304. usedRegisters := NIL;
  2305. dst := NewRegisterOperand (addressType);
  2306. src := NewRegisterOperand (addressType);
  2307. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2308. Emit(Mov(position, dst, parameter1));
  2309. Emit(Mov(position, src, parameter2));
  2310. label := NewLabel();
  2311. SetLabel(label);
  2312. Emit(Push(position, dst));
  2313. Emit(Push(position, src));
  2314. GetRecordTypeName (recordType,name);
  2315. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2316. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2317. Emit(Call(position, op, 0));
  2318. Emit(Pop(position, src));
  2319. Emit(Pop(position, dst));
  2320. Emit(Add(position, dst, dst, ofs));
  2321. Emit(Add(position, src, src, ofs));
  2322. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2323. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2324. Emit(Exit(position,0,0, 0));
  2325. END;
  2326. INC(statCoopAssignProcedure, section.pc);
  2327. ReturnToContext(context);
  2328. IF dump # NIL THEN dump := section.comments END;
  2329. END CreateAssignProcedure;
  2330. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2331. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2332. BEGIN
  2333. IF IsUnsafePointer (type) THEN
  2334. skip := NewLabel();
  2335. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2336. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2337. BreqL (skip, op, nil);
  2338. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2339. SetLabel (skip);
  2340. ELSIF SemanticChecker.IsPointerType (type) THEN
  2341. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2342. CallThis(position,"GarbageCollector","Mark", 1);
  2343. ELSIF type.IsRecordType() THEN
  2344. Emit (Push(position,register));
  2345. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2346. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2347. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2348. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2349. ELSIF IsStaticArray(type) THEN
  2350. size := StaticArrayNumElements(type);
  2351. base := StaticArrayBaseType(type);
  2352. IF base.IsRecordType() THEN
  2353. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2354. Emit (Push(position, register));
  2355. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2356. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2357. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2358. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2359. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2360. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2361. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2362. Emit (Push(position, register));
  2363. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2364. ELSE
  2365. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2366. Emit (Push(position, register));
  2367. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2368. ASSERT(base.IsPointer());
  2369. END;
  2370. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2371. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2372. CallThis(position,"GarbageCollector","Mark", 1);
  2373. ELSE HALT(100); (* missing ? *)
  2374. END;
  2375. END CallTraceMethod;
  2376. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2377. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2378. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2379. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2380. BEGIN
  2381. previousSection := section;
  2382. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2383. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2384. GetRecordTypeName (recordType,name);
  2385. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2386. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2387. IF dump # NIL THEN dump := section.comments END;
  2388. IF backend.hasLinkRegister THEN
  2389. Emit(Push(Basic.invalidPosition, lr));
  2390. END;
  2391. variable := recordType.recordScope.firstVariable;
  2392. WHILE variable # NIL DO
  2393. IF variable.NeedsTrace() THEN
  2394. register := NewRegisterOperand (addressType);
  2395. Emit (Mov(position,register,parameter1));
  2396. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2397. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2398. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2399. END;
  2400. CallTraceMethod(register, variable.type);
  2401. ReleaseIntermediateOperand(register);
  2402. END;
  2403. variable := variable.nextVariable;
  2404. END;
  2405. recordBase := recordType.GetBaseRecord();
  2406. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2407. recordBase := recordBase.GetBaseRecord();
  2408. END;
  2409. IF recordBase # NIL THEN
  2410. IF backend.hasLinkRegister THEN
  2411. Emit(Pop(Basic.invalidPosition, lr));
  2412. END;
  2413. GetRecordTypeName (recordBase,name);
  2414. IF HasExplicitTraceMethod (recordBase) THEN
  2415. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2416. ELSE
  2417. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2418. END;
  2419. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2420. Emit(Br(position,op));
  2421. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2422. Emit(Exit(position,0,0,0));
  2423. ELSE
  2424. IF backend.hasLinkRegister THEN
  2425. Emit(Pop(Basic.invalidPosition, lr));
  2426. END;
  2427. IF recordType.isObject THEN
  2428. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2429. ELSE
  2430. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2431. END;
  2432. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2433. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2434. Emit(Br(position,op));
  2435. END;
  2436. IF ~recordType.isObject THEN
  2437. GetRecordTypeName (recordType,name);
  2438. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2439. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2440. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2441. NEW(registerUsageCount);
  2442. usedRegisters := NIL;
  2443. IF dump # NIL THEN dump := section.comments END;
  2444. register := NewRegisterOperand (addressType);
  2445. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2446. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2447. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2448. END;
  2449. Emit (Push(position,register));
  2450. GetRecordTypeName (recordType,name);
  2451. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2452. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2453. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2454. ReleaseIntermediateOperand(register);
  2455. Emit(Exit(position,0,0,0));
  2456. GetRecordTypeName (recordType,name);
  2457. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2458. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2459. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2460. NEW(registerUsageCount);
  2461. usedRegisters := NIL;
  2462. register := NewRegisterOperand (addressType);
  2463. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2464. Emit(Mov(position, register, parameter1));
  2465. label := NewLabel();
  2466. SetLabel(label);
  2467. Emit(Push(position, register));
  2468. GetRecordTypeName (recordType,name);
  2469. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2470. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2471. Emit(Call(position, op, 0));
  2472. Emit(Pop(position, register));
  2473. Emit(Add(position, register, register, ofs));
  2474. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2475. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2476. Emit(Exit(position,0,0,0));
  2477. END;
  2478. INC(statCoopTraceMethod, section.pc);
  2479. ReturnToContext(context);
  2480. IF dump # NIL THEN dump := section.comments END;
  2481. END CreateTraceMethod;
  2482. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2483. VAR name: Basic.SegmentedName;
  2484. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2485. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2486. context: Context;
  2487. BEGIN
  2488. IF recordType.isObject THEN RETURN END;
  2489. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2490. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2491. GetRecordTypeName (recordType,name);
  2492. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2493. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2494. IF dump # NIL THEN dump := section.comments END;
  2495. IF backend.hasLinkRegister THEN
  2496. Emit(Push(Basic.invalidPosition, lr));
  2497. END;
  2498. variable := recordType.recordScope.firstVariable;
  2499. WHILE variable # NIL DO
  2500. IF variable.NeedsTrace() THEN
  2501. dst := NewRegisterOperand (addressType);
  2502. Emit (Mov(position, dst, parameter1));
  2503. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2504. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2505. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2506. END;
  2507. CallResetProcedure(dst, nil, variable.type);
  2508. ReleaseIntermediateOperand(dst);
  2509. END;
  2510. variable := variable.nextVariable;
  2511. END;
  2512. recordBase := recordType.GetBaseRecord();
  2513. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2514. IF backend.hasLinkRegister THEN
  2515. Emit(Pop(Basic.invalidPosition, lr));
  2516. END;
  2517. GetRecordTypeName (recordBase,name);
  2518. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2519. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2520. Emit(Br(position,op));
  2521. ELSE
  2522. Emit(Exit(position,0,0, 0));
  2523. END;
  2524. GetRecordTypeName (recordType,name);
  2525. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2526. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2527. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2528. NEW(registerUsageCount);
  2529. usedRegisters := NIL;
  2530. dst := NewRegisterOperand (addressType);
  2531. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2532. Emit(Mov(position, dst, parameter1));
  2533. label := NewLabel();
  2534. SetLabel(label);
  2535. Emit(Push(position, dst));
  2536. GetRecordTypeName (recordType,name);
  2537. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2538. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2539. Emit(Call(position, op, 0));
  2540. Emit(Pop(position, dst));
  2541. Emit(Add(position, dst, dst, ofs));
  2542. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2543. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2544. Emit(Exit(position,0,0, 0));
  2545. INC(statCoopResetProcedure, section.pc);
  2546. ReturnToContext(context);
  2547. IF dump # NIL THEN dump := section.comments END;
  2548. END CreateResetProcedure;
  2549. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2550. VAR name: Basic.SegmentedName; context: Context;
  2551. BEGIN
  2552. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2553. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2554. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2555. IF dump # NIL THEN dump := section.comments END;
  2556. IF backend.hasLinkRegister THEN
  2557. Emit(Push(Basic.invalidPosition, lr));
  2558. END;
  2559. Emit(Push(position,fp));
  2560. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2561. ResetVariables(scope);
  2562. Emit(Pop(position,fp));
  2563. Emit(Exit(position,0,0, 0));
  2564. ReturnToContext(context);
  2565. IF dump # NIL THEN dump := section.comments END;
  2566. END CreateResetMethod;
  2567. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2568. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2569. BEGIN
  2570. IF SemanticChecker.IsPointerType (type) THEN
  2571. Emit (Push(position, dest));
  2572. CallThis(position,"GarbageCollector","Reset", 1);
  2573. ELSIF type.IsRecordType() THEN
  2574. Emit (Push(position, dest));
  2575. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2576. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2577. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2578. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2579. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2580. size := GetArrayLength(type, tag);
  2581. base := ArrayBaseType(type);
  2582. IF base.IsRecordType() THEN
  2583. Emit (Push(position, size));
  2584. Emit (Push(position, dest));
  2585. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2586. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2587. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2588. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2589. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2590. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2591. Emit (Push(position, size));
  2592. Emit (Push(position, dest));
  2593. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2594. ELSE
  2595. Emit (Push(position, size));
  2596. Emit (Push(position, dest));
  2597. CallThis(position,"GarbageCollector","ResetArray", 2);
  2598. ASSERT(ArrayBaseType(type).IsPointer());
  2599. END;
  2600. ReleaseIntermediateOperand(size);
  2601. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2602. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2603. Emit (Push(position, dest));
  2604. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2605. ELSE HALT(100); (* missing ? *)
  2606. END;
  2607. END CallResetProcedure;
  2608. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2609. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2610. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2611. VAR operand: Operand;
  2612. BEGIN
  2613. Symbol (symbol, operand);
  2614. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2615. ReleaseOperand(operand);
  2616. END Reset;
  2617. BEGIN
  2618. previousScope := currentScope;
  2619. currentScope := scope;
  2620. pc := section.pc;
  2621. variable := scope.firstVariable;
  2622. WHILE variable # NIL DO
  2623. IF variable.NeedsTrace() THEN
  2624. Reset (variable);
  2625. END;
  2626. variable := variable.nextVariable;
  2627. END;
  2628. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2629. WHILE parameter # NIL DO
  2630. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2631. Reset (parameter);
  2632. END;
  2633. parameter := parameter.nextParameter;
  2634. END;
  2635. INC(statCoopResetVariables, section.pc - pc);
  2636. currentScope := previousScope;
  2637. END ResetVariables;
  2638. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2639. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2640. VAR op: IntermediateCode.Operand; context: Context;
  2641. BEGIN
  2642. previousSection := section;
  2643. GetCodeSectionNameForSymbol(procedure, name);
  2644. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  2645. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  2646. IF dump # NIL THEN dump := section.comments END;
  2647. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2648. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2649. Emit(Data(position,op));
  2650. Emit(Data(position,nil));
  2651. IF HasPointers (procedure.procedureScope) THEN
  2652. GetCodeSectionNameForSymbol(procedure, name);
  2653. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2654. ELSE
  2655. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2656. END;
  2657. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2658. Emit(Data(position,op));
  2659. ReturnToContext(context);
  2660. IF dump # NIL THEN dump := section.comments END;
  2661. END CreateProcedureDescriptor;
  2662. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2663. VAR import: SyntaxTree.Import;
  2664. s: Basic.MessageString;
  2665. selfName: SyntaxTree.IdentifierString;
  2666. BEGIN
  2667. moduleScope.ownerModule.GetName(selfName);
  2668. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2669. module := moduleScope.ownerModule
  2670. ELSE
  2671. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2672. IF import = NIL THEN
  2673. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2674. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2675. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2676. s := "Module ";
  2677. Strings.Append(s,moduleName);
  2678. Strings.Append(s," cannot be imported.");
  2679. IF force THEN
  2680. Error(position,s);
  2681. ELSIF canBeLoaded THEN
  2682. IF WarningDynamicLoading THEN
  2683. Strings.Append(s, "=> no dynamic linking.");
  2684. Warning(position, s);
  2685. END;
  2686. canBeLoaded := FALSE;
  2687. END;
  2688. RETURN FALSE
  2689. ELSE
  2690. SELF.module.imports.AddName(moduleName)
  2691. END;
  2692. ELSIF import.module = NIL THEN (* already tried *)
  2693. RETURN FALSE
  2694. END;
  2695. module := import.module;
  2696. END;
  2697. RETURN TRUE
  2698. END AddImport;
  2699. (* needed for old binary object file format*)
  2700. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2701. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2702. BEGIN
  2703. IF AddImport(moduleName,module,TRUE) THEN
  2704. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2705. IF procedure = NIL THEN
  2706. s := "Instruction not supported on target, emulation procedure ";
  2707. Strings.Append(s,moduleName);
  2708. Strings.Append(s,".");
  2709. Strings.Append(s,procedureName);
  2710. Strings.Append(s," not present");
  2711. Error(position,s);
  2712. ELSE
  2713. StaticCallOperand(r,procedure);
  2714. ReleaseOperand(r);
  2715. fp := GetFingerprint(procedure);
  2716. END;
  2717. END;
  2718. END EnsureSymbol;
  2719. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2720. VAR exit: Label; trueL,falseL: Label;
  2721. BEGIN
  2722. trueL := NewLabel();
  2723. falseL := NewLabel();
  2724. exit := NewLabel();
  2725. Condition(x,trueL,falseL);
  2726. InitOperand(result,ModeValue);
  2727. SetLabel(trueL);
  2728. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2729. Emit(Mov(position,result.op,true));
  2730. BrL(exit);
  2731. SetLabel(falseL);
  2732. Emit(MovReplace(position,result.op,false));
  2733. SetLabel(exit);
  2734. END ConditionToValue;
  2735. PROCEDURE ValueToCondition(VAR op: Operand);
  2736. BEGIN
  2737. LoadValue(op,system.booleanType);
  2738. BrneL(trueLabel,op.op, false);
  2739. ReleaseOperand(op);
  2740. BrL(falseLabel);
  2741. END ValueToCondition;
  2742. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2743. VAR size: LONGINT;
  2744. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2745. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2746. BEGIN
  2747. ASSERT(type.form = SyntaxTree.Open);
  2748. baseType := type.arrayBase.resolved;
  2749. IF IsOpenArray(baseType) THEN
  2750. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2751. ELSE
  2752. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2753. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2754. END;
  2755. len := tag;
  2756. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2757. IntermediateCode.MakeMemory(len,addressType);
  2758. UseIntermediateOperand(len);
  2759. Reuse2(res,sizeOperand,len);
  2760. Emit(Mul(position,res,sizeOperand,len));
  2761. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2762. RETURN res
  2763. END GetArraySize;
  2764. BEGIN
  2765. type := type.resolved;
  2766. IF IsOpenArray(type) THEN
  2767. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2768. RETURN tag
  2769. ELSE
  2770. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2771. END;
  2772. ELSE
  2773. size := ToMemoryUnits(system,system.SizeOf(type));
  2774. RETURN IntermediateCode.Immediate(addressType,size)
  2775. END;
  2776. END GetDynamicSize;
  2777. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2778. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2779. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2780. BEGIN
  2781. ASSERT(type.form = SyntaxTree.Open);
  2782. baseType := type.arrayBase.resolved;
  2783. IF IsOpenArray(baseType) THEN
  2784. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2785. ELSE
  2786. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2787. END;
  2788. len := tag;
  2789. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2790. IntermediateCode.MakeMemory(len,addressType);
  2791. UseIntermediateOperand(len);
  2792. Reuse2(res,sizeOperand,len);
  2793. Emit(Mul(position,res,sizeOperand,len));
  2794. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2795. RETURN res
  2796. END GetLength;
  2797. BEGIN
  2798. type := type.resolved;
  2799. IF IsOpenArray(type) THEN
  2800. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2801. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2802. ELSIF type IS SyntaxTree.StringType THEN
  2803. RETURN tag;
  2804. ELSE
  2805. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  2806. END;
  2807. END GetArrayLength;
  2808. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2809. VAR result: IntermediateCode.Operand;
  2810. BEGIN
  2811. IF backend.cooperative THEN
  2812. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2813. ELSE
  2814. MakeMemory(result, tag, addressType, 0);
  2815. END;
  2816. RETURN result
  2817. END GetSizeFromTag;
  2818. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2819. VAR parameter: SyntaxTree.Parameter;
  2820. BEGIN
  2821. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2822. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2823. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2824. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2825. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2826. END;
  2827. RETURN GetDynamicSize(e.type, tag);
  2828. END GetArrayOfBytesSize;
  2829. (*
  2830. to find imported symbol. not needed ?
  2831. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2832. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2833. BEGIN
  2834. IF AddImport(moduleName,importedModule,FALSE) THEN
  2835. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2836. RETURN symbol
  2837. ELSE
  2838. RETURN NIL
  2839. END
  2840. END SymbolByName;
  2841. *)
  2842. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2843. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2844. BEGIN
  2845. IF AddImport(moduleName,runtimeModule,force) THEN
  2846. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2847. IF procedure = NIL THEN
  2848. s := "Procedure ";
  2849. Strings.Append(s,moduleName);
  2850. Strings.Append(s,".");
  2851. Strings.Append(s,procedureName);
  2852. Strings.Append(s," not present");
  2853. Error(position,s);
  2854. RETURN FALSE
  2855. ELSE
  2856. RETURN TRUE
  2857. END;
  2858. ELSE RETURN FALSE
  2859. END;
  2860. END GetRuntimeProcedure;
  2861. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2862. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2863. s: Basic.MessageString;
  2864. BEGIN
  2865. Basic.InitSegmentedName(name);
  2866. name[0] := Basic.MakeString(moduleName);
  2867. name[1] := Basic.MakeString(typeName);
  2868. name[2] := -1;
  2869. IF AddImport(moduleName,importedModule, FALSE) THEN
  2870. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2871. IF symbol = NIL THEN
  2872. s := "type ";
  2873. Strings.Append(s,moduleName);
  2874. Strings.Append(s,".");
  2875. Strings.Append(s,typeName);
  2876. Strings.Append(s," not present");
  2877. Error(position,s);
  2878. END;
  2879. ELSE symbol := NIL;
  2880. END;
  2881. IF importedModule = moduleScope.ownerModule THEN
  2882. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2883. ELSE
  2884. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2885. END;
  2886. RETURN symbol
  2887. END GetTypeDescriptor;
  2888. (* 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. *)
  2889. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2890. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2891. pooledName: Basic.SegmentedName; size: LONGINT;
  2892. BEGIN
  2893. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2894. StaticCallOperand(result,procedure);
  2895. IF numberParameters < 0 THEN
  2896. size := ProcedureParametersSize(system,procedure);
  2897. ELSE
  2898. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2899. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2900. Error(position,"runtime call parameter count mismatch");
  2901. END;
  2902. END;
  2903. Emit(Call(position, result.op, size));
  2904. ReleaseOperand(result);
  2905. ELSE (* only static linking possible *)
  2906. ASSERT(numberParameters >= 0);
  2907. Basic.InitSegmentedName(pooledName);
  2908. pooledName[0] := Basic.MakeString(moduleName);
  2909. pooledName[1] := Basic.MakeString(procedureName);
  2910. pooledName[2] := -1;
  2911. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2912. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2913. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2914. END;
  2915. END CallThisChecked;
  2916. (* 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. *)
  2917. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2918. BEGIN
  2919. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2920. END CallThis;
  2921. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2922. VAR
  2923. left,right: Operand;
  2924. leftSize, rightSize: IntermediateCode.Operand;
  2925. saved: RegisterEntry;
  2926. reg: IntermediateCode.Operand;
  2927. procedureName: SyntaxTree.IdentifierString;
  2928. BEGIN
  2929. procedureName := "CompareString";
  2930. SaveRegisters();ReleaseUsedRegisters(saved);
  2931. Designate(leftExpression,left);
  2932. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2933. Emit(Push(position,leftSize));
  2934. ReleaseIntermediateOperand(leftSize);
  2935. Emit(Push(position,left.op));
  2936. ReleaseOperand(left);
  2937. Designate(rightExpression,right);
  2938. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2939. Emit(Push(position,rightSize));
  2940. ReleaseIntermediateOperand(rightSize);
  2941. Emit(Push(position,right.op));
  2942. ReleaseOperand(right);
  2943. IF backend.cooperative THEN
  2944. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2945. ELSE
  2946. CallThis(position,runtimeModuleName,procedureName, 4);
  2947. END;
  2948. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2949. Emit(Result(position,reg));
  2950. (*
  2951. AcquireThisRegister(int8,IntermediateCode.Result);
  2952. *)
  2953. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2954. (*
  2955. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2956. *)
  2957. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2958. ReleaseIntermediateOperand(reg);
  2959. BrL(falseLabel);
  2960. END CompareString;
  2961. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2962. VAR
  2963. left,right: Operand;
  2964. leftSize, rightSize: IntermediateCode.Operand;
  2965. saved: RegisterEntry;
  2966. procedureName: SyntaxTree.IdentifierString;
  2967. BEGIN
  2968. procedureName := "CopyString";
  2969. SaveRegisters();ReleaseUsedRegisters(saved);
  2970. Designate(leftExpression,left);
  2971. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2972. Emit(Push(position,leftSize));
  2973. ReleaseIntermediateOperand(leftSize);
  2974. Emit(Push(position,left.op));
  2975. ReleaseOperand(left);
  2976. Designate(rightExpression,right);
  2977. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2978. Emit(Push(position,rightSize));
  2979. ReleaseIntermediateOperand(rightSize);
  2980. Emit(Push(position,right.op));
  2981. ReleaseOperand(right);
  2982. IF backend.cooperative THEN
  2983. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2984. ELSE
  2985. CallThis(position,runtimeModuleName,procedureName,4);
  2986. END;
  2987. RestoreRegisters(saved);
  2988. END CopyString;
  2989. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  2990. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2991. leftType,rightType: SyntaxTree.Type;
  2992. leftExpression,rightExpression : SyntaxTree.Expression;
  2993. componentType: IntermediateCode.Type;
  2994. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  2995. size: LONGINT;
  2996. BEGIN
  2997. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2998. dest := destination; destination := emptyOperand;
  2999. leftType := x.left.type.resolved;
  3000. rightType := x.right.type.resolved;
  3001. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3002. CASE x.operator OF
  3003. Scanner.Or:
  3004. (* shortcut evaluation of left OR right *)
  3005. IF ~conditional THEN ConditionToValue(x);
  3006. ELSE
  3007. next := NewLabel();
  3008. Condition(x.left,trueLabel,next);
  3009. SetLabel(next);
  3010. Condition(x.right,trueLabel,falseLabel);
  3011. END;
  3012. |Scanner.And:
  3013. (* shortcut evaluation of left & right *)
  3014. IF ~conditional THEN ConditionToValue(x);
  3015. ELSE
  3016. next := NewLabel();
  3017. Condition(x.left,next,falseLabel);
  3018. SetLabel(next);
  3019. Condition(x.right,trueLabel,falseLabel);
  3020. END;
  3021. |Scanner.Is:
  3022. IF ~conditional THEN ConditionToValue(x);
  3023. ELSE
  3024. (* get type desc tag *)
  3025. IF IsPointerToRecord(leftType,recordType) THEN
  3026. Evaluate(x.left,left);
  3027. Dereference(left,recordType,IsUnsafePointer(leftType))
  3028. ELSE
  3029. Designate(x.left,left);
  3030. END;
  3031. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  3032. ReleaseOperand(left);
  3033. END;
  3034. |Scanner.Plus:
  3035. Evaluate(x.left,left);
  3036. Evaluate(x.right,right);
  3037. IF leftType IS SyntaxTree.SetType THEN
  3038. InitOperand(result,ModeValue);
  3039. Reuse2a(result.op,left.op,right.op,dest);
  3040. Emit(Or(position,result.op,left.op,right.op));
  3041. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3042. InitOperand(result,ModeValue);
  3043. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3044. Reuse2(result.tag,left.tag,right.tag);
  3045. Emit(Add(position,result.op,left.op,right.op));
  3046. Emit(Add(position,result.tag,left.tag,right.tag))
  3047. ELSE
  3048. InitOperand(result,ModeValue);
  3049. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3050. AddInt(result.op, left.op, right.op) ;
  3051. ELSE
  3052. *)
  3053. Reuse2a(result.op,left.op,right.op,dest);
  3054. Emit(Add(position,result.op,left.op,right.op));
  3055. (*
  3056. END;
  3057. *)
  3058. END;
  3059. ReleaseOperand(left); ReleaseOperand(right);
  3060. |Scanner.Minus:
  3061. Evaluate(x.left,left);
  3062. Evaluate(x.right,right);
  3063. IF leftType IS SyntaxTree.SetType THEN
  3064. InitOperand(result,ModeValue);
  3065. Reuse1(result.op,right.op);
  3066. Emit(Not(position,result.op,right.op));
  3067. ReleaseOperand(right);
  3068. Emit(And(position,result.op,result.op,left.op));
  3069. ReleaseOperand(left);
  3070. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3071. InitOperand(result,ModeValue);
  3072. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3073. Reuse2(result.tag,left.tag,right.tag);
  3074. Emit(Sub(position,result.op,left.op,right.op));
  3075. Emit(Sub(position,result.tag,left.tag,right.tag));
  3076. ReleaseOperand(left); ReleaseOperand(right)
  3077. ELSE
  3078. InitOperand(result,ModeValue);
  3079. Reuse2a(result.op,left.op,right.op,dest);
  3080. Emit(Sub(position,result.op,left.op,right.op));
  3081. ReleaseOperand(left); ReleaseOperand(right);
  3082. END;
  3083. |Scanner.Times:
  3084. Evaluate(x.left,left);
  3085. Evaluate(x.right,right);
  3086. IF leftType IS SyntaxTree.SetType THEN
  3087. InitOperand(result,ModeValue);
  3088. Reuse2a(result.op,left.op,right.op,dest);
  3089. Emit(And(position,result.op,left.op,right.op));
  3090. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3091. InitOperand(result, ModeValue);
  3092. componentType := left.op.type;
  3093. (* TODO: review this *)
  3094. (*
  3095. result.op = left.op * right.op - left.tag * right.tag
  3096. result.tag = left.tag * right.op + left.op * right.tag
  3097. *)
  3098. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3099. Emit(Mul(position,result.op, left.op, right.op));
  3100. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3101. Emit(Mul(position,tempReg, left.tag, right.tag));
  3102. Emit(Sub(position,result.op, result.op, tempReg));
  3103. Reuse2(result.tag, left.tag, right.op);
  3104. Emit(Mul(position,result.tag, left.tag, right.op));
  3105. Emit(Mul(position,tempReg, left.op, right.tag));
  3106. Emit(Add(position,result.tag, result.tag, tempReg));
  3107. ReleaseIntermediateOperand(tempReg)
  3108. ELSE
  3109. InitOperand(result,ModeValue);
  3110. Reuse2a(result.op,left.op,right.op,dest);
  3111. Emit(Mul(position,result.op,left.op,right.op));
  3112. END;
  3113. ReleaseOperand(left); ReleaseOperand(right);
  3114. |Scanner.Div:
  3115. Evaluate(x.left,left);
  3116. Evaluate(x.right,right);
  3117. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3118. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3119. IF ~isUnchecked THEN
  3120. exit := NewLabel();
  3121. BrltL(exit,zero,right.op);
  3122. EmitTrap(position,NegativeDivisorTrap);
  3123. SetLabel(exit);
  3124. END;
  3125. END;
  3126. InitOperand(result,ModeValue);
  3127. Reuse2a(result.op,left.op,right.op,dest);
  3128. Emit(Div(position,result.op,left.op,right.op));
  3129. ReleaseOperand(left); ReleaseOperand(right);
  3130. |Scanner.Mod:
  3131. Evaluate(x.left,left);
  3132. Evaluate(x.right,right);
  3133. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3134. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3135. IF ~isUnchecked THEN
  3136. exit := NewLabel();
  3137. BrltL(exit,zero,right.op);
  3138. EmitTrap(position,NegativeDivisorTrap);
  3139. SetLabel(exit);
  3140. END;
  3141. END;
  3142. InitOperand(result,ModeValue);
  3143. Reuse2a(result.op,left.op,right.op,dest);
  3144. Emit(Mod(position,result.op,left.op,right.op));
  3145. ReleaseOperand(left); ReleaseOperand(right);
  3146. |Scanner.Slash:
  3147. Evaluate(x.left,left);
  3148. Evaluate(x.right,right);
  3149. IF leftType IS SyntaxTree.SetType THEN
  3150. InitOperand(result,ModeValue);
  3151. Reuse2a(result.op,left.op,right.op,dest);
  3152. Emit(Xor(position,result.op,left.op,right.op));
  3153. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3154. InitOperand(result,ModeValue);
  3155. componentType := left.op.type;
  3156. (* review this *)
  3157. (*
  3158. divisor = right.op * right.op + right.tag * right.tag
  3159. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3160. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3161. *)
  3162. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3163. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3164. Emit(Mul(position,tempReg, right.op, right.op));
  3165. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3166. Emit(Add(position,tempReg, tempReg, tempReg2));
  3167. result.op := tempReg2;
  3168. Emit(Mul(position,result.op, left.op, right.op));
  3169. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3170. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3171. Emit(Add(position,result.op, result.op, tempReg2));
  3172. Emit(Div(position,result.op, result.op, tempReg));
  3173. Reuse2(result.tag, left.tag, right.op);
  3174. Emit(Mul(position,result.tag, left.tag, right.op));
  3175. Emit(Mul(position,tempReg2, left.op, right.tag));
  3176. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3177. Emit(Div(position,result.tag, result.tag, tempReg));
  3178. ReleaseIntermediateOperand(tempReg);
  3179. ReleaseIntermediateOperand(tempReg2)
  3180. ELSE
  3181. InitOperand(result,ModeValue);
  3182. Reuse2a(result.op,left.op,right.op,dest);
  3183. Emit(Div(position,result.op,left.op,right.op));
  3184. END;
  3185. ReleaseOperand(left); ReleaseOperand(right);
  3186. |Scanner.Equal:
  3187. IF ~conditional THEN ConditionToValue(x);
  3188. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3189. CompareString(BreqL,x.left,x.right);
  3190. ELSE
  3191. Evaluate(x.left,left);
  3192. Evaluate(x.right,right);
  3193. IF leftType IS SyntaxTree.RangeType THEN
  3194. ASSERT(rightType IS SyntaxTree.RangeType);
  3195. BrneL(falseLabel, left.op, right.op); (* first *)
  3196. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3197. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3198. ReleaseOperand(left); ReleaseOperand(right);
  3199. BrL(trueLabel)
  3200. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3201. BrneL(falseLabel, left.op, right.op); (* first *)
  3202. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3203. ReleaseOperand(left); ReleaseOperand(right);
  3204. BrL(trueLabel)
  3205. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3206. (* TODO: review this *)
  3207. BrneL(falseLabel, left.op, right.op); (* real part *)
  3208. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3209. ReleaseOperand(left); ReleaseOperand(right);
  3210. BrL(trueLabel)
  3211. ELSE
  3212. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3213. ReleaseOperand(left); ReleaseOperand(right);
  3214. BrL(trueLabel);
  3215. END;
  3216. END;
  3217. |Scanner.LessEqual:
  3218. IF ~conditional THEN ConditionToValue(x);
  3219. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3220. CompareString(BrgeL,x.right,x.left);
  3221. ELSE
  3222. Evaluate(x.left,left);
  3223. Evaluate(x.right,right);
  3224. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3225. Reuse1(temp.op,right.op);
  3226. Emit(And(position,temp.op,left.op,right.op));
  3227. ReleaseOperand(right);
  3228. BreqL(trueLabel,temp.op,left.op);
  3229. BrL(falseLabel);
  3230. ReleaseOperand(temp);ReleaseOperand(left);
  3231. ELSE
  3232. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3233. ReleaseOperand(left); ReleaseOperand(right);
  3234. BrL(trueLabel);
  3235. END;
  3236. END;
  3237. |Scanner.Less:
  3238. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3239. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  3240. leftExpression.SetType(system.booleanType);
  3241. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3242. rightExpression.SetType(system.booleanType);
  3243. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3244. leftExpression.SetType(system.booleanType);
  3245. Expression(leftExpression);
  3246. ELSIF ~conditional THEN ConditionToValue(x);
  3247. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3248. CompareString(BrltL,x.left,x.right);
  3249. ELSE
  3250. Evaluate(x.left,left);
  3251. Evaluate(x.right,right);
  3252. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3253. ReleaseOperand(left); ReleaseOperand(right);
  3254. BrL(trueLabel);
  3255. END;
  3256. |Scanner.Greater:
  3257. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3258. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  3259. leftExpression.SetType(system.booleanType);
  3260. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3261. rightExpression.SetType(system.booleanType);
  3262. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3263. leftExpression.SetType(system.booleanType);
  3264. Expression(leftExpression);
  3265. ELSIF ~conditional THEN ConditionToValue(x);
  3266. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3267. CompareString(BrltL,x.right,x.left);
  3268. ELSE
  3269. Evaluate(x.left,left);
  3270. Evaluate(x.right,right);
  3271. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3272. ReleaseOperand(left); ReleaseOperand(right);
  3273. BrL(trueLabel);
  3274. END;
  3275. |Scanner.GreaterEqual:
  3276. IF ~conditional THEN ConditionToValue(x);
  3277. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3278. CompareString(BrgeL,x.left,x.right);
  3279. ELSE
  3280. Evaluate(x.left,left);
  3281. Evaluate(x.right,right);
  3282. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3283. Reuse1(temp.op,left.op);
  3284. Emit(And(position,temp.op,left.op,right.op));
  3285. ReleaseOperand(left);
  3286. BreqL(trueLabel, temp.op,right.op);
  3287. ReleaseOperand(temp); ReleaseOperand(right);
  3288. BrL(falseLabel);
  3289. ELSE
  3290. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3291. ReleaseOperand(left); ReleaseOperand(right);
  3292. BrL(trueLabel);
  3293. END;
  3294. END;
  3295. |Scanner.Unequal:
  3296. IF ~conditional THEN ConditionToValue(x);
  3297. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3298. CompareString(BrneL,x.left,x.right);
  3299. ELSE
  3300. Evaluate(x.left,left);
  3301. Evaluate(x.right,right);
  3302. IF leftType IS SyntaxTree.RangeType THEN
  3303. ASSERT(rightType IS SyntaxTree.RangeType);
  3304. BrneL(trueLabel, left.op, right.op); (* first *)
  3305. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3306. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3307. ReleaseOperand(left); ReleaseOperand(right);
  3308. BrL(falseLabel)
  3309. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3310. BrneL(trueLabel, left.op, right.op); (* first *)
  3311. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3312. ReleaseOperand(left); ReleaseOperand(right);
  3313. BrL(falseLabel)
  3314. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3315. (* TODO: review this *)
  3316. BrneL(trueLabel, left.op, right.op); (* real part *)
  3317. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3318. ReleaseOperand(left); ReleaseOperand(right);
  3319. BrL(falseLabel)
  3320. ELSE
  3321. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3322. ReleaseOperand(left); ReleaseOperand(right);
  3323. BrL(trueLabel);
  3324. END;
  3325. END;
  3326. |Scanner.In:
  3327. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3328. Evaluate(x.left,left);
  3329. Evaluate(x.right,right);
  3330. Convert(left.op,setType);
  3331. ReuseCopy(temp.op,right.op);
  3332. Emit(Shr(position,temp.op,temp.op,left.op));
  3333. ReleaseOperand(right); ReleaseOperand(left);
  3334. IntermediateCode.InitImmediate(one,setType,1);
  3335. Emit(And(position,temp.op,temp.op,one));
  3336. IF conditional THEN
  3337. IntermediateCode.InitImmediate(zero,setType,0);
  3338. BrneL(trueLabel,temp.op,zero);
  3339. ReleaseOperand(temp);
  3340. BrL(falseLabel);
  3341. ELSE
  3342. Convert(temp.op,bool);
  3343. result.mode := ModeValue;
  3344. result.op := temp.op;
  3345. result.tag := nil; (* may be left over from calls to evaluate *)
  3346. END;
  3347. ELSE
  3348. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3349. IF x.operator = Scanner.Questionmarks THEN
  3350. leftExpression := x.left;
  3351. rightExpression := x.right;
  3352. ELSE
  3353. leftExpression := x.right;
  3354. rightExpression := x.left;
  3355. END;
  3356. Evaluate(leftExpression, left);
  3357. Emit(Push(position,left.op));
  3358. ReleaseOperand(left);
  3359. Designate(rightExpression, right);
  3360. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3361. IF ~backend.cellsAreObjects THEN
  3362. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3363. END;
  3364. Emit(Push(position,right.op));
  3365. ReleaseOperand(right);
  3366. IF backend.cellsAreObjects THEN
  3367. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3368. ELSE
  3369. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3370. END;
  3371. InitOperand(result, ModeValue);
  3372. result.op := NewRegisterOperand(bool);
  3373. Emit(Result(position,result.op));
  3374. IF conditional THEN
  3375. IntermediateCode.InitImmediate(zero,setType,0);
  3376. BrneL(trueLabel,result.op,zero);
  3377. ReleaseOperand(result);
  3378. BrL(falseLabel);
  3379. END;
  3380. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3381. leftExpression := x.left;
  3382. rightExpression := x.right;
  3383. Evaluate(leftExpression, left);
  3384. Emit(Push(position,left.op));
  3385. ReleaseOperand(left);
  3386. Evaluate(rightExpression, right);
  3387. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3388. IF ~backend.cellsAreObjects THEN
  3389. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3390. END;
  3391. Emit(Push(position,right.op));
  3392. ReleaseOperand(right);
  3393. IF backend.cellsAreObjects THEN
  3394. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3395. ELSE
  3396. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3397. END;
  3398. InitOperand(result, ModeValue);
  3399. result.op := NewRegisterOperand(bool);
  3400. Emit(Result(position,result.op));
  3401. IF conditional THEN
  3402. IntermediateCode.InitImmediate(zero,setType,0);
  3403. BrneL(trueLabel,result.op,zero);
  3404. ReleaseOperand(result);
  3405. BrL(falseLabel);
  3406. END;
  3407. ELSE
  3408. HALT(100);
  3409. END;
  3410. END;
  3411. destination := dest;
  3412. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3413. END VisitBinaryExpression;
  3414. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3415. VAR localResult, operand: Operand;
  3416. BEGIN
  3417. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3418. InitOperand(localResult, ModeValue);
  3419. ASSERT(x.first # NIL);
  3420. Evaluate(x.first, operand);
  3421. localResult.op := operand.op;
  3422. ReleaseOperand(operand);
  3423. UseIntermediateOperand(localResult.op);
  3424. ASSERT(x.last # NIL);
  3425. Evaluate(x.last, operand);
  3426. localResult.tag := operand.op;
  3427. ReleaseOperand(operand);
  3428. UseIntermediateOperand(localResult.tag);
  3429. IF x.step # NIL THEN
  3430. Evaluate(x.step, operand);
  3431. localResult.extra := operand.op;
  3432. ReleaseOperand(operand);
  3433. UseIntermediateOperand(localResult.extra);
  3434. END;
  3435. result := localResult;
  3436. IF Trace THEN TraceExit("VisitRangeExpression") END
  3437. END VisitRangeExpression;
  3438. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3439. BEGIN
  3440. HALT(100); (* should never be evaluated *)
  3441. END VisitTensorRangeExpression;
  3442. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3443. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3444. BEGIN
  3445. IF Trace THEN TraceEnter("VisitConversion") END;
  3446. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3447. dest := destination; destination := emptyOperand;
  3448. Evaluate(x.expression,old);
  3449. InitOperand(result,ModeValue);
  3450. result.op := old.op;
  3451. ASSERT(result.op.mode # 0);
  3452. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3453. (* convert TO a complex number *)
  3454. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3455. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3456. ASSERT(result.op.mode # 0);
  3457. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3458. (* convert FROM a complex number TO a complex number*)
  3459. result.tag := old.tag;
  3460. ASSERT(result.tag.mode # 0);
  3461. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3462. ASSERT(result.tag.mode # 0)
  3463. ELSE
  3464. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3465. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3466. END
  3467. ELSE
  3468. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3469. ASSERT(result.op.mode # 0);
  3470. result.tag := old.tag; (*! probably never used *)
  3471. END;
  3472. destination := dest;
  3473. IF Trace THEN TraceExit("VisitConversion") END;
  3474. END VisitConversion;
  3475. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3476. BEGIN
  3477. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3478. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3479. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3480. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3481. END VisitTypeDeclaration;
  3482. (** designators (expressions) *)
  3483. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3484. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3485. BEGIN
  3486. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3487. IF x.left # NIL THEN Expression(x.left) END;
  3488. Symbol(x.symbol,result);
  3489. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3490. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3491. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3492. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3493. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3494. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3495. END;
  3496. END;
  3497. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3498. END VisitSymbolDesignator;
  3499. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3500. BEGIN
  3501. IF isUnchecked THEN RETURN END;
  3502. IF tagsAvailable THEN
  3503. TrapC(BrltL,index,length,IndexCheckTrap);
  3504. END;
  3505. END BoundCheck;
  3506. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3507. VAR d: IntermediateCode.Operand;
  3508. BEGIN
  3509. IF isUnchecked THEN RETURN END;
  3510. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3511. TrapC(op,dim,d,ArraySizeTrap);
  3512. ReleaseIntermediateOperand(d);
  3513. END DimensionCheck;
  3514. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3515. VAR
  3516. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3517. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3518. expression: SyntaxTree.Expression;
  3519. resultingType, leftType, baseType: SyntaxTree.Type;
  3520. skipLabel1: Label;
  3521. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3522. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3523. variableOp: Operand;
  3524. variable: SyntaxTree.Variable;
  3525. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3526. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3527. VAR e: SyntaxTree.Expression; i: LONGINT;
  3528. BEGIN
  3529. tensorFound := FALSE;
  3530. FOR i := 0 TO parameters.Length()-1 DO
  3531. e := parameters.GetExpression(i);
  3532. IF e IS SyntaxTree.TensorRangeExpression THEN
  3533. ASSERT(~tensorFound);
  3534. tensorFound := TRUE;
  3535. ELSIF e IS SyntaxTree.RangeExpression THEN
  3536. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3537. ELSE
  3538. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3539. END;
  3540. END;
  3541. END CountIndices;
  3542. BEGIN
  3543. ASSERT(tagsAvailable);
  3544. resultingType := x.type.resolved; (* resulting type *)
  3545. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3546. InitOperand(localResult, ModeReference);
  3547. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3548. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3549. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3550. (* a globally defined array destination tag is available -> use and invalidate it*)
  3551. localResult.tag := arrayDestinationTag;
  3552. IntermediateCode.InitOperand(arrayDestinationTag)
  3553. ELSE
  3554. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3555. (* the result is of array range type and thus does not provide any collectable pointers *)
  3556. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3557. Symbol(variable, variableOp);
  3558. ReuseCopy(localResult.tag, variableOp.op);
  3559. ReleaseOperand(variableOp);
  3560. END
  3561. END;
  3562. indexListSize := x.parameters.Length();
  3563. CountIndices(x.parameters);
  3564. (*ASSERT(tensorRangeCount <= 1);*)
  3565. (* designate the array to be indexed over, perform tensor range check if known *)
  3566. Designate(x.left, array);
  3567. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3568. Dereference(array, leftType,FALSE);
  3569. IF ~tensorFound THEN
  3570. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  3571. END
  3572. END;
  3573. (* default base offset *)
  3574. srcDimOffset := 0;
  3575. destDimOffset := 0;
  3576. indexDim := 0;
  3577. (* use address of source array as basis *)
  3578. localResult.op := array.op;
  3579. UseIntermediateOperand(localResult.op);
  3580. (* go through the index list *)
  3581. FOR i := 0 TO indexListSize - 1 DO
  3582. expression := x.parameters.GetExpression(i);
  3583. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3584. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3585. srcDimOffset := -indexListSize;
  3586. destDimOffset := -suffixRanges;
  3587. ELSE
  3588. (* determine which dimension of source array is currently looked at *)
  3589. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3590. (* get the memory operand pointing to array descriptor dimension *)
  3591. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3592. (* make a reusable register from it *)
  3593. ReuseCopy(srcDim, tmp);
  3594. ReleaseIntermediateOperand(tmp);
  3595. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3596. ELSE
  3597. srcDim := IntermediateCode.Immediate(sizeType, i);
  3598. END;
  3599. (* get length and increment of source array for current dimension *)
  3600. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3601. Convert(sourceLength.op, sizeType);
  3602. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3603. Convert(sourceIncrement.op, sizeType);
  3604. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3605. ReleaseIntermediateOperand(srcDim);
  3606. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3607. (* SINGLE INDEX *)
  3608. Evaluate(expression, index);
  3609. ReleaseIntermediateOperand(index.tag);
  3610. index.tag := emptyOperand;
  3611. Convert(index.op, sizeType);
  3612. (* lower bound check *)
  3613. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3614. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3615. ELSIF isUnchecked THEN (* do nothing *)
  3616. ELSE
  3617. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3618. END;
  3619. (* upper bound check *)
  3620. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3621. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3622. ELSIF isUnchecked THEN (* do nothing *)
  3623. ELSE
  3624. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3625. END;
  3626. ReleaseOperand(sourceLength);
  3627. Convert(index.op, addressType);
  3628. summand := index.op;
  3629. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3630. (* RANGE OF INDICES *)
  3631. Evaluate(expression, range);
  3632. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3633. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3634. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3635. ReleaseOperand(range);
  3636. Convert(firstIndex, sizeType);
  3637. Convert(lastIndex, sizeType);
  3638. Convert(stepSize, sizeType);
  3639. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3640. if it is 'MAX(LONGINT)' *)
  3641. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3642. TransferToRegister(lastIndex, lastIndex);
  3643. skipLabel1 := NewLabel();
  3644. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3645. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3646. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3647. SetLabel(skipLabel1)
  3648. END;
  3649. (* check if step size is valid *)
  3650. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3651. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3652. ELSIF isUnchecked THEN (* do nothing *)
  3653. ELSE
  3654. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3655. END;
  3656. (* check lower bound check *)
  3657. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3658. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3659. ELSIF isUnchecked THEN (* do nothing *)
  3660. ELSE
  3661. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3662. END;
  3663. (* check upper bound check *)
  3664. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3665. (* statically open range: nothing to do *)
  3666. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3667. ASSERT(staticLastIndex < staticSourceLength)
  3668. ELSIF isUnchecked THEN (* do nothing *)
  3669. ELSE
  3670. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3671. END;
  3672. (* determine length of target array for current dimension *)
  3673. (* 1. incorporate last index: *)
  3674. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3675. (* last index is static *)
  3676. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3677. targetLength := sourceLength.op
  3678. ELSE
  3679. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3680. END;
  3681. UseIntermediateOperand(targetLength);
  3682. ELSE
  3683. (* targetLength := lastIndex + 1
  3684. Reuse1(targetLength, lastIndex);
  3685. *)
  3686. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3687. END;
  3688. ReleaseOperand(sourceLength);
  3689. ReleaseIntermediateOperand(lastIndex);
  3690. (* 2. incorporate first index: *)
  3691. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3692. (* first index and current target length are static *)
  3693. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3694. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3695. (* first index = 0: nothing to do *)
  3696. ELSE
  3697. (* targetLength := targetLength - firstIndex *)
  3698. TransferToRegister(targetLength, targetLength);
  3699. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3700. END;
  3701. (* clip negative lengths to 0 *)
  3702. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3703. IF staticTargetLength < 0 THEN
  3704. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3705. END
  3706. ELSE
  3707. skipLabel1 := NewLabel();
  3708. TransferToRegister(targetLength, targetLength);
  3709. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3710. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3711. SetLabel(skipLabel1)
  3712. END;
  3713. (* 3. incorporate index step size: *)
  3714. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3715. (*step size and current target length are static *)
  3716. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3717. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3718. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3719. (* step size = 1: nothing to do *)
  3720. ELSE
  3721. (* emit code for this:
  3722. targetLength := (targetLength-1) DIV stepSize +1;
  3723. *)
  3724. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3725. DivInt(targetLength, targetLength, stepSize);
  3726. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3727. END;
  3728. (* determine increment of target array for current dimension *)
  3729. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3730. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3731. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3732. (* step size = 1 *)
  3733. targetIncrement := sourceIncrement.op;
  3734. UseIntermediateOperand(targetIncrement)
  3735. ELSE
  3736. (* targetIncrement := sourceIncrement * stepSize *)
  3737. Reuse1(targetIncrement, stepSize);
  3738. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3739. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3740. END;
  3741. ReleaseIntermediateOperand(stepSize);
  3742. (* write length and increment of target array to descriptor *)
  3743. IF destDimOffset < 0 THEN
  3744. (* determine which dimension of target array is currently looked at *)
  3745. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3746. TransferToRegister(destDim, tmp);
  3747. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3748. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3749. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3750. ReleaseIntermediateOperand(destDim);
  3751. INC(destDimOffset);
  3752. ELSE
  3753. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3754. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  3755. END;
  3756. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3757. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3758. INC(indexDim);
  3759. Convert(firstIndex, addressType);
  3760. TransferToRegister(summand, firstIndex);
  3761. ELSE HALT(100);
  3762. END;
  3763. (*
  3764. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3765. *)
  3766. Convert(sourceIncrement.op, addressType);
  3767. Convert(summand, addressType);
  3768. MulInt(summand, summand, sourceIncrement.op);
  3769. ReleaseIntermediateOperand(sourceIncrement.op);
  3770. AddInt(localResult.op, localResult.op, summand);
  3771. ReleaseIntermediateOperand(summand);
  3772. END
  3773. END;
  3774. result := localResult;
  3775. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3776. ReleaseIntermediateOperand(result.tag);
  3777. result.tag := TypeDescriptorAdr(resultingType);
  3778. IF ~newObjectFile THEN
  3779. IntermediateCode.MakeMemory(result.tag,addressType);
  3780. END;
  3781. ELSIF IsDelegate(resultingType) THEN
  3782. ReleaseIntermediateOperand(result.tag);
  3783. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3784. UseIntermediateOperand(result.tag);
  3785. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3786. ReleaseIntermediateOperand(result.tag);
  3787. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3788. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3789. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3790. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3791. (* finalize target array descriptor *)
  3792. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3793. (* write lengths and increments of target array for remaining dimensions *)
  3794. i := indexListSize;
  3795. WHILE indexDim < targetArrayDimensionality DO
  3796. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3797. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3798. ReleaseOperand(sourceLength);
  3799. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3800. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3801. ReleaseOperand(sourceIncrement);
  3802. INC(i); INC(indexDim);
  3803. END;
  3804. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3805. tmp := nil;
  3806. ELSE
  3807. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3808. END;
  3809. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3810. ReleaseIntermediateOperand(tmp);
  3811. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3812. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3813. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3814. ELSE
  3815. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3816. END;
  3817. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3818. ReleaseIntermediateOperand(tmp);
  3819. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3820. (* write dimensionality *)
  3821. IF targetArrayDimensionality # 0 THEN
  3822. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3823. END;
  3824. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3825. END;
  3826. ReleaseOperand(array);
  3827. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3828. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3829. END;
  3830. END MathIndexDesignator;
  3831. (* get the length of an array , trying to make use of static information *)
  3832. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3833. VAR res: IntermediateCode.Operand; size: LONGINT;
  3834. BEGIN
  3835. type := type.resolved;
  3836. IF type IS SyntaxTree.ArrayType THEN
  3837. WITH type: SyntaxTree.ArrayType DO
  3838. IF type.form = SyntaxTree.Static THEN
  3839. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3840. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3841. Evaluate(type.length, op);
  3842. ReleaseIntermediateOperand(op.tag);
  3843. RETURN op.op;*)
  3844. ELSE
  3845. res := tag;
  3846. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3847. IntermediateCode.MakeMemory(res,addressType);
  3848. UseIntermediateOperand(res);
  3849. RETURN res
  3850. END
  3851. END;
  3852. ELSE
  3853. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3854. RETURN IntermediateCode.Immediate(addressType,size);
  3855. END;
  3856. END ArrayLength;
  3857. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  3858. BEGIN
  3859. IF IsImmediate(x) THEN
  3860. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  3861. ELSE
  3862. IF ~ReusableRegister(res) THEN
  3863. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3864. ELSE
  3865. UseIntermediateOperand(res);
  3866. END;
  3867. Emit(Mov(position,res,x))
  3868. END;
  3869. END CopyInt;
  3870. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3871. BEGIN
  3872. ReleaseIntermediateOperand(res);
  3873. IF IsImmediate(x) & IsImmediate(y) THEN
  3874. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3875. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3876. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3877. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3878. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3879. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3880. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3881. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3882. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3883. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3884. UseIntermediateOperand(res);
  3885. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3886. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3887. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3888. UseIntermediateOperand(res);
  3889. ELSE
  3890. IF ~ReusableRegister(res) THEN
  3891. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3892. ELSE
  3893. UseIntermediateOperand(res);
  3894. END;
  3895. IF IsImmediate(x) & (x.intValue = 0) THEN
  3896. Emit(Mov(position,res,y))
  3897. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3898. Emit(Mov(position,res,x))
  3899. ELSE
  3900. Emit(Add(position,res, x, y));
  3901. END;
  3902. END;
  3903. END AddInt;
  3904. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3905. BEGIN
  3906. ReleaseIntermediateOperand(res);
  3907. IF IsImmediate(x) & IsImmediate(y) THEN
  3908. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3909. ELSE
  3910. IF ~ReusableRegister(res) THEN
  3911. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3912. ELSE UseIntermediateOperand(res);
  3913. END;
  3914. IF IsImmediate(x) & (x.intValue = 1) THEN
  3915. Emit(Mov(position,res,y))
  3916. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3917. Emit(Mov(position,res,x))
  3918. ELSE
  3919. Emit(Mul(position,res, x, y));
  3920. END;
  3921. END;
  3922. END MulInt;
  3923. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3924. BEGIN
  3925. ReleaseIntermediateOperand(res);
  3926. IF IsImmediate(x) & IsImmediate(y) THEN
  3927. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3928. ELSE
  3929. IF ~ReusableRegister(res) THEN
  3930. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3931. ELSE UseIntermediateOperand(res);
  3932. END;
  3933. IF IsImmediate(x) & (x.intValue = 1) THEN
  3934. Emit(Mov(position,res,y))
  3935. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3936. Emit(Mov(position,res,x))
  3937. ELSE
  3938. Emit(Div(position,res, x, y));
  3939. END;
  3940. END;
  3941. END DivInt;
  3942. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3943. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3944. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3945. BEGIN
  3946. type := x.left.type.resolved;
  3947. IF type IS SyntaxTree.StringType THEN
  3948. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  3949. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3950. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  3951. type := atype;
  3952. x.left.SetType(type);
  3953. END;
  3954. IntermediateCode.InitImmediate(res,addressType,0);
  3955. maxDim := x.parameters.Length()-1;
  3956. (*
  3957. computation rule:
  3958. a: ARRAY X,Y,Z OF Element with size S
  3959. a[i,j,k] -->
  3960. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  3961. *)
  3962. FOR i := 0 TO maxDim DO
  3963. e := x.parameters.GetExpression(i);
  3964. Evaluate(e,index);
  3965. Convert(index.op,addressType);
  3966. AddInt(res, res, index.op);
  3967. IF i = 0 THEN
  3968. (*
  3969. ReuseCopy(res, index.op);
  3970. *)
  3971. Designate(x.left,array);
  3972. type := x.left.type.resolved;
  3973. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3974. Dereference(array, type, FALSE);
  3975. END;
  3976. (*
  3977. ELSE AddInt(res, res, index.op);
  3978. *)
  3979. END;
  3980. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  3981. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  3982. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  3983. BoundCheck(index.op, length);
  3984. END;
  3985. ReleaseIntermediateOperand(length);
  3986. END;
  3987. ReleaseOperand(index);
  3988. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3989. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  3990. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3991. MulInt(res,res,length);
  3992. END;
  3993. ReleaseIntermediateOperand(length);
  3994. END;
  3995. (* remaining open dimensions -- compute address *)
  3996. i := maxDim+1;
  3997. IF type IS SyntaxTree.ArrayType THEN
  3998. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3999. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4000. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4001. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4002. MulInt(res,res,length);
  4003. END;
  4004. ReleaseIntermediateOperand(length);
  4005. INC(i);
  4006. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4007. END;
  4008. END;
  4009. IF (type IS SyntaxTree.ArrayType) THEN
  4010. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4011. size := StaticSize(system, type);
  4012. IF size # 1 THEN
  4013. length := IntermediateCode.Immediate(addressType,size);
  4014. MulInt(res,res,length);
  4015. END;
  4016. ELSE
  4017. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4018. IF size # 1 THEN
  4019. length := IntermediateCode.Immediate(addressType,size);
  4020. MulInt(res,res,length);
  4021. END;
  4022. END;
  4023. END;
  4024. AddInt(res,res,array.op);
  4025. InitOperand(result,ModeReference);
  4026. result.op := res;
  4027. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4028. ReleaseIntermediateOperand(result.tag);
  4029. result.tag := TypeDescriptorAdr(type);
  4030. IF ~newObjectFile THEN
  4031. IntermediateCode.MakeMemory(result.tag,addressType);
  4032. END
  4033. ELSIF IsDelegate(type) THEN
  4034. ReleaseIntermediateOperand(result.tag);
  4035. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4036. UseIntermediateOperand(result.tag);
  4037. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4038. ReleaseIntermediateOperand(result.tag);
  4039. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4040. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4041. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4042. END;
  4043. ReleaseOperand(array);
  4044. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  4045. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  4046. END;
  4047. END IndexDesignator;
  4048. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  4049. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4050. BEGIN
  4051. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4052. dest := destination; destination := emptyOperand;
  4053. type := x.left.type.resolved;
  4054. IF type IS SyntaxTree.MathArrayType THEN
  4055. MathIndexDesignator(x);
  4056. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4057. IndexDesignator(x);
  4058. END;
  4059. destination := dest;
  4060. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4061. END VisitIndexDesignator;
  4062. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4063. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4064. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4065. procedure: SyntaxTree.Procedure;
  4066. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4067. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4068. BEGIN
  4069. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4070. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4071. parameters := expression.parameters;
  4072. moduleName := "FoxArrayBase";
  4073. procedureName := "CopyDescriptor";
  4074. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4075. SaveRegisters();ReleaseUsedRegisters(saved);
  4076. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4077. IF procedure = NIL THEN
  4078. s := "procedure ";
  4079. Strings.Append(s,moduleName);
  4080. Strings.Append(s,".");
  4081. Strings.Append(s,procedureName);
  4082. Strings.Append(s," not present");
  4083. Error(position,s);
  4084. ELSE
  4085. (* push address of temporary variable *)
  4086. Symbol(variable,destOperand);
  4087. Emit(Push(position,destOperand.op));
  4088. ReleaseOperand(destOperand);
  4089. (* push src *)
  4090. Evaluate(expression.left,srcOperand);
  4091. (*
  4092. Dereference(srcOperand,expression.type.resolved);
  4093. Emit(Push(position,srcOperand.tag));
  4094. *)
  4095. Emit(Push(position,srcOperand.op));
  4096. ReleaseOperand(srcOperand);
  4097. tensorFound := FALSE;
  4098. FOR i := 0 TO parameters.Length()-1 DO
  4099. e := parameters.GetExpression(i);
  4100. IF e IS SyntaxTree.TensorRangeExpression THEN
  4101. tensorFound := TRUE;
  4102. ELSIF e IS SyntaxTree.RangeExpression THEN
  4103. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4104. ELSE
  4105. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4106. END;
  4107. END;
  4108. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4109. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4110. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4111. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4112. StaticCallOperand(procOp,procedure);
  4113. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  4114. ReleaseOperand(procOp);
  4115. END;
  4116. RestoreRegisters(saved);
  4117. END;
  4118. RETURN variable
  4119. END PrepareTensorDescriptor;
  4120. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4121. VAR
  4122. type, descriptorType, baseType: SyntaxTree.Type;
  4123. operand, tmpOperand, variableOp, variable2Op: Operand;
  4124. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4125. variable, variable2: SyntaxTree.Variable;
  4126. dim, i, size: LONGINT;
  4127. (* TODO: needed? *)
  4128. oldArrayDestinationTag: IntermediateCode.Operand;
  4129. oldArrayDestinationDimension: LONGINT;
  4130. position: Position;
  4131. saved: RegisterEntry;
  4132. arrayFlags: SET;
  4133. m, n: LONGINT;
  4134. PROCEDURE Pass(op: IntermediateCode.Operand);
  4135. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4136. BEGIN
  4137. IF numberRegister >= 0 THEN
  4138. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  4139. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4140. Emit(Mov(position,parameterRegister, op));
  4141. ELSE
  4142. Emit(Push(position,op))
  4143. END
  4144. END Pass;
  4145. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4146. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4147. BEGIN
  4148. formalType := formalType.resolved; actualType := actualType.resolved;
  4149. IF IsOpenArray(formalType)THEN
  4150. IF actualType IS SyntaxTree.StringType THEN
  4151. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4152. RETURN;
  4153. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4154. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4155. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4156. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4157. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4158. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4159. ELSE
  4160. tmp := baseReg;
  4161. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4162. IntermediateCode.MakeMemory(tmp,addressType);
  4163. Pass((tmp));
  4164. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4165. END;
  4166. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4167. END;
  4168. END PushArrayLens;
  4169. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4170. BEGIN
  4171. CASE size OF
  4172. |2: INCL(flags,Size2Flag);
  4173. |3: INCL(flags,Size3Flag);
  4174. |4: INCL(flags,Size4Flag);
  4175. |5: INCL(flags,Size5Flag);
  4176. |6: INCL(flags,Size6Flag);
  4177. |7: INCL(flags,Size7Flag);
  4178. |8: INCL(flags,Size8Flag);
  4179. END;
  4180. END SetSmallArraySizeFlag;
  4181. BEGIN
  4182. IF Trace THEN TraceEnter("PushParameter") END;
  4183. position := expression.position;
  4184. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4185. type := expression.type.resolved;
  4186. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4187. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4188. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4189. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4190. );
  4191. (* TODO: needed? *)
  4192. oldArrayDestinationTag := arrayDestinationTag;
  4193. oldArrayDestinationDimension := arrayDestinationDimension;
  4194. IF IsArrayOfSystemByte(parameter.type) THEN
  4195. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4196. Designate(expression,operand);
  4197. ELSE
  4198. Evaluate(expression, tmpOperand);
  4199. (* array of system byte does not provide any pointers *)
  4200. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4201. Symbol(variable, operand);
  4202. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4203. Emit(Mov(position,tmp, tmpOperand.op));
  4204. ReleaseOperand(tmpOperand);
  4205. END;
  4206. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4207. ReleaseIntermediateOperand(operand.tag);
  4208. operand.tag := tmp;
  4209. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4210. Pass((operand.tag));
  4211. END;
  4212. Pass((operand.op));
  4213. ELSIF IsOpenArray(parameter.type) THEN
  4214. Designate(expression,operand);
  4215. baseReg := operand.tag;
  4216. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4217. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4218. END;
  4219. Pass((operand.op)); (* address of the array *)
  4220. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4221. (* case 1
  4222. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4223. *)
  4224. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4225. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4226. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4227. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4228. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4229. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4230. arrayDestinationTag := sp;
  4231. (* case 1b
  4232. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4233. *)
  4234. IF expression IS SyntaxTree.IndexDesignator THEN
  4235. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4236. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4237. arrayDestinationDimension := dim;
  4238. Designate(expression,operand);
  4239. (* case 1a
  4240. P(...,A,...) push: push array descriptor to stack
  4241. *)
  4242. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4243. Designate(expression,operand);
  4244. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4245. i := 0;
  4246. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4247. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4248. INC(i);
  4249. END;
  4250. type := expression.type.resolved;
  4251. WHILE (i<dim) DO (* remaining static dimensions *)
  4252. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4253. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4254. ReleaseOperand(tmpOperand);
  4255. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4256. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4257. ReleaseOperand(tmpOperand);
  4258. INC(i);
  4259. END;
  4260. dimOp := IntermediateCode.Immediate(addressType,dim);
  4261. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4262. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4263. (* case 1d
  4264. P(...,T,...) push: process left arguments, create array descriptor with given number of dimensions from T on stack
  4265. + case 1e
  4266. P(.. PT() ... );
  4267. *)
  4268. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4269. Designate(expression,operand);
  4270. Dereference(operand,type.resolved,FALSE);
  4271. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4272. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4273. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4274. (* case 1f
  4275. P(...,S,...) push: create array descriptor to S on stack
  4276. case 1g
  4277. P(... PS()...)
  4278. *)
  4279. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4280. Designate(expression,operand);
  4281. FOR i := 0 TO dim-1 DO
  4282. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4283. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4284. ReleaseOperand(tmpOperand);
  4285. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4286. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4287. ReleaseOperand(tmpOperand);
  4288. END;
  4289. (*******
  4290. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4291. *)
  4292. arrayFlags := {StaticFlag};
  4293. IF dim = 1 THEN
  4294. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4295. ReleaseOperand(tmpOperand);
  4296. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4297. m := LONGINT(tmpOperand.op.intValue);
  4298. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4299. ELSIF dim = 2 THEN
  4300. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4301. ReleaseOperand(tmpOperand);
  4302. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4303. m := LONGINT(tmpOperand.op.intValue);
  4304. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4305. ReleaseOperand(tmpOperand);
  4306. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4307. n := LONGINT(tmpOperand.op.intValue);
  4308. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4309. INCL(arrayFlags,SmallMatrixFlag);
  4310. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4311. END;
  4312. END;
  4313. (*******)
  4314. dimOp := IntermediateCode.Immediate(addressType,dim);
  4315. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4316. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4317. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4318. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4319. baseType := SemanticChecker.ArrayBase(type,dim);
  4320. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4321. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4322. ELSE HALT(100);
  4323. END;
  4324. (* case 2
  4325. procedure P([left args], var A: array [*,*] of Type, [right args])
  4326. *)
  4327. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4328. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4329. (* case 2b
  4330. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4331. push: push reference to pushed array descriptor
  4332. post: remove array descriptor.
  4333. *)
  4334. IF expression IS SyntaxTree.IndexDesignator THEN
  4335. descriptorType := GetMathArrayDescriptorType(dim);
  4336. (* range type : no allocation possible, should be untraced *)
  4337. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4338. Symbol(variable,variableOp);
  4339. arrayDestinationTag := variableOp.op;
  4340. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4341. arrayDestinationDimension := dim;
  4342. NeedDescriptor := TRUE;
  4343. Designate(expression,operand);
  4344. Pass((operand.tag));
  4345. NeedDescriptor := FALSE;
  4346. (* case 2a
  4347. P(...,A,...)
  4348. push: push reference to array descriptor on stack
  4349. *)
  4350. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4351. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4352. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4353. INC(i);
  4354. END;
  4355. IF i = dim THEN
  4356. Designate(expression,operand);
  4357. Pass((operand.tag));
  4358. ELSE (* open-static *)
  4359. type := expression.type.resolved;
  4360. descriptorType := GetMathArrayDescriptorType(dim);
  4361. (* static array , cannot be reallocated, untraced !*)
  4362. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4363. Symbol(variable,variableOp);
  4364. arrayDestinationTag := variableOp.op;
  4365. Designate(expression,operand);
  4366. FOR i := 0 TO dim-1 DO
  4367. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4368. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4369. ReleaseOperand(tmpOperand);
  4370. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4371. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4372. ReleaseOperand(tmpOperand);
  4373. END;
  4374. dimOp := IntermediateCode.Immediate(addressType,dim);
  4375. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4376. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4377. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4378. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4379. baseType := SemanticChecker.ArrayBase(type,dim);
  4380. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4381. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4382. Pass((arrayDestinationTag));
  4383. END;
  4384. (* case 2d
  4385. P(...,T,...) push: emit dimension check, push T
  4386. *)
  4387. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4388. Designate(expression,operand);
  4389. Dereference(operand,type.resolved,FALSE);
  4390. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4391. Pass((operand.tag));
  4392. (* case 2f
  4393. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4394. push: push reference to pushed array descriptor
  4395. post: remove array descriptor
  4396. *)
  4397. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4398. descriptorType := GetMathArrayDescriptorType(dim);
  4399. (* static array -- cannot be reallocatated, untraced *)
  4400. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4401. Symbol(variable,variableOp);
  4402. arrayDestinationTag := variableOp.op;
  4403. Designate(expression,operand);
  4404. FOR i := 0 TO dim-1 DO
  4405. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4406. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4407. ReleaseOperand(tmpOperand);
  4408. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4409. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4410. ReleaseOperand(tmpOperand);
  4411. END;
  4412. (*
  4413. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4414. *)
  4415. arrayFlags := {StaticFlag};
  4416. IF dim = 1 THEN
  4417. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4418. ReleaseOperand(tmpOperand);
  4419. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4420. m := LONGINT(tmpOperand.op.intValue);
  4421. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4422. ELSIF dim = 2 THEN
  4423. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4424. ReleaseOperand(tmpOperand);
  4425. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4426. m := LONGINT(tmpOperand.op.intValue);
  4427. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4428. ReleaseOperand(tmpOperand);
  4429. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4430. n := LONGINT(tmpOperand.op.intValue);
  4431. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4432. INCL(arrayFlags,SmallMatrixFlag);
  4433. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4434. END;
  4435. END;
  4436. (*******)
  4437. dimOp := IntermediateCode.Immediate(addressType,dim);
  4438. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4439. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4440. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4441. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4442. baseType := SemanticChecker.ArrayBase(type,dim);
  4443. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4444. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4445. Pass((arrayDestinationTag));
  4446. ELSE HALT(100);
  4447. END;
  4448. (* case 3
  4449. procedure P([left args], [const] A: array [?] of Type, [right args])
  4450. *)
  4451. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4452. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4453. (* case 3b
  4454. P(...,A[a..b,c..d],...)
  4455. *)
  4456. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4457. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4458. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4459. Symbol(variable,variableOp);
  4460. LoadValue(variableOp,system.addressType);
  4461. ELSE
  4462. descriptorType := GetMathArrayDescriptorType(dim);
  4463. (* range -- cannot be reallocated *)
  4464. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4465. Symbol(variable,variableOp);
  4466. END;
  4467. arrayDestinationTag := variableOp.op;
  4468. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4469. arrayDestinationDimension := 0;
  4470. Designate(expression,operand);
  4471. Pass((operand.tag));
  4472. (* case 3a
  4473. P(...,A,...)
  4474. *)
  4475. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4476. i := 0;
  4477. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4478. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4479. INC(i);
  4480. END;
  4481. IF i = dim THEN
  4482. Designate(expression,operand);
  4483. Pass((operand.tag));
  4484. ELSE (* open-static *)
  4485. type := expression.type.resolved;
  4486. descriptorType := GetMathArrayDescriptorType(dim);
  4487. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4488. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4489. Symbol(variable,variableOp);
  4490. arrayDestinationTag := variableOp.op;
  4491. Designate(expression,operand);
  4492. FOR i := 0 TO dim-1 DO
  4493. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4494. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4495. ReleaseOperand(tmpOperand);
  4496. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4497. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4498. ReleaseOperand(tmpOperand);
  4499. END;
  4500. dimOp := IntermediateCode.Immediate(addressType,dim);
  4501. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4502. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4503. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4504. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4505. baseType := SemanticChecker.ArrayBase(type,dim);
  4506. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4507. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4508. Pass((arrayDestinationTag));
  4509. END;
  4510. (* case 3d
  4511. P(...,T,...)
  4512. case 3e
  4513. P(...,PT(...),...)
  4514. *)
  4515. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4516. Designate(expression,operand);
  4517. Dereference(operand,type.resolved,FALSE);
  4518. Pass((operand.tag));
  4519. (* case 3f
  4520. P(...,S,...)
  4521. case 3g
  4522. P(...,PS(...),...)
  4523. *)
  4524. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4525. descriptorType := GetMathArrayDescriptorType(dim);
  4526. (* static array does not need to be traced *)
  4527. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4528. Symbol(variable,variableOp);
  4529. arrayDestinationTag := variableOp.op;
  4530. Designate(expression,operand);
  4531. IF operand.op.type.length >1 THEN (* vector register *)
  4532. (* static array does not need to be traced *)
  4533. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4534. Symbol(variable2, variable2Op);
  4535. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4536. Emit(Mov(position,tmp, operand.op));
  4537. ReleaseOperand(operand);
  4538. Symbol(variable2, operand);
  4539. END;
  4540. FOR i := 0 TO dim-1 DO
  4541. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4542. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4543. ReleaseOperand(tmpOperand);
  4544. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4545. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4546. ReleaseOperand(tmpOperand);
  4547. END;
  4548. dimOp := IntermediateCode.Immediate(addressType,dim);
  4549. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4550. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4551. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4552. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4553. baseType := SemanticChecker.ArrayBase(type,dim);
  4554. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4555. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4556. Pass((arrayDestinationTag));
  4557. ELSE HALT(100);
  4558. END;
  4559. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4560. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4561. (* case 4b
  4562. P(...,A[a..b,c..d],...)
  4563. *)
  4564. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4565. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4566. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4567. Symbol(variable,variableOp);
  4568. LoadValue(variableOp,system.addressType);
  4569. ELSE
  4570. descriptorType := GetMathArrayDescriptorType(dim);
  4571. (* range array -- cannot be allocated *)
  4572. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4573. Symbol(variable,variableOp);
  4574. END;
  4575. arrayDestinationTag := variableOp.op;
  4576. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4577. arrayDestinationDimension := 0;
  4578. Designate(expression,operand);
  4579. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4580. Symbol(variable,variableOp);
  4581. ELSE
  4582. (* alias to range -- untraced *)
  4583. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4584. Symbol(variable,variableOp);
  4585. MakeMemory(tmp,variableOp.op,addressType,0);
  4586. Emit(Mov(position,tmp,operand.tag));
  4587. ReleaseIntermediateOperand(tmp);
  4588. END;
  4589. Pass((variableOp.op));
  4590. ReleaseOperand(variableOp);
  4591. (* case 4a
  4592. P(...,A,...)
  4593. *)
  4594. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4595. i := 0;
  4596. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4597. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4598. INC(i);
  4599. END;
  4600. IF i = dim THEN
  4601. Designate(expression,operand);
  4602. arrayDestinationTag := operand.tag;
  4603. ELSE (* open-static *)
  4604. type := expression.type.resolved;
  4605. descriptorType := GetMathArrayDescriptorType(dim);
  4606. (* static array -- untraced *)
  4607. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4608. Symbol(variable,variableOp);
  4609. arrayDestinationTag := variableOp.op;
  4610. Designate(expression,operand);
  4611. FOR i := 0 TO dim-1 DO
  4612. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4613. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4614. ReleaseOperand(tmpOperand);
  4615. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4616. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4617. ReleaseOperand(tmpOperand);
  4618. END;
  4619. dimOp := IntermediateCode.Immediate(addressType,dim);
  4620. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4621. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4622. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4623. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4624. baseType := SemanticChecker.ArrayBase(type,dim);
  4625. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4626. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4627. END;
  4628. (* tensor alias to open array -- untraced *)
  4629. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4630. Symbol(variable,variableOp);
  4631. MakeMemory(tmp,variableOp.op,addressType,0);
  4632. Emit(Mov(position,tmp,arrayDestinationTag));
  4633. ReleaseIntermediateOperand(tmp);
  4634. Pass((variableOp.op));
  4635. ReleaseOperand(variableOp);
  4636. (* case 4d
  4637. P(...,T,...)
  4638. *)
  4639. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4640. Designate(expression,operand);
  4641. Pass((operand.op));
  4642. (* case 4f
  4643. P(...,S,...)
  4644. *)
  4645. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4646. descriptorType := GetMathArrayDescriptorType(dim);
  4647. (* static array -- cannot be reallocated, untraced *)
  4648. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4649. Symbol(variable,variableOp);
  4650. arrayDestinationTag := variableOp.op;
  4651. Designate(expression,operand);
  4652. FOR i := 0 TO dim-1 DO
  4653. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4654. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4655. ReleaseOperand(tmpOperand);
  4656. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4657. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4658. ReleaseOperand(tmpOperand);
  4659. END;
  4660. dimOp := IntermediateCode.Immediate(addressType,dim);
  4661. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4662. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4663. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4664. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4665. baseType := SemanticChecker.ArrayBase(type,dim);
  4666. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4667. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4668. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4669. Symbol(variable,variableOp);
  4670. MakeMemory(tmp,variableOp.op,addressType,0);
  4671. Emit(Mov(position,tmp,arrayDestinationTag));
  4672. ReleaseIntermediateOperand(tmp);
  4673. Pass((variableOp.op));
  4674. ReleaseOperand(variableOp);
  4675. ELSE HALT(100);
  4676. END;
  4677. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4678. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4679. Designate(expression,operand);
  4680. IF operand.op.type.length > 1 THEN
  4681. Emit(Push(position, operand.op));
  4682. ELSE
  4683. size := system.SizeOf(type);
  4684. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4685. size := ToMemoryUnits(system,size);
  4686. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4687. arrayDestinationTag := sp;
  4688. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4689. END;
  4690. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4691. Designate(expression,operand);
  4692. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4693. (* static array no pointer *)
  4694. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4695. Symbol(variable,variableOp);
  4696. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4697. Emit(Mov(position,tmp,operand.op));
  4698. Emit(Push(position,variableOp.op));
  4699. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4700. Pass((operand.op));
  4701. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4702. END;
  4703. ELSE HALT(200)
  4704. END;
  4705. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4706. IF parameter.kind = SyntaxTree.VarParameter THEN
  4707. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4708. Designate(expression, operand);
  4709. Pass((operand.op));
  4710. ELSE
  4711. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4712. Evaluate(expression, operand);
  4713. Pass((operand.extra)); (* step *)
  4714. Pass((operand.tag)); (* last *)
  4715. Pass((operand.op)) (* first *)
  4716. END
  4717. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4718. IF parameter.kind = SyntaxTree.VarParameter THEN
  4719. Designate(expression, operand);
  4720. Pass((operand.op));
  4721. ELSE
  4722. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4723. Evaluate(expression, operand);
  4724. Pass((operand.tag)); (* real part *)
  4725. Pass((operand.op)) (* imaginary part *)
  4726. END
  4727. ELSE
  4728. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4729. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4730. Designate(expression,operand);
  4731. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4732. (* stack allocation *)
  4733. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4734. (*! parameter alignment to be discussed ... *)
  4735. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4736. size := type(SyntaxTree.StringType).length;
  4737. END;
  4738. IF backend.cooperative & parameter.NeedsTrace() THEN
  4739. dst := NewRegisterOperand (addressType);
  4740. Emit(Mov(position,dst, sp));
  4741. IntermediateCode.InitImmediate(null, byteType, 0);
  4742. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4743. ReleaseIntermediateOperand(dst);
  4744. SaveRegisters();ReleaseUsedRegisters(saved);
  4745. (* register dst has been freed before SaveRegisters already *)
  4746. CallAssignMethod(dst, operand.op, parameter.type);
  4747. RestoreRegisters(saved);
  4748. END;
  4749. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4750. ELSIF IsOpenArray(parameter.type) THEN
  4751. Designate(expression,operand);
  4752. baseReg := operand.tag;
  4753. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4754. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4755. END;
  4756. Pass((operand.op)); (* address of the array *)
  4757. ELSIF IsDelegate(parameter.type) THEN
  4758. Evaluate(expression,operand);
  4759. IF backend.cooperative & parameter.NeedsTrace() THEN
  4760. Emit(Push(position, nil));
  4761. dst := NewRegisterOperand (addressType);
  4762. Emit(Mov(position,dst, sp));
  4763. ReleaseIntermediateOperand(dst);
  4764. SaveRegisters();ReleaseUsedRegisters(saved);
  4765. Emit(Push(position, dst));
  4766. (* register dst has been freed before SaveRegisters already *)
  4767. Emit(Push(position, operand.tag));
  4768. CallThis(position,"GarbageCollector","Assign",2);
  4769. RestoreRegisters(saved);
  4770. ELSE
  4771. Pass((operand.tag));
  4772. END;
  4773. Pass((operand.op));
  4774. ELSE
  4775. Evaluate(expression,operand);
  4776. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4777. Emit(Push(position, nil));
  4778. dst := NewRegisterOperand (addressType);
  4779. Emit(Mov(position,dst, sp));
  4780. ReleaseIntermediateOperand(dst);
  4781. SaveRegisters();ReleaseUsedRegisters(saved);
  4782. Emit(Push(position, dst));
  4783. (* register dst has been freed before SaveRegisters already *)
  4784. Emit(Push(position, operand.op));
  4785. CallThis(position,"GarbageCollector","Assign",2);
  4786. RestoreRegisters(saved);
  4787. ELSE
  4788. Pass((operand.op));
  4789. END;
  4790. END;
  4791. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4792. Evaluate(expression,operand);
  4793. Pass((operand.op));
  4794. ELSE (* var parameter *)
  4795. Designate(expression,operand);
  4796. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4797. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4798. Pass((operand.tag));
  4799. END;
  4800. END;
  4801. Pass((operand.op));
  4802. END;
  4803. END;
  4804. (* TODO: needed? *)
  4805. arrayDestinationTag := oldArrayDestinationTag;
  4806. arrayDestinationDimension := oldArrayDestinationDimension;
  4807. IF needsParameterBackup THEN
  4808. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4809. ReuseCopy(parameterBackup, operand.op)
  4810. END;
  4811. ReleaseOperand(operand);
  4812. IF Trace THEN TraceExit("PushParameter") END;
  4813. END PushParameter;
  4814. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4815. VAR prevConditional: BOOLEAN;
  4816. BEGIN
  4817. prevConditional := conditional;
  4818. conditional := FALSE;
  4819. 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
  4820. Expression(x.result); (* use register *)
  4821. END;
  4822. Statement(x.statement);
  4823. conditional := prevConditional;
  4824. IF x.result # NIL THEN Expression(x.result) END;
  4825. 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
  4826. ReleaseIntermediateOperand(result.op);
  4827. END;
  4828. END VisitStatementDesignator;
  4829. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4830. VAR
  4831. procedure: SyntaxTree.Procedure;
  4832. procedureType: SyntaxTree.ProcedureType;
  4833. wasInline: BOOLEAN;
  4834. actualParameters: SyntaxTree.ExpressionList;
  4835. formalParameter: SyntaxTree.Parameter;
  4836. actualParameter: SyntaxTree.Expression;
  4837. i: LONGINT;
  4838. localVariable: SyntaxTree.Variable;
  4839. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4840. src, dest: Operand;
  4841. prevInlineExit : Label;
  4842. prevMapper: SymbolMapper;
  4843. tooComplex: BOOLEAN;
  4844. resultDesignator: SyntaxTree.Expression;
  4845. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4846. BEGIN
  4847. IF e = NIL THEN RETURN TRUE
  4848. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4849. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4850. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4851. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4852. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4853. ELSE RETURN FALSE
  4854. END;
  4855. END SimpleExpression;
  4856. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4857. BEGIN
  4858. RETURN checker.CanPassInRegister(type)
  4859. END FitsInRegister;
  4860. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4861. VAR
  4862. variable: SyntaxTree.Variable;
  4863. variableDesignator: SyntaxTree.Designator;
  4864. BEGIN
  4865. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  4866. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  4867. variableDesignator.SetType(type);
  4868. RETURN variableDesignator
  4869. END GetTemp;
  4870. BEGIN
  4871. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4872. wasInline := currentIsInline;
  4873. prevInlineExit := currentInlineExit;
  4874. prevMapper := currentMapper;
  4875. currentInlineExit := NewLabel();
  4876. tooComplex := FALSE;
  4877. NEW(currentMapper);
  4878. currentIsInline := TRUE;
  4879. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4880. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4881. formalParameter := procedureType.firstParameter;
  4882. actualParameters := x.parameters;
  4883. i := 0;
  4884. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4885. actualParameter := actualParameters.GetExpression(i);
  4886. IF actualParameter.resolved # NIL THEN
  4887. actualParameter := actualParameter.resolved
  4888. END;
  4889. (*
  4890. if expression is simple and can be passed immediately
  4891. or if type fits in register then we can proceed
  4892. otherwise we escape to ordinary procedure call.
  4893. *)
  4894. (* cases where the expression can be mapped identically *)
  4895. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4896. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  4897. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4898. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4899. (*
  4900. Assign(variableDesignator, actualParameter);
  4901. *)
  4902. Evaluate(actualParameter, src);
  4903. Designate(variableDesignator, dest);
  4904. Emit(Mov(x.position, dest.op, src.op));
  4905. ReleaseOperand(dest);
  4906. ReleaseOperand(src);
  4907. (* the src operand should now have been completely released ! *)
  4908. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  4909. ELSE tooComplex := TRUE
  4910. END;
  4911. (*
  4912. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4913. currentMapper.Add(formalParameter, actualParameter, NIL);
  4914. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4915. variableDesignator := GetTemp(system.addressType, FALSE);
  4916. Designate(actualParameter, src);
  4917. Designate(variableDesignator, dest);
  4918. IntermediateCode.MakeMemory(dest.op,addressType);
  4919. Emit(Mov(x.position, dest.op, src.op));
  4920. ReleaseOperand(dest);
  4921. IF src.tag.mode # IntermediateCode.Undefined THEN
  4922. tagDesignator := GetTemp(system.addressType, FALSE);
  4923. Designate(tagDesignator, dest);
  4924. IntermediateCode.MakeMemory(dest.op,addressType);
  4925. Emit(Mov(x.position, dest.op, src.op));
  4926. END;
  4927. ReleaseOperand(dest); ReleaseOperand(src);
  4928. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4929. END;
  4930. *)
  4931. formalParameter := formalParameter.nextParameter;
  4932. INC(i);
  4933. END;
  4934. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4935. IF resultDesignator # NIL THEN
  4936. returnDesignator := resultDesignator
  4937. ELSE
  4938. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4939. END;
  4940. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  4941. END;
  4942. localVariable := procedure.procedureScope.firstVariable;
  4943. WHILE ~tooComplex & (localVariable # NIL) DO
  4944. variableDesignator := GetTemp(localVariable.type, FALSE);
  4945. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  4946. localVariable := localVariable.nextVariable;
  4947. END;
  4948. IF ~tooComplex THEN
  4949. VisitStatementBlock(procedure.procedureScope.body);
  4950. SetLabel(currentInlineExit);
  4951. IF procedureType.returnType # NIL THEN
  4952. Designate(returnDesignator, result);
  4953. IF conditional THEN
  4954. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4955. ValueToCondition(result)
  4956. END;
  4957. END;
  4958. END;
  4959. currentMapper := prevMapper;
  4960. currentInlineExit := prevInlineExit;
  4961. currentIsInline := wasInline;
  4962. RETURN ~tooComplex
  4963. END InlineProcedureCall;
  4964. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4965. VAR
  4966. parameters: SyntaxTree.ExpressionList;
  4967. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4968. designator: SyntaxTree.Designator;
  4969. procedureType: SyntaxTree.ProcedureType;
  4970. formalParameter: SyntaxTree.Parameter;
  4971. operand, returnValue: Operand;
  4972. reg, size, mask, dest: IntermediateCode.Operand;
  4973. saved,saved2: RegisterEntry;
  4974. symbol: SyntaxTree.Symbol;
  4975. variable: SyntaxTree.Variable;
  4976. i, parametersSize, returnTypeSize : LONGINT;
  4977. structuredReturnType: BOOLEAN;
  4978. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4979. tempVariableDesignator: SyntaxTree.Designator;
  4980. gap, alignment: LONGINT; (*fld*)
  4981. (* TODO: remove unnecessary backup variables *)
  4982. oldResult: Operand;
  4983. oldCurrentScope: SyntaxTree.Scope;
  4984. oldArrayDestinationTag: IntermediateCode.Operand;
  4985. oldArrayDestinationDimension: LONGINT;
  4986. oldConstantDeclaration: SyntaxTree.Symbol;
  4987. oldDestination: IntermediateCode.Operand;
  4988. oldCurrentLoop: Label;
  4989. oldConditional: BOOLEAN;
  4990. oldTrueLabel, oldFalseLabel: Label;
  4991. oldLocked: BOOLEAN;
  4992. usedRegisters,oldUsedRegisters: RegisterEntry;
  4993. return: IntermediateCode.Operand;
  4994. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  4995. arg: IntermediateCode.Operand;
  4996. dummy: IntermediateCode.Operand;
  4997. recordType: SyntaxTree.RecordType;
  4998. operatorSelectionProcedureOperand: Operand;
  4999. operatorSelectionProcedure: SyntaxTree.Procedure;
  5000. fingerPrint: SyntaxTree.FingerPrint;
  5001. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5002. identifierNumber: LONGINT;
  5003. parameterRegister: Backend.Registers;
  5004. parameterRegisters: LONGINT;
  5005. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  5006. procedure: SyntaxTree.Procedure;
  5007. PROCEDURE BackupGlobalState;
  5008. BEGIN
  5009. oldResult := result;
  5010. oldCurrentScope := currentScope;
  5011. oldArrayDestinationTag := arrayDestinationTag;
  5012. oldArrayDestinationDimension := arrayDestinationDimension;
  5013. oldConstantDeclaration := constantDeclaration;
  5014. oldDestination := destination;
  5015. oldCurrentLoop := currentLoop;
  5016. oldConditional := conditional;
  5017. oldTrueLabel := trueLabel;
  5018. oldFalseLabel := falseLabel;
  5019. oldLocked := locked;
  5020. oldUsedRegisters := usedRegisters
  5021. END BackupGlobalState;
  5022. PROCEDURE RestoreGlobalState;
  5023. BEGIN
  5024. result := oldResult;
  5025. currentScope := oldCurrentScope;
  5026. arrayDestinationTag := oldArrayDestinationTag;
  5027. arrayDestinationDimension := oldArrayDestinationDimension;
  5028. constantDeclaration := oldConstantDeclaration;
  5029. destination := oldDestination;
  5030. currentLoop := oldCurrentLoop;
  5031. conditional := oldConditional;
  5032. trueLabel := oldTrueLabel;
  5033. falseLabel := oldFalseLabel;
  5034. locked := oldLocked;
  5035. usedRegisters := oldUsedRegisters
  5036. END RestoreGlobalState;
  5037. (** do preparations before parameter push for array-structured object types (ASOTs):
  5038. if ASOT is passed as VAR parameter:
  5039. - allocate temporary variable of math array type
  5040. - copy contents of ASOT to be passed to temporary variable
  5041. - use temporary variable as the actual parameter instead
  5042. - 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)
  5043. **)
  5044. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5045. VAR
  5046. expression: SyntaxTree.Expression;
  5047. BEGIN
  5048. IF actualParameter IS SyntaxTree.Designator THEN
  5049. designator := actualParameter(SyntaxTree.Designator);
  5050. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5051. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5052. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5053. ASSERT(checker # NIL);
  5054. checker.SetCurrentScope(currentScope);
  5055. (* allocate temporary variable *)
  5056. ASSERT(actualParameter.type # NIL);
  5057. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5058. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5059. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5060. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5061. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5062. ASSERT(tempVariableDesignator.type # NIL);
  5063. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5064. (* copy math array stored in actual parameter to temporary variable *)
  5065. BackupGlobalState;
  5066. AssignMathArray(tempVariableDesignator, actualParameter);
  5067. RestoreGlobalState;
  5068. (* use temporary variable as actual parameter instead of the original one *)
  5069. actualParameter := tempVariableDesignator;
  5070. (* create write-back call and store it in linked list *)
  5071. (* create new list entry *)
  5072. IF firstWriteBackCall = NIL THEN
  5073. NEW(firstWriteBackCall);
  5074. currentWriteBackCall := firstWriteBackCall
  5075. ELSE
  5076. ASSERT(currentWriteBackCall # NIL);
  5077. NEW(currentWriteBackCall.next);
  5078. currentWriteBackCall := currentWriteBackCall.next
  5079. END;
  5080. expression := checker.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5081. ASSERT(expression.type = NIL);
  5082. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5083. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5084. (* prepare writeback for any other "normal" indexer *)
  5085. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5086. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5087. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5088. Assign(tempVariableDesignator, actualParameter);
  5089. actualParameter := tempVariableDesignator;
  5090. IF firstWriteBackCall = NIL THEN
  5091. NEW(firstWriteBackCall);
  5092. currentWriteBackCall := firstWriteBackCall
  5093. ELSE
  5094. ASSERT(currentWriteBackCall # NIL);
  5095. NEW(currentWriteBackCall.next);
  5096. currentWriteBackCall := currentWriteBackCall.next
  5097. END;
  5098. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5099. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5100. END
  5101. END
  5102. END PrepareParameter;
  5103. BEGIN
  5104. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5105. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5106. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5107. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5108. IF InlineProcedureCall(x) THEN
  5109. RETURN
  5110. ELSE
  5111. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5112. END
  5113. END;
  5114. END;
  5115. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5116. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5117. dest := destination; destination := emptyOperand;
  5118. SaveRegisters();ReleaseUsedRegisters(saved);
  5119. parameters := x.parameters;
  5120. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5121. (* an operator is called *)
  5122. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5123. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  5124. (* check if a dynamic operator call should be performed *)
  5125. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5126. ELSE
  5127. isCallOfDynamicOperator := FALSE
  5128. END;
  5129. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5130. Emit(Push(position, ap));
  5131. END;
  5132. alignment := procedureType.stackAlignment;
  5133. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize = 64) THEN
  5134. alignment := 16 (* bytes *);
  5135. END;
  5136. IF alignment > 1 THEN
  5137. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5138. Emit(Mov(position,reg, sp));
  5139. gap := ParametersSize(system, procedureType, FALSE);
  5140. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5141. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN
  5142. gap := 4*ToMemoryUnits(system,system.addressSize); (* at least four registers get pushed*)
  5143. END;
  5144. END;
  5145. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  5146. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5147. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5148. Emit(And(position,sp, sp, mask));
  5149. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5150. Emit(Push(position,reg));
  5151. (*
  5152. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  5153. Emit(Mov(position,mem,reg));
  5154. *)
  5155. ReleaseIntermediateOperand(reg);
  5156. END;
  5157. IF SysvABI(procedureType.callingConvention) & (system.addressSize = 32) THEN
  5158. (* align stack to 16-byte boundary *)
  5159. IntermediateCode.InitImmediate(mask,addressType,-16);
  5160. Emit(And(position,sp, sp, mask));
  5161. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5162. IF gap # 0 THEN
  5163. IntermediateCode.InitImmediate(size,addressType,gap);
  5164. Emit(Sub(position,sp,sp,size))
  5165. END;
  5166. END;
  5167. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5168. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5169. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5170. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5171. ELSE
  5172. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5173. END;
  5174. Evaluate(x.left, operand);
  5175. IF symbol IS SyntaxTree.Procedure THEN
  5176. IF (procedureType.selfParameter # NIL) THEN
  5177. Emit(Push(position,operand.tag));
  5178. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5179. Emit(Push(position,operand.tag));
  5180. ELSIF (procedureType.isDelegate) THEN
  5181. Emit(Push(position,operand.tag));
  5182. END;
  5183. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5184. IF (procedureType.selfParameter # NIL) THEN
  5185. Emit(Push(position,operand.tag));
  5186. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5187. Emit(Push(position,operand.tag));
  5188. END;
  5189. ELSE HALT(200);
  5190. END;
  5191. ReleaseIntermediateOperand(operand.tag);
  5192. operand.tag := emptyOperand;
  5193. (* determine if a structured return type is needed *)
  5194. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5195. IF structuredReturnType THEN
  5196. IF resultDesignator # NIL THEN
  5197. d := resultDesignator;
  5198. ELSE
  5199. (* temporary result that might be allocated, must potentially be traced *)
  5200. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5201. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5202. d.SetType(variable.type);
  5203. END;
  5204. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5205. Designate(d,returnValue);
  5206. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5207. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5208. Emit(Push(position,size));
  5209. Emit(Push(position,returnValue.op));
  5210. ReleaseOperand(returnValue);
  5211. ELSE*)
  5212. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  5213. (*
  5214. END;
  5215. *)
  5216. END;
  5217. firstWriteBackCall := NIL; (* reset write-back call list *)
  5218. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  5219. parameterRegister := backend.GetParameterRegisters(procedureType.callingConvention);
  5220. IF parameterRegister = NIL THEN parameterRegisters := 0
  5221. ELSE parameterRegisters := LEN(parameterRegister)
  5222. END;
  5223. passByRegister := parameterRegisters > 0;
  5224. registerNumber := 0;
  5225. formalParameter := procedureType.lastParameter;
  5226. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5227. actualParameter := parameters.GetExpression(i);
  5228. PrepareParameter(actualParameter, formalParameter);
  5229. IF passByRegister & (i < parameterRegisters) THEN
  5230. IF ~PassInRegister(formalParameter) THEN
  5231. Error(actualParameter.position,"cannot be passed by register")
  5232. ELSE
  5233. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,parameterRegister[i]);
  5234. END;
  5235. INC(registerNumber);
  5236. ELSE
  5237. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5238. END;
  5239. formalParameter := formalParameter.prevParameter;
  5240. END;
  5241. IF passByRegister (* & (registerNumber > 0)*) & ~SysvABI(procedureType.callingConvention) THEN
  5242. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5243. stackSize := ToMemoryUnits(system,parameterRegisters*addressType.sizeInBits);
  5244. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5245. END;
  5246. ELSE
  5247. hasDynamicOperands := FALSE;
  5248. formalParameter := procedureType.firstParameter;
  5249. FOR i := 0 TO parameters.Length() - 1 DO
  5250. actualParameter := parameters.GetExpression(i);
  5251. IF formalParameter # NIL THEN (* TENTATIVE *)
  5252. PrepareParameter(actualParameter, formalParameter);
  5253. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5254. ASSERT(i < 2);
  5255. hasDynamicOperands := TRUE;
  5256. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  5257. ELSE
  5258. IF passByRegister & (registerNumber > 0) THEN
  5259. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5260. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5261. END;
  5262. passByRegister := FALSE;
  5263. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5264. END;
  5265. formalParameter := formalParameter.nextParameter;
  5266. END;
  5267. END;
  5268. END;
  5269. IF symbol IS SyntaxTree.Procedure THEN
  5270. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5271. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5272. Emit(Push(position,reg));
  5273. ReleaseIntermediateOperand(reg);
  5274. END;
  5275. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5276. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5277. parametersSize := ParametersSize(system,procedureType,FALSE);
  5278. END;
  5279. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5280. (*
  5281. dynamic operator overloading:
  5282. first push parameters, regularly:
  5283. [self]
  5284. par1
  5285. par2
  5286. then push parameters for GetOperator
  5287. identifier
  5288. ptr1
  5289. tag
  5290. ptr2
  5291. tag
  5292. call GetOperatorRuntimeProc
  5293. call Operator
  5294. *)
  5295. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5296. (* push ID *)
  5297. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5298. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5299. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5300. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5301. formalParameter := procedureType.firstParameter;
  5302. FOR i := 0 TO parameters.Length() - 1 DO
  5303. IF formalParameter.access # SyntaxTree.Hidden THEN
  5304. ASSERT(i < 2);
  5305. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5306. (* push pointer *)
  5307. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5308. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5309. (* add dereference *)
  5310. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5311. (*! better: do refer to stack above than using parameter backups !!*)
  5312. ReleaseIntermediateOperand(parameterBackups[i]);
  5313. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5314. END;
  5315. Emit(Push(position,parameterBackups[i]));
  5316. ReleaseIntermediateOperand(parameterBackups[i]);
  5317. (* push typetag *)
  5318. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5319. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5320. arg := TypeDescriptorAdr(recordType);
  5321. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5322. Emit(Push(position,arg));
  5323. ELSE
  5324. (* push 'NonPointer' *)
  5325. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5326. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5327. (* push fingerprint *)
  5328. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5329. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5330. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5331. END
  5332. END;
  5333. formalParameter := formalParameter.nextParameter
  5334. END;
  5335. (* for unary operators: complete the information for the second parameter *)
  5336. IF procedureType.numberParameters < 2 THEN
  5337. (* push 'NonPointer' *)
  5338. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5339. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5340. (* push 'NoType' *)
  5341. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5342. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5343. END;
  5344. (* call operator selection procedure *)
  5345. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5346. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5347. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  5348. ReleaseOperand(operatorSelectionProcedureOperand);
  5349. (* use the address that the operator selection procedure returned as the target address of the call *)
  5350. InitOperand(operand, ModeValue);
  5351. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5352. Emit(Result(position,operand.op))
  5353. END
  5354. END;
  5355. ReleaseParameterRegisters();
  5356. IF backend.trackLeave & ~isUnchecked & (procedureType.callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5357. SaveRegisters();ReleaseUsedRegisters(saved2);
  5358. CallThis(position,"Objects","LeaveA2",0);
  5359. RestoreRegisters(saved2);
  5360. END;
  5361. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR SysvABI(procedureType.callingConvention) THEN
  5362. Emit(Call(position,operand.op,0));
  5363. ELSE
  5364. Emit(Call(position,operand.op,parametersSize));
  5365. END;
  5366. ReleaseOperand(operand);
  5367. IF procedureType.noReturn THEN
  5368. EmitTrap(position,NoReturnTrap);
  5369. END;
  5370. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5371. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5372. Emit(Result(position,return));
  5373. END;
  5374. IF backend.trackLeave & ~isUnchecked & (procedureType.callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5375. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5376. Emit(Push(position, return));
  5377. CallThis(position,"Objects","ReenterA2",0);
  5378. Emit(Pop(position, return));
  5379. ELSE
  5380. CallThis(position,"Objects","ReenterA2",0);
  5381. END;
  5382. END;
  5383. (* === return parameter space === *)
  5384. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & passByRegister (* & (registerNumber > 0) *) THEN
  5385. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5386. (* cleanup all space for all parameters *)
  5387. IF parametersSize < 32 THEN
  5388. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5389. parametersSize := 32
  5390. END;
  5391. size := IntermediateCode.Immediate(addressType,parametersSize);
  5392. Emit(Add(position,sp,sp,size))
  5393. END;
  5394. IF SysvABI(procedureType.callingConvention) THEN
  5395. IF passByRegister THEN
  5396. IF parameters.Length() > parameterRegisters THEN
  5397. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5398. ELSE
  5399. parametersSize := 0
  5400. END;
  5401. ELSE
  5402. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5403. INC( parametersSize, (-parametersSize) MOD 16 )
  5404. END;
  5405. IF parametersSize > 0 THEN
  5406. size := IntermediateCode.Immediate(addressType,parametersSize);
  5407. Emit(Add(position,sp,sp,size))
  5408. END;
  5409. END;
  5410. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5411. IF structuredReturnType THEN
  5412. (* stack pointer rewinding done by callee
  5413. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5414. Emit(Add(position,sp,sp,size));
  5415. *)
  5416. RestoreRegisters(saved);
  5417. InitOperand(result,ModeReference);
  5418. Symbol(variable,result);
  5419. ELSE
  5420. RestoreRegisters(saved);
  5421. InitOperand(result,ModeValue);
  5422. result.op := return;
  5423. END;
  5424. END;
  5425. IF alignment > 1 THEN
  5426. Emit(Pop(position,sp));
  5427. END;
  5428. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5429. Emit(Pop(position, ap));
  5430. END;
  5431. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5432. ValueToCondition(result);
  5433. END;
  5434. destination := dest;
  5435. (* perform all write-back calls in the list *)
  5436. BackupGlobalState;
  5437. currentWriteBackCall := firstWriteBackCall;
  5438. WHILE currentWriteBackCall # NIL DO
  5439. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5440. currentWriteBackCall := currentWriteBackCall.next
  5441. END;
  5442. RestoreGlobalState;
  5443. (* TENATIVE *)
  5444. (*
  5445. IF isOperatorCall THEN
  5446. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5447. END;
  5448. *)
  5449. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5450. END VisitProcedureCallDesignator;
  5451. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5452. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5453. td: SyntaxTree.Symbol;
  5454. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5455. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5456. BEGIN
  5457. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5458. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5459. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5460. variable.SetType(system.anyType);
  5461. scope.AddVariable(variable);
  5462. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5463. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5464. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5465. typeDeclaration.SetScope(module.module.moduleScope);
  5466. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5467. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5468. END;
  5469. RETURN hiddenPointerType;
  5470. END GetHiddenPointerType;
  5471. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5472. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5473. BEGIN
  5474. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5475. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5476. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5477. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5478. scope.AddVariable(variable);
  5479. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5480. variable.SetType(system.anyType);
  5481. scope.AddVariable(variable);
  5482. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5483. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5484. typeDeclaration.SetDeclaredType(delegatePointerType);
  5485. typeDeclaration.SetScope(module.module.moduleScope);
  5486. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5487. delegatePointerType.SetState(SyntaxTree.Resolved);
  5488. END;
  5489. RETURN delegatePointerType
  5490. END GetDelegateType;
  5491. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5492. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5493. such as in VAR a: RECORD ... END;
  5494. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5495. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5496. *)
  5497. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5498. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5499. BEGIN (* no code emission *)
  5500. source := NIL;
  5501. x := x.resolved;
  5502. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5503. x := GetHiddenPointerType();
  5504. ELSIF IsDelegate(x) THEN
  5505. x := GetDelegateType();
  5506. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5507. ELSE HALT(200);
  5508. END;
  5509. td := x.typeDeclaration;
  5510. IF td = NIL THEN
  5511. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5512. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5513. ASSERT(td # NIL);
  5514. END;
  5515. IF newObjectFile THEN
  5516. GetCodeSectionNameForSymbol(td,name);
  5517. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5518. meta.CheckTypeDeclaration(x);
  5519. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5520. ELSE
  5521. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5522. END;
  5523. IF backend.cooperative OR meta.simple THEN
  5524. offset := 0;
  5525. ELSE
  5526. IF x IS SyntaxTree.CellType THEN
  5527. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5528. IF baseRecord = NIL THEN
  5529. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5530. ELSE
  5531. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5532. END;
  5533. ELSE
  5534. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5535. END;
  5536. END;
  5537. ELSE
  5538. offset := 0;
  5539. source := module.allSections.FindBySymbol(td); (*TODO*)
  5540. IF source = NIL THEN
  5541. null := 0;
  5542. GetCodeSectionNameForSymbol(td,name);
  5543. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  5544. Basic.SuffixSegmentedName (name, module.module.name);
  5545. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5546. IntermediateCode.InitImmediate(op,addressType,0);
  5547. source(IntermediateCode.Section).Emit(Data(position,op));
  5548. source.SetReferenced(FALSE)
  5549. ELSE
  5550. name := source.name;
  5551. END;
  5552. END;
  5553. RETURN td
  5554. END GetBackendType;
  5555. BEGIN
  5556. (*td := t.typeDeclaration;*)
  5557. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5558. (*
  5559. IF t IS SyntaxTree.PointerType THEN
  5560. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5561. ELSE
  5562. source := GetBackendType(t);
  5563. END;
  5564. *)
  5565. IF newObjectFile THEN
  5566. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5567. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5568. IntermediateCode.SetOffset(res,offset);
  5569. ELSE
  5570. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5571. END;
  5572. (*
  5573. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5574. make memory should be used when tag is used, not earlier
  5575. *)
  5576. RETURN res
  5577. END TypeDescriptorAdr;
  5578. (*
  5579. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5580. VAR result: IntermediateCode.Operand;
  5581. BEGIN
  5582. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5583. operand.tag := TypeDescriptorAdr(operand.type);
  5584. IntermediateCode.MakeMemory(operand.tag,addressType);
  5585. UseIntermediateOperand(operand.tag);
  5586. END;
  5587. END MakeTypeTag;
  5588. *)
  5589. PROCEDURE ProfilerInit;
  5590. VAR reg: IntermediateCode.Operand;
  5591. BEGIN
  5592. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5593. Emit(Call(position,reg,0));
  5594. END ProfilerInit;
  5595. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5596. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5597. BEGIN
  5598. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5599. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5600. THEN
  5601. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5602. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5603. Emit(Push(position,reg));
  5604. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5605. Emit(Push(position,reg));
  5606. StaticCallOperand(result,procedure);
  5607. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5608. ReleaseOperand(result);
  5609. END;
  5610. END ProfilerEnterExit;
  5611. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5612. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5613. BEGIN
  5614. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5615. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5616. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5617. profileInit.Emit(Push(position,reg));
  5618. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5619. profileInit.Emit(Push(position,reg));
  5620. NEW(string, LEN(name)); COPY(name, string^);
  5621. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5622. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5623. sv.SetType(type);
  5624. Designate(sv,result);
  5625. profileInit.Emit(Push(position,result.tag));
  5626. profileInit.Emit(Push(position,result.op));
  5627. StaticCallOperand(result,procedure);
  5628. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5629. ReleaseOperand(result);
  5630. END;
  5631. END ProfilerAddProcedure;
  5632. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5633. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5634. BEGIN
  5635. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5636. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5637. profileInit.Emit(Push(position,reg));
  5638. profileInitPatchPosition := profileInit.pc;
  5639. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5640. NEW(string, LEN(name)); COPY(name, string^);
  5641. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5642. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5643. sv.SetType(type);
  5644. Designate(sv,result);
  5645. profileInit.Emit(Push(position,result.tag));
  5646. profileInit.Emit(Push(position,result.op));
  5647. StaticCallOperand(result,procedure);
  5648. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5649. ReleaseOperand(result);
  5650. END;
  5651. END ProfilerAddModule;
  5652. PROCEDURE ProfilerPatchInit;
  5653. VAR reg: IntermediateCode.Operand;
  5654. BEGIN
  5655. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5656. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5657. EmitLeave(profileInit,position,NIL,0);
  5658. profileInit.Emit(Exit(position,0,0,0));
  5659. END ProfilerPatchInit;
  5660. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5661. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5662. VAR
  5663. id: LONGINT;
  5664. leftType, rightType: SyntaxTree.Type;
  5665. procedureType: SyntaxTree.ProcedureType;
  5666. runtimeProcedure: SyntaxTree.Procedure;
  5667. runtimeProcedureOperand, operatorOperand: Operand;
  5668. kind: SET;
  5669. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5670. VAR
  5671. arg: IntermediateCode.Operand;
  5672. recordType: SyntaxTree.RecordType;
  5673. fingerPrint: SyntaxTree.FingerPrint;
  5674. BEGIN
  5675. IF type = NIL THEN
  5676. (* no type: push 'NoType' *)
  5677. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5678. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5679. ELSIF IsStrictlyPointerToRecord(type) THEN
  5680. (* pointer to record type: push typetag *)
  5681. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5682. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5683. arg := TypeDescriptorAdr(recordType);
  5684. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5685. ELSE
  5686. (* non-pointer to record type: push fingerprint *)
  5687. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5688. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5689. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5690. END;
  5691. operatorInitializationCodeSection.Emit(Push(position,arg))
  5692. END PushTypeInfo;
  5693. BEGIN
  5694. ASSERT(operatorInitializationCodeSection # NIL);
  5695. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5696. procedureType := operator.type(SyntaxTree.ProcedureType);
  5697. (* determine types *)
  5698. leftType := procedureType.firstParameter.type;
  5699. IF procedureType.numberParameters = 2 THEN
  5700. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5701. rightType := procedureType.firstParameter.nextParameter.type;
  5702. ELSE
  5703. rightType := NIL
  5704. END;
  5705. (* determine operator kind *)
  5706. IF IsStrictlyPointerToRecord(leftType) THEN
  5707. kind := {LhsIsPointer}
  5708. ELSE
  5709. kind := {}
  5710. END;
  5711. IF IsStrictlyPointerToRecord(rightType) THEN
  5712. kind := kind + {RhsIsPointer}
  5713. END;
  5714. IF kind # {} THEN (* TODO: to be removed later on *)
  5715. (* at least one of the types is a pointer to record *)
  5716. (* emit a code that registers this specific operator in the runtime *)
  5717. dump := operatorInitializationCodeSection.comments;
  5718. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5719. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5720. (* push ID *)
  5721. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5722. id := Global.GetSymbol(module.module.case, operator.name);
  5723. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5724. (* push kind *)
  5725. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5726. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5727. (* push type infos *)
  5728. PushTypeInfo(leftType);
  5729. PushTypeInfo(rightType);
  5730. (* push operator address *)
  5731. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5732. StaticCallOperand(operatorOperand, operator);
  5733. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5734. ReleaseOperand(operatorOperand);
  5735. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5736. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5737. ReleaseOperand(runtimeProcedureOperand)
  5738. END
  5739. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5740. END
  5741. END RegisterDynamicOperator;
  5742. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5743. VAR
  5744. traceModule: SyntaxTree.Module;
  5745. procedure: SyntaxTree.Procedure;
  5746. procedureVariable: SyntaxTree.Variable;
  5747. s,msg: Basic.MessageString;
  5748. res: Operand;
  5749. i: LONGINT;
  5750. sv: SyntaxTree.StringValue;
  5751. type: SyntaxTree.Type;
  5752. recordType: SyntaxTree.RecordType;
  5753. printout: Printout.Printer;
  5754. stringWriter: Streams.StringWriter;
  5755. expression: SyntaxTree.Expression;
  5756. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5757. BEGIN
  5758. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5759. IF procedure = NIL THEN
  5760. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5761. END;
  5762. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5763. s := "procedure ";
  5764. Strings.Append(s,backend.traceModuleName);
  5765. Strings.Append(s,".");
  5766. Strings.Append(s,procedureName);
  5767. Strings.Append(s," not present");
  5768. Error(position,s);
  5769. RETURN FALSE
  5770. ELSE
  5771. RETURN TRUE
  5772. END;
  5773. END GetProcedure;
  5774. PROCEDURE CallProcedure;
  5775. VAR size: LONGINT;
  5776. BEGIN
  5777. IF procedure # NIL THEN
  5778. StaticCallOperand(result,procedure);
  5779. size := ProcedureParametersSize(system,procedure);
  5780. ELSE
  5781. Symbol(procedureVariable, result);
  5782. LoadValue(result, procedureVariable.type.resolved);
  5783. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5784. END;
  5785. Emit(Call(position,result.op,size));
  5786. END CallProcedure;
  5787. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5788. VAR res: Operand; string: SyntaxTree.String;
  5789. BEGIN
  5790. IF GetProcedure("String") THEN
  5791. NEW(string, LEN(s)); COPY(s, string^);
  5792. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5793. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  5794. sv.SetType(type);
  5795. Designate(sv,res);
  5796. Emit(Push(position,res.tag));
  5797. Emit(Push(position,res.op));
  5798. ReleaseOperand(res);
  5799. CallProcedure;
  5800. END;
  5801. END String;
  5802. PROCEDURE Integer(op: IntermediateCode.Operand);
  5803. BEGIN
  5804. IF GetProcedure("Int") THEN
  5805. Emit(Push(position,op));
  5806. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5807. CallProcedure;
  5808. END;
  5809. END Integer;
  5810. PROCEDURE Float(op: IntermediateCode.Operand);
  5811. BEGIN
  5812. IF GetProcedure("HIntHex") THEN
  5813. Emit(Push(position,op));
  5814. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5815. CallProcedure;
  5816. END;
  5817. END Float;
  5818. PROCEDURE Set(op: IntermediateCode.Operand);
  5819. BEGIN
  5820. IF GetProcedure("Set") THEN
  5821. Emit(Push(position,op));
  5822. (*
  5823. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5824. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5825. *)
  5826. CallProcedure;
  5827. END;
  5828. END Set;
  5829. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5830. BEGIN
  5831. IF GetProcedure("Boolean") THEN
  5832. Emit(Push(position,op));
  5833. CallProcedure;
  5834. END;
  5835. END Boolean;
  5836. PROCEDURE Char(op: IntermediateCode.Operand);
  5837. BEGIN
  5838. IF GetProcedure("Char") THEN
  5839. Emit(Push(position,op));
  5840. CallProcedure;
  5841. END;
  5842. END Char;
  5843. PROCEDURE Address(op: IntermediateCode.Operand);
  5844. BEGIN
  5845. IF GetProcedure("Address") THEN
  5846. Emit(Push(position,op));
  5847. CallProcedure;
  5848. END;
  5849. END Address;
  5850. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  5851. VAR len: IntermediateCode.Operand;
  5852. BEGIN
  5853. IF GetProcedure("String") THEN
  5854. len := GetArrayLength(type, op.tag);
  5855. Emit(Push(position,len));
  5856. ReleaseIntermediateOperand(len);
  5857. Emit(Push(position,op.op));
  5858. CallProcedure;
  5859. END;
  5860. END StringOperand;
  5861. PROCEDURE Ln;
  5862. BEGIN
  5863. IF GetProcedure("Ln") THEN
  5864. CallProcedure;
  5865. END;
  5866. END Ln;
  5867. BEGIN
  5868. IF backend.traceModuleName = "" THEN RETURN END;
  5869. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5870. IF GetProcedure("Enter") THEN
  5871. CallProcedure
  5872. END;
  5873. NEW(stringWriter,LEN(s));
  5874. FOR i := 0 TO x.Length()-1 DO
  5875. msg := "";
  5876. expression := x.GetExpression(i);
  5877. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5878. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5879. ELSE
  5880. Global.GetModuleName(module.module, s);
  5881. END;
  5882. IF i = 0 THEN
  5883. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  5884. stringWriter.String(":");
  5885. END;
  5886. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5887. IF ~(expression IS SyntaxTree.StringValue) THEN
  5888. printout.Expression(expression);
  5889. stringWriter.Get(s);
  5890. Strings.Append(msg,s);
  5891. Strings.Append(msg,"= ");
  5892. ELSE stringWriter.Get(s); (* remove from string writer *)
  5893. Strings.Append(msg, s);
  5894. END;
  5895. String(msg);
  5896. IF SemanticChecker.IsStringType(expression.type) THEN
  5897. Designate(expression,res);
  5898. StringOperand(res, expression.type);
  5899. ELSE
  5900. Evaluate(expression,res);
  5901. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5902. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5903. Convert(res.op,int64);
  5904. END;
  5905. Integer(res.op);
  5906. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5907. Boolean(res.op);
  5908. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5909. Set(res.op);
  5910. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5911. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5912. Convert(res.op,float64);
  5913. END;
  5914. Float(res.op);
  5915. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5916. Char(res.op);
  5917. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5918. Address(res.op);String("H");
  5919. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5920. Address(res.op);String("H");
  5921. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5922. Address(res.op);String("H");
  5923. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5924. Address(res.op);String("H");
  5925. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5926. String("NIL");
  5927. ELSE HALT(200);
  5928. END;
  5929. END;
  5930. ReleaseOperand(res);
  5931. String("; ");
  5932. END;
  5933. IF GetProcedure("Exit") THEN
  5934. CallProcedure
  5935. ELSE
  5936. Ln;
  5937. END;
  5938. END;
  5939. END SystemTrace;
  5940. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5941. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5942. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5943. BEGIN
  5944. type := type.resolved;
  5945. IF type IS SyntaxTree.RecordType THEN
  5946. WITH type: SyntaxTree.RecordType DO
  5947. baseType := type.baseType;
  5948. IF baseType # NIL THEN
  5949. baseType := baseType.resolved;
  5950. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5951. InitFields(baseType,adr,offset);
  5952. END;
  5953. variable := type.recordScope.firstVariable;
  5954. WHILE variable # NIL DO
  5955. IF variable.initializer # NIL THEN
  5956. Evaluate(variable.initializer,initializerOp);
  5957. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5958. Emit(Mov(position,mem,initializerOp.op));
  5959. ReleaseOperand(initializerOp);
  5960. ReleaseIntermediateOperand(mem);
  5961. END;
  5962. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5963. variable := variable.nextVariable
  5964. END;
  5965. END;
  5966. ELSIF (type IS SyntaxTree.ArrayType) THEN
  5967. WITH type: SyntaxTree.ArrayType DO
  5968. IF type.form = SyntaxTree.Static THEN
  5969. baseType := type.arrayBase;
  5970. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5971. FOR i := 0 TO type.staticLength-1 DO
  5972. InitFields(baseType,adr,offset+i*size);
  5973. END;
  5974. END;
  5975. END;
  5976. ELSIF type IS SyntaxTree.MathArrayType THEN
  5977. WITH type: SyntaxTree.MathArrayType DO
  5978. IF type.form = SyntaxTree.Open THEN
  5979. dim := DynamicDim(type);
  5980. imm := IntermediateCode.Immediate(addressType,dim);
  5981. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  5982. baseType := SemanticChecker.ArrayBase(type,dim);
  5983. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  5984. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  5985. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  5986. ReleaseIntermediateOperand(imm);
  5987. (* flags remain empty (=0) for open array *)
  5988. ELSIF type.form = SyntaxTree.Static THEN
  5989. baseType := type.arrayBase;
  5990. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5991. ASSERT(type.staticLength < 1024*1024*1024);
  5992. FOR i := 0 TO type.staticLength-1 DO
  5993. InitFields(baseType,adr,offset+i*size);
  5994. END;
  5995. END;
  5996. END;
  5997. END;
  5998. END InitFields;
  5999. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6000. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6001. BEGIN
  6002. type := variable.type.resolved;
  6003. IF (type IS SyntaxTree.MathArrayType) THEN
  6004. WITH type: SyntaxTree.MathArrayType DO
  6005. IF type.form = SyntaxTree.Open THEN
  6006. Symbol(variable,operand);
  6007. InitFields(type, operand.tag,0);
  6008. IF temporary THEN
  6009. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6010. END;
  6011. ELSIF type.form = SyntaxTree.Tensor THEN
  6012. Symbol(variable, operand);
  6013. MakeMemory(tmp,operand.op,addressType,0);
  6014. ReleaseOperand(operand);
  6015. IF temporary THEN
  6016. (* trick -- temporary object from array base *)
  6017. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6018. Symbol(symbol,operand);
  6019. MakeMemory(mem,operand.op,addressType,0);
  6020. ReleaseOperand(operand);
  6021. Emit(Mov(position,tmp, mem) );
  6022. ReleaseOperand(operand);
  6023. ELSE
  6024. Emit(Mov(position,tmp, nil ) );
  6025. END;
  6026. ReleaseIntermediateOperand(tmp);
  6027. END;
  6028. END;
  6029. ELSE
  6030. Symbol(variable,operand);
  6031. IF variable.initializer # NIL THEN
  6032. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6033. reference.SetType(variable.type.resolved);
  6034. reference.SetAssignable(TRUE);
  6035. Assign(reference,variable.initializer);
  6036. ELSIF temporary THEN
  6037. IF SemanticChecker.IsPointerType(variable.type) THEN
  6038. Symbol(variable, operand);
  6039. MakeMemory(tmp,operand.op,addressType,0);
  6040. ReleaseOperand(operand);
  6041. Emit(Mov(position,tmp, nil ) );
  6042. ReleaseIntermediateOperand(tmp);
  6043. END;
  6044. END;
  6045. InitFields(type, operand.op,0);
  6046. ReleaseOperand(operand);
  6047. END;
  6048. END InitVariable;
  6049. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6050. VAR end: Label;
  6051. BEGIN
  6052. IF type.form = SyntaxTree.Tensor THEN
  6053. InitOperand(result,ModeValue);
  6054. ReuseCopy(result.op,base);
  6055. end := NewLabel();
  6056. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6057. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6058. SetLabel(end);
  6059. Convert(result.op,sizeType);
  6060. ELSE
  6061. InitOperand(result,ModeValue);
  6062. IntermediateCode.InitImmediate(result.op, sizeType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6063. END
  6064. END MathArrayDim;
  6065. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6066. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6067. BEGIN
  6068. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6069. MakeMemory(mem,base,addressType,offset);
  6070. Emit(Mov(position,mem,value));
  6071. ReleaseIntermediateOperand(mem);
  6072. END PutMathArrayField;
  6073. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6074. VAR mem: IntermediateCode.Operand;
  6075. BEGIN
  6076. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6077. MakeMemory(mem,base,addressType,offset);
  6078. Emit(Mov(position,mem,value));
  6079. ReleaseIntermediateOperand(mem);
  6080. END PutMathArrayFieldOffset;
  6081. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6082. BEGIN
  6083. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6084. MakeMemory(value,base,addressType,offset);
  6085. END GetMathArrayField;
  6086. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6087. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6088. BEGIN
  6089. IF incr THEN
  6090. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6091. ELSE
  6092. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6093. END;
  6094. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6095. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6096. ELSE
  6097. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6098. Emit(Mov(position,reg,dim));
  6099. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6100. Emit(Add(position,reg,reg,base));
  6101. MakeMemory(mem, reg, addressType, offset);
  6102. ReleaseIntermediateOperand(reg);
  6103. Emit(Mov(position,mem,value));
  6104. ReleaseIntermediateOperand(mem);
  6105. END;
  6106. END PutMathArrayLenOrIncr;
  6107. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6108. BEGIN
  6109. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6110. END PutMathArrayLength;
  6111. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6112. BEGIN
  6113. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6114. END PutMathArrayIncrement;
  6115. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6116. BEGIN
  6117. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6118. END GetMathArrayIncrement;
  6119. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6120. BEGIN
  6121. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6122. END GetMathArrayLength;
  6123. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6124. VAR dimOp: IntermediateCode.Operand;
  6125. BEGIN
  6126. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6127. GetMathArrayLength(type, operand, dimOp, check, result);
  6128. END GetMathArrayLengthAt;
  6129. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6130. VAR dimOp: IntermediateCode.Operand;
  6131. BEGIN
  6132. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6133. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6134. END GetMathArrayIncrementAt;
  6135. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6136. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6137. offset: LONGINT;
  6138. BEGIN
  6139. IF increment THEN
  6140. offset := MathIncrOffset;
  6141. ELSE
  6142. offset := MathLenOffset;
  6143. END;
  6144. INC(offset,operand.dimOffset*2);
  6145. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6146. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6147. END;
  6148. (* static dimension *)
  6149. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6150. IF check & (type.form = SyntaxTree.Tensor) THEN
  6151. DimensionCheck(operand.tag,dim,BrltL);
  6152. END;
  6153. val := SHORT(dim.intValue);
  6154. IF type.form # SyntaxTree.Tensor THEN
  6155. t := SemanticChecker.ArrayBase(type,val);
  6156. type := t.resolved(SyntaxTree.MathArrayType);
  6157. IF type.form = SyntaxTree.Static THEN
  6158. IF increment THEN
  6159. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6160. ELSE
  6161. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6162. END;
  6163. InitOperand(result,ModeValue);
  6164. result.op := res;
  6165. RETURN;
  6166. END;
  6167. END;
  6168. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6169. MakeMemory(res,operand.tag,addressType,offset);
  6170. (*
  6171. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6172. *)
  6173. InitOperand(result,ModeValue);
  6174. result.op := res;
  6175. ELSE
  6176. Convert(dim,addressType);
  6177. IF check THEN
  6178. IF type.form = SyntaxTree.Tensor THEN
  6179. DimensionCheck(operand.tag,dim,BrltL);
  6180. ELSIF isUnchecked THEN (* do nothing *)
  6181. ELSE
  6182. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6183. END;
  6184. END;
  6185. end := NewLabel(); next := NIL;
  6186. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6187. Emit(Mov(position,res,dim));
  6188. Convert(res,sizeType);
  6189. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6190. WHILE t IS SyntaxTree.MathArrayType DO
  6191. type := t(SyntaxTree.MathArrayType);
  6192. IF type.form = SyntaxTree.Static THEN
  6193. imm := IntermediateCode.Immediate(sizeType,val);
  6194. next := NewLabel();
  6195. BrneL(next,imm,res);
  6196. IF increment THEN
  6197. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6198. ELSE
  6199. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6200. END;
  6201. Emit(MovReplace(position,res,imm));
  6202. BrL(end);
  6203. ELSE hasDynamicPart := TRUE;
  6204. END;
  6205. t := type.arrayBase.resolved;
  6206. val := val + 1;
  6207. IF next # NIL THEN SetLabel(next) END;
  6208. END;
  6209. IF hasDynamicPart THEN
  6210. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6211. Emit(Mov(position,res2,dim));
  6212. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6213. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6214. Emit(Add(position,res2,res2,imm));
  6215. Emit(Add(position,res2,res2,operand.tag));
  6216. IntermediateCode.MakeMemory(res2,sizeType);
  6217. Emit(MovReplace(position,res,res2));
  6218. ReleaseIntermediateOperand(res2);
  6219. END;
  6220. SetLabel(end);
  6221. Convert(res,sizeType);
  6222. InitOperand(result,ModeValue);
  6223. result.op := res;
  6224. END;
  6225. END MathArrayLenOrIncr;
  6226. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6227. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6228. offset: LONGINT;
  6229. BEGIN
  6230. offset := operand.dimOffset+DynamicDim(type)-1;
  6231. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6232. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6233. val := SHORT(dim.intValue);
  6234. t := SemanticChecker.ArrayBase(type,val);
  6235. type := t.resolved(SyntaxTree.ArrayType);
  6236. IF type.form = SyntaxTree.Static THEN
  6237. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6238. ELSE
  6239. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6240. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6241. END;
  6242. UseIntermediateOperand(res);
  6243. InitOperand(result,ModeValue);
  6244. result.op := res;
  6245. ELSE
  6246. Convert(dim,addressType);
  6247. IF ~isUnchecked THEN
  6248. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6249. END;
  6250. end := NewLabel(); next := NIL;
  6251. (* ReuseCopy(dim,res); *)
  6252. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6253. Emit(Mov(position,res,dim));
  6254. Convert(res,sizeType);
  6255. Convert(res,sizeType);
  6256. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6257. WHILE t IS SyntaxTree.ArrayType DO
  6258. type := t(SyntaxTree.ArrayType);
  6259. IF type.form = SyntaxTree.Static THEN
  6260. imm := IntermediateCode.Immediate(sizeType,val);
  6261. next := NewLabel();
  6262. BrneL(next,imm,res);
  6263. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6264. Emit(MovReplace(position,res,imm));
  6265. BrL(end);
  6266. ELSE hasDynamicPart := TRUE;
  6267. END;
  6268. t := type.arrayBase.resolved;
  6269. val := val + 1;
  6270. IF next # NIL THEN SetLabel(next) END;
  6271. END;
  6272. IF hasDynamicPart THEN
  6273. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6274. Convert(res2,addressType);
  6275. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6276. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6277. Emit(Sub(position,res2,imm,res2));
  6278. Emit(Add(position,res2,res2,operand.tag));
  6279. IntermediateCode.MakeMemory(res2,sizeType);
  6280. Emit(MovReplace(position,res,res2));
  6281. ReleaseIntermediateOperand(res2);
  6282. END;
  6283. SetLabel(end);
  6284. Convert(res,sizeType);
  6285. InitOperand(result,ModeValue);
  6286. result.op := res;
  6287. END;
  6288. END ArrayLen;
  6289. (**
  6290. create a temporary variable in current scope
  6291. **)
  6292. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6293. VAR name: SyntaxTree.Identifier; variable: SyntaxTree.Variable;
  6294. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6295. BEGIN
  6296. IF ~register THEN
  6297. variable := temporaries.GetFreeVariable(type, untraced, index);
  6298. ELSE
  6299. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6300. END;
  6301. scope := currentScope;
  6302. variable := NIL; (* disable free variable managemenet for the time being -- does not work *)
  6303. IF variable = NIL THEN
  6304. name := temporaries.GetUID();
  6305. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6306. variable.SetType(type);
  6307. variable.SetAccess(SyntaxTree.Hidden);
  6308. variable.SetUntraced(untraced);
  6309. IF ~register THEN
  6310. temporaries.AddVariable(variable);
  6311. IF scope.lastVariable # NIL THEN
  6312. offset := scope.lastVariable.offsetInBits;
  6313. ELSE
  6314. offset := 0;
  6315. END;
  6316. DEC(offset,system.SizeOf(variable.type));
  6317. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6318. variable(SyntaxTree.Variable).SetOffset(offset);
  6319. scope.AddVariable(variable(SyntaxTree.Variable));
  6320. scope.EnterSymbol(variable, duplicate);
  6321. ASSERT(~duplicate);
  6322. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6323. ELSE
  6324. variable.SetUseRegister(TRUE);
  6325. variable(SyntaxTree.Variable).SetOffset(0);
  6326. END;
  6327. ELSE
  6328. name := temporaries.GetUID();
  6329. offset := variable.offsetInBits;
  6330. (* create new variable on existing slot *)
  6331. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6332. variable.SetType(type);
  6333. variable.SetAccess(SyntaxTree.Hidden);
  6334. variable.SetUntraced(untraced);
  6335. variable(SyntaxTree.Variable).SetOffset(offset);
  6336. scope.AddVariable(variable(SyntaxTree.Variable));
  6337. scope.EnterSymbol(variable, duplicate);
  6338. ASSERT(~duplicate);
  6339. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6340. (*
  6341. ASSERT(variable.type.resolved = type.resolved)
  6342. *)
  6343. END;
  6344. RETURN variable(SyntaxTree.Variable)
  6345. END GetTemporaryVariable;
  6346. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6347. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6348. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6349. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6350. i: LONGINT; duplicate: BOOLEAN;
  6351. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6352. VAR variable: SyntaxTree.Variable;
  6353. BEGIN
  6354. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6355. variable.SetType(type);
  6356. recordScope.AddVariable(variable);
  6357. END AddVariable;
  6358. BEGIN
  6359. name := "@ArrayDescriptor";
  6360. Basic.AppendNumber(name,dimensions);
  6361. identifier := SyntaxTree.NewIdentifier(name);
  6362. parentScope := module.module.moduleScope;
  6363. symbol := parentScope.FindSymbol(identifier);
  6364. IF symbol # NIL THEN
  6365. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6366. type := typeDeclaration.declaredType;
  6367. ELSE
  6368. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6369. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6370. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6371. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6372. recordType.SetTypeDeclaration(typeDeclaration);
  6373. recordType.SetState(SyntaxTree.Resolved);
  6374. typeDeclaration.SetDeclaredType(recordType);
  6375. AddVariable("@ptr",system.anyType);
  6376. AddVariable("@adr",system.addressType);
  6377. AddVariable("@flags",system.addressType);
  6378. AddVariable("@dim",system.addressType);
  6379. AddVariable("@elementSize",system.addressType);
  6380. FOR i := 0 TO dimensions-1 DO
  6381. name := "@len";
  6382. Basic.AppendNumber(name,i);
  6383. AddVariable(name,system.addressType);
  6384. name := "@incr";
  6385. Basic.AppendNumber(name,i);
  6386. AddVariable(name,system.addressType);
  6387. END;
  6388. parentScope.AddTypeDeclaration(typeDeclaration);
  6389. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6390. ASSERT(~duplicate);
  6391. type := recordType;
  6392. END;
  6393. RETURN type
  6394. END GetMathArrayDescriptorType;
  6395. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6396. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6397. BEGIN
  6398. type := GetMathArrayDescriptorType(dimensions);
  6399. Emit(Push(position,op.op));
  6400. (* push type descriptor *)
  6401. reg := TypeDescriptorAdr(type);
  6402. IF ~newObjectFile THEN
  6403. IntermediateCode.MakeMemory(reg,addressType);
  6404. END;
  6405. Emit(Push(position,reg));
  6406. ReleaseIntermediateOperand(reg);
  6407. (* push realtime flag: false by default *)
  6408. Emit(Push(position,false));
  6409. CallThis(position,"Heaps","NewRec",3);
  6410. END NewMathArrayDescriptor;
  6411. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6412. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6413. BEGIN
  6414. NEW(string, LEN(s)); COPY(s, string^);
  6415. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6416. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6417. sv.SetType(type);
  6418. Designate(sv,res);
  6419. Emit(Push(position,res.tag));
  6420. Emit(Push(position,res.op));
  6421. ReleaseOperand(res);
  6422. END PushConstString;
  6423. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6424. BEGIN
  6425. IF b THEN
  6426. Emit(Push(Basic.invalidPosition, true));
  6427. ELSE
  6428. Emit(Push(Basic.invalidPosition, false));
  6429. END;
  6430. END PushConstBoolean;
  6431. PROCEDURE PushConstSet(v: SET);
  6432. VAR value: SyntaxTree.Value; op: Operand;
  6433. BEGIN
  6434. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6435. value.SetType(system.setType);
  6436. Evaluate(value, op);
  6437. Emit(Push(Basic.invalidPosition, op.op));
  6438. ReleaseOperand(op);
  6439. END PushConstSet;
  6440. PROCEDURE PushConstInteger(v: LONGINT);
  6441. VAR value: SyntaxTree.Value; op: Operand;
  6442. BEGIN
  6443. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6444. value.SetType(system.longintType);
  6445. Evaluate(value, op);
  6446. Emit(Push(Basic.invalidPosition, op.op));
  6447. ReleaseOperand(op);
  6448. END PushConstInteger;
  6449. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6450. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6451. section: IntermediateCode.Section;
  6452. BEGIN
  6453. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6454. Global.GetSymbolSegmentedName(symbol, name);
  6455. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6456. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6457. procedure.SetScope(moduleScope);
  6458. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6459. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6460. procedure.SetAccess(SyntaxTree.Hidden);
  6461. currentScope := procedureScope;
  6462. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6463. EmitEnter(section, Basic.invalidPosition,procedure,0,0,0);
  6464. RETURN section;
  6465. END OpenInitializer;
  6466. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6467. BEGIN
  6468. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6469. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6470. section := prev;
  6471. END CloseInitializer;
  6472. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6473. VAR name: SyntaxTree.IdentifierString;
  6474. variable: SyntaxTree.Variable;
  6475. parameter: SyntaxTree.Parameter;
  6476. type: SyntaxTree.Type;
  6477. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6478. BEGIN
  6479. InitOperand(op,ModeReference);
  6480. op.op := fp;
  6481. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6482. Dereference(op, x, FALSE);
  6483. result := op;
  6484. Symbol(symbol, op);
  6485. END Field;
  6486. PROCEDURE Direction(direction: LONGINT): SET;
  6487. BEGIN
  6488. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6489. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6490. ELSE HALT(100);
  6491. END;
  6492. END Direction;
  6493. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6494. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6495. BEGIN
  6496. Field(port, op);
  6497. ToMemory(op.op,addressType,0);
  6498. Emit(Push(Basic.invalidPosition, op.op));
  6499. ReleaseOperand(op);
  6500. Basic.GetString(modifier.identifier, name);
  6501. PushConstString(name);
  6502. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6503. ASSERT(SemanticChecker.IsStringType(value.type));
  6504. Designate(value, op);
  6505. Emit(Push(modifier.position, op.tag));
  6506. Emit(Push(modifier.position, op.op));
  6507. ReleaseOperand(op);
  6508. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6509. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6510. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6511. Evaluate(value, op);
  6512. Emit(Push(modifier.position, op.op));
  6513. ReleaseOperand(op);
  6514. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6515. ELSE
  6516. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6517. END;
  6518. END AddPortProperty;
  6519. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6520. VAR modifier: SyntaxTree.Modifier;
  6521. BEGIN
  6522. modifier := parameter.modifiers;
  6523. WHILE modifier # NIL DO
  6524. AddPortProperty(parameter,modifier, modifier.expression);
  6525. modifier := modifier.nextModifier;
  6526. END;
  6527. END AddPortProperties;
  6528. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6529. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6530. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6531. PROCEDURE PushLens(type: SyntaxTree.Type);
  6532. BEGIN
  6533. IF IsSemiDynamicArray(type) THEN
  6534. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6535. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6536. Emit(Push(Basic.invalidPosition, op.op));
  6537. ReleaseOperand(op);
  6538. INC(dim);
  6539. ELSIF IsStaticArray(type) THEN
  6540. len := len * type(SyntaxTree.ArrayType).staticLength;
  6541. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6542. INC(dim);
  6543. ELSE
  6544. baseType := type;
  6545. END;
  6546. END PushLens;
  6547. BEGIN
  6548. (* cell *)
  6549. IF parameter.type IS SyntaxTree.ArrayType THEN
  6550. type := parameter.type;
  6551. dim := 0;
  6552. len := 1;
  6553. PushLens(type);
  6554. portType := baseType.resolved(SyntaxTree.PortType);
  6555. ELSE
  6556. portType := parameter.type(SyntaxTree.PortType);
  6557. END;
  6558. PushSelfPointer();
  6559. (* port / array of ports *)
  6560. IF IsStaticArray(type) THEN
  6561. PushConstInteger(len);
  6562. END;
  6563. Field(parameter, op);
  6564. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6565. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6566. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6567. Designate(d, op);*)
  6568. Emit(Push(Basic.invalidPosition, op.op));
  6569. ReleaseOperand(op);
  6570. (* name *)
  6571. PushConstString(name);
  6572. (* inout *)
  6573. PushConstSet(Direction(portType.direction));
  6574. (* width *)
  6575. PushConstInteger(portType.sizeInBits);
  6576. IF parameter.type IS SyntaxTree.PortType THEN
  6577. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6578. AddPortProperties(parameter);
  6579. ELSIF IsStaticArray(type)THEN
  6580. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6581. ELSIF IsSemiDynamicArray(type) THEN
  6582. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6583. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6584. Emit(Add(position,reg, sp, size));
  6585. (* dim *)
  6586. PushConstInteger(dim);
  6587. (* len array *)
  6588. Emit(Push(position, reg));
  6589. ReleaseIntermediateOperand(reg);
  6590. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6591. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6592. Emit(Add(position, sp,sp, size));
  6593. ELSE
  6594. HALT(100);
  6595. END;
  6596. END Parameter;
  6597. BEGIN
  6598. IF backend.cellsAreObjects THEN
  6599. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6600. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6601. END;
  6602. parameter := x.firstParameter;
  6603. WHILE (parameter # NIL) DO
  6604. type := parameter.type.resolved;
  6605. WHILE (type IS SyntaxTree.ArrayType) DO
  6606. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6607. END;
  6608. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6609. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6610. Parameter(name,parameter);
  6611. END;
  6612. parameter := parameter.nextParameter;
  6613. END;
  6614. ELSE HALT(200)
  6615. END;
  6616. END AddPorts;
  6617. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6618. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6619. BEGIN
  6620. Symbol(cell,op);
  6621. ToMemory(op.op,addressType,0);
  6622. Emit(Push(position,op.op));
  6623. ReleaseOperand(op);
  6624. property.GetName(name);
  6625. (* does not work when inheritance is used:
  6626. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6627. *)
  6628. PushConstString(name);
  6629. IF (value # NIL) THEN
  6630. ASSERT(
  6631. SemanticChecker.IsStringType(property.type)
  6632. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6633. OR (property.type.resolved IS SyntaxTree.FloatType)
  6634. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6635. OR (property.type.resolved IS SyntaxTree.SetType)
  6636. );
  6637. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6638. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6639. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6640. Designate(d, op);
  6641. IF SemanticChecker.IsStringType(property.type) THEN
  6642. Emit(Push(Basic.invalidPosition, op.tag))
  6643. END;
  6644. Emit(Push(Basic.invalidPosition, op.op));
  6645. ReleaseOperand(op);
  6646. END;
  6647. IF value = NIL THEN
  6648. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6649. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6650. ASSERT(SemanticChecker.IsStringType(value.type));
  6651. Designate(value, op);
  6652. PushString(op, value.type);
  6653. ReleaseOperand(op);
  6654. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6655. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6656. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6657. Evaluate(value, op);
  6658. Emit(Push(property.position, op.op));
  6659. ReleaseOperand(op);
  6660. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6661. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6662. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6663. Evaluate(value, op);
  6664. Emit(Push(property.position, op.op));
  6665. ReleaseOperand(op);
  6666. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6667. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6668. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6669. Evaluate(value, op);
  6670. Emit(Push(property.position, op.op));
  6671. ReleaseOperand(op);
  6672. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6673. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6674. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6675. Evaluate(value, op);
  6676. Emit(Push(property.position, op.op));
  6677. ReleaseOperand(op);
  6678. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6679. ELSE
  6680. HALT(200);
  6681. END;
  6682. END AddProperty;
  6683. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6684. VAR symbol: SyntaxTree.Symbol;
  6685. BEGIN
  6686. WHILE modifier # NIL DO
  6687. symbol := cellType.FindProperty(modifier.identifier);
  6688. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6689. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6690. modifier := modifier.nextModifier;
  6691. END;
  6692. END AddModifiers;
  6693. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6694. VAR last: SyntaxTree.Modifier;
  6695. BEGIN
  6696. IF to = NIL THEN
  6697. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6698. ELSE
  6699. last := to;
  6700. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6701. last := last.nextModifier;
  6702. END;
  6703. IF last.identifier # this.identifier THEN
  6704. ASSERT(last.nextModifier = NIL);
  6705. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6706. END;
  6707. END;
  6708. END AppendModifier;
  6709. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6710. BEGIN
  6711. WHILE this # NIL DO
  6712. AppendModifier(to, this);
  6713. this := this.nextModifier;
  6714. END;
  6715. END AppendModifiers;
  6716. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6717. VAR base: SyntaxTree.Type;
  6718. BEGIN
  6719. AppendModifiers(to, c.modifiers);
  6720. base := c.GetBaseValueType();
  6721. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6722. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6723. END;
  6724. END AppendCellTypeModifiers;
  6725. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6726. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6727. BEGIN
  6728. Basic.GetString(modifier.identifier, name);
  6729. PushConstString(name);
  6730. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6731. ASSERT(SemanticChecker.IsStringType(value.type));
  6732. Designate(value, op);
  6733. PushString(op, value.type);
  6734. ReleaseOperand(op);
  6735. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6736. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6737. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6738. Evaluate(value, op);
  6739. Emit(Push(modifier.position, op.op));
  6740. ReleaseOperand(op);
  6741. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6742. ELSE
  6743. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6744. END;
  6745. END AddPortProperty;
  6746. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6747. BEGIN
  6748. WHILE modifier # NIL DO
  6749. AddPortProperty(modifier, modifier.expression);
  6750. modifier := modifier.nextModifier;
  6751. END;
  6752. END AddPortProperties;
  6753. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6754. VAR op: Operand;
  6755. BEGIN
  6756. Evaluate(p, op);
  6757. Emit(Push(p.position, op.op));
  6758. ReleaseOperand(op);
  6759. IF p IS SyntaxTree.Designator THEN
  6760. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  6761. END;
  6762. END PushPort;
  6763. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6764. VAR tmp: IntermediateCode.Operand;
  6765. BEGIN
  6766. actualType := actualType.resolved;
  6767. IF actualType IS SyntaxTree.StringType THEN
  6768. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6769. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6770. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6771. ELSE
  6772. tmp := op.tag;
  6773. IntermediateCode.MakeMemory(tmp,addressType);
  6774. Emit(Push(position,tmp));
  6775. END;
  6776. Emit(Push(position,op.op))
  6777. END PushString;
  6778. (* conservative check if x is potentially on the heap, excluding the module heap
  6779. required for generational garbage collector
  6780. *)
  6781. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  6782. VAR pos: LONGINT; y: SyntaxTree.Expression;
  6783. BEGIN
  6784. RETURN TRUE;
  6785. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  6786. passed by reference.
  6787. pos := x.position.start;
  6788. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  6789. x := x(SyntaxTree.Designator).left;
  6790. END;
  6791. RETURN x # NIL;
  6792. *)
  6793. END OnHeap;
  6794. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6795. VAR
  6796. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6797. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6798. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6799. tmp:IntermediateCode.Operand;
  6800. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6801. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6802. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6803. dest: IntermediateCode.Operand;
  6804. staticLength: LONGINT; itype: IntermediateCode.Type;
  6805. convert,isTensor: BOOLEAN;
  6806. recordType: SyntaxTree.RecordType;
  6807. baseType: SyntaxTree.Type;
  6808. flags: SET;
  6809. left: SyntaxTree.Expression;
  6810. call: SyntaxTree.Designator;
  6811. procedure: SyntaxTree.Procedure;
  6812. temporaryVariable: SyntaxTree.Variable;
  6813. dummy: IntermediateCode.Operand;
  6814. customBuiltin: SyntaxTree.CustomBuiltin;
  6815. isVarPar: ARRAY 3 OF BOOLEAN;
  6816. callsection: Sections.Section;
  6817. segmentedName: Basic.SegmentedName;
  6818. needsTrace: BOOLEAN;
  6819. n: ARRAY 256 OF CHAR;
  6820. modifier: SyntaxTree.Modifier;
  6821. previous, init: IntermediateCode.Section;
  6822. prevScope: SyntaxTree.Scope;
  6823. firstPar: LONGINT;
  6824. saved: RegisterEntry;
  6825. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6826. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6827. priority: IntermediateCode.Operand;
  6828. op,callop: Operand;
  6829. BEGIN
  6830. IF type = NIL THEN RETURN END;
  6831. type := type.resolved;
  6832. IF type IS SyntaxTree.PointerType THEN
  6833. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6834. END;
  6835. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6836. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6837. recordScope := type(SyntaxTree.RecordType).recordScope;
  6838. IF recordScope.bodyProcedure # NIL THEN
  6839. procedure := recordScope.bodyProcedure;
  6840. body := procedure.procedureScope.body;
  6841. Emit(Push(position,self));
  6842. IF body.isActive THEN
  6843. StaticCallOperand(callop,procedure);
  6844. Emit(Push(position,callop.op));
  6845. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6846. Convert(priority,sizeType);
  6847. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6848. END;
  6849. Emit(Push(position,priority));
  6850. ReleaseIntermediateOperand(priority);
  6851. IF backend.cooperative THEN
  6852. Emit(Push(position,self));
  6853. CallThis(position,"Activities","Create",3)
  6854. ELSE
  6855. flags := 0;
  6856. IF body.isSafe THEN
  6857. flags := 1;
  6858. END;
  6859. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6860. Emit(Push(position,self));
  6861. CallThis(position,"Objects","CreateProcess",4)
  6862. END;
  6863. ELSE
  6864. Emit(Push(position,self));
  6865. StaticCallOperand(callop,procedure);
  6866. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6867. END;
  6868. Emit(Pop(position,self));
  6869. END;
  6870. END CallBodies;
  6871. PROCEDURE PushTD(type: SyntaxTree.Type);
  6872. VAR op: IntermediateCode.Operand;
  6873. BEGIN
  6874. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6875. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6876. ELSE
  6877. IF type.resolved IS SyntaxTree.PointerType THEN
  6878. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6879. END;
  6880. op := TypeDescriptorAdr(type.resolved);
  6881. IF ~newObjectFile THEN
  6882. IntermediateCode.MakeMemory(op,addressType);
  6883. END;
  6884. Emit(Push(position,op));
  6885. END
  6886. END PushTD;
  6887. BEGIN
  6888. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6889. dest := destination; destination := emptyOperand;
  6890. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6891. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6892. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6893. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6894. CASE x.id OF
  6895. (* ---- COPY ----- *)
  6896. |Global.Copy:
  6897. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6898. (* ---- EXCL, INCL----- *)
  6899. |Global.Excl,Global.Incl:
  6900. Evaluate(p0,s0);
  6901. Evaluate(p1,s1);
  6902. Convert(s1.op,setType);
  6903. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6904. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6905. END;
  6906. ReuseCopy(res,s0.op);
  6907. ReleaseOperand(s0);
  6908. Reuse1(tmp,s1.op);
  6909. ReleaseOperand(s1);
  6910. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6911. IF x.id = Global.Excl THEN
  6912. Emit(Not(position,tmp,tmp));
  6913. Emit(And(position,res,res,tmp));
  6914. ELSE
  6915. Emit(Or(position,res,res,tmp));
  6916. END;
  6917. ReleaseIntermediateOperand(tmp);
  6918. Designate(p0,s0);
  6919. ToMemory(s0.op,setType,0);
  6920. Emit(Mov(position,s0.op,res));
  6921. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6922. (* ---- DISPOSE ----- *)
  6923. |Global.Dispose:
  6924. Designate(p0,s0);
  6925. Emit(Push(position,s0.op));
  6926. ReleaseOperand(s0);
  6927. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6928. (* ---- GETPROCEDURE ----- *)
  6929. |Global.GetProcedure:
  6930. Designate(p0,s0);
  6931. PushString(s0,p0.type);
  6932. Designate(p1,s1);
  6933. PushString(s1,p1.type);
  6934. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6935. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6936. ELSE PushTD(procedureType.firstParameter.type)
  6937. END;
  6938. PushTD(procedureType.returnType);
  6939. Designate(p2,s2);
  6940. Emit(Push(position,s2.op));
  6941. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6942. CallThis(position,"Modules","GetProcedure", 7);
  6943. (* ---- ASH, LSH, ROT ----- *)
  6944. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6945. Evaluate(p0,s0);
  6946. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6947. (* make unsigned arguments in order to produced a logical shift *)
  6948. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6949. convert:= TRUE;
  6950. itype := s0.op.type;
  6951. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6952. Convert(s0.op,itype);
  6953. ELSE
  6954. convert := FALSE;
  6955. END;
  6956. END;
  6957. Evaluate(p1,s1);
  6958. IF IsIntegerConstant(p1,hint) THEN
  6959. ReuseCopy(reg,s0.op);
  6960. IF hint > 0 THEN
  6961. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6962. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6963. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6964. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  6965. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  6966. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  6967. END;
  6968. ELSIF hint < 0 THEN
  6969. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  6970. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  6971. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  6972. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  6973. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  6974. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  6975. END;
  6976. END;
  6977. ReleaseOperand(s0); ReleaseOperand(s1);
  6978. ELSE
  6979. exit := NewLabel();
  6980. end := NewLabel();
  6981. ReuseCopy(reg,s0.op);
  6982. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  6983. Reuse1(tmp,s1.op);
  6984. Emit(Neg(position,tmp,s1.op));
  6985. Convert(tmp,s1.op.type);
  6986. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  6987. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  6988. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  6989. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  6990. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  6991. END;
  6992. ReleaseIntermediateOperand(tmp);
  6993. BrL(end);
  6994. SetLabel(exit);
  6995. ReuseCopy(tmp,s1.op);
  6996. Convert(tmp,s1.op.type);
  6997. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  6998. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  6999. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7000. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7001. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7002. END;
  7003. ReleaseIntermediateOperand(tmp);
  7004. SetLabel(end);
  7005. ReleaseOperand(s0); ReleaseOperand(s1);
  7006. END;
  7007. InitOperand(result,ModeValue);
  7008. IF convert THEN
  7009. itype := reg.type;
  7010. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7011. Convert(reg,itype);
  7012. END;
  7013. result.op := reg;
  7014. (* ---- CAP ----- *)
  7015. |Global.Cap:
  7016. Evaluate(p0,result);
  7017. ReuseCopy(reg,result.op);
  7018. ReleaseIntermediateOperand(result.op);
  7019. ignore := NewLabel();
  7020. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7021. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7022. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7023. SetLabel(ignore);
  7024. result.op := reg;
  7025. (* ---- CHR ----- *)
  7026. |Global.Chr, Global.Chr32:
  7027. Evaluate(p0,result);
  7028. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7029. |Global.Entier, Global.EntierH:
  7030. Evaluate(p0,result);
  7031. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7032. (* ---- MIN and MAX ----- *)
  7033. |Global.Max,Global.Min:
  7034. Evaluate(p0,s0);
  7035. Evaluate(p1,s1);
  7036. Reuse2(res,s0.op,s1.op);
  7037. else := NewLabel();
  7038. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7039. ELSE BrltL(else,s1.op,s0.op) END;
  7040. Emit(Mov(position,res,s0.op));
  7041. ReleaseOperand(s0);
  7042. end := NewLabel();
  7043. BrL(end);
  7044. SetLabel(else);
  7045. Emit(MovReplace(position,res,s1.op));
  7046. SetLabel(end);
  7047. ReleaseOperand(s1);
  7048. InitOperand(result,ModeValue);
  7049. result.op := res;
  7050. (* ---- ODD ----- *)
  7051. |Global.Odd:
  7052. IF ~conditional THEN
  7053. ConditionToValue(x)
  7054. ELSE
  7055. Evaluate(p0,result);
  7056. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7057. Reuse1(res,result.op);
  7058. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7059. ReleaseIntermediateOperand(result.op);
  7060. result.op := res;
  7061. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  7062. ReleaseOperand(result);
  7063. BrL(falseLabel);
  7064. END;
  7065. (* ---- ORD ----- *)
  7066. |Global.Ord, Global.Ord32:
  7067. Evaluate(p0,result);
  7068. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7069. (* ---- SHORT, LONG ----- *)
  7070. |Global.Short, Global.Long:
  7071. Evaluate(p0,result);
  7072. IF x.type IS SyntaxTree.ComplexType THEN
  7073. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7074. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7075. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7076. ELSE
  7077. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7078. END
  7079. (* ---- HALT, SYSTEM.HALT----- *)
  7080. |Global.Halt, Global.systemHalt:
  7081. val := p0.resolved(SyntaxTree.IntegerValue).value;
  7082. EmitTrap (position, val);
  7083. (* ---- ASSERT ----- *)
  7084. |Global.Assert:
  7085. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7086. trueL := NewLabel();
  7087. falseL := NewLabel();
  7088. Condition(p0,trueL,falseL);
  7089. IF p1 = NIL THEN val := AssertTrap
  7090. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  7091. END;
  7092. SetLabel(falseL);
  7093. EmitTrap(position,val);
  7094. SetLabel(trueL);
  7095. END;
  7096. (*
  7097. Emit(TrapC(result.op,val);
  7098. *)
  7099. (* ---- INC, DEC----- *)
  7100. |Global.Inc,Global.Dec:
  7101. Expression(p0); adr := result.op;
  7102. LoadValue(result,p0.type); l := result;
  7103. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7104. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7105. END;
  7106. IF x.id = Global.Inc THEN
  7107. Emit(Add(position,l.op,l.op,r.op));
  7108. ELSE
  7109. Emit(Sub(position,l.op,l.op,r.op));
  7110. END;
  7111. ReleaseOperand(l); ReleaseOperand(r);
  7112. (* ---- LEN ----- *)
  7113. |Global.Len: (* dynamic length, static length done by checker *)
  7114. Designate(p0,operand);
  7115. IF p1 = NIL THEN
  7116. InitOperand(l,ModeValue);
  7117. l.op := IntermediateCode.Immediate(sizeType,0);
  7118. ELSE
  7119. Evaluate(p1,l);
  7120. END;
  7121. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7122. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7123. Dereference(operand, p0.type.resolved, FALSE);
  7124. END;
  7125. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7126. ReleaseOperand(operand); ReleaseOperand(l);
  7127. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7128. ASSERT(p1 # NIL);
  7129. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7130. Dereference(operand,p0.type.resolved,FALSE);
  7131. END;
  7132. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7133. ReleaseOperand(operand); ReleaseOperand(l);
  7134. ELSE HALT(100);
  7135. END;
  7136. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7137. (* ---- FIRST ---- *)
  7138. |Global.First:
  7139. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7140. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7141. ELSE
  7142. Designate(p0, result)
  7143. END
  7144. (* ---- LAST ---- *)
  7145. |Global.Last:
  7146. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7147. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7148. ELSE
  7149. Designate(p0, result);
  7150. (* make sure result.op is a register *)
  7151. tmp := result.op;
  7152. ReuseCopy(result.op, result.op);
  7153. ReleaseIntermediateOperand(tmp);
  7154. (* add offset to result.op *)
  7155. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7156. END
  7157. (* ---- STEP ---- *)
  7158. |Global.Step:
  7159. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7160. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7161. ELSE
  7162. Designate(p0, result);
  7163. (* make sure result.op is a register *)
  7164. tmp := result.op;
  7165. ReuseCopy(result.op, result.op);
  7166. ReleaseIntermediateOperand(tmp);
  7167. (* add offset to result.op *)
  7168. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7169. END
  7170. (* ---- RE ---- *)
  7171. |Global.Re:
  7172. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7173. Designate(p0, result)
  7174. ELSE
  7175. Evaluate(p0, result)
  7176. END
  7177. (* ---- IM ---- *)
  7178. |Global.Im:
  7179. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7180. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7181. Designate(p0, result);
  7182. (* make sure result.op is a register *)
  7183. tmp := result.op;
  7184. ReuseCopy(result.op, result.op);
  7185. ReleaseIntermediateOperand(tmp);
  7186. (* add offset to result.op *)
  7187. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7188. (* ---- ABS ----- *)
  7189. |Global.Abs:
  7190. Evaluate(p0,operand);
  7191. type := p0.type.resolved;
  7192. InitOperand(result,ModeValue);
  7193. Reuse1a(result.op,operand.op,dest);
  7194. Emit(Abs(position,result.op,operand.op));
  7195. ReleaseOperand(operand);
  7196. (* ---- WAIT ----- *)
  7197. |Global.Wait:
  7198. Evaluate(p0,operand);
  7199. Emit(Push(position,operand.op));
  7200. ReleaseOperand(operand);
  7201. CallThis(position,"Activities","Wait", 1);
  7202. (* ---- NEW ----- *)
  7203. |Global.New:
  7204. (*! the following code is only correct for "standard" Oberon calling convention *)
  7205. IF x.type # NIL THEN
  7206. type := x.type.resolved;
  7207. firstPar := 0;
  7208. ELSE
  7209. type := p0.type.resolved;
  7210. firstPar := 1;
  7211. END;
  7212. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7213. THEN
  7214. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7215. IF backend.cooperative THEN
  7216. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7217. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7218. IF recordType.isObject THEN
  7219. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7220. IF recordType.IsActive() THEN
  7221. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7222. END;
  7223. IF recordType.IsProtected() THEN
  7224. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7225. END;
  7226. ELSE
  7227. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7228. END;
  7229. END;
  7230. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7231. CallThis(position,"Runtime","New", 1);
  7232. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7233. Emit(Result(position, pointer));
  7234. exit := NewLabel();
  7235. BreqL(exit,pointer,nil);
  7236. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7237. GetRecordTypeName (recordType,name);
  7238. IF ~recordType.isObject THEN
  7239. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7240. END;
  7241. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7242. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7243. IF recordType.isObject THEN
  7244. IF recordType.IsProtected() THEN
  7245. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7246. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7247. END;
  7248. IF recordType.IsActive() THEN
  7249. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7250. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7251. END;
  7252. END;
  7253. END;
  7254. (* initialize fields *)
  7255. IF type(SyntaxTree.PointerType).isPlain THEN
  7256. size := 0;
  7257. ELSIF recordType.isObject THEN
  7258. size := BaseObjectTypeSize;
  7259. ELSE
  7260. size := BaseRecordTypeSize;
  7261. END;
  7262. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7263. (* call initializer *)
  7264. constructor := GetConstructor(recordType);
  7265. IF constructor # NIL THEN
  7266. (*! should be unified with ProcedureCallDesignator *)
  7267. Emit(Push(position,pointer));
  7268. ReleaseIntermediateOperand(pointer);
  7269. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7270. FOR i := firstPar TO x.parameters.Length()-1 DO
  7271. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7272. formalParameter := formalParameter.nextParameter;
  7273. END;
  7274. (* static call of the constructor *)
  7275. GetCodeSectionNameForSymbol(constructor,name);
  7276. ASSERT(~constructor.isInline);
  7277. IF constructor.scope.ownerModule # module.module THEN
  7278. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7279. ELSE
  7280. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7281. END;
  7282. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7283. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7284. Emit(Pop(position,pointer));
  7285. END;
  7286. (* call bodies *)
  7287. CallBodies(pointer,type);
  7288. SetLabel(exit);
  7289. needsTrace := p0.NeedsTrace();
  7290. IF needsTrace THEN ModifyAssignments(true) END;
  7291. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7292. Emit(Push(position, pointer));
  7293. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7294. Emit(Pop(position, pointer));
  7295. END;
  7296. Designate(p0,l);
  7297. IF needsTrace THEN
  7298. CallAssignPointer(l.op, pointer);
  7299. ELSE
  7300. ToMemory(l.op,addressType,0);
  7301. Emit(Mov(position,l.op,pointer));
  7302. END;
  7303. ReleaseIntermediateOperand(pointer);
  7304. ReleaseOperand(l);
  7305. IF needsTrace THEN ModifyAssignments(false) END;
  7306. ELSE (* not cooperative backend *)
  7307. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7308. IF temporaryVariable # NIL THEN
  7309. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7310. ELSE
  7311. Designate(p0,l);
  7312. END;
  7313. (* l.op contains address of pointer to record *)
  7314. Emit(Push(position,l.op)); (* address for use after syscall *)
  7315. Emit(Push(position,l.op));
  7316. ReleaseOperand(l);
  7317. (* push type descriptor *)
  7318. reg := TypeDescriptorAdr(recordType);
  7319. IF ~newObjectFile THEN
  7320. IntermediateCode.MakeMemory(reg,addressType);
  7321. END;
  7322. Emit(Push(position,reg));
  7323. ReleaseIntermediateOperand(reg);
  7324. (* push realtime flag *)
  7325. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7326. ELSE Emit(Push(position,false));
  7327. END;
  7328. CallThis(position,"Heaps","NewRec", 3);
  7329. (* check allocation success, if not successful then do not call initializers and bodies *)
  7330. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7331. Emit(Pop(position,pointer));
  7332. MakeMemory(reg,pointer,addressType,0);
  7333. ReleaseIntermediateOperand(pointer);
  7334. pointer := reg;
  7335. exit := NewLabel();
  7336. BreqL(exit,pointer,nil);
  7337. Emit(Push(position,pointer));
  7338. (* initialize fields *)
  7339. InitFields(recordType, pointer,0);
  7340. (* call initializer *)
  7341. constructor := GetConstructor(recordType);
  7342. IF constructor # NIL THEN
  7343. (*! should be unified with ProcedureCallDesignator *)
  7344. Emit(Push(position,pointer));
  7345. ReleaseIntermediateOperand(pointer);
  7346. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7347. FOR i := firstPar TO x.parameters.Length()-1 DO
  7348. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7349. formalParameter := formalParameter.nextParameter;
  7350. END;
  7351. (* static call of the constructor *)
  7352. GetCodeSectionNameForSymbol(constructor,name);
  7353. ASSERT(~constructor.isInline);
  7354. IF constructor.scope.ownerModule # module.module THEN
  7355. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7356. ELSE
  7357. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7358. END;
  7359. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7360. ELSE
  7361. ReleaseIntermediateOperand(pointer);
  7362. END;
  7363. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7364. Emit(Pop(position,pointer));
  7365. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7366. Designate(p0,l);
  7367. IF backend.writeBarriers & OnHeap(p0) THEN
  7368. SaveRegisters();ReleaseUsedRegisters(saved);
  7369. Emit(Push(position,l.op));
  7370. Emit(Push(position,pointer));
  7371. CallThis(position,"Heaps","Assign",2);
  7372. RestoreRegisters(saved);
  7373. ELSE
  7374. ToMemory(l.op,addressType,0);
  7375. Emit(Mov(position,l.op,pointer));
  7376. END;
  7377. ReleaseOperand(l);
  7378. result.tag := emptyOperand;
  7379. ELSIF (x.type # NIL) THEN
  7380. result := l; (* temporary variable is the result of NEW Type() *)
  7381. END;
  7382. (* call bodies *)
  7383. CallBodies(pointer,type);
  7384. ReleaseIntermediateOperand(pointer);
  7385. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7386. end := NewLabel();
  7387. BrL(end);
  7388. SetLabel(exit);
  7389. Designate(p0,l);
  7390. ToMemory(l.op,addressType,0);
  7391. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7392. ReleaseOperand(l);
  7393. SetLabel(end);
  7394. ELSE
  7395. SetLabel(exit);
  7396. END;
  7397. END;
  7398. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7399. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7400. IF ~backend.cooperative THEN (* simpler version *)
  7401. (*
  7402. push len0
  7403. push len1
  7404. push len2
  7405. push len_size
  7406. push len_adr
  7407. push tag
  7408. push static elements
  7409. push element size
  7410. push adr
  7411. *)
  7412. dim := 0;
  7413. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7414. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7415. parameter := x.parameters.GetExpression(i);
  7416. Evaluate(parameter,r);
  7417. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7418. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7419. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7420. END;
  7421. Emit(Push(position,r.op));
  7422. ReleaseOperand(r);
  7423. INC(dim);
  7424. END;
  7425. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7426. Emit(Mov(position, adr, sp));
  7427. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7428. Emit(Push(position, adr));
  7429. ReleaseIntermediateOperand(adr);
  7430. openDim := dim;
  7431. staticLength := 1;
  7432. IF type IS SyntaxTree.ArrayType THEN
  7433. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7434. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7435. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7436. END;
  7437. END;
  7438. IF SemanticChecker.ContainsPointer(type) THEN
  7439. tmp := TypeDescriptorAdr(type);
  7440. IF ~newObjectFile THEN
  7441. IntermediateCode.MakeMemory(tmp,addressType);
  7442. END;
  7443. ELSE
  7444. tmp := nil;
  7445. END;
  7446. Emit(Push(position,tmp)); (* type descriptor *)
  7447. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7448. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7449. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7450. Designate(p0,l);
  7451. Emit(Push(position,l.op)); (* address *)
  7452. ReleaseOperand(l);
  7453. CallThis(position,"Heaps","NewArray", 6);
  7454. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7455. Emit(Add(position,sp,sp,tmp));
  7456. ELSE
  7457. dim := 0;
  7458. IntermediateCode.InitOperand(reg);
  7459. IF p1 # NIL THEN
  7460. FOR i := firstPar TO x.parameters.Length()-1 DO
  7461. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7462. parameter := x.parameters.GetExpression(i);
  7463. Evaluate(parameter,r);
  7464. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7465. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7466. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7467. END;
  7468. Emit(Push(position,r.op));
  7469. IF i=1 THEN
  7470. CopyInt(reg,r.op);
  7471. ELSE
  7472. MulInt(reg, reg, r.op);
  7473. END;
  7474. ReleaseOperand(r);
  7475. INC(dim);
  7476. END;
  7477. Convert(reg,addressType);
  7478. ELSE
  7479. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7480. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7481. END;
  7482. openDim := dim;
  7483. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7484. IF backend.cooperative THEN
  7485. size := ToMemoryUnits(system,system.SizeOf(type));
  7486. WHILE type IS SyntaxTree.ArrayType DO
  7487. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7488. END;
  7489. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7490. IF (size # 1) THEN
  7491. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7492. END;
  7493. Emit(Push(position,reg));
  7494. size := ToMemoryUnits(system,system.SizeOf(type));
  7495. IF (size # 1) THEN
  7496. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7497. END;
  7498. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7499. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7500. Emit(Push(position,reg));
  7501. ReleaseIntermediateOperand(reg);
  7502. CallThis(position,"Runtime","New", 1);
  7503. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7504. Emit(Result(position, pointer));
  7505. exit := NewLabel();
  7506. else := NewLabel();
  7507. BreqL(else,pointer,nil);
  7508. IF ~type.hasPointers THEN
  7509. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7510. ELSIF type IS SyntaxTree.RecordType THEN
  7511. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7512. ELSIF type IS SyntaxTree.ProcedureType THEN
  7513. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7514. ELSE
  7515. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7516. END;
  7517. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7518. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7519. 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))));
  7520. IF type IS SyntaxTree.RecordType THEN
  7521. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7522. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7523. ELSE
  7524. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7525. END;
  7526. i := openDim;
  7527. WHILE i > 0 DO
  7528. DEC (i);
  7529. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7530. END;
  7531. needsTrace := p0.NeedsTrace();
  7532. IF needsTrace THEN ModifyAssignments(true) END;
  7533. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7534. Emit(Push(position, pointer));
  7535. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7536. Emit(Pop(position, pointer));
  7537. END;
  7538. Designate(p0,l);
  7539. IF needsTrace THEN
  7540. CallAssignPointer(l.op, pointer);
  7541. ModifyAssignments(false);
  7542. ELSE
  7543. ToMemory(l.op,addressType,0);
  7544. Emit(Mov(position,l.op,pointer));
  7545. END;
  7546. ReleaseIntermediateOperand(pointer);
  7547. ReleaseOperand(l);
  7548. BrL(exit);
  7549. SetLabel(else);
  7550. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7551. Designate(p0,l);
  7552. IF needsTrace THEN
  7553. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7554. ELSE
  7555. ToMemory(l.op,addressType,0);
  7556. Emit(Mov(position,l.op,pointer));
  7557. END;
  7558. ReleaseOperand(l);
  7559. SetLabel(exit);
  7560. ELSE
  7561. (*! the following code is only correct for "standard" Oberon calling convention *)
  7562. IF SemanticChecker.ContainsPointer(type) THEN
  7563. IF type IS SyntaxTree.ArrayType THEN
  7564. staticLength := 1;
  7565. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7566. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7567. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7568. END;
  7569. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7570. MulInt(reg,reg,tmp);
  7571. END;
  7572. Designate(p0,l);
  7573. IF openDim > 0 THEN
  7574. Emit(Push(position,l.op)); (* address for use after syscall *)
  7575. END;
  7576. Emit(Push(position,l.op)); (* address *)
  7577. ReleaseOperand(l);
  7578. tmp := TypeDescriptorAdr(type);
  7579. IF ~newObjectFile THEN
  7580. IntermediateCode.MakeMemory(tmp,addressType);
  7581. END;
  7582. Emit(Push(position,tmp)); (* type descriptor *)
  7583. ReleaseIntermediateOperand(tmp);
  7584. Emit(Push(position,reg)); (* number Elements *)
  7585. ReleaseIntermediateOperand(reg);
  7586. tmp := IntermediateCode.Immediate(addressType,dim);
  7587. Emit(Push(position,tmp)); (* dimensions *)
  7588. (* push realtime flag *)
  7589. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7590. ELSE Emit(Push(position,false));
  7591. END;
  7592. CallThis(position,"Heaps","NewArr",5)
  7593. ELSE
  7594. size := ToMemoryUnits(system,system.SizeOf(type));
  7595. IF (size # 1) THEN
  7596. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7597. (*
  7598. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7599. *)
  7600. END;
  7601. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7602. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7603. AddInt(reg, reg, tmp);
  7604. (*
  7605. Emit(Add(position,reg,reg,tmp));
  7606. *)
  7607. Designate(p0,l);
  7608. IF openDim >0 THEN
  7609. Emit(Push(position,l.op)); (* address for use after syscall *)
  7610. END;
  7611. Emit(Push(position,l.op)); (* address for syscall *)
  7612. ReleaseOperand(l); (* pointer address *)
  7613. Emit(Push(position,reg)); (* size *)
  7614. ReleaseIntermediateOperand(reg);
  7615. (* push realtime flag *)
  7616. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7617. ELSE Emit(Push(position,false));
  7618. END;
  7619. CallThis(position,"Heaps","NewSys", 3)
  7620. END;
  7621. IF openDim > 0 THEN
  7622. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7623. Emit(Pop(position,adr));
  7624. ToMemory(adr,addressType,0);
  7625. ReuseCopy(tmp,adr);
  7626. ReleaseIntermediateOperand(adr);
  7627. adr := tmp;
  7628. else := NewLabel();
  7629. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7630. i := openDim-1;
  7631. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7632. WHILE (i >= 0) DO
  7633. Emit(Pop(position,reg));
  7634. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7635. Emit(Mov(position,res,reg));
  7636. DEC(i);
  7637. END;
  7638. ReleaseIntermediateOperand(adr);
  7639. ReleaseIntermediateOperand(reg);
  7640. exit := NewLabel();
  7641. BrL(exit);
  7642. SetLabel(else);
  7643. (* else part: array could not be allocated *)
  7644. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7645. Emit(Add(position,sp,sp,tmp));
  7646. SetLabel(exit);
  7647. END;
  7648. END;
  7649. END;
  7650. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7651. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7652. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7653. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7654. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7655. left.SetType(procedure.type);
  7656. formalParameter := procedureType.firstParameter;
  7657. (* push array to allocate *)
  7658. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7659. formalParameter :=formalParameter.nextParameter;
  7660. (* push length array *)
  7661. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7662. (* push size *)
  7663. type := t0;
  7664. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7665. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7666. END;
  7667. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7668. Emit(Push(position,tmp));
  7669. (* *)
  7670. IF SemanticChecker.ContainsPointer(type) THEN
  7671. tmp := TypeDescriptorAdr(type);
  7672. IF ~newObjectFile THEN
  7673. IntermediateCode.MakeMemory(tmp,addressType);
  7674. END;
  7675. ELSE
  7676. tmp := IntermediateCode.Immediate(addressType, 0);
  7677. END;
  7678. Emit(Push(position,tmp)); (* type descriptor *)
  7679. StaticCallOperand(result,procedure);
  7680. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7681. ReleaseOperand(result);
  7682. END;
  7683. (*
  7684. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7685. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7686. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7687. *)
  7688. ELSE
  7689. (*
  7690. push len0
  7691. push len1
  7692. push len2
  7693. push size
  7694. push len_adr
  7695. push element_size
  7696. push tag
  7697. push adr
  7698. *)
  7699. dim := 0;
  7700. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7701. isTensor := TRUE;
  7702. ELSE
  7703. isTensor := FALSE;
  7704. END;
  7705. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7706. IF ~isTensor THEN
  7707. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7708. END;
  7709. parameter := x.parameters.GetExpression(i);
  7710. Evaluate(parameter,r);
  7711. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7712. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7713. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7714. END;
  7715. Emit(Push(position,r.op));
  7716. ReleaseOperand(r);
  7717. INC(dim);
  7718. END;
  7719. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7720. Emit(Mov(position, adr, sp));
  7721. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7722. Emit(Push(position, adr));
  7723. ReleaseIntermediateOperand(adr);
  7724. openDim := dim;
  7725. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7726. IF isTensor THEN
  7727. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7728. ELSE
  7729. baseType := SemanticChecker.ArrayBase(type,openDim);
  7730. END;
  7731. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7732. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7733. IF SemanticChecker.ContainsPointer(baseType) THEN
  7734. tmp := TypeDescriptorAdr(baseType);
  7735. IF ~newObjectFile THEN
  7736. IntermediateCode.MakeMemory(tmp,addressType);
  7737. END;
  7738. ELSE
  7739. tmp := nil;
  7740. END;
  7741. Emit(Push(position,tmp)); (* type descriptor *)
  7742. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7743. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7744. ELSE (* error message has already been emited *)
  7745. RETURN;
  7746. END;
  7747. Designate(p0,l);
  7748. IF isTensor THEN
  7749. Emit(Push(position,l.op)); (* address *)
  7750. ELSE
  7751. Emit(Push(position,l.tag)); (* address *)
  7752. END;
  7753. ReleaseOperand(l);
  7754. StaticCallOperand(result,procedure);
  7755. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7756. ReleaseOperand(result);
  7757. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7758. Emit(Add(position,sp,sp,tmp));
  7759. END;
  7760. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7761. THEN
  7762. IF ~backend.cellsAreObjects THEN RETURN END;
  7763. IF InCellScope(currentScope) THEN
  7764. PushSelfPointer()
  7765. ELSE
  7766. Emit(Push(position, nil));
  7767. END;
  7768. (* push temp address *)
  7769. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7770. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7771. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7772. (* l.op contains address of pointer to record *)
  7773. Emit(Push(position,l.op)); (* address for use after syscall *)
  7774. ReleaseOperand(l);
  7775. (* push type descriptor *)
  7776. reg := TypeDescriptorAdr(baseType);
  7777. IF ~newObjectFile THEN
  7778. IntermediateCode.MakeMemory(reg,addressType);
  7779. END;
  7780. Emit(Push(position,reg));
  7781. ReleaseIntermediateOperand(reg);
  7782. (* push name *)
  7783. (*Global.GetSymbolName(p0, n);*)
  7784. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7785. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7786. ELSE
  7787. Global.GetModuleName(module.module, n);
  7788. END;
  7789. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  7790. (*type.typeDeclaration.GetName(n);*)
  7791. PushConstString(n);
  7792. (* push cellnet boolean *)
  7793. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7794. (* push engine boolean *)
  7795. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7796. (* allocate *)
  7797. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7798. (* add capabilities *)
  7799. modifier := p0(SyntaxTree.Designator).modifiers;
  7800. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7801. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7802. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7803. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7804. END;
  7805. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7806. (*
  7807. modifier := baseType(SyntaxTree.CellType).modifiers;
  7808. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7809. modifier := p0(SyntaxTree.Designator).modifiers;
  7810. *)
  7811. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7812. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7813. (* l.op contains address of pointer to record *)
  7814. ToMemory(l.op,addressType,0);
  7815. (* l.op contains value of pointer to record *)
  7816. Emit(Push(position,l.op)); (* address for use after syscall *)
  7817. ReleaseOperand(l);
  7818. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7819. prevScope := currentScope;
  7820. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7821. previous := section;
  7822. section := init;
  7823. (* add ports *)
  7824. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7825. CloseInitializer(previous);
  7826. currentScope := prevScope;
  7827. Symbol(temporaryVariable,l);
  7828. ToMemory(l.op,addressType,0);
  7829. Emit(Push(position,l.op));
  7830. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7831. (*
  7832. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7833. IF constructor # NIL THEN
  7834. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7835. FOR i := 1 TO x.parameters.Length()-1 DO
  7836. p := x.parameters.GetExpression(i);
  7837. Global.GetSymbolName(parameter,name);
  7838. Evaluate(p, value);
  7839. ASSERT(value.type # NIL);
  7840. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7841. par := instance.AddParameter(name);
  7842. par.SetInteger(value.integer);
  7843. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7844. par := instance.AddParameter(name);
  7845. par.SetBoolean(value.boolean);
  7846. ELSE Error(x.position,NotYetImplemented)
  7847. END;
  7848. parameter := parameter.nextParameter
  7849. END;
  7850. END;
  7851. *)
  7852. (* call initializer *)
  7853. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7854. IF constructor # NIL THEN
  7855. (*! should be unified with ProcedureCallDesignator *)
  7856. IF backend.cellsAreObjects THEN
  7857. Symbol(temporaryVariable,l);
  7858. ToMemory(l.op,addressType,0);
  7859. Emit(Push(position,l.op));
  7860. ReleaseOperand(l);
  7861. END;
  7862. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7863. FOR i := firstPar TO x.parameters.Length()-1 DO
  7864. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7865. formalParameter := formalParameter.nextParameter;
  7866. END;
  7867. (* static call of the constructor *)
  7868. Global.GetSymbolSegmentedName(constructor,name);
  7869. ASSERT(~constructor.isInline);
  7870. IF constructor.scope.ownerModule # module.module THEN
  7871. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7872. ELSE
  7873. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7874. END;
  7875. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7876. (*ELSE
  7877. ReleaseIntermediateOperand(pointer);*)
  7878. END;
  7879. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7880. ToMemory(l.op, addressType, 0);
  7881. Designate(p0,s0);
  7882. ToMemory(s0.op,addressType,0);
  7883. Emit(Mov(position,s0.op,l.op));
  7884. ReleaseOperand(l);
  7885. ReleaseOperand(s0);
  7886. result.tag := emptyOperand;
  7887. (* start *)
  7888. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7889. (* push cell *)
  7890. Symbol(temporaryVariable, l);
  7891. ToMemory(l.op,addressType,0);
  7892. Emit(Push(Basic.invalidPosition,l.op));
  7893. (* push delegate *)
  7894. Emit(Push(Basic.invalidPosition,l.op));
  7895. ReleaseOperand(l);
  7896. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7897. Emit(Push(position, s1.op));
  7898. ReleaseOperand(s1);
  7899. CallThis(position,"ActiveCellsRuntime","Start",3);
  7900. END;
  7901. (*IF temporaryVariable # NIL THEN
  7902. end := NewLabel();
  7903. BrL(end);
  7904. SetLabel(exit);
  7905. Designate(p0,l);
  7906. ToMemory(l.op,addressType,0);
  7907. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7908. ReleaseOperand(l);
  7909. SetLabel(end);
  7910. ELSE
  7911. SetLabel(exit);
  7912. END;
  7913. *)
  7914. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7915. ELSE (* no pointer to record, no pointer to array *)
  7916. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7917. (* ignore new statement *)
  7918. Warning(p0.position, "cannot run on final hardware");
  7919. ELSE
  7920. HALT(200);
  7921. END;
  7922. END;
  7923. (* ---- ADDRESSOF----- *)
  7924. |Global.systemAdr:
  7925. Designate(p0,s0);
  7926. s0.mode := ModeValue;
  7927. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7928. ReleaseIntermediateOperand(s0.op);
  7929. s0.op := s0.tag;
  7930. IntermediateCode.InitOperand(s0.tag);
  7931. END;
  7932. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7933. result := s0;
  7934. (* ---- BIT ----- *)
  7935. |Global.systemBit:
  7936. Evaluate(p0,s0);
  7937. ToMemory(s0.op,addressType,0);
  7938. ReuseCopy(res,s0.op);
  7939. ReleaseOperand(s0);
  7940. Evaluate(p1,s1);
  7941. Emit(Ror(position,res,res,s1.op));
  7942. ReleaseOperand(s1);
  7943. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7944. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7945. IF ~conditional THEN
  7946. InitOperand(result,ModeValue); result.op := res;
  7947. ELSE
  7948. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7949. BrL(falseLabel);
  7950. ReleaseIntermediateOperand(res);
  7951. END;
  7952. (* --- MSK ----*)
  7953. |Global.systemMsk:
  7954. Evaluate(p0,s0);
  7955. Evaluate(p1,s1);
  7956. ReuseCopy(res,s0.op);
  7957. ReleaseOperand(s0);
  7958. Emit(And(position,res,res,s1.op));
  7959. ReleaseOperand(s1);
  7960. InitOperand(result,ModeValue);
  7961. result.op := res;
  7962. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  7963. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  7964. Evaluate(p0,s0);
  7965. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  7966. ReleaseOperand(s0);
  7967. InitOperand(result,ModeValue);
  7968. result.op := res;
  7969. (* ---- SYSTEM.GetStackPointer ----- *)
  7970. |Global.systemGetStackPointer:
  7971. InitOperand(result,ModeValue);
  7972. result.op := sp;
  7973. (* ---- SYSTEM.GetFramePointer ----- *)
  7974. |Global.systemGetFramePointer:
  7975. InitOperand(result,ModeValue);
  7976. result.op := fp;
  7977. (* ---- SYSTEM.GetActivity ----- *)
  7978. |Global.systemGetActivity:
  7979. ASSERT(backend.cooperative);
  7980. InitOperand(result,ModeValue);
  7981. result.op := ap;
  7982. (* ---- SYSTEM.SetStackPointer ----- *)
  7983. |Global.systemSetStackPointer:
  7984. Evaluate(p0,s0); (* *)
  7985. Emit(Mov(position,sp,s0.op));
  7986. ReleaseOperand(s0);
  7987. (* ---- SYSTEM.SetFramePointer ----- *)
  7988. |Global.systemSetFramePointer:
  7989. Evaluate(p0,s0); (* *)
  7990. Emit(Mov(position,fp,s0.op));
  7991. ReleaseOperand(s0);
  7992. (* ---- SYSTEM.Activity ----- *)
  7993. |Global.systemSetActivity:
  7994. ASSERT(backend.cooperative);
  7995. Evaluate(p0,s0); (* *)
  7996. Emit(Mov(position,ap,s0.op));
  7997. ReleaseOperand(s0);
  7998. (* ---- SYSTEM.VAL ----- *)
  7999. |Global.systemVal:
  8000. Expression(p1);
  8001. s1 := result;
  8002. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8003. IF s1.mode = ModeReference THEN
  8004. (* nothing to be done if not record type, just take over new type *)
  8005. IF (type IS SyntaxTree.RecordType) THEN
  8006. ReleaseIntermediateOperand(s1.tag);
  8007. s1.tag := TypeDescriptorAdr(type);
  8008. IF ~newObjectFile THEN
  8009. IntermediateCode.MakeMemory(s1.tag,addressType);
  8010. END;
  8011. UseIntermediateOperand(s1.tag);
  8012. END;
  8013. result := s1;
  8014. ELSE (* copy over result to different type, may not use convert *)
  8015. itype := IntermediateCode.GetType(system,type);
  8016. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8017. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8018. Emit(Mov(position,s0.op,s1.op));
  8019. ReleaseOperand(s1);
  8020. InitOperand(result,ModeValue);
  8021. result.op := s0.op;
  8022. ELSE (* different size, must convert *)
  8023. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8024. Convert(s1.op, IntermediateCode.GetType(system,type));
  8025. result := s1;
  8026. END;
  8027. END;
  8028. (* ---- SYSTEM.GET ----- *)
  8029. |Global.systemGet:
  8030. Evaluate(p0,s0); (* adr *)
  8031. Designate(p1,s1); (* variable *)
  8032. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8033. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8034. Emit(Mov(position,s1.op,s0.op));
  8035. ReleaseOperand(s1);
  8036. ReleaseOperand(s0);
  8037. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8038. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8039. Evaluate(p0,s0); (* *)
  8040. Evaluate(p1,s1); (* variable *)
  8041. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8042. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8043. (* real part *)
  8044. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8045. Emit(Mov(position,res, s1.op));
  8046. ReleaseIntermediateOperand(res);
  8047. (* imaginary part *)
  8048. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8049. Emit(Mov(position,res, s1.tag));
  8050. ReleaseIntermediateOperand(res);
  8051. ReleaseOperand(s1);
  8052. ReleaseOperand(s0);
  8053. ELSE
  8054. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8055. ReleaseOperand(s0);
  8056. Emit(Mov(position,res,s1.op));
  8057. ReleaseIntermediateOperand(res);
  8058. ReleaseOperand(s1);
  8059. END;
  8060. (* ---- SYSTEM.MOVE ----- *)
  8061. |Global.systemMove:
  8062. Evaluate(p0,s0);
  8063. Evaluate(p1,s1);
  8064. Evaluate(p2,s2);
  8065. Emit(Copy(position,s1.op,s0.op,s2.op));
  8066. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8067. (* ---- SYSTEM.NEW ----- *)
  8068. |Global.systemNew:
  8069. Designate(p0,s0);
  8070. Emit(Push(position,s0.op));
  8071. ReleaseOperand(s0);
  8072. Evaluate(p1,s1);
  8073. Emit(Push(position,s1.op));
  8074. ReleaseOperand(s1);
  8075. (* push realtime flag: false by default *)
  8076. Emit(Push(position,false));
  8077. CallThis(position,"Heaps","NewSys",3);
  8078. (* ---- SYSTEM.CALL ----- *)
  8079. |Global.systemRef:
  8080. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8081. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8082. s0.mode := ModeValue;
  8083. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8084. result := s0
  8085. (* ---- INCR ----- *)
  8086. |Global.Incr:
  8087. Designate(p0,operand);
  8088. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8089. Dereference(operand,p0.type.resolved,FALSE);
  8090. END;
  8091. ASSERT(p1 # NIL);
  8092. Evaluate(p1,l);
  8093. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8094. ReleaseOperand(operand); ReleaseOperand(l);
  8095. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8096. (* ---- SUM ----- *)
  8097. |Global.Sum: HALT(200);
  8098. (* ---- ALL ----- *)
  8099. |Global.All: HALT(200);
  8100. (* ---- CAS ----- *)
  8101. |Global.Cas:
  8102. needsTrace := p0.NeedsTrace();
  8103. IF needsTrace THEN ModifyAssignments(true) END;
  8104. Designate(p0,s0);
  8105. Evaluate(p1,s1);
  8106. Evaluate(p2,s2);
  8107. IF needsTrace THEN
  8108. Emit(Push(position, s0.op));
  8109. Emit(Push(position, s1.op));
  8110. Emit(Push(position, s2.op));
  8111. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8112. ELSE
  8113. Emit(Cas(position,s0.op,s1.op,s2.op));
  8114. END;
  8115. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8116. IF needsTrace THEN ModifyAssignments(false) END;
  8117. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8118. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  8119. IF conditional THEN
  8120. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8121. BrL(falseLabel);
  8122. ReleaseIntermediateOperand(res);
  8123. END;
  8124. (* ---- DIM ----- *)
  8125. |Global.Dim:
  8126. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8127. Designate(p0,s0);
  8128. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8129. Dereference(s0,p0.type.resolved,FALSE);
  8130. END;
  8131. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8132. ReleaseOperand(s0);
  8133. (* ---- RESHAPE ----- *)
  8134. |Global.Reshape:
  8135. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8136. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8137. left.SetType(procedure.type);
  8138. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8139. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8140. END;
  8141. (* ---- SYSTEM.TYPECODE ----- *)
  8142. |Global.systemTypeCode:
  8143. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8144. IF type.resolved IS SyntaxTree.PointerType THEN
  8145. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8146. END;
  8147. result.op := TypeDescriptorAdr(type);
  8148. IF ~newObjectFile THEN
  8149. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  8150. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  8151. END;
  8152. result.mode := ModeValue;
  8153. (* ---- SYSTEM.TRACE ----- *)
  8154. |Global.systemTrace:
  8155. SystemTrace(x.parameters, x.position);
  8156. (* ----- CONNECT ------*)
  8157. |Global.Connect:
  8158. IF backend.cellsAreObjects THEN
  8159. PushPort(p0);
  8160. PushPort(p1);
  8161. IF p2 # NIL THEN
  8162. Evaluate(p2, s2);
  8163. Emit(Push(p2.position, s2.op));
  8164. ReleaseOperand(s2);
  8165. ELSE
  8166. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8167. END;
  8168. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8169. ELSE
  8170. Warning(x.position, "cannot run on final hardware");
  8171. END;
  8172. (* ----- DELEGATE ------*)
  8173. |Global.Delegate:
  8174. IF backend.cellsAreObjects THEN
  8175. PushPort(p0);
  8176. PushPort(p1);
  8177. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8178. ELSE
  8179. Warning(x.position, "cannot run on final hardware");
  8180. END;
  8181. (* ----- SEND ------*)
  8182. |Global.Send:
  8183. Evaluate(p0,s0);
  8184. Evaluate(p1,s1);
  8185. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8186. Emit(Push(position,s0.op));
  8187. Emit(Push(position,s1.op));
  8188. (*
  8189. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8190. *)
  8191. IF ~backend.cellsAreObjects THEN
  8192. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8193. END;
  8194. ReleaseOperand(s0);
  8195. ReleaseOperand(s1);
  8196. IF backend.cellsAreObjects THEN
  8197. CallThis(position,"ActiveCellsRuntime","Send",2);
  8198. ELSE
  8199. CallThis(position,ChannelModuleName,"Send",2);
  8200. END;
  8201. (* ----- RECEIVE ------*)
  8202. |Global.Receive:
  8203. Evaluate(p0,s0);
  8204. Emit(Push(position,s0.op));
  8205. Designate(p1,s1);
  8206. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8207. Emit(Push(position,s1.op));
  8208. IF p2 # NIL THEN
  8209. Designate(p2,s2);
  8210. Emit(Push(position,s2.op));
  8211. END;
  8212. (*
  8213. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8214. *)
  8215. IF ~backend.cellsAreObjects THEN
  8216. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8217. END;
  8218. ReleaseOperand(s0);
  8219. ReleaseOperand(s1);
  8220. ReleaseOperand(s2);
  8221. IF backend.cellsAreObjects THEN
  8222. IF p2 = NIL THEN
  8223. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8224. ELSE
  8225. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8226. END;
  8227. ELSE
  8228. IF p2 = NIL THEN
  8229. CallThis(position,ChannelModuleName,"Receive",2)
  8230. ELSE
  8231. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8232. END;
  8233. END;
  8234. | Global.systemSpecial:
  8235. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8236. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8237. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8238. (* determine if parameters are of the VAR kind *)
  8239. ASSERT(x.parameters.Length() <= 3);
  8240. formalParameter := procedureType.firstParameter;
  8241. FOR i := 0 TO x.parameters.Length() - 1 DO
  8242. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8243. formalParameter := formalParameter.nextParameter
  8244. END;
  8245. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8246. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8247. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8248. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8249. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8250. IF procedureType.returnType # NIL THEN
  8251. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8252. Emit(Result(position, res));
  8253. (*InitOperand(result,ModeValue);
  8254. result.op := res;
  8255. *)
  8256. IF ~conditional THEN
  8257. InitOperand(result,ModeValue); result.op := res;
  8258. ELSE
  8259. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8260. BrL(falseLabel);
  8261. ReleaseIntermediateOperand(res);
  8262. END;
  8263. END
  8264. ELSE (* function not yet implemented *)
  8265. Error(position,"not yet implemented");
  8266. END;
  8267. destination := dest;
  8268. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8269. END VisitBuiltinCallDesignator;
  8270. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  8271. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8272. BEGIN
  8273. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8274. dest := destination; destination := emptyOperand;
  8275. Expression(x.left);
  8276. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8277. ELSIF isUnchecked THEN (* no check *)
  8278. ELSE
  8279. trueL := NewLabel();
  8280. falseL := NewLabel();
  8281. IF IsPointerToRecord(x.left.type,recordType) THEN
  8282. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8283. Emit(Mov(position,tag, result.op));
  8284. IF result.mode # ModeValue THEN
  8285. ptr := tag;
  8286. IntermediateCode.MakeMemory(ptr,addressType);
  8287. Emit(Mov(position,tag, ptr));
  8288. END;
  8289. IF ~backend.cooperative THEN
  8290. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8291. END;
  8292. IntermediateCode.MakeMemory(tag,addressType);
  8293. ELSE
  8294. tag := result.tag;
  8295. UseIntermediateOperand(tag);
  8296. END;
  8297. TypeTest(tag,x.type,trueL,falseL);
  8298. ReleaseIntermediateOperand(tag);
  8299. SetLabel(falseL);
  8300. EmitTrap(position,TypeCheckTrap);
  8301. SetLabel(trueL);
  8302. END;
  8303. destination := dest;
  8304. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8305. END VisitTypeGuardDesignator;
  8306. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8307. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8308. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8309. VAR label: Label; pc: LONGINT;
  8310. BEGIN
  8311. IF backend.cooperative & ~isUnchecked THEN
  8312. pc := section.pc;
  8313. label := NewLabel();
  8314. BrneL(label, operand.op, nil);
  8315. EmitTrap(position, NilPointerTrap);
  8316. SetLabel(label);
  8317. INC(statCoopNilCheck, section.pc - pc);
  8318. END;
  8319. END NilCheck;
  8320. BEGIN
  8321. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8322. ReuseCopy(dereferenced,operand.op);
  8323. ReleaseOperand(operand);
  8324. operand.mode := ModeReference;
  8325. operand.op := dereferenced;
  8326. operand.tag := dereferenced;
  8327. UseIntermediateOperand(operand.tag);
  8328. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8329. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8330. ReleaseIntermediateOperand(operand.tag);
  8331. operand.tag := TypeDescriptorAdr(type);
  8332. IF ~newObjectFile THEN
  8333. IntermediateCode.MakeMemory(operand.tag,addressType);
  8334. END;
  8335. ELSE
  8336. IF ~backend.cooperative THEN
  8337. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8338. END;
  8339. IntermediateCode.MakeMemory(operand.tag,addressType);
  8340. END;
  8341. NilCheck(operand.op);
  8342. ELSIF type IS SyntaxTree.ArrayType THEN
  8343. IF isUnsafe THEN
  8344. NilCheck(operand.op);
  8345. ReleaseIntermediateOperand(operand.tag);
  8346. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8347. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8348. ELSE
  8349. operand.tag := emptyOperand;
  8350. END;
  8351. ELSE
  8352. NilCheck(operand.op);
  8353. IF backend.cooperative THEN
  8354. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8355. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8356. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8357. ELSE
  8358. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8359. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8360. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8361. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8362. END;
  8363. END;
  8364. ELSIF type IS SyntaxTree.MathArrayType THEN
  8365. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8366. IntermediateCode.MakeMemory(operand.op,addressType);
  8367. ELSE HALT(100);
  8368. END;
  8369. END Dereference;
  8370. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  8371. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8372. BEGIN
  8373. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8374. dest := destination; destination := emptyOperand;
  8375. Evaluate(x.left,d);
  8376. type := x.type.resolved;
  8377. prevIsUnchecked := isUnchecked;
  8378. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8379. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8380. END;
  8381. Dereference(d,type,IsUnsafePointer(x.left.type));
  8382. isUnchecked := prevIsUnchecked;
  8383. result := d;
  8384. 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
  8385. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8386. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8387. END;
  8388. END;
  8389. destination := dest;
  8390. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8391. END VisitDereferenceDesignator;
  8392. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  8393. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8394. BEGIN
  8395. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8396. dest := destination; destination := emptyOperand;
  8397. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8398. tag := result.op;
  8399. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8400. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8401. StaticCallOperand(result,procedure.super);
  8402. ReleaseIntermediateOperand(result.tag);
  8403. UseIntermediateOperand(tag); (* necessary ? *)
  8404. result.tag := tag;
  8405. destination := dest;
  8406. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8407. END VisitSupercallDesignator;
  8408. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  8409. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8410. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8411. name: Basic.SegmentedName;
  8412. procedure: SyntaxTree.Procedure;
  8413. procedureType: SyntaxTree.ProcedureType;
  8414. BEGIN
  8415. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8416. dest := destination; destination := emptyOperand;
  8417. scope := currentScope;
  8418. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8419. scope := scope.outerScope;
  8420. END;
  8421. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8422. IF newObjectFile THEN
  8423. moduleSection := meta.ModuleSection();
  8424. IF backend.cooperative THEN
  8425. moduleOffset := 0;
  8426. ELSE
  8427. moduleOffset := moduleSection.pc;
  8428. END;
  8429. result.mode := ModeValue;
  8430. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8431. ELSE
  8432. Symbol(moduleSelf,result);
  8433. IntermediateCode.MakeMemory(result.op,addressType);
  8434. END
  8435. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8436. result.mode := ModeValue;
  8437. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8438. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8439. ELSE
  8440. GetBaseRegister(basereg,currentScope,scope);
  8441. InitOperand(result,ModeReference);
  8442. result.op := basereg;
  8443. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8444. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8445. parametersSize := ProcedureParametersSize(system,procedure);
  8446. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8447. IF backend.cooperative THEN
  8448. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8449. END;
  8450. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8451. MakeMemory(result.op, result.op, addressType, 0);
  8452. END;
  8453. (* tag must be loaded when dereferencing SELF pointer *)
  8454. END;
  8455. destination := dest;
  8456. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8457. END VisitSelfDesignator;
  8458. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  8459. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8460. BEGIN
  8461. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8462. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8463. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8464. parameter := procedureType.returnParameter;
  8465. IF currentIsInline THEN
  8466. map := currentMapper.Get(NIL);
  8467. IF map # NIL THEN
  8468. Designate(map.to, result);
  8469. ELSE
  8470. HALT(200);
  8471. END;
  8472. RETURN;
  8473. END;
  8474. VisitParameter(parameter);
  8475. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8476. END VisitResultDesignator;
  8477. (** values *)
  8478. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  8479. BEGIN
  8480. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8481. IF conditional THEN
  8482. IF x.value THEN BrL(trueLabel)
  8483. ELSE BrL(falseLabel)
  8484. END;
  8485. ELSE
  8486. InitOperand(result,ModeValue);
  8487. IF x.value THEN result.op := true ELSE result.op := false END;
  8488. END;
  8489. END VisitBooleanValue;
  8490. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8491. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8492. BEGIN
  8493. Global.GetModuleSegmentedName(module.module, name);
  8494. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8495. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8496. RETURN section
  8497. END GetDataSection;
  8498. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8499. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8500. BEGIN
  8501. type := vop.type;
  8502. data := GetDataSection();
  8503. pc := EnterImmediate(data,vop);
  8504. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8505. IntermediateCode.MakeMemory(vop, type);
  8506. END GetImmediateMem;
  8507. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  8508. BEGIN
  8509. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8510. InitOperand(result,ModeValue);
  8511. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8512. IF ~supportedImmediate(result.op) &~inData THEN
  8513. GetImmediateMem(result.op)
  8514. END;
  8515. END VisitIntegerValue;
  8516. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  8517. BEGIN
  8518. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8519. InitOperand(result,ModeValue);
  8520. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8521. END VisitCharacterValue;
  8522. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  8523. BEGIN
  8524. IF Trace THEN TraceEnter("VisitSetValue") END;
  8525. InitOperand(result,ModeValue);
  8526. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8527. END VisitSetValue;
  8528. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  8529. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8530. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8531. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8532. BEGIN
  8533. numberElements := x.elements.Length();
  8534. FOR i := 0 TO numberElements-1 DO
  8535. expression := x.elements.GetExpression(i);
  8536. IF expression IS SyntaxTree.MathArrayExpression THEN
  8537. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8538. ELSE
  8539. inData := TRUE;
  8540. Evaluate(expression,op);
  8541. irv.Emit(Data(position,op.op));
  8542. inData := FALSE;
  8543. ReleaseOperand(op);
  8544. END;
  8545. END;
  8546. END RecursiveData;
  8547. BEGIN
  8548. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8549. IF ~TryConstantDeclaration() THEN
  8550. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8551. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8552. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8553. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8554. ELSE
  8555. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8556. END;
  8557. RecursiveData(x.array);
  8558. InitOperand(result,ModeReference);
  8559. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8560. END
  8561. END VisitMathArrayValue;
  8562. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8563. VAR constant: Sections.Section;
  8564. BEGIN
  8565. IF constantDeclaration = NIL THEN
  8566. RETURN FALSE
  8567. ELSE
  8568. (* Is a constant in this module: did we generate it already? *)
  8569. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8570. IF constant # NIL THEN
  8571. InitOperand(result,ModeReference);
  8572. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8573. RETURN TRUE;
  8574. END;
  8575. END;
  8576. RETURN FALSE
  8577. END TryConstantDeclaration;
  8578. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  8579. BEGIN
  8580. constantDeclaration := x;
  8581. x.value.resolved.Accept(SELF);
  8582. END VisitConstant;
  8583. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  8584. BEGIN
  8585. IF Trace THEN TraceEnter("VisitRealValue") END;
  8586. InitOperand(result,ModeValue);
  8587. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8588. END VisitRealValue;
  8589. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  8590. VAR
  8591. componentType: SyntaxTree.Type;
  8592. BEGIN
  8593. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8594. ASSERT(x.type IS SyntaxTree.ComplexType);
  8595. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8596. InitOperand(result,ModeValue);
  8597. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8598. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8599. END VisitComplexValue;
  8600. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  8601. VAR i: LONGINT; name: Basic.SegmentedName;
  8602. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8603. BEGIN
  8604. IF Trace THEN TraceEnter("VisitStringValue") END;
  8605. IF ~TryConstantDeclaration() THEN
  8606. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8607. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8608. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8609. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8610. ELSE
  8611. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8612. END;
  8613. FOR i := 0 TO x.length-1 DO
  8614. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8615. irv.Emit(Data(position,op));
  8616. END;
  8617. InitOperand(result,ModeReference);
  8618. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8619. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8620. END
  8621. END VisitStringValue;
  8622. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8623. BEGIN
  8624. IF Trace THEN TraceEnter("VisitNilValue") END;
  8625. InitOperand(result,ModeValue);
  8626. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8627. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8628. END VisitNilValue;
  8629. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8630. BEGIN
  8631. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8632. InitOperand(result,ModeValue);
  8633. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8634. END VisitEnumerationValue;
  8635. (** symbols *)
  8636. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8637. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8638. END VisitImport;
  8639. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8640. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8641. BEGIN
  8642. IF scope # baseScope THEN
  8643. (* left := [fp+8] *)
  8644. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8645. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8646. ReuseCopy(left,right);
  8647. ReleaseIntermediateOperand(right);
  8648. scope := scope.outerScope; DEC(level);
  8649. (* { left := [left+8] } *)
  8650. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8651. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8652. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8653. Emit(Mov(position,left,right));
  8654. scope := scope.outerScope; DEC(level);
  8655. END;
  8656. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8657. result := left;
  8658. ELSE
  8659. result := fp;
  8660. END;
  8661. END GetBaseRegister;
  8662. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8663. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8664. BEGIN
  8665. IF Trace THEN TraceEnter("VisitVariable"); END;
  8666. type := x.type.resolved;
  8667. IF (x.useRegister) THEN
  8668. InitOperand(result, ModeValue);
  8669. IF x.registerNumber < 0 THEN
  8670. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8671. reg := x.registerNumber;
  8672. ELSE
  8673. reg := registerUsageCount.Map(x.registerNumber);
  8674. UseRegister(reg);
  8675. END;
  8676. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8677. ELSIF x.externalName # NIL THEN
  8678. InitOperand(result,ModeReference);
  8679. Basic.ToSegmentedName(x.externalName^, name);
  8680. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8681. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8682. InitOperand(result,ModeReference);
  8683. GetBaseRegister(result.op,currentScope,x.scope);
  8684. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8685. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8686. InitOperand(result,ModeReference);
  8687. GetCodeSectionNameForSymbol(x,name);
  8688. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8689. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8690. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8691. InitOperand(result,ModeReference);
  8692. GetCodeSectionNameForSymbol(x,name);
  8693. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8694. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8695. ELSE (* field, left designator must have been emitted *)
  8696. ASSERT(result.mode = ModeReference);
  8697. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8698. ReuseCopy(temp,result.op);
  8699. ReleaseIntermediateOperand(result.op);
  8700. result.op := temp;
  8701. END;
  8702. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8703. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8704. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8705. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8706. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8707. END;
  8708. END;
  8709. END;
  8710. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8711. ValueToCondition(result);
  8712. ELSIF type IS SyntaxTree.ProcedureType THEN
  8713. ReleaseIntermediateOperand(result.tag);
  8714. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8715. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8716. UseIntermediateOperand(result.tag);
  8717. ELSE
  8718. result.tag := nil; (* nil *)
  8719. END;
  8720. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8721. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8722. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8723. ReleaseIntermediateOperand(result.tag);
  8724. Global.GetSymbolSegmentedName(x,name);
  8725. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8726. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8727. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8728. ELSE
  8729. END;
  8730. ELSE
  8731. ReleaseIntermediateOperand(result.tag);
  8732. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8733. END;
  8734. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8735. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8736. ReleaseIntermediateOperand(result.tag);
  8737. result.tag := result.op;
  8738. UseIntermediateOperand(result.tag);
  8739. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8740. IntermediateCode.MakeMemory(result.op,addressType);
  8741. END;
  8742. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8743. ReleaseIntermediateOperand(result.tag);
  8744. result.tag := TypeDescriptorAdr(type);
  8745. IF ~newObjectFile THEN
  8746. IntermediateCode.MakeMemory(result.tag,addressType);
  8747. END;
  8748. UseIntermediateOperand(result.tag);
  8749. (* tag for pointer type computed not here but during dereferencing *)
  8750. END;
  8751. IF Trace THEN TraceExit("VisitVariable") END;
  8752. END VisitVariable;
  8753. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8754. BEGIN
  8755. VisitVariable(property);
  8756. END VisitProperty;
  8757. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8758. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8759. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT; temp: IntermediateCode.Operand;
  8760. BEGIN
  8761. type := x.type.resolved;
  8762. IF Trace THEN TraceEnter("VisitParameter") END;
  8763. IF x.ownerType IS SyntaxTree.CellType THEN
  8764. ptype := x.type.resolved;
  8765. IF backend.cellsAreObjects THEN
  8766. ASSERT(result.mode = ModeReference);
  8767. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8768. ReuseCopy(temp,result.op);
  8769. ReleaseIntermediateOperand(result.op);
  8770. result.op := temp;
  8771. END;
  8772. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8773. RETURN;
  8774. ELSE
  8775. InitOperand(result,ModeReference);
  8776. GetCodeSectionNameForSymbol(x,name);
  8777. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8778. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8779. RETURN;
  8780. END;
  8781. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8782. InitOperand(result,ModeReference);
  8783. GetCodeSectionNameForSymbol(x,name);
  8784. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8785. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8786. RETURN
  8787. ELSE
  8788. GetBaseRegister(basereg,currentScope,x.scope);
  8789. InitOperand(result,ModeReference);
  8790. result.op := basereg;
  8791. END;
  8792. IF IsOpenArray(type) THEN
  8793. result.tag := basereg;
  8794. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8795. IntermediateCode.MakeMemory(result.op,addressType);
  8796. IF Global.IsOberonProcedure(x.ownerType) THEN
  8797. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8798. UseIntermediateOperand(result.tag);
  8799. ELSE
  8800. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8801. END;
  8802. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8803. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8804. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8805. ELSIF IsStaticArray(type) THEN
  8806. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8807. IntermediateCode.MakeMemory(result.op,addressType);
  8808. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8809. ELSIF type IS SyntaxTree.MathArrayType THEN
  8810. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8811. WITH type: SyntaxTree.MathArrayType DO
  8812. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8813. IF type.form = SyntaxTree.Tensor THEN
  8814. ELSIF type.form = SyntaxTree.Open THEN
  8815. result.tag := result.op;
  8816. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8817. IntermediateCode.MakeMemory(result.op,addressType);
  8818. UseIntermediateOperand(result.tag);
  8819. ELSIF type.form = SyntaxTree.Static THEN
  8820. IF x.kind = SyntaxTree.ConstParameter THEN
  8821. IntermediateCode.MakeMemory(result.op,addressType);
  8822. END;
  8823. ELSE HALT(100)
  8824. END;
  8825. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8826. IF type.form = SyntaxTree.Tensor THEN
  8827. ToMemory(result.op,addressType,0);
  8828. ELSIF type.form = SyntaxTree.Open THEN
  8829. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8830. ReuseCopy(result.tag, mem);
  8831. ReleaseIntermediateOperand(mem);
  8832. ReleaseIntermediateOperand(result.op);
  8833. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8834. ELSIF type.form = SyntaxTree.Static THEN
  8835. IntermediateCode.MakeMemory(result.op,addressType);
  8836. ELSE HALT(100)
  8837. END;
  8838. ELSE HALT(100)
  8839. END;
  8840. END;
  8841. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8842. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8843. IntermediateCode.MakeMemory(result.op,addressType);
  8844. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8845. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8846. END;
  8847. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8848. ValueToCondition(result);
  8849. ELSIF type IS SyntaxTree.ProcedureType THEN
  8850. ReleaseIntermediateOperand(result.tag);
  8851. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8852. IF x.kind = SyntaxTree.VarParameter THEN
  8853. ReuseCopy(result.tag,result.op);
  8854. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8855. IntermediateCode.MakeMemory(result.tag,addressType);
  8856. ELSE
  8857. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8858. UseIntermediateOperand(result.tag);
  8859. END;
  8860. ELSE
  8861. result.tag := nil;
  8862. END;
  8863. (* tag for pointer type computed not here but during dereferencing *)
  8864. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  8865. ReleaseIntermediateOperand(result.tag);
  8866. result.tag := basereg;
  8867. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8868. IntermediateCode.MakeMemory(result.tag,addressType);
  8869. UseIntermediateOperand(result.tag);
  8870. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  8871. ReleaseIntermediateOperand(result.tag);
  8872. result.tag := TypeDescriptorAdr(type);
  8873. IF ~newObjectFile THEN
  8874. IntermediateCode.MakeMemory(result.tag,addressType);
  8875. END;
  8876. UseIntermediateOperand(result.tag);
  8877. END;
  8878. IF Trace THEN TraceExit("VisitParameter") END;
  8879. END VisitParameter;
  8880. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8881. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8882. BEGIN
  8883. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8884. (* left.p: left already emitted *)
  8885. tag := result.op; (* value of pointer to left *)
  8886. (* get type desc *)
  8887. tmp := result.tag;
  8888. IntermediateCode.MakeMemory(tmp,addressType);
  8889. (* get method adr *)
  8890. Reuse1(reg,tmp);
  8891. ReleaseIntermediateOperand(tmp);
  8892. IF backend.cooperative THEN
  8893. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8894. WHILE recordType.baseType # NIL DO
  8895. recordType := recordType.GetBaseRecord ();
  8896. END;
  8897. GetRecordTypeName (recordType,name);
  8898. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8899. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8900. offset := 0;
  8901. ELSE
  8902. offset := 2;
  8903. END;
  8904. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8905. ELSE
  8906. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8907. END;
  8908. InitOperand(operand,ModeReference);
  8909. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8910. operand.op := reg;
  8911. operand.tag := tag;
  8912. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8913. END DynamicCallOperand;
  8914. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8915. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8916. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8917. BEGIN
  8918. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8919. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8920. tag := operand.op;
  8921. ReleaseIntermediateOperand(operand.tag);
  8922. ELSE tag := nil
  8923. END;
  8924. IF x.isInline THEN
  8925. sectionType := Sections.InlineCodeSection;
  8926. ELSE
  8927. sectionType := Sections.CodeSection;
  8928. END;
  8929. IF x.externalName # NIL THEN
  8930. Basic.ToSegmentedName(x.externalName^, name);
  8931. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8932. ELSE
  8933. GetCodeSectionNameForSymbol(x, name);
  8934. IF (x.scope.ownerModule = module.module) THEN
  8935. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8936. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8937. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8938. IF source.pc = 0 THEN (* no code yet *)
  8939. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8940. END;
  8941. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8942. bits := x.procedureScope.body.code.inlineCode;
  8943. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8944. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8945. binary.CopyBits(bits, 0, bits.GetSize());
  8946. source.SetResolved(binary);
  8947. ELSE
  8948. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8949. END;
  8950. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8951. END;
  8952. InitOperand(operand,ModeValue);
  8953. operand.op := reg;
  8954. operand.tag := tag;
  8955. IF Trace THEN TraceExit("StaticCallOperand") END;
  8956. END StaticCallOperand;
  8957. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8958. (* handle expressions of the form designator.procedure or procedure *)
  8959. BEGIN
  8960. IF Trace THEN TraceEnter("VisitProcedure") END;
  8961. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  8962. DynamicCallOperand(result,x);
  8963. ELSIF x.isInline THEN
  8964. StaticCallOperand(result,x);
  8965. ELSE
  8966. StaticCallOperand(result,x);
  8967. END;
  8968. IF Trace THEN TraceExit("VisitProcedure") END;
  8969. END VisitProcedure;
  8970. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  8971. BEGIN
  8972. VisitProcedure(x);
  8973. END VisitOperator;
  8974. (** statements *)
  8975. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  8976. BEGIN
  8977. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  8978. Expression(x.call);
  8979. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  8980. ReleaseOperand(result)
  8981. END;
  8982. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  8983. END VisitProcedureCallStatement;
  8984. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  8985. VAR leftType, rightType: SyntaxTree.MathArrayType;
  8986. leftBase, rightBase: SyntaxTree.Type;
  8987. procedureName,s: SyntaxTree.IdentifierString;
  8988. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  8989. size: LONGINT; rightKind: LONGINT;
  8990. dummy: IntermediateCode.Operand;
  8991. CONST moduleName = "FoxArrayBase";
  8992. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  8993. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  8994. BEGIN
  8995. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  8996. IF base IS SyntaxTree.MathArrayType THEN
  8997. base := OpenArray(base(SyntaxTree.MathArrayType));
  8998. END;
  8999. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  9000. result.SetArrayBase(base);
  9001. RETURN result
  9002. END OpenArray;
  9003. BEGIN
  9004. IF AddImport(moduleName,arrayBase,TRUE) THEN
  9005. SaveRegisters();ReleaseUsedRegisters(saved);
  9006. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  9007. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  9008. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  9009. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  9010. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  9011. IF leftType.form = SyntaxTree.Tensor THEN
  9012. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  9013. ELSIF leftType.form = SyntaxTree.Open THEN
  9014. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  9015. ELSIF leftType.form = SyntaxTree.Static THEN
  9016. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  9017. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  9018. END;
  9019. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  9020. IF procedure = NIL THEN
  9021. s := "Instruction not supported on target, emulation procedure ";
  9022. Strings.Append(s,moduleName);
  9023. Strings.Append(s,".");
  9024. Strings.Append(s,procedureName);
  9025. Strings.Append(s," not present");
  9026. Error(position,s);
  9027. ELSE
  9028. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  9029. parameter.SetType(leftType);
  9030. parameter.SetAccess(SyntaxTree.Internal);
  9031. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9032. parameter.SetKind(rightKind);
  9033. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9034. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  9035. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  9036. StaticCallOperand(result,procedure);
  9037. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  9038. ReleaseOperand(result);
  9039. END;
  9040. RestoreRegisters(saved);
  9041. END;
  9042. END AssignMathArray;
  9043. VAR modifyAssignmentCounter := 0: LONGINT;
  9044. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  9045. VAR processor,mem,dst: IntermediateCode.Operand;
  9046. BEGIN
  9047. IF value.intValue = true.intValue THEN
  9048. INC(modifyAssignmentCounter);
  9049. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  9050. modifyAssignmentsPC := section.pc;
  9051. ELSE
  9052. DEC(modifyAssignmentCounter);
  9053. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  9054. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  9055. END;
  9056. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  9057. dst := NewRegisterOperand (addressType);
  9058. Emit(Mov(position,dst, processor));
  9059. IntermediateCode.InitMemory(mem,bool, dst, 0);
  9060. Emit(Mov(position,mem, value));
  9061. ReleaseIntermediateOperand(dst);
  9062. END ModifyAssignments;
  9063. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9064. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9065. BEGIN
  9066. type := left.type.resolved;
  9067. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9068. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9069. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9070. IF procedureType.returnParameter = parameter THEN
  9071. (* this is the only case where the destination can be dynamically smaller than the source
  9072. in all other cases the dynamic size has to be taken
  9073. *)
  9074. IF backend.cooperative THEN
  9075. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  9076. ELSE
  9077. MakeMemory(mem, tag, addressType, 0);
  9078. END;
  9079. RETURN mem;
  9080. END;
  9081. END;
  9082. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9083. END CopySize;
  9084. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9085. VAR
  9086. leftO, rightO: Operand;
  9087. arg,mem, sizeOp: IntermediateCode.Operand;
  9088. leftType, rightType, componentType, base: SyntaxTree.Type;
  9089. size: LONGINT;
  9090. parameters: SyntaxTree.ExpressionList;
  9091. procedure: SyntaxTree.Procedure;
  9092. call: SyntaxTree.ProcedureCallDesignator;
  9093. designator: SyntaxTree.Designator;
  9094. saved: RegisterEntry;
  9095. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9096. VAR procedureType: SyntaxTree.ProcedureType;
  9097. BEGIN
  9098. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9099. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9100. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9101. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9102. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9103. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9104. IF right.id = Global.Reshape THEN RETURN TRUE
  9105. END;
  9106. END;
  9107. END;
  9108. END;
  9109. RETURN FALSE
  9110. END CanPassAsResultParameter;
  9111. BEGIN
  9112. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9113. leftType := left.type.resolved; rightType:= right.type.resolved;
  9114. IF backend.cooperative & left.NeedsTrace() THEN
  9115. ModifyAssignments(true);
  9116. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9117. Designate(right, rightO);
  9118. Designate(left, leftO);
  9119. ASSERT(leftO.mode = ModeReference);
  9120. TransferToRegister(leftO.op, leftO.op);
  9121. TransferToRegister(rightO.op, rightO.op);
  9122. Emit(Push(position, leftO.op));
  9123. Emit(Push(position, rightO.op));
  9124. CallAssignMethod(leftO.op, rightO.op, left.type);
  9125. Emit(Pop(position, rightO.op));
  9126. Emit(Pop(position, leftO.op));
  9127. sizeOp := CopySize(left, leftO.tag);
  9128. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9129. ReleaseIntermediateOperand(sizeOp);
  9130. ReleaseOperand(leftO);
  9131. ReleaseOperand(rightO);
  9132. ELSE
  9133. Evaluate(right,rightO);
  9134. Designate(left,leftO);
  9135. ASSERT(leftO.mode = ModeReference);
  9136. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9137. (* copy procedure address first *)
  9138. MakeMemory(mem,leftO.op,addressType,0);
  9139. Emit(Mov(position,mem,rightO.op));
  9140. ReleaseIntermediateOperand(mem);
  9141. (* copy pointer address *)
  9142. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9143. CallAssignPointer(leftO.tag, rightO.tag);
  9144. ELSE
  9145. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9146. CallAssignPointer(leftO.op, rightO.op);
  9147. END;
  9148. ReleaseOperand(leftO);
  9149. ReleaseOperand(rightO);
  9150. END;
  9151. ModifyAssignments(false);
  9152. RETURN;
  9153. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  9154. SaveRegisters();ReleaseUsedRegisters(saved);
  9155. IF SemanticChecker.IsPointerType(leftType) THEN
  9156. Evaluate(right,rightO);
  9157. Designate(left,leftO);
  9158. Emit(Push(position,leftO.op));
  9159. ReleaseOperand(leftO);
  9160. Emit(Push(position,rightO.op));
  9161. ReleaseOperand(rightO);
  9162. CallThis(position,"Heaps","Assign",2);
  9163. ELSIF leftType.IsRecordType() THEN
  9164. Designate(right,rightO);
  9165. Designate(left,leftO);
  9166. Emit(Push(position,leftO.op));
  9167. Emit(Push(position,leftO.tag)); (* type desc *)
  9168. ReleaseOperand(leftO);
  9169. Emit(Push(position,rightO.op));
  9170. ReleaseOperand(rightO);
  9171. CallThis(position,"Heaps","AssignRecord",3);
  9172. ELSIF IsStaticArray(leftType) THEN
  9173. size := StaticArrayNumElements(leftType);
  9174. base := StaticArrayBaseType(leftType);
  9175. Designate(right,rightO);
  9176. Designate(left,leftO);
  9177. Emit(Push(position,leftO.op));
  9178. ReleaseOperand(leftO);
  9179. arg := TypeDescriptorAdr(base);
  9180. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9181. Emit(Push(position,arg));
  9182. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9183. Emit(Push(position,rightO.op));
  9184. ReleaseOperand(rightO);
  9185. CallThis(position,"Heaps","AssignArray",4);
  9186. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  9187. size := StaticMathArrayNumElements(leftType);
  9188. base := StaticMathArrayBaseType(leftType);
  9189. Designate(right,rightO);
  9190. Designate(left,leftO);
  9191. Emit(Push(position,leftO.op));
  9192. ReleaseOperand(leftO);
  9193. arg := TypeDescriptorAdr(base);
  9194. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9195. Emit(Push(position,arg));
  9196. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9197. Emit(Push(position,rightO.op));
  9198. ReleaseOperand(rightO);
  9199. CallThis(position,"Heaps","AssignArray",4);
  9200. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9201. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9202. Evaluate(right,rightO);
  9203. Designate(left,leftO);
  9204. MakeMemory(mem,leftO.op,addressType,0);
  9205. Emit(Mov(position,mem,rightO.op));
  9206. ReleaseIntermediateOperand(mem);
  9207. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9208. Emit (Push(position, leftO.tag));
  9209. ReleaseOperand(leftO);
  9210. Emit (Push(position, rightO.tag));
  9211. ReleaseOperand(rightO);
  9212. CallThis(position,"Heaps","Assign", 2);
  9213. ELSE HALT(100); (* missing ? *)
  9214. END;
  9215. RestoreRegisters(saved);
  9216. RETURN;
  9217. END;
  9218. IF CanPassAsResultParameter(right) THEN
  9219. procedureResultDesignator := left(SyntaxTree.Designator);
  9220. Expression(right);
  9221. procedureResultDesignator := NIL;
  9222. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9223. (* left <-- ALIAS OF right: zerocopy *)
  9224. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9225. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9226. designator.SetType(procedure.type);
  9227. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9228. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9229. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9230. END;
  9231. ELSIF leftType IS SyntaxTree.RangeType THEN
  9232. (* LHS is of array range type *)
  9233. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9234. Evaluate(right, rightO);
  9235. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9236. (* first *)
  9237. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 0);
  9238. Emit(Mov(position,mem, rightO.op));
  9239. ReleaseIntermediateOperand(mem);
  9240. (* last *)
  9241. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9242. Emit(Mov(position,mem, rightO.tag));
  9243. ReleaseIntermediateOperand(mem);
  9244. (* step *)
  9245. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9246. Emit(Mov(position,mem, rightO.extra));
  9247. ReleaseIntermediateOperand(mem);
  9248. ReleaseOperand(rightO);
  9249. ReleaseOperand(leftO)
  9250. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9251. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9252. Evaluate(right, rightO);
  9253. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9254. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9255. (* real part *)
  9256. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9257. Emit(Mov(position,mem, rightO.op));
  9258. ReleaseIntermediateOperand(mem);
  9259. (* imaginary part *)
  9260. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9261. Emit(Mov(position,mem, rightO.tag));
  9262. ReleaseIntermediateOperand(mem);
  9263. ReleaseOperand(rightO);
  9264. ReleaseOperand(leftO)
  9265. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9266. OR (leftType IS SyntaxTree.PortType) THEN
  9267. (* rightO := leftO;*)
  9268. Evaluate(right,rightO);
  9269. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9270. Designate(left,leftO);
  9271. IF leftO.mode = ModeReference THEN
  9272. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9273. destination := mem;
  9274. ELSE
  9275. destination := leftO.op;
  9276. END;
  9277. ReleaseOperand(leftO);
  9278. IF destination.mode # IntermediateCode.Undefined THEN
  9279. Emit(Mov(position,destination,rightO.op));
  9280. END;
  9281. ReleaseOperand(rightO);
  9282. ReleaseIntermediateOperand(mem);
  9283. IntermediateCode.InitOperand(destination);
  9284. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9285. Evaluate(right,rightO);
  9286. Designate(left,leftO);
  9287. MakeMemory(mem,leftO.op,addressType,0);
  9288. Emit(Mov(position,mem,rightO.op));
  9289. ReleaseIntermediateOperand(mem);
  9290. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9291. (* delegate *)
  9292. (*
  9293. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9294. *)
  9295. Emit(Mov(position,leftO.tag,rightO.tag));
  9296. END;
  9297. ReleaseOperand(leftO);
  9298. ReleaseOperand(rightO);
  9299. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9300. Designate(right,rightO);
  9301. Designate(left,leftO);
  9302. sizeOp := CopySize(left, leftO.tag);
  9303. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9304. ReleaseIntermediateOperand(sizeOp);
  9305. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9306. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9307. IF (rightType IS SyntaxTree.StringType) THEN
  9308. CopyString(left,right);
  9309. 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
  9310. Designate(right,rightO);
  9311. Designate(left,leftO);
  9312. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9313. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9314. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9315. ELSE
  9316. HALT(201)
  9317. END;
  9318. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9319. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9320. Designate(right,rightO);
  9321. Designate(left,leftO);
  9322. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9323. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9324. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9325. ELSE
  9326. AssignMathArray(left,right);
  9327. END;
  9328. ELSE
  9329. HALT(200);
  9330. END;
  9331. END Assign;
  9332. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  9333. BEGIN
  9334. IF Trace THEN TraceEnter("VisitAssignment") END;
  9335. Assign(x.left,x.right);
  9336. IF Trace THEN TraceExit("VisitAssignment") END;
  9337. END VisitAssignment;
  9338. PROCEDURE EmitCooperativeSwitch;
  9339. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9340. BEGIN
  9341. ASSERT (cooperativeSwitches);
  9342. pc := section.pc;
  9343. IF lastSwitchPC = section.pc THEN RETURN END;
  9344. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9345. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9346. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9347. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9348. INC(statCoopSwitch, section.pc - pc);
  9349. END EmitCooperativeSwitch;
  9350. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  9351. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9352. BEGIN
  9353. p0 := communication.left; p1 := communication.right;
  9354. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9355. Evaluate(p0,s0);
  9356. Evaluate(p1,s1);
  9357. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9358. Emit(Push(position,s0.op));
  9359. Emit(Push(position,s1.op));
  9360. (*
  9361. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9362. *)
  9363. IF ~backend.cellsAreObjects THEN
  9364. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9365. END;
  9366. ReleaseOperand(s0);
  9367. ReleaseOperand(s1);
  9368. IF backend.cellsAreObjects THEN
  9369. CallThis(position,"ActiveCellsRuntime","Send",2);
  9370. ELSE
  9371. CallThis(position,ChannelModuleName,"Send",2);
  9372. END;
  9373. (* ----- RECEIVE ------*)
  9374. ELSE
  9375. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9376. tmp := p0; p0 := p1; p1 := tmp;
  9377. END;
  9378. Evaluate(p0,s0);
  9379. Emit(Push(position,s0.op));
  9380. Designate(p1,s1);
  9381. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9382. Emit(Push(position,s1.op));
  9383. (*
  9384. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9385. *)
  9386. IF ~backend.cellsAreObjects THEN
  9387. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9388. END;
  9389. ReleaseOperand(s0);
  9390. ReleaseOperand(s1);
  9391. IF backend.cellsAreObjects THEN
  9392. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9393. ELSE
  9394. CallThis(position,ChannelModuleName,"Receive",2)
  9395. END;
  9396. END;
  9397. END VisitCommunicationStatement;
  9398. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  9399. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9400. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9401. VAR true, false: Label; condition, value: BOOLEAN;
  9402. BEGIN
  9403. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9404. IF condition THEN
  9405. true := NewLabel();
  9406. false := NewLabel();
  9407. Condition(if.condition,true,false);
  9408. SetLabel(true);
  9409. StatementSequence(if.statements);
  9410. BrL(end);
  9411. SetLabel(false);
  9412. ELSE
  9413. IF value THEN (* always true *)
  9414. escape := TRUE;
  9415. StatementSequence(if.statements);
  9416. (* no branch necessary -- rest skipped *)
  9417. END;
  9418. END;
  9419. END IfPart;
  9420. BEGIN
  9421. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9422. end := NewLabel();
  9423. elsifs := x.ElsifParts();
  9424. IfPart(x.ifPart);
  9425. FOR i := 0 TO elsifs-1 DO
  9426. IF ~escape THEN
  9427. elsif := x.GetElsifPart(i);
  9428. IfPart(elsif);
  9429. END;
  9430. END;
  9431. IF (x.elsePart # NIL) & ~escape THEN
  9432. StatementSequence(x.elsePart);
  9433. END;
  9434. SetLabel(end);
  9435. IF Trace THEN TraceExit("VisitIfStatement") END;
  9436. END VisitIfStatement;
  9437. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9438. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9439. BEGIN
  9440. (*IF x.variable.type.resolved = x.type.resolved THEN
  9441. (* always true, do nothing *)
  9442. ELSE*)
  9443. Designate(x.variable,res);
  9444. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9445. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9446. END;
  9447. trueL := NewLabel();
  9448. TypeTest(res.tag,x.type,trueL,falseL);
  9449. ReleaseOperand(res);
  9450. SetLabel(trueL);
  9451. StatementSequence(x.statements);
  9452. BrL(endL);
  9453. END WithPart;
  9454. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  9455. VAR endL,falseL: Label;i: LONGINT;
  9456. BEGIN
  9457. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9458. endL := NewLabel();
  9459. FOR i := 0 TO x.WithParts()-1 DO
  9460. falseL := NewLabel();
  9461. WithPart(x.GetWithPart(i),falseL,endL);
  9462. SetLabel(falseL);
  9463. END;
  9464. IF x.elsePart = NIL THEN
  9465. IF ~isUnchecked THEN
  9466. EmitTrap(position,WithTrap);
  9467. END;
  9468. ELSE
  9469. StatementSequence(x.elsePart)
  9470. END;
  9471. SetLabel(endL);
  9472. IF Trace THEN TraceExit("VisitWithStatement") END;
  9473. END VisitWithStatement;
  9474. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  9475. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9476. out,else: Label; label: Label;
  9477. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9478. symbol: SyntaxTree.Symbol;
  9479. BEGIN
  9480. (*! split case statement into if-elsif statements for large case label lists *)
  9481. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9482. size := x.max-x.min+1;
  9483. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9484. END;
  9485. Evaluate(x.variable,var);
  9486. ReuseCopy(tmp,var.op);
  9487. ReleaseIntermediateOperand(var.op);
  9488. var.op := tmp;
  9489. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9490. Convert(var.op,addressType);
  9491. size := x.max-x.min+1;
  9492. else := NewLabel();
  9493. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9494. (*
  9495. UniqueId(name,module.module,"case",caseId);
  9496. *)
  9497. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9498. Global.GetModuleSegmentedName(module.module, name);
  9499. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9500. symbol := SyntaxTree.NewSymbol(name[1]);
  9501. symbol.SetScope(moduleScope);
  9502. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9503. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9504. section.isCaseTable := TRUE;
  9505. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9506. ReuseCopy(res,var.op);
  9507. ReleaseOperand(var);
  9508. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9509. Emit(Add(position,res,res,jmp));
  9510. IntermediateCode.MakeMemory(res,addressType);
  9511. Emit(Br(position,res));
  9512. ReleaseIntermediateOperand(res);
  9513. out := NewLabel();
  9514. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9515. part := x.GetCasePart(i);
  9516. constant := part.firstConstant;
  9517. label := NewLabel();
  9518. SetLabel(label);
  9519. WHILE(constant # NIL) DO (* case labels for this case part *)
  9520. FOR j := constant.min TO constant.max DO
  9521. fixups[j-x.min] := label;
  9522. END;
  9523. constant := constant.next;
  9524. END;
  9525. StatementSequence(part.statements);
  9526. BrL(out);
  9527. END;
  9528. SetLabel(else);
  9529. FOR i := 0 TO size-1 DO
  9530. IF fixups[i] = NIL THEN
  9531. fixups[i] := else;
  9532. END;
  9533. END;
  9534. IF x.elsePart # NIL THEN
  9535. StatementSequence(x.elsePart);
  9536. ELSIF ~isUnchecked THEN
  9537. EmitTrap(position,CaseTrap);
  9538. END;
  9539. SetLabel(out);
  9540. FOR i := 0 TO size-1 DO
  9541. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9542. section.Emit(Data(position,op));
  9543. END;
  9544. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9545. END VisitCaseStatement;
  9546. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  9547. VAR start: Label; true,false: Label;
  9548. BEGIN
  9549. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9550. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9551. start := NewLabel();
  9552. true := NewLabel();
  9553. false := NewLabel();
  9554. SetLabel(start);
  9555. Condition(x.condition,true,false);
  9556. SetLabel(true);
  9557. StatementSequence(x.statements);
  9558. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9559. BrL(start);
  9560. SetLabel(false);
  9561. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9562. END VisitWhileStatement;
  9563. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  9564. VAR false,true: Label;
  9565. BEGIN
  9566. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9567. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9568. true := NewLabel();
  9569. false := NewLabel();
  9570. SetLabel(false);
  9571. StatementSequence(x.statements);
  9572. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9573. Condition(x.condition,true,false);
  9574. SetLabel(true);
  9575. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9576. END VisitRepeatStatement;
  9577. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  9578. VAR
  9579. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9580. temporaryVariable: SyntaxTree.Variable;
  9581. temporaryVariableDesignator : SyntaxTree.Designator;
  9582. BEGIN
  9583. IF Trace THEN TraceEnter("VisitForStatement") END;
  9584. true := NewLabel();
  9585. false := NewLabel();
  9586. start := NewLabel();
  9587. Assign(x.variable,x.from);
  9588. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9589. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9590. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9591. Assign(temporaryVariableDesignator,x.to);
  9592. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9593. IF by > 0 THEN
  9594. cmp := Scanner.LessEqual
  9595. ELSE
  9596. cmp := Scanner.GreaterEqual
  9597. END;
  9598. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9599. binary.SetType(system.booleanType);
  9600. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9601. SetLabel(start);
  9602. Condition(binary,true,false);
  9603. SetLabel(true);
  9604. StatementSequence(x.statements);
  9605. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9606. binary.SetType(x.variable.type);
  9607. Assign(x.variable,binary);
  9608. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9609. BrL(start);
  9610. SetLabel(false);
  9611. IF Trace THEN TraceExit("VisitForStatement") END;
  9612. END VisitForStatement;
  9613. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  9614. VAR prevLoop: Label;
  9615. BEGIN
  9616. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9617. prevLoop := currentLoop;
  9618. currentLoop := NewLabel();
  9619. StatementSequence(x.statements);
  9620. SetLabel(currentLoop);
  9621. currentLoop := prevLoop;
  9622. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9623. END VisitExitableBlock;
  9624. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  9625. VAR prevLoop,start: Label;
  9626. BEGIN
  9627. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9628. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9629. start := NewLabel();
  9630. prevLoop := currentLoop;
  9631. SetLabel(start);
  9632. currentLoop := NewLabel();
  9633. StatementSequence(x.statements);
  9634. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9635. BrL(start);
  9636. SetLabel(currentLoop);
  9637. currentLoop := prevLoop;
  9638. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9639. END VisitLoopStatement;
  9640. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  9641. VAR outer: SyntaxTree.Statement;
  9642. BEGIN
  9643. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9644. IF locked THEN (* r if we jump out of an exclusive block *)
  9645. outer := x.outer;
  9646. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9647. outer := outer.outer;
  9648. END;
  9649. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9650. Lock(FALSE);
  9651. END;
  9652. END;
  9653. BrL(currentLoop);
  9654. IF Trace THEN TraceExit("VisitExitStatement") END;
  9655. END VisitExitStatement;
  9656. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  9657. VAR
  9658. expression, parameterDesignator: SyntaxTree.Expression;
  9659. type, componentType: SyntaxTree.Type;
  9660. res, right: Operand;
  9661. left, mem, reg: IntermediateCode.Operand;
  9662. parameter: SyntaxTree.Parameter;
  9663. procedure: SyntaxTree.Procedure;
  9664. procedureType: SyntaxTree.ProcedureType;
  9665. returnTypeOffset: LONGINT;
  9666. delegate: BOOLEAN;
  9667. map: SymbolMap;
  9668. cc, parametersSize: LONGINT;
  9669. BEGIN
  9670. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9671. expression := x.returnValue;
  9672. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9673. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9674. IF currentIsInline THEN
  9675. IF expression # NIL THEN
  9676. map := currentMapper.Get(NIL);
  9677. IF map # NIL THEN
  9678. Assign(map.to, expression);
  9679. ELSE
  9680. Evaluate(expression,res);
  9681. Emit(Return(position,res.op));
  9682. ReleaseOperand(res);
  9683. END;
  9684. END;
  9685. BrL(currentInlineExit);
  9686. RETURN;
  9687. END;
  9688. IF expression # NIL THEN
  9689. type := expression.type.resolved;
  9690. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9691. IF locked THEN Lock(FALSE) END;
  9692. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9693. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9694. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9695. (* return without structured return parameter *)
  9696. Evaluate(expression,res);
  9697. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9698. IF locked OR profile THEN
  9699. Emit(Push(position,res.op));
  9700. IF delegate THEN HALT(200) END;
  9701. ReleaseOperand(res);
  9702. IF locked THEN Lock(FALSE) END;
  9703. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9704. reg := NewRegisterOperand(res.op.type);
  9705. Emit(Pop(position,reg));
  9706. Emit(Return(position,reg));
  9707. ReleaseIntermediateOperand(reg);
  9708. ELSE
  9709. Emit(Return(position,res.op));
  9710. ReleaseOperand(res);
  9711. END;
  9712. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9713. THEN
  9714. (* return using structured return parameter *)
  9715. 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)
  9716. OR SemanticChecker.IsPointerType(type));
  9717. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9718. parameter :=procedureType.returnParameter;
  9719. ASSERT(parameter # NIL);
  9720. returnTypeOffset := parameter.offsetInBits;
  9721. (*
  9722. IF parameter# NIL THEN
  9723. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9724. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9725. ELSE
  9726. returnTypeOffset := system.offsetFirstParameter
  9727. END;
  9728. *)
  9729. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9730. IF type IS SyntaxTree.RangeType THEN
  9731. (* array range type *)
  9732. Evaluate(expression, right);
  9733. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 0);
  9734. Emit(Mov(position,mem, right.op)); (* first *)
  9735. ReleaseIntermediateOperand(mem);
  9736. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9737. Emit(Mov(position,mem, right.tag)); (* last *)
  9738. ReleaseIntermediateOperand(mem);
  9739. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9740. Emit(Mov(position,mem, right.extra)); (* step *)
  9741. ReleaseIntermediateOperand(mem);
  9742. ReleaseOperand(right);
  9743. ELSIF type IS SyntaxTree.ComplexType THEN
  9744. Evaluate(expression, right);
  9745. componentType := type(SyntaxTree.ComplexType).componentType;
  9746. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9747. Emit(Mov(position,mem, right.op)); (* real part *)
  9748. ReleaseIntermediateOperand(mem);
  9749. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9750. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9751. ReleaseIntermediateOperand(mem);
  9752. ReleaseOperand(right);
  9753. ELSE (* covers cases: pointer / record / array *)
  9754. parameter := procedureType.returnParameter;
  9755. checker.SetCurrentScope(currentScope);
  9756. ASSERT(parameter # NIL);
  9757. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9758. Assign(parameterDesignator,expression);
  9759. END;
  9760. ReleaseIntermediateOperand(left);
  9761. IF locked THEN Lock(FALSE) END;
  9762. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9763. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9764. parameter := procedureType.returnParameter;
  9765. checker.SetCurrentScope(currentScope);
  9766. IF parameter = NIL THEN
  9767. Error(procedure.position, "structured return of parameter of procedure not found");
  9768. ELSE
  9769. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9770. Assign(parameterDesignator,expression);
  9771. END;
  9772. IF locked THEN Lock(FALSE) END;
  9773. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9774. ELSE
  9775. HALT(200);
  9776. END;
  9777. ELSE
  9778. IF locked THEN Lock(FALSE) END;
  9779. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9780. END;
  9781. IF backend.cooperative THEN
  9782. BrL(exitLabel);
  9783. ELSE
  9784. cc := procedureType(SyntaxTree.ProcedureType).callingConvention;
  9785. IF cc = SyntaxTree.WinAPICallingConvention THEN
  9786. parametersSize := ProcedureParametersSize(backend.system,procedure);
  9787. ELSE
  9788. parametersSize := 0;
  9789. END;
  9790. EmitLeave(section, position,procedure, procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9791. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention, parametersSize));
  9792. END;
  9793. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9794. END VisitReturnStatement;
  9795. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9796. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9797. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9798. statements: SyntaxTree.StatementSequence;
  9799. name, suffix: SyntaxTree.IdentifierString;
  9800. BEGIN
  9801. Strings.IntToStr(awaitProcCounter,suffix);
  9802. Strings.Concat("@AwaitProcedure",suffix,name);
  9803. identifier := SyntaxTree.NewIdentifier(name);
  9804. INC(awaitProcCounter);
  9805. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9806. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9807. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9808. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9809. procedure.SetAccess(SyntaxTree.Hidden);
  9810. procedure.SetScope(currentScope);
  9811. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9812. procedureType.SetReturnType(system.booleanType);
  9813. procedure.SetType(procedureType);
  9814. body := SyntaxTree.NewBody(x.position,procedureScope);
  9815. procedureScope.SetBody(body);
  9816. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9817. returnStatement.SetReturnValue(x.condition);
  9818. statements := SyntaxTree.NewStatementSequence();
  9819. statements.AddStatement(returnStatement);
  9820. body.SetStatementSequence(statements);
  9821. currentScope.AddProcedure(procedure);
  9822. RETURN procedure
  9823. END MakeAwaitProcedure;
  9824. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9825. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9826. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9827. BEGIN
  9828. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9829. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9830. IF backend.cooperative THEN
  9831. start := NewLabel();
  9832. true := NewLabel();
  9833. false := NewLabel();
  9834. SetLabel(start);
  9835. Condition(x.condition,true,false);
  9836. SetLabel(false);
  9837. PushSelfPointer();
  9838. CallThis(position,"ExclusiveBlocks","Await",1);
  9839. BrL(start);
  9840. SetLabel(true);
  9841. PushSelfPointer();
  9842. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9843. ELSE
  9844. proc := MakeAwaitProcedure(x);
  9845. Emit(Push(position,fp));
  9846. GetCodeSectionNameForSymbol(proc,name);
  9847. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9848. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9849. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9850. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9851. Emit(Result(position,res));
  9852. (*
  9853. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9854. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9855. *)
  9856. InitOperand(result,ModeValue);
  9857. result.op := res;
  9858. label := NewLabel();
  9859. BreqL(label, result.op, SELF.true);
  9860. ReleaseOperand(result);
  9861. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9862. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9863. Emit(Push(position,res));
  9864. Emit(Push(position,fp));
  9865. PushSelfPointer();
  9866. Emit(Push(position,nil));
  9867. CallThis(position,"Objects","Await",4);
  9868. SetLabel(label);
  9869. END;
  9870. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9871. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9872. END VisitAwaitStatement;
  9873. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9874. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9875. BEGIN
  9876. FOR i := 0 TO x.Length() - 1 DO
  9877. statement := x.GetStatement( i );
  9878. Statement(statement);
  9879. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9880. END;
  9881. END StatementSequence;
  9882. PROCEDURE PushSelfPointer;
  9883. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  9884. procedureType: SyntaxTree.ProcedureType;
  9885. BEGIN
  9886. scope := currentScope;
  9887. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9888. scope := scope.outerScope;
  9889. END;
  9890. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9891. IF ~newObjectFile THEN
  9892. Symbol(moduleSelf,op);
  9893. IntermediateCode.MakeMemory(op.op,addressType);
  9894. ELSE
  9895. moduleSection := meta.ModuleSection();
  9896. IF backend.cooperative THEN
  9897. moduleOffset := 0;
  9898. ELSE
  9899. moduleOffset := moduleSection.pc;
  9900. END;
  9901. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9902. END;
  9903. ELSE
  9904. GetBaseRegister(op.op,currentScope,scope);
  9905. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9906. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9907. parametersSize := ProcedureParametersSize(system,procedure);
  9908. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  9909. IF backend.cooperative THEN
  9910. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9911. END;
  9912. IntermediateCode.MakeMemory(op.op,addressType);
  9913. END;
  9914. Emit(Push(position,op.op));
  9915. ReleaseOperand(op);
  9916. END PushSelfPointer;
  9917. PROCEDURE Lock(lock: BOOLEAN);
  9918. BEGIN
  9919. IF Trace THEN TraceEnter("Lock") END;
  9920. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9921. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9922. ASSERT(modifyAssignmentCounter = 0);
  9923. IF dump # NIL THEN
  9924. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9925. dump.Ln;dump.Update;
  9926. END;
  9927. PushSelfPointer;
  9928. IF backend.cooperative THEN
  9929. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9930. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9931. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9932. END;
  9933. ELSE
  9934. Emit(Push(position,true));
  9935. IF lock THEN CallThis(position,"Objects","Lock",2)
  9936. ELSE CallThis(position,"Objects","Unlock",2);
  9937. END;
  9938. END;
  9939. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9940. IF Trace THEN TraceExit("Lock") END;
  9941. END Lock;
  9942. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9943. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9944. BEGIN
  9945. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9946. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9947. previouslyUnchecked := isUnchecked;
  9948. isUnchecked := isUnchecked OR x.isUnchecked;
  9949. previouslyCooperativeSwitches := cooperativeSwitches;
  9950. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9951. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9952. IF x.statements # NIL THEN
  9953. StatementSequence(x.statements);
  9954. END;
  9955. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9956. isUnchecked := previouslyUnchecked;
  9957. cooperativeSwitches := previouslyCooperativeSwitches;
  9958. IF Trace THEN TraceExit("VisitStatementBlock") END;
  9959. END VisitStatementBlock;
  9960. PROCEDURE VisitCode(x: SyntaxTree.Code);
  9961. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  9962. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  9963. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  9964. procedure: SyntaxTree.Procedure;
  9965. map: SymbolMap;
  9966. cc, parametersSize: LONGINT;
  9967. BEGIN
  9968. scope := currentScope;
  9969. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  9970. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9971. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9972. return := emptyOperand;
  9973. IF Trace THEN TraceEnter("VisitCode") END;
  9974. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  9975. NEW(in, x.inRules.Length());
  9976. FOR i := 0 TO LEN(in)-1 DO
  9977. statement := x.inRules.GetStatement(i);
  9978. WITH statement: SyntaxTree.Assignment DO
  9979. Evaluate(statement.right, operand);
  9980. result := operand.op;
  9981. NEW(str, 64);
  9982. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  9983. in[i] := result; IntermediateCode.SetString(in[i], str);
  9984. ReleaseIntermediateOperand(operand.tag);
  9985. END;
  9986. END;
  9987. ELSE in := NIL
  9988. END;
  9989. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  9990. NEW(out, x.outRules.Length());
  9991. FOR i := 0 TO LEN(out)-1 DO
  9992. statement := x.outRules.GetStatement(i);
  9993. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  9994. WITH statement: SyntaxTree.Assignment DO
  9995. Designate(statement.left, operand);
  9996. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  9997. NEW(str, 64);
  9998. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  9999. out[i] := result; IntermediateCode.SetString(out[i], str);
  10000. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  10001. |statement: SyntaxTree.ReturnStatement DO
  10002. NEW(str, 64);
  10003. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  10004. IF currentIsInline THEN
  10005. map := currentMapper.Get(NIL);
  10006. Designate(map.to, operand);
  10007. IF map.isAddress THEN
  10008. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10009. ELSE
  10010. result := operand.op;
  10011. END;
  10012. (*! only if it does not fit into register
  10013. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10014. *)
  10015. (*Evaluate(map.to, operand);*)
  10016. out[i] := result;
  10017. ELSE
  10018. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  10019. END;
  10020. IntermediateCode.SetString(out[i], str);
  10021. ReleaseIntermediateOperand(operand.tag);
  10022. return := out[i];
  10023. ELSE
  10024. END;
  10025. END;
  10026. ELSE out := NIL
  10027. END;
  10028. Emit(Asm(x.position,x.sourceCode, in, out));
  10029. IF in # NIL THEN
  10030. FOR i := 0 TO LEN(in)-1 DO
  10031. ReleaseIntermediateOperand(in[i]);
  10032. END;
  10033. END;
  10034. IF out # NIL THEN
  10035. FOR i := 0 TO LEN(out)-1 DO
  10036. WITH statement: SyntaxTree.Assignment DO
  10037. ReleaseIntermediateOperand(out[i]);
  10038. |statement: SyntaxTree.ReturnStatement DO
  10039. (* release happens below *)
  10040. ELSE
  10041. END;
  10042. statement := x.outRules.GetStatement(i);
  10043. END;
  10044. END;
  10045. IF return.mode # IntermediateCode.Undefined THEN
  10046. IF currentIsInline THEN
  10047. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  10048. Symbol(procedureType.returnParameter, par);
  10049. MakeMemory(mem, par.op, return.type, 0);
  10050. ReleaseOperand(par);
  10051. Emit(Mov(position, mem, return));
  10052. ReleaseIntermediateOperand(mem);
  10053. ELSE
  10054. Emit(Return(position,return));
  10055. END;
  10056. ReleaseIntermediateOperand(return);
  10057. IF currentIsInline THEN RETURN END;
  10058. cc := procedureType(SyntaxTree.ProcedureType).callingConvention;
  10059. IF cc = SyntaxTree.WinAPICallingConvention THEN
  10060. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10061. ELSE
  10062. parametersSize := 0;
  10063. END;
  10064. EmitLeave(section, position,procedure, cc);
  10065. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,cc, parametersSize));
  10066. END;
  10067. IF Trace THEN TraceExit("VisitCode") END;
  10068. END VisitCode;
  10069. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  10070. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  10071. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  10072. const, call: IntermediateCode.Operand;
  10073. parameterDesignator: SyntaxTree.Expression;
  10074. saved: RegisterEntry;
  10075. name: Basic.SegmentedName;
  10076. BEGIN
  10077. IF Trace THEN TraceEnter("ParameterCopies") END;
  10078. parameter := x.firstParameter;
  10079. WHILE parameter # NIL DO
  10080. IF parameter.kind = SyntaxTree.ValueParameter THEN
  10081. type := parameter.type.resolved;
  10082. IF IsOpenArray(type) THEN
  10083. VisitParameter(parameter);
  10084. op := result;
  10085. IF backend.cooperative & parameter.NeedsTrace() THEN
  10086. length := GetArrayLength(type, op.tag);
  10087. size := NewRegisterOperand(addressType);
  10088. base := ArrayBaseType(type);
  10089. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10090. Emit(Mul(position, size, length, const));
  10091. dst := NewRegisterOperand (addressType);
  10092. Emit(Mov(position, dst, size));
  10093. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10094. Emit(Sub(position,dst,sp,dst));
  10095. Emit(And(position,dst,dst,const));
  10096. Emit(Mov(position,sp,dst));
  10097. par := fp;
  10098. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10099. IntermediateCode.InitImmediate(null, byteType, 0);
  10100. Emit(Fill(position, dst, size, null));
  10101. ReleaseIntermediateOperand(dst);
  10102. ReleaseIntermediateOperand(length);
  10103. SaveRegisters();ReleaseUsedRegisters(saved);
  10104. (* register dst has been freed before SaveRegisters already *)
  10105. base := ArrayBaseType(type);
  10106. (* assign method of open array *)
  10107. IF base.IsRecordType() THEN
  10108. Emit (Push(position, length));
  10109. Emit (Push(position, dst));
  10110. Emit (Push(position, op.op));
  10111. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10112. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10113. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10114. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10115. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10116. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10117. Emit (Push(position,length));
  10118. Emit (Push(position, dst));
  10119. Emit (Push(position, length));
  10120. Emit (Push(position, op.op));
  10121. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10122. ELSE
  10123. Emit (Push(position, length));
  10124. Emit (Push(position, dst));
  10125. Emit (Push(position, length));
  10126. Emit (Push(position, op.op));
  10127. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10128. ASSERT(ArrayBaseType(type).IsPointer());
  10129. END;
  10130. RestoreRegisters(saved);
  10131. ELSE
  10132. temp := GetDynamicSize(type,op.tag);
  10133. ReuseCopy(size,temp);
  10134. ReleaseIntermediateOperand(temp);
  10135. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10136. Emit(Sub(position,size,sp,size));
  10137. Emit(And(position,size,size,const));
  10138. Emit(Mov(position,sp,size));
  10139. par := fp;
  10140. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10141. ReleaseIntermediateOperand(size);
  10142. size := GetDynamicSize(type,op.tag);
  10143. END;
  10144. Emit(Copy(position,sp,op.op,size));
  10145. ReleaseIntermediateOperand(size);
  10146. ReleaseOperand(op);
  10147. IntermediateCode.MakeMemory(par,addressType);
  10148. Emit(Mov(position,par,sp));
  10149. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10150. checker.SetCurrentScope(currentScope);
  10151. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10152. Assign(parameterDesignator,parameterDesignator);
  10153. END;
  10154. END;
  10155. parameter := parameter.nextParameter;
  10156. END;
  10157. IF Trace THEN TraceExit("ParameterCopies") END;
  10158. END ParameterCopies;
  10159. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10160. VAR x: SyntaxTree.Variable;
  10161. BEGIN
  10162. x := scope.firstVariable;
  10163. WHILE x # NIL DO
  10164. InitVariable(x,FALSE);
  10165. x := x.nextVariable;
  10166. END;
  10167. END InitVariables;
  10168. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10169. BEGIN
  10170. IF (symbol # NIL) THEN
  10171. RETURN fingerPrinter.SymbolFP(symbol).public
  10172. ELSE
  10173. RETURN 0
  10174. END;
  10175. END GetFingerprint;
  10176. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10177. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10178. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10179. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10180. name: Basic.SegmentedName;
  10181. offset: LONGINT;
  10182. BEGIN
  10183. IF Trace THEN TraceEnter("Body") END;
  10184. ReleaseUsedRegisters(saved); (* just in case ... *)
  10185. section := ir;
  10186. exitLabel := NewLabel ();
  10187. IF moduleBody THEN moduleBodySection := section END;
  10188. IF ir.comments # NIL THEN
  10189. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10190. commentPrintout.SingleStatement(TRUE);
  10191. dump := ir.comments;
  10192. ELSE
  10193. commentPrintout := NIL;
  10194. dump := NIL;
  10195. END;
  10196. prevScope := currentScope;
  10197. currentScope := scope;
  10198. lastSwitchPC := 0;
  10199. cooperativeSwitches := backend.cooperative;
  10200. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10201. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10202. IF x # NIL THEN
  10203. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10204. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10205. IF moduleBody THEN
  10206. ProfilerInit();
  10207. ELSE
  10208. Basic.SegmentedNameToString(ir.name, string);
  10209. ProfilerAddProcedure(numberProcedures,string);
  10210. ProfilerEnterExit(numberProcedures,TRUE);
  10211. END;
  10212. END;
  10213. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10214. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10215. END;
  10216. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10217. IF moduleBody & ~newObjectFile THEN
  10218. InitVariables(moduleScope)
  10219. END;
  10220. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10221. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10222. IF procedure = cellScope.bodyProcedure THEN
  10223. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10224. StaticCallOperand(op, cellScope.constructor);
  10225. Emit(Call(position,op.op,0));
  10226. END;
  10227. END;
  10228. END;
  10229. InitVariables(scope);
  10230. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10231. GetCodeSectionNameForSymbol(procedure, name);
  10232. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10233. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10234. IF ProtectModulesPointers THEN
  10235. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10236. ELSE
  10237. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10238. END;
  10239. IntermediateCode.SetOffset(right,offset); (* tag *)
  10240. IntermediateCode.InitMemory(left,addressType,fp,0);
  10241. Emit(Mov(position, left, right));
  10242. END;
  10243. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10244. ParameterCopies(procedureType);
  10245. IF x.code = NIL THEN
  10246. VisitStatementBlock(x);
  10247. ELSE
  10248. VisitCode(x.code)
  10249. END;
  10250. IF x.finally # NIL THEN (*! mark finally block for object file *)
  10251. ir.SetFinally(ir.pc);
  10252. StatementSequence(x.finally)
  10253. END;
  10254. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10255. IF ~backend.cooperative THEN
  10256. ProfilerEnterExit(numberProcedures,FALSE);
  10257. END;
  10258. INC(numberProcedures);
  10259. END;
  10260. END;
  10261. IF backend.cooperative THEN
  10262. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10263. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10264. END;
  10265. IF x # NIL THEN
  10266. SELF.position := x.position;
  10267. END;
  10268. CheckRegistersFree();
  10269. ASSERT(modifyAssignmentCounter = 0);
  10270. currentScope := prevScope;
  10271. IF Trace THEN TraceExit("Body") END;
  10272. END Body;
  10273. END ImplementationVisitor;
  10274. MetaDataGenerator=OBJECT
  10275. VAR
  10276. implementationVisitor: ImplementationVisitor;
  10277. declarationVisitor: DeclarationVisitor;
  10278. module: Sections.Module;
  10279. moduleName: ARRAY 128 OF CHAR;
  10280. moduleNamePool: Basic.HashTableInt;
  10281. moduleNamePoolSection: IntermediateCode.Section;
  10282. modulePointerSection: IntermediateCode.Section;
  10283. modulePointerSizePC: LONGINT;
  10284. modulePointerSectionOffset: LONGINT;
  10285. modulePointers: LONGINT;
  10286. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  10287. RecordBaseOffset: LONGINT;
  10288. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10289. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10290. TypeTags: LONGINT; (* type extension level support *)
  10291. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10292. patchInfoPC: LONGINT;
  10293. patchCRC: LONGINT;
  10294. CONST
  10295. EmptyBlockOffset = 2;
  10296. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10297. BEGIN
  10298. IF implementationVisitor.backend.cooperative THEN
  10299. TypeTags := MAX(LONGINT);
  10300. BaseTypesTableOffset := 0;
  10301. MethodTableOffset := 2;
  10302. TypeRecordBaseOffset := 0;
  10303. RecordBaseOffset := 0;
  10304. ELSIF simple THEN
  10305. TypeTags := 3; (* only 3 extensions allowed *)
  10306. BaseTypesTableOffset := 1;
  10307. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10308. TypeRecordBaseOffset := 0;
  10309. RecordBaseOffset := 1;
  10310. ELSE
  10311. TypeTags := 16;
  10312. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10313. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10314. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10315. (* change this when Heaps.HeapBlock is modified *)
  10316. RecordBaseOffset := 8;
  10317. END;
  10318. SELF.simple := simple;
  10319. SELF.implementationVisitor := implementationVisitor;
  10320. SELF.declarationVisitor := declarationVisitor;
  10321. implementationVisitor.meta := SELF;
  10322. declarationVisitor.meta := SELF;
  10323. END InitMetaDataGenerator;
  10324. PROCEDURE SetModule(module: Sections.Module);
  10325. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10326. BEGIN
  10327. SELF.module := module;
  10328. Global.GetModuleName(module.module,moduleName);
  10329. Global.GetSymbolSegmentedName(module.module, name);
  10330. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple & ~implementationVisitor.backend.cooperative THEN
  10331. NEW(moduleNamePool, 32);
  10332. (*! require GC protection *)
  10333. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10334. IF ProtectModulesPointers THEN
  10335. name := "Heaps.AnyPtr";
  10336. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10337. (* set base pointer *)
  10338. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10339. END;
  10340. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10341. modulePointers := 0;
  10342. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10343. AddPointer(moduleNamePoolSection, namePoolOffset);
  10344. END;
  10345. END SetModule;
  10346. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10347. BEGIN
  10348. IF ~implementationVisitor.backend.cooperative THEN
  10349. NamedSymbol(modulePointerSection, section.name, NIL, 0, offset);
  10350. INC(modulePointers);
  10351. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10352. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10353. END;
  10354. END AddPointer;
  10355. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10356. BEGIN
  10357. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10358. END GetTypeRecordBaseOffset;
  10359. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10360. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10361. BEGIN
  10362. (* change this when Heaps.HeapBlock is modified *)
  10363. INC(dataAdrOffset,6);
  10364. Info(section,"headerAdr");
  10365. Address(section,0);
  10366. Info(section,"typeDesc");
  10367. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10368. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10369. NamedSymbol(section, name, symbol, 0, offset);
  10370. Info(section,"mark: LONGINT;");
  10371. Longint(section,-1);
  10372. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10373. Info(section,"dataAdr-: ADDRESS");
  10374. Symbol(section,section, dataAdrOffset,0);
  10375. Info(section,"size-: SIZE");
  10376. Address(section,0);
  10377. Info(section,"nextMark: HeapBlock;");
  10378. Address(section,0);
  10379. END HeapBlock;
  10380. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10381. VAR i: LONGINT;
  10382. BEGIN
  10383. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10384. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10385. Info(section,"count*: LONGINT");
  10386. Longint(section,0);
  10387. Info(section,"locked*: BOOLEAN");
  10388. Longint(section,0);
  10389. Info(section,"awaitingLock*: ProcessQueue");
  10390. Address(section,0);
  10391. Address(section,0);
  10392. Info(section,"awaitingCond*: ProcessQueue");
  10393. Address(section,0);
  10394. Address(section,0);
  10395. Info(section,"lockedBy*: ANY");
  10396. Address(section,0);
  10397. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10398. Longint(section,1);
  10399. FOR i := 2 TO 6 DO
  10400. Longint(section,0);
  10401. END;
  10402. Info(section,"lock*: ANY");
  10403. Address(section,0);
  10404. END ProtectedHeapBlock;
  10405. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10406. BEGIN
  10407. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10408. END Info;
  10409. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10410. VAR op: IntermediateCode.Operand;
  10411. BEGIN
  10412. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10413. section.Emit(Data(Basic.invalidPosition,op));
  10414. END Address;
  10415. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10416. VAR op: IntermediateCode.Operand;
  10417. BEGIN
  10418. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10419. section.Emit(Data(Basic.invalidPosition,op));
  10420. END Size;
  10421. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  10422. VAR op: IntermediateCode.Operand;
  10423. BEGIN
  10424. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  10425. section.Emit(Data(Basic.invalidPosition,op));
  10426. END Set;
  10427. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10428. VAR op: IntermediateCode.Operand;
  10429. BEGIN
  10430. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10431. section.Emit(Data(Basic.invalidPosition,op));
  10432. END Longint;
  10433. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10434. VAR op,noOperand: IntermediateCode.Operand;
  10435. BEGIN
  10436. IntermediateCode.InitOperand(noOperand);
  10437. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10438. section.PatchOperands(pc,op,noOperand,noOperand);
  10439. END PatchAddress;
  10440. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10441. VAR op,noOperand: IntermediateCode.Operand;
  10442. BEGIN
  10443. IntermediateCode.InitOperand(noOperand);
  10444. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10445. section.PatchOperands(pc,op,noOperand,noOperand);
  10446. END PatchSize;
  10447. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10448. VAR op,noOperand: IntermediateCode.Operand;
  10449. BEGIN
  10450. IntermediateCode.InitOperand(noOperand);
  10451. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10452. section.PatchOperands(pc,op,noOperand,noOperand);
  10453. END PatchLongint;
  10454. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10455. VAR op, noOperand: IntermediateCode.Operand;
  10456. BEGIN
  10457. IntermediateCode.InitOperand(noOperand);
  10458. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10459. section.PatchOperands(pc,op,noOperand,noOperand);
  10460. END PatchSymbol;
  10461. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10462. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10463. BEGIN
  10464. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10465. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10466. section.Emit(Data(Basic.invalidPosition,op));
  10467. END Boolean;
  10468. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10469. VAR op: IntermediateCode.Operand;
  10470. BEGIN
  10471. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10472. section.Emit(Data(Basic.invalidPosition,op));
  10473. END Char;
  10474. PROCEDURE Integer(section: IntermediateCode.Section; int: LONGINT);
  10475. VAR op: IntermediateCode.Operand;
  10476. BEGIN
  10477. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.integerType),int);
  10478. section.Emit(Data(Basic.invalidPosition,op));
  10479. END Integer;
  10480. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10481. VAR i: LONGINT;
  10482. BEGIN
  10483. Info(section,str);
  10484. i := 0;
  10485. WHILE(str[i] # 0X) DO
  10486. Char(section,str[i]);
  10487. INC(i);
  10488. END;
  10489. Char(section,0X);
  10490. END String;
  10491. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10492. VAR s: Basic.SectionName;
  10493. BEGIN
  10494. StringPool.GetString(str, s);
  10495. String(section, s);
  10496. END String0;
  10497. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10498. VAR op: IntermediateCode.Operand;
  10499. BEGIN
  10500. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10501. IntermediateCode.SetOffset(op,realOffset);
  10502. section.Emit(Data(Basic.invalidPosition,op));
  10503. END NamedSymbol;
  10504. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10505. VAR op: IntermediateCode.Operand;
  10506. BEGIN
  10507. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10508. IntermediateCode.SetOffset(op,realOffset);
  10509. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10510. END NamedSymbolAt;
  10511. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10512. BEGIN
  10513. IF symbol= NIL THEN
  10514. Address( section, realOffset);
  10515. ASSERT(virtualOffset = 0);
  10516. ELSE
  10517. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10518. END;
  10519. END Symbol;
  10520. (* OutPointers delivers
  10521. {pointerOffset}
  10522. *)
  10523. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10524. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10525. BEGIN
  10526. type := type.resolved;
  10527. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10528. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10529. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10530. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10531. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10532. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10533. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10534. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10535. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10536. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10537. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10538. ELSIF (type IS SyntaxTree.RecordType) THEN
  10539. (* never treat a record like a pointer, even if the pointer field is set! *)
  10540. WITH type: SyntaxTree.RecordType DO
  10541. base := type.GetBaseRecord();
  10542. IF base # NIL THEN
  10543. Pointers(offset,symbol,section, base,numberPointers);
  10544. END;
  10545. variable := type.recordScope.firstVariable;
  10546. WHILE(variable # NIL) DO
  10547. IF ~(variable.untraced) THEN
  10548. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10549. END;
  10550. variable := variable.nextVariable;
  10551. END;
  10552. END;
  10553. ELSIF (type IS SyntaxTree.CellType) THEN
  10554. WITH type: SyntaxTree.CellType DO
  10555. base := type.GetBaseRecord();
  10556. IF base # NIL THEN
  10557. Pointers(offset,symbol,section, base,numberPointers);
  10558. END;
  10559. variable := type.cellScope.firstVariable;
  10560. WHILE(variable # NIL) DO
  10561. IF ~(variable.untraced) THEN
  10562. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10563. END;
  10564. variable := variable.nextVariable;
  10565. END;
  10566. property := type.firstProperty;
  10567. WHILE(property # NIL) DO
  10568. IF ~(property.untraced) THEN
  10569. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10570. END;
  10571. property := property.nextProperty;
  10572. END;
  10573. parameter := type.firstParameter;
  10574. WHILE(parameter # NIL) DO
  10575. IF ~(parameter.untraced) THEN
  10576. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10577. END;
  10578. parameter := parameter.nextParameter;
  10579. END;
  10580. END;
  10581. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10582. WITH type: SyntaxTree.ArrayType DO
  10583. IF type.form= SyntaxTree.Static THEN
  10584. n := type.staticLength;
  10585. base := type.arrayBase.resolved;
  10586. WHILE(base IS SyntaxTree.ArrayType) DO
  10587. type := base(SyntaxTree.ArrayType);
  10588. n := n* type.staticLength;
  10589. base := type.arrayBase.resolved;
  10590. END;
  10591. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10592. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  10593. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10594. FOR i := 0 TO n-1 DO
  10595. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10596. END;
  10597. END;
  10598. ELSE
  10599. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10600. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10601. END;
  10602. END;
  10603. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10604. WITH type: SyntaxTree.MathArrayType DO
  10605. IF type.form = SyntaxTree.Static THEN
  10606. n := type.staticLength;
  10607. base := type.arrayBase.resolved;
  10608. WHILE(base IS SyntaxTree.MathArrayType) DO
  10609. type := base(SyntaxTree.MathArrayType);
  10610. n := n* type.staticLength;
  10611. base := type.arrayBase.resolved;
  10612. END;
  10613. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10614. IF SemanticChecker.ContainsPointer(base) THEN
  10615. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10616. FOR i := 0 TO n-1 DO
  10617. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10618. END;
  10619. END;
  10620. ELSE
  10621. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10622. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10623. END
  10624. END;
  10625. (* ELSE no pointers in type *)
  10626. END;
  10627. END Pointers;
  10628. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10629. VAR position,i: LONGINT; ch: CHAR;
  10630. BEGIN
  10631. IF pool.Has(index) THEN
  10632. RETURN pool.GetInt(index)
  10633. ELSE
  10634. position := source.pc;
  10635. pool.PutInt(index, position);
  10636. Info(source, name);
  10637. i := 0;
  10638. REPEAT
  10639. ch := name[i]; INC(i);
  10640. Char( source, ch);
  10641. UNTIL ch = 0X;
  10642. END;
  10643. RETURN position;
  10644. END EnterDynamicName;
  10645. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10646. VAR name: Basic.SectionName; position: LONGINT;
  10647. BEGIN
  10648. IF pool.Has(index) THEN
  10649. RETURN pool.GetInt(index)
  10650. ELSE
  10651. StringPool.GetString(index, name);
  10652. position := EnterDynamicName(source,name,index, pool);
  10653. END;
  10654. RETURN position;
  10655. END DynamicName;
  10656. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10657. VAR section: IntermediateCode.Section;
  10658. BEGIN
  10659. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10660. IF implementationVisitor.backend.cooperative THEN
  10661. Info(section, "TypeDescriptor");
  10662. Basic.ToSegmentedName("BaseTypes.Array", name);
  10663. NamedSymbol(section, name,NIL, 0, 0);
  10664. BasePointer(section);
  10665. offset := 0;
  10666. ELSE
  10667. IF ProtectModulesPointers THEN
  10668. HeapBlock(mName,typeName,section,2);
  10669. END;
  10670. Info(section, "HeapBlock");
  10671. IF ProtectModulesPointers THEN
  10672. Symbol(section,section,2,0);
  10673. ELSE
  10674. Address(section,0);
  10675. END;
  10676. Info(section, "TypeDescriptor");
  10677. Address(section,0);
  10678. offset := section.pc;
  10679. END;
  10680. RETURN section
  10681. END NamedBlock;
  10682. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10683. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10684. BEGIN
  10685. COPY(moduleName,name);
  10686. Strings.Append(name,suffix);
  10687. Basic.ToSegmentedName(name, pooledName);
  10688. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10689. END Block;
  10690. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10691. VAR name: Basic.SegmentedName;
  10692. BEGIN
  10693. Info(source,"ArrayHeader");
  10694. IF implementationVisitor.backend.cooperative THEN
  10695. sizePC := source.pc;
  10696. Address(source,0);
  10697. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10698. IF baseType # "" THEN
  10699. Basic.ToSegmentedName(baseType, name);
  10700. NamedSymbol(source, name,NIL, 0, 0);
  10701. ELSE
  10702. Address(source,0);
  10703. END;
  10704. Address(source,0);
  10705. ELSE
  10706. Address(source,0);
  10707. Address(source,0);
  10708. (* first pointer for GC *)
  10709. IF hasPointer THEN
  10710. (* points to first element in the array, this is NOT the base type descriptor *)
  10711. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  10712. ELSE
  10713. Address(source,0);
  10714. END;
  10715. sizePC := source.pc;
  10716. Address(source,0);
  10717. Info(source,"array data");
  10718. END;
  10719. END ArrayBlock;
  10720. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10721. BEGIN
  10722. IF implementationVisitor.backend.cooperative THEN
  10723. PatchSize(section, pc, size);
  10724. PatchSize(section, pc + 3, size);
  10725. ELSE
  10726. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  10727. PatchSize(section, pc, size);
  10728. END;
  10729. END PatchArray;
  10730. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10731. VAR
  10732. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10733. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10734. poolMap: Basic.HashTableInt;
  10735. namePool: IntermediateCode.Section;
  10736. namePoolOffset: LONGINT;
  10737. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10738. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10739. BEGIN
  10740. Basic.SegmentedNameToString(s1.name,n1);
  10741. Basic.SegmentedNameToString(s2.name,n2);
  10742. index := 0;
  10743. ch1 := n1[index];
  10744. ch2 := n2[index];
  10745. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10746. INC(index);
  10747. ch1 := n1[index];
  10748. ch2 := n2[index];
  10749. END;
  10750. RETURN ch1 < ch2;
  10751. END Compare;
  10752. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10753. VAR
  10754. i, j: LONGINT;
  10755. x, t: Sections.Section;
  10756. BEGIN
  10757. IF lo < hi THEN
  10758. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10759. WHILE i <= j DO
  10760. WHILE Compare(list[i], x) DO INC(i) END;
  10761. WHILE Compare(x, list[j]) DO DEC(j) END;
  10762. IF i <= j THEN
  10763. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10764. INC(i); DEC(j)
  10765. END
  10766. END;
  10767. IF lo < j THEN QuickSort(list, lo, j) END;
  10768. IF i < hi THEN QuickSort(list, i, hi) END
  10769. END;
  10770. END QuickSort;
  10771. (*
  10772. ExportDesc* = RECORD
  10773. fp*: ADDRESS;
  10774. name* {UNTRACED}: DynamicName;
  10775. adr*: ADDRESS;
  10776. exports*: LONGINT;
  10777. dsc* {UNTRACED}: ExportArray
  10778. END;
  10779. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10780. *)
  10781. PROCEDURE ExportDesc2(
  10782. source: IntermediateCode.Section;
  10783. namePool: IntermediateCode.Section;
  10784. fingerPrinter: FingerPrinter.FingerPrinter;
  10785. symbol: Sections.Section;
  10786. name: StringPool.Index;
  10787. VAR patchAdr: LONGINT
  10788. ): BOOLEAN;
  10789. VAR fingerPrint: SyntaxTree.FingerPrint;
  10790. BEGIN
  10791. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10792. & (symbol.type # Sections.InlineCodeSection)
  10793. THEN
  10794. *)
  10795. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10796. & (symbol.type # Sections.InlineCodeSection))
  10797. THEN
  10798. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10799. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10800. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10801. Longint(source,fingerPrint.public);
  10802. ELSE
  10803. Longint(source, 0);
  10804. END;
  10805. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  10806. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10807. Symbol(source, symbol,0,0);
  10808. patchAdr := source.pc;
  10809. Longint(source, 0);
  10810. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  10811. Address(source,0);
  10812. END;
  10813. RETURN TRUE
  10814. ELSE
  10815. RETURN FALSE
  10816. END;
  10817. END ExportDesc2;
  10818. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10819. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10820. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10821. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  10822. nextPatch: LONGINT;
  10823. TYPE
  10824. Scope = RECORD
  10825. elements: LONGINT;
  10826. gelements: LONGINT;
  10827. section: IntermediateCode.Section;
  10828. patchAdr: LONGINT;
  10829. arraySizePC: LONGINT;
  10830. beginPC: LONGINT; (* current scope start pc *)
  10831. END;
  10832. BEGIN
  10833. Basic.InitSegmentedName(prev);
  10834. olevel := -1;
  10835. scopes[0].section := source;
  10836. scopes[0].arraySizePC := MIN(LONGINT);
  10837. FOR s := 0 TO LEN(sections)-1 DO
  10838. symbol := sections[s];
  10839. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10840. this := sections[s].name;
  10841. level := 0;
  10842. WHILE (this[level] > 0) DO
  10843. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10844. INC(level);
  10845. END;
  10846. WHILE level < olevel DO
  10847. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10848. IF olevel > 0 THEN
  10849. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10850. nextPatch := scopes[olevel-1].patchAdr+1;
  10851. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10852. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10853. END;
  10854. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10855. DEC(olevel);
  10856. END;
  10857. IF (this[level] > 0) THEN
  10858. IF level > olevel THEN
  10859. (*TRACE("opening",level); *)
  10860. IF scopes[level].section = NIL THEN
  10861. arrayName := ".@ExportArray";
  10862. Strings.AppendInt(arrayName, level);
  10863. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  10864. AddPointer(scopes[level].section,offset);
  10865. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  10866. END;
  10867. scopes[level].beginPC := scopes[level].section.pc;
  10868. olevel := level;
  10869. scopes[olevel].elements := 0;
  10870. END;
  10871. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10872. sym := sections[s];
  10873. ELSE
  10874. sym := NIL;
  10875. END;
  10876. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10877. THEN
  10878. INC(scopes[olevel].elements);
  10879. END;
  10880. (* enter string in scope *)
  10881. INC(level);
  10882. END;
  10883. END;
  10884. Basic.SegmentedNameToString(this, name);
  10885. prev := this;
  10886. END;
  10887. END;
  10888. WHILE 0 <= olevel DO
  10889. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10890. IF olevel > 0 THEN
  10891. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10892. nextPatch := scopes[olevel-1].patchAdr+1;
  10893. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10894. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10895. END;
  10896. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10897. DEC(olevel);
  10898. END;
  10899. level := 0;
  10900. WHILE (level < LEN(scopes)) DO
  10901. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  10902. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10903. END;
  10904. INC(level);
  10905. END;
  10906. END Export;
  10907. BEGIN
  10908. NEW(fingerPrinter);
  10909. NEW(poolMap, 64);
  10910. (* 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 *)
  10911. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10912. NEW(sectionArray, module.allSections.Length());
  10913. FOR i := 0 TO module.allSections.Length() - 1 DO
  10914. section := module.allSections.GetSection(i);
  10915. sectionArray[i] := section;
  10916. END;
  10917. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10918. Export(sectionArray^);
  10919. END ExportDesc;
  10920. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10921. VAR
  10922. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10923. BEGIN
  10924. Info(source, "exception table offsets array descriptor");
  10925. size := 0;
  10926. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  10927. Info(source, "exception table content");
  10928. FOR i := 0 TO module.allSections.Length() - 1 DO
  10929. p := module.allSections.GetSection(i);
  10930. IF p.type = Sections.CodeSection THEN
  10931. finallyPC := p(IntermediateCode.Section).finally;
  10932. IF finallyPC>=0 THEN
  10933. Symbol( source, p, 0,0);
  10934. Symbol( source, p, finallyPC, 0);
  10935. Symbol( source, p, finallyPC,0);
  10936. INC(size);
  10937. END;
  10938. END
  10939. END;
  10940. PatchArray(source,sizePC,size);
  10941. END ExceptionArray;
  10942. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10943. VAR i: LONGINT; ch: CHAR;
  10944. BEGIN
  10945. i := 0;
  10946. REPEAT
  10947. ch := name[i]; INC(i);
  10948. Char( section, ch);
  10949. UNTIL ch = 0X;
  10950. WHILE i < 32 DO
  10951. Char( section, 0X); INC(i);
  10952. END;
  10953. END Name;
  10954. PROCEDURE References(section: IntermediateCode.Section);
  10955. CONST
  10956. sfTypeNone = 0X;
  10957. sfTypeCHAR = 01X;
  10958. sfTypeCHAR8 = 02X;
  10959. sfTypeCHAR16 = 03X;
  10960. sfTypeCHAR32 = 04X;
  10961. sfTypeRANGE = 05X;
  10962. sfTypeSHORTINT = 06X;
  10963. sfTypeINTEGER = 07X;
  10964. sfTypeLONGINT = 08X;
  10965. sfTypeHUGEINT = 09X;
  10966. sfTypeWORD = 0AX;
  10967. sfTypeLONGWORD = 0BX;
  10968. sfTypeSIGNED8 = 0CX;
  10969. sfTypeSIGNED16 = 0DX;
  10970. sfTypeSIGNED32 = 0EX;
  10971. sfTypeSIGNED64 = 0FX;
  10972. sfTypeUNSIGNED8 = 10X;
  10973. sfTypeUNSIGNED16 = 11X;
  10974. sfTypeUNSIGNED32 = 12X;
  10975. sfTypeUNSIGNED64 = 13X;
  10976. sfTypeREAL = 14X;
  10977. sfTypeLONGREAL = 15X;
  10978. sfTypeCOMPLEX = 16X;
  10979. sfTypeLONGCOMPLEX = 17X;
  10980. sfTypeBOOLEAN = 18X;
  10981. sfTypeSET = 19X;
  10982. sfTypeANY = 1AX;
  10983. sfTypeOBJECT = 1BX;
  10984. sfTypeBYTE = 1CX;
  10985. sfTypeADDRESS = 1DX;
  10986. sfTypeSIZE = 1EX;
  10987. sfTypeIndirect = 1FX;
  10988. sfTypeRecord = 20X;
  10989. sfTypePointerToRecord = 21X;
  10990. sfTypePointerToArray = 22X;
  10991. sfTypeOpenArray = 23X;
  10992. sfTypeStaticArray = 24X;
  10993. sfTypeDynamicArray = 25X;
  10994. sfTypeMathStaticArray = 26X;
  10995. sfTypeMathOpenArray = 27X;
  10996. sfTypeMathTensor = 28X;
  10997. sfTypeDelegate = 29X;
  10998. sfTypeENUM = 2AX;
  10999. sfTypeCELL = 2BX;
  11000. sfTypePORT = 2CX;
  11001. sfIN = 0X;
  11002. sfOUT = 1X;
  11003. flagDelegate = 0;
  11004. flagConstructor = 1;
  11005. (* variable / parameter addressing modes *)
  11006. sfAbsolute = 0X; (* global vars *)
  11007. sfRelative = 1X; (* variables, value parameters *)
  11008. sfIndirect = 2X; (* var parameters *)
  11009. sfScopeBegin = 0F0X;
  11010. sfScopeEnd = 0F1X;
  11011. sfProcedure = 0F2X;
  11012. sfVariable = 0F3X;
  11013. sfTypeDeclaration = 0F4X;
  11014. sfModule = 0FFX;
  11015. RefInfo = TRUE;
  11016. VAR
  11017. s: Sections.Section; sizePC, i, startPC, lastOffset: LONGINT;
  11018. indirectTypes: Basic.HashTable;
  11019. PROCEDURE CurrentIndex(): LONGINT;
  11020. VAR i: LONGINT;
  11021. BEGIN
  11022. FOR i := startPC TO section.pc -1 DO
  11023. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  11024. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  11025. END;
  11026. startPC := section.pc;
  11027. RETURN lastOffset;
  11028. END CurrentIndex;
  11029. (*
  11030. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11031. Module = sfModule prevSymbol:SIZE name:String Scope.
  11032. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11033. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  11034. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11035. Type =
  11036. sfTypePointerToRecord
  11037. | sfTypePointerToArray Type
  11038. | sfTypeOpenArray Type
  11039. | sfTypeDynamicArray Type
  11040. | sfTypeStaticArray length:SIZE Type
  11041. | sfTypeMathOpenArray Type
  11042. | sfTypeMathStaticArray length:SIZE Type
  11043. | sfTypeMathTensor Type
  11044. | sfTypeRecord tdAdr:ADDRESS
  11045. | sfTypeDelegate {Parameter} return:Type
  11046. | sfTypePort (sfIN | sfOUT)
  11047. | sfTypeBOOLEAN
  11048. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  11049. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  11050. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  11051. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  11052. | sfTypeWORD | sfTypeLONGWORD
  11053. | sfTypeREAL | sfTypeLONGREAL
  11054. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  11055. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  11056. | sfTypeIndirect offset:SIZE.
  11057. *)
  11058. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  11059. VAR offset: SIZE;
  11060. BEGIN
  11061. IF indirectTypes.Has(type) THEN
  11062. offset := indirectTypes.GetInt(type);
  11063. Char(section, sfTypeIndirect);
  11064. Size(section, offset);
  11065. RETURN TRUE;
  11066. ELSE
  11067. indirectTypes.PutInt(type, CurrentIndex());
  11068. RETURN FALSE;
  11069. END;
  11070. END Indirect;
  11071. PROCEDURE NType(type: SyntaxTree.Type);
  11072. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  11073. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  11074. BEGIN
  11075. IF type = NIL THEN
  11076. Char(section, sfTypeNone)
  11077. ELSE
  11078. type := type.resolved;
  11079. size := type.sizeInBits;
  11080. WITH type:SyntaxTree.PointerType DO
  11081. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11082. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11083. Char(section, sfTypePointerToRecord);
  11084. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11085. ELSE
  11086. IF RefInfo THEN Info(section,"PointerToArray") END;
  11087. Char(section, sfTypePointerToArray);
  11088. NType(type.pointerBase);
  11089. END;
  11090. | type: SyntaxTree.ArrayType DO
  11091. IF ~Indirect(type) THEN
  11092. IF type.form = SyntaxTree.Open THEN
  11093. IF RefInfo THEN Info(section,"OpenArray") END;
  11094. Char(section, sfTypeOpenArray);
  11095. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11096. IF RefInfo THEN Info(section,"DynamicArray") END;
  11097. Char(section, sfTypeDynamicArray);
  11098. ELSIF type.form = SyntaxTree.Static THEN
  11099. IF RefInfo THEN Info(section,"StaticArray") END;
  11100. Char(section, sfTypeStaticArray);
  11101. Size(section, type.staticLength);
  11102. ELSE
  11103. HALT(100);
  11104. END;
  11105. NType(type.arrayBase);
  11106. END;
  11107. | type: SyntaxTree.MathArrayType DO
  11108. IF ~Indirect(type) THEN
  11109. IF type.form = SyntaxTree.Open THEN
  11110. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11111. Char(section, sfTypeMathOpenArray);
  11112. ELSIF type.form = SyntaxTree.Static THEN
  11113. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11114. Char(section, sfTypeMathStaticArray);
  11115. Size(section, type.staticLength);
  11116. ELSIF type.form = SyntaxTree.Tensor THEN
  11117. IF RefInfo THEN Info(section,"MathTensor") END;
  11118. Char(section, sfTypeMathTensor);
  11119. ELSE
  11120. HALT(100);
  11121. END;
  11122. NType(type.arrayBase);
  11123. END;
  11124. | type: SyntaxTree.RecordType DO
  11125. IF ~Indirect(type) THEN
  11126. IF type.pointerType # NIL (* OBJECT *) THEN
  11127. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11128. Char(section, sfTypePointerToRecord)
  11129. ELSE
  11130. IF RefInfo THEN Info(section,"Record") END;
  11131. Char(section, sfTypeRecord);
  11132. td := type.typeDeclaration;
  11133. IF RefInfo THEN Info(section,"TD") END;
  11134. IF (td # NIL) THEN
  11135. Global.GetSymbolSegmentedName(td,segmentedName);
  11136. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11137. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11138. ELSE
  11139. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11140. END;
  11141. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11142. Symbol(section, tir, 0, offset);
  11143. ELSE
  11144. Address(section, 0);
  11145. END;
  11146. END;
  11147. END;
  11148. | type: SyntaxTree.CellType DO
  11149. IF ~Indirect(type) THEN
  11150. IF RefInfo THEN Info(section,"Record") END;
  11151. Char(section, sfTypeRecord);
  11152. td := type.typeDeclaration;
  11153. IF RefInfo THEN Info(section,"TD") END;
  11154. IF (td # NIL) THEN
  11155. Global.GetSymbolSegmentedName(td,segmentedName);
  11156. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11157. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11158. ELSE
  11159. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11160. END;
  11161. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11162. Symbol(section, tir, 0, offset);
  11163. ELSE
  11164. Address(section, 0);
  11165. END;
  11166. END;
  11167. | type: SyntaxTree.PortType DO
  11168. Char(section, sfTypePORT);
  11169. IF type.direction = SyntaxTree.OutPort THEN
  11170. Char(section, sfOUT)
  11171. ELSE
  11172. Char(section, sfIN)
  11173. END;
  11174. | type: SyntaxTree.ProcedureType DO
  11175. IF ~Indirect(type) THEN
  11176. Char(section, sfTypeDelegate);
  11177. parameter := type.firstParameter;
  11178. WHILE(parameter # NIL) DO
  11179. NParameter(parameter, -1);
  11180. parameter := parameter.nextParameter;
  11181. END;
  11182. NType(type.returnType);
  11183. END;
  11184. | type:SyntaxTree.EnumerationType DO
  11185. Char(section, sfTypeENUM);
  11186. | type: SyntaxTree.BasicType DO
  11187. WITH type: SyntaxTree.BooleanType DO
  11188. IF RefInfo THEN Info(section,"Boolean") END;
  11189. Char(section, sfTypeBOOLEAN);
  11190. | type: SyntaxTree.CharacterType DO
  11191. IF type = module.system.characterType THEN
  11192. IF RefInfo THEN Info(section,"CHAR") END;
  11193. Char(section, sfTypeCHAR);
  11194. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11195. IF RefInfo THEN Info(section,"CHAR8") END;
  11196. Char(section, sfTypeCHAR8)
  11197. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11198. IF RefInfo THEN Info(section,"CHAR16") END;
  11199. Char(section, sfTypeCHAR16);
  11200. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11201. IF RefInfo THEN Info(section,"CHAR32") END;
  11202. Char(section, sfTypeCHAR32);
  11203. ELSE
  11204. HALT(100);
  11205. END;
  11206. |type: SyntaxTree.IntegerType DO
  11207. IF type(SyntaxTree.IntegerType).signed THEN
  11208. IF (type = module.system.shortintType) THEN
  11209. IF RefInfo THEN Info(section,"SHORTINT") END;
  11210. Char(section, sfTypeSHORTINT)
  11211. ELSIF (type = module.system.integerType) THEN
  11212. IF RefInfo THEN Info(section,"INTEGER") END;
  11213. Char(section, sfTypeINTEGER)
  11214. ELSIF (type = module.system.longintType) THEN
  11215. IF RefInfo THEN Info(section,"LONGINT") END;
  11216. Char(section, sfTypeLONGINT)
  11217. ELSIF (type = module.system.hugeintType) THEN
  11218. IF RefInfo THEN Info(section,"HUGEINT") END;
  11219. Char(section, sfTypeHUGEINT)
  11220. ELSIF (type = module.system.wordType) THEN
  11221. IF RefInfo THEN Info(section,"WORD") END;
  11222. Char(section, sfTypeWORD)
  11223. ELSIF (type = module.system.longWordType) THEN
  11224. IF RefInfo THEN Info(section,"LONGWORD") END;
  11225. Char(section, sfTypeLONGWORD);
  11226. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11227. IF RefInfo THEN Info(section,"SIGNED8") END;
  11228. Char(section, sfTypeSIGNED8)
  11229. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11230. IF RefInfo THEN Info(section,"SIGNED16") END;
  11231. Char(section, sfTypeSIGNED16)
  11232. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11233. IF RefInfo THEN Info(section,"SIGNED32") END;
  11234. Char(section, sfTypeSIGNED32)
  11235. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11236. IF RefInfo THEN Info(section,"SIGNED64") END;
  11237. Char(section, sfTypeSIGNED64)
  11238. ELSE
  11239. HALT(100);
  11240. END
  11241. ELSE (* unsigned *)
  11242. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11243. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11244. Char(section, sfTypeUNSIGNED8)
  11245. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11246. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11247. Char(section, sfTypeUNSIGNED16)
  11248. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11249. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11250. Char(section, sfTypeUNSIGNED32)
  11251. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11252. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11253. Char(section, sfTypeUNSIGNED64)
  11254. ELSE
  11255. HALT(100)
  11256. END
  11257. END;
  11258. | type: SyntaxTree.FloatType DO
  11259. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11260. IF RefInfo THEN Info(section,"REAL") END;
  11261. Char(section, sfTypeREAL);
  11262. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11263. IF RefInfo THEN Info(section,"LONGREAL") END;
  11264. Char(section, sfTypeLONGREAL);
  11265. ELSE
  11266. HALT(100);
  11267. END;
  11268. |type: SyntaxTree.ComplexType DO
  11269. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11270. IF RefInfo THEN Info(section,"COMPLEX") END;
  11271. Char(section, sfTypeCOMPLEX);
  11272. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11273. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11274. Char(section, sfTypeLONGCOMPLEX);
  11275. ELSE
  11276. HALT(100);
  11277. END;
  11278. |type:SyntaxTree.SetType DO
  11279. IF RefInfo THEN Info(section,"SET") END;
  11280. Char(section, sfTypeSET);
  11281. |type:SyntaxTree.AnyType DO
  11282. IF RefInfo THEN Info(section,"ANY") END;
  11283. Char(section, sfTypeANY);
  11284. |type:SyntaxTree.ObjectType DO
  11285. IF RefInfo THEN Info(section,"OBJECT") END;
  11286. Char(section, sfTypeOBJECT);
  11287. |type:SyntaxTree.ByteType DO
  11288. IF RefInfo THEN Info(section,"BYTE") END;
  11289. Char(section, sfTypeBYTE);
  11290. |type:SyntaxTree.RangeType DO
  11291. IF RefInfo THEN Info(section,"RANGE") END;
  11292. Char(section, sfTypeRANGE)
  11293. |type:SyntaxTree.AddressType DO
  11294. IF RefInfo THEN Info(section,"ADDRESS") END;
  11295. Char(section, sfTypeADDRESS)
  11296. |type:SyntaxTree.SizeType DO
  11297. IF RefInfo THEN Info(section,"SIZE") END;
  11298. Char(section, sfTypeSIZE)
  11299. ELSE
  11300. HALT(100)
  11301. END;
  11302. ELSE HALT(101);
  11303. END;
  11304. END;
  11305. END NType;
  11306. (*
  11307. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11308. *)
  11309. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11310. VAR pos: LONGINT; type: SyntaxTree.Type;
  11311. BEGIN
  11312. IF RefInfo THEN Info(section, "Parameter") END;
  11313. Char(section, sfVariable);
  11314. Size(section, procOffset);
  11315. String0(section, parameter.name);
  11316. type := parameter.type.resolved;
  11317. IF parameter.kind = SyntaxTree.VarParameter THEN
  11318. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11319. ELSE Char(section, sfIndirect)
  11320. END;
  11321. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11322. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11323. Char(section, sfIndirect);
  11324. ELSE
  11325. Char(section, sfRelative);
  11326. END;
  11327. ELSE
  11328. Char(section, sfRelative);
  11329. END;
  11330. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11331. NType(parameter.type);
  11332. END NParameter;
  11333. (*
  11334. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11335. *)
  11336. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11337. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11338. flags: SET;
  11339. BEGIN
  11340. IF procedure.externalName # NIL THEN RETURN END;
  11341. IF RefInfo THEN Info(section, "Procedure") END;
  11342. pos := CurrentIndex();
  11343. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11344. Char(section, sfProcedure);
  11345. Size(section, scopeOffset);
  11346. String0(section,procedure.name);
  11347. s := module.allSections.FindBySymbol(procedure);
  11348. Symbol(section,s,0,0); (* start *)
  11349. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11350. flags := {};
  11351. IF procedureType.isDelegate THEN
  11352. INCL(flags, flagDelegate);
  11353. END;
  11354. IF procedure.isConstructor THEN
  11355. INCL(flags, flagConstructor);
  11356. END;
  11357. Set(section, flags);
  11358. IF RefInfo THEN Info(section, "Parameters") END;
  11359. parameter := procedureType.firstParameter;
  11360. WHILE(parameter # NIL) DO
  11361. NParameter(parameter, pos);
  11362. parameter := parameter.nextParameter;
  11363. END;
  11364. IF procedureType.returnParameter # NIL THEN
  11365. NParameter(procedureType.returnParameter, pos);
  11366. END;
  11367. IF procedureType.selfParameter # NIL THEN
  11368. NParameter(procedureType.selfParameter, pos);
  11369. END;
  11370. IF RefInfo THEN Info(section, "ReturnType") END;
  11371. NType(procedureType.returnType);
  11372. NScope(procedure.procedureScope, pos);
  11373. END NProcedure;
  11374. (*
  11375. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11376. *)
  11377. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11378. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11379. BEGIN
  11380. IF RefInfo THEN Info(section, "Variable") END;
  11381. pos := CurrentIndex();
  11382. Char(section, sfVariable);
  11383. Size(section, scopeOffset);
  11384. String0(section, variable.name);
  11385. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11386. Char(section, sfAbsolute);
  11387. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11388. NamedSymbol(section, sn,variable, 0,0);
  11389. ELSE
  11390. Char(section, sfRelative);
  11391. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11392. END;
  11393. NType(variable.type);
  11394. s := module.allSections.FindBySymbol(variable);
  11395. END NVariable;
  11396. (*
  11397. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11398. *)
  11399. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11400. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11401. BEGIN
  11402. IF typeDeclaration = NIL THEN RETURN END;
  11403. pos := CurrentIndex();
  11404. s := module.allSections.FindBySymbol(typeDeclaration);
  11405. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11406. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11407. Char(section, sfTypeDeclaration);
  11408. Size(section, scopeOffset);
  11409. String0(section, typeDeclaration.name);
  11410. declared := typeDeclaration.declaredType.resolved;
  11411. IF (declared IS SyntaxTree.PointerType) THEN
  11412. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11413. END;
  11414. WITH declared: SyntaxTree.RecordType DO
  11415. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11416. Symbol(section, s, 0, offset);
  11417. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11418. Basic.AppendToSegmentedName(name,".@Info");
  11419. s := module.allSections.FindByName(name);
  11420. IF s # NIL THEN (* does not work for coop *)
  11421. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11422. END;
  11423. NScope(declared.recordScope, pos);
  11424. |declared: SyntaxTree.CellType DO
  11425. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11426. Symbol(section, s, 0, offset);
  11427. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11428. Basic.AppendToSegmentedName(name,".@Info");
  11429. s := module.allSections.FindByName(name);
  11430. IF s # NIL THEN
  11431. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11432. END;
  11433. NScope(declared.cellScope, pos);
  11434. ELSE
  11435. Address(section, 0);
  11436. END;
  11437. END NTypeDeclaration;
  11438. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11439. VAR pos: LONGINT;
  11440. BEGIN
  11441. pos := CurrentIndex();
  11442. Char(section,sfModule);
  11443. Size(section, prevSymbol);
  11444. String0(section, module.name);
  11445. NScope(module.moduleScope, pos);
  11446. END NModule;
  11447. (*
  11448. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11449. *)
  11450. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11451. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration; pos: LONGINT;
  11452. BEGIN
  11453. IF scope = NIL THEN RETURN END;
  11454. IF RefInfo THEN Info(section, "Scope") END;
  11455. Char(section, sfScopeBegin);
  11456. variable := scope.firstVariable;
  11457. WHILE (variable # NIL) DO
  11458. NVariable(variable, prevSymbol);
  11459. variable := variable.nextVariable;
  11460. END;
  11461. WITH scope: SyntaxTree.ModuleScope DO
  11462. bodyProcedure := scope.bodyProcedure;
  11463. |scope: SyntaxTree.RecordScope DO
  11464. bodyProcedure := scope.bodyProcedure;
  11465. ELSE
  11466. bodyProcedure := NIL;
  11467. END;
  11468. IF bodyProcedure # NIL THEN
  11469. NProcedure(bodyProcedure, prevSymbol)
  11470. END;
  11471. procedure := scope.firstProcedure;
  11472. WHILE procedure # NIL DO
  11473. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11474. procedure := procedure.nextProcedure;
  11475. END;
  11476. typeDeclaration := scope.firstTypeDeclaration;
  11477. WHILE typeDeclaration # NIL DO
  11478. NTypeDeclaration(typeDeclaration, prevSymbol);
  11479. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11480. END;
  11481. Char(section, sfScopeEnd); (* scope ends *)
  11482. END NScope;
  11483. BEGIN
  11484. NEW(indirectTypes, 32);
  11485. ArrayBlock(section,sizePC,"", FALSE);
  11486. startPC := section.pc;
  11487. NModule(module.module, -1);
  11488. PatchArray(section,sizePC,CurrentIndex());
  11489. END References;
  11490. (*
  11491. Command* = RECORD
  11492. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11493. name*: Name; (* name of the procedure *)
  11494. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11495. entryAdr* : ADDRESS; (* entry address of procedure *)
  11496. END;
  11497. *)
  11498. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11499. VAR
  11500. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11501. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11502. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11503. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11504. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11505. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11506. BEGIN
  11507. RETURN
  11508. (type = NIL) OR
  11509. (type.resolved IS SyntaxTree.RecordType) OR
  11510. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11511. (type.resolved IS SyntaxTree.AnyType);
  11512. END TypeAllowed;
  11513. BEGIN
  11514. numberParameters := procedureType.numberParameters;
  11515. RETURN
  11516. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11517. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11518. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11519. END GetProcedureAllowed;
  11520. PROCEDURE WriteType(type : SyntaxTree.Type);
  11521. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11522. name: Basic.SegmentedName; offset: LONGINT;
  11523. BEGIN
  11524. IF type = NIL THEN
  11525. Address(source,0);
  11526. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11527. Address(source,1);
  11528. ELSE
  11529. type := type.resolved;
  11530. IF type IS SyntaxTree.PointerType THEN
  11531. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11532. END;
  11533. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11534. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11535. name[0] := typeDeclaration.name; name[1] := -1;
  11536. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11537. ASSERT(section # NIL);
  11538. ELSE
  11539. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11540. (* TODO *)
  11541. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11542. END;
  11543. IF implementationVisitor.backend.cooperative THEN
  11544. offset := 0;
  11545. ELSE
  11546. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11547. END;
  11548. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11549. END;
  11550. END WriteType;
  11551. BEGIN
  11552. Info(source, "command array descriptor");
  11553. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11554. numberCommands := 0;
  11555. Info(source, "command array content");
  11556. FOR i := 0 TO module.allSections.Length() - 1 DO
  11557. p := module.allSections.GetSection(i);
  11558. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11559. procedure := p.symbol(SyntaxTree.Procedure);
  11560. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11561. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11562. procedure.GetName(name);
  11563. Name(source,name);
  11564. numberParameters := procedureType.numberParameters;
  11565. (* offset of type of first parameter *)
  11566. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11567. ELSE WriteType(procedureType.firstParameter.type)
  11568. END;
  11569. (* offset of type of return parameter *)
  11570. WriteType(procedureType.returnType);
  11571. (* command name *)
  11572. (* command code offset *)
  11573. Symbol(source,p,0,0);
  11574. INC(numberCommands);
  11575. IF Trace THEN
  11576. D.Ln;
  11577. END;
  11578. END;
  11579. END
  11580. END;
  11581. PatchArray(source,sizePC,numberCommands);
  11582. END CommandArray;
  11583. (* to prevent from double import of different module aliases *)
  11584. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11585. VAR i: SyntaxTree.Import;
  11586. BEGIN
  11587. i := module.module.moduleScope.firstImport;
  11588. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11589. i := i.nextImport;
  11590. END;
  11591. RETURN i = import
  11592. END IsFirstDirectOccurence;
  11593. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11594. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11595. BEGIN
  11596. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11597. ArrayBlock(source,pc,"", FALSE);
  11598. Info(source, "import module array data");
  11599. IF implementationVisitor.backend.cooperative THEN
  11600. offset := 0;
  11601. ELSE
  11602. IF module.system.addressType.sizeInBits = 64 THEN
  11603. (* change this when Heaps.HeapBlock is modified *)
  11604. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11605. ELSE
  11606. (* change this when Heaps.HeapBlock is modified *)
  11607. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11608. END;
  11609. END;
  11610. import := module.module.moduleScope.firstImport;
  11611. numberImports := 0;
  11612. WHILE import # NIL DO
  11613. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11614. Global.GetModuleSegmentedName(import.module,name);
  11615. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11616. NamedSymbol(source, name, NIL, 0, offset);
  11617. INC(numberImports);
  11618. END;
  11619. import := import.nextImport
  11620. END;
  11621. PatchArray(source,pc,numberImports);
  11622. END ImportsArray;
  11623. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11624. VAR
  11625. p: Sections.Section; sizePC, size, i: LONGINT;
  11626. BEGIN
  11627. Info(source, "Type info section");
  11628. size := 0;
  11629. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11630. FOR i := 0 TO module.allSections.Length() - 1 DO
  11631. p := module.allSections.GetSection(i);
  11632. WITH p: IntermediateCode.Section DO
  11633. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11634. Symbol(source,p,EmptyBlockOffset,0);
  11635. INC(size);
  11636. END;
  11637. END
  11638. END;
  11639. PatchArray(source,sizePC,size);
  11640. END TypeInfoSection;
  11641. (*
  11642. ProcTableEntry* = RECORD
  11643. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11644. noPtr*: LONGINT;
  11645. END;
  11646. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11647. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11648. *)
  11649. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11650. VAR
  11651. numberPointers: LONGINT;
  11652. procedure: SyntaxTree.Procedure;
  11653. BEGIN
  11654. Info(section,"pcFrom");
  11655. Symbol(section,procedureSection,0,0);
  11656. Info(section,"pcTo");
  11657. Symbol(section, procedureSection, procedureSection.pc, 0);
  11658. Info(section,"pointer to offsets array");
  11659. Symbol(section, section,section.pc+1,0);
  11660. Info(section,"offsets array");
  11661. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11662. PointerArray(section, procedure.procedureScope, numberPointers);
  11663. END ProcedureDescriptor;
  11664. (* only for tracing, the descriptor is otherwise not complete ! *)
  11665. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11666. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; offset: LONGINT; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11667. BEGIN
  11668. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11669. name := procedureSection.name;
  11670. Basic.AppendToSegmentedName(name,".@Info");
  11671. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11672. Address(section,0);
  11673. Symbol(section,section,2,0);
  11674. (*
  11675. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11676. descSize: SIZE;
  11677. sentinel: ADDRESS; (* = MPO-4 *)
  11678. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11679. flags*: SET;
  11680. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11681. name*: Name;
  11682. END;
  11683. *)
  11684. Size(section, 0);
  11685. Address(section,0);
  11686. Address(section,0);
  11687. Set(section,{});
  11688. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); END;
  11689. moduleSection := ModuleSection();
  11690. Symbol( section, moduleSection, moduleSection.pc,0);
  11691. IF procedureSection.symbol = NIL THEN
  11692. Basic.SegmentedNameToString(procedureSection.name, infoName);
  11693. ELSE
  11694. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  11695. END;
  11696. Name(section, infoName);
  11697. Size(section, 0);
  11698. RETURN section;
  11699. END MakeProcedureDescriptorTag;
  11700. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11701. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  11702. BEGIN
  11703. name := procedureSection.name;
  11704. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  11705. IF implementationVisitor.backend.cooperative THEN
  11706. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11707. Info(section, "TypeDescriptor");
  11708. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  11709. NamedSymbol(dest, name,NIL, 0, 0);
  11710. BaseRecord(dest);
  11711. offset := 0;
  11712. ELSIF CreateProcedureDescInfo THEN
  11713. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11714. Address(dest,0);
  11715. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  11716. offset := dest.pc;
  11717. ELSE
  11718. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  11719. END;
  11720. ProcedureDescriptor(dest, procedureSection);
  11721. Symbol(section, dest, offset, 0);
  11722. END ProcedureDescriptorPointer;
  11723. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  11724. VAR sizePC, i: LONGINT; destination: Sections.Section;
  11725. BEGIN
  11726. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  11727. numberProcs := 0;
  11728. FOR i := 0 TO module.allSections.Length() - 1 DO
  11729. destination := module.allSections.GetSection(i);
  11730. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11731. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  11732. INC(numberProcs);
  11733. END
  11734. END;
  11735. PatchArray(section, sizePC, numberProcs);
  11736. END ProcedureDescriptorArray;
  11737. (*
  11738. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11739. VAR
  11740. next*: Module; (** once a module is published, all fields are read-only *)
  11741. name*: Name;
  11742. init, published: BOOLEAN;
  11743. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11744. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  11745. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11746. command*: POINTER TO ARRAY OF Command;
  11747. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11748. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11749. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11750. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11751. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11752. data*, code*: Bytes;
  11753. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11754. export*: ExportDesc;
  11755. term*: TerminationHandler;
  11756. exTable*: ExceptionTable;
  11757. noProcs*: LONGINT;
  11758. firstProc*: ADDRESS; <- done by loader
  11759. maxPtrs*: LONGINT;
  11760. crc*: LONGINT;
  11761. *)
  11762. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11763. BEGIN
  11764. Info(section, "cycle");
  11765. Size(section,0);
  11766. Info(section, "references");
  11767. Size(section,0);
  11768. Info(section, "nextMarked");
  11769. Address(section,0);
  11770. Info(section, "nextWatched");
  11771. Address(section,0);
  11772. END BasePointer;
  11773. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11774. BEGIN
  11775. BasePointer(section);
  11776. Info(section, "action");
  11777. Address(section,0);
  11778. Info(section, "monitor");
  11779. Address(section,0);
  11780. END BaseObject;
  11781. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  11782. BEGIN
  11783. BasePointer(section);
  11784. Info(section, "action");
  11785. Address(section,0);
  11786. Info(section, "monitor");
  11787. Address(section,0);
  11788. END BaseRecord;
  11789. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  11790. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  11791. pooledName: Basic.SegmentedName;
  11792. symbol: SyntaxTree.Symbol;
  11793. BEGIN
  11794. Global.GetModuleName(module.module,name);
  11795. Strings.Append(name,".@Module.@Descriptor");
  11796. Basic.ToSegmentedName(name, pooledName);
  11797. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11798. Symbol(section,descriptorSection,0,0);
  11799. Info(descriptorSection, "descriptor");
  11800. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11801. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  11802. Address(descriptorSection,0);
  11803. Global.GetModuleName(module.module,name);
  11804. Strings.Append(name,".@Trace");
  11805. Basic.ToSegmentedName(name, pooledName);
  11806. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11807. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  11808. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11809. END ModuleDescriptor;
  11810. PROCEDURE ModuleSection(): IntermediateCode.Section;
  11811. VAR name: ARRAY 128 OF CHAR;
  11812. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  11813. symbol: SyntaxTree.Symbol;
  11814. BEGIN
  11815. ASSERT(implementationVisitor.backend.newObjectFile);
  11816. Global.GetModuleName(module.module,name);
  11817. Strings.Append(name,".@Module");
  11818. Basic.ToSegmentedName(name, pooledName);
  11819. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11820. moduleSection.SetExported(TRUE);
  11821. IF moduleSection.pc = 0 THEN
  11822. IF implementationVisitor.backend.cooperative THEN
  11823. Info(moduleSection, "descriptor");
  11824. ModuleDescriptor(moduleSection);
  11825. BaseObject(moduleSection);
  11826. implementationVisitor.CreateTraceModuleMethod(module.module);
  11827. ELSE
  11828. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  11829. Info(moduleSection, "HeapBlock");
  11830. Symbol(moduleSection,moduleSection,2,0);
  11831. Info(moduleSection, "TypeDescriptor");
  11832. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11833. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  11834. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  11835. END;
  11836. END;
  11837. RETURN moduleSection;
  11838. END ModuleSection;
  11839. PROCEDURE NewModuleInfo();
  11840. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11841. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11842. sectionName: Basic.SectionName;
  11843. CONST MPO=-40000000H;
  11844. BEGIN
  11845. (*
  11846. TypeDesc* = POINTER TO RECORD
  11847. descSize: SIZE;
  11848. sentinel: LONGINT; (* = MPO-4 *)
  11849. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11850. flags*: SET;
  11851. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11852. name*: Name;
  11853. refsOffset: SIZE;
  11854. END;
  11855. *)
  11856. (*name is missing prefixes sometimes*)
  11857. Global.GetModuleSegmentedName(module.module,name);
  11858. Basic.AppendToSegmentedName(name,".@Info");
  11859. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11860. Info(source, "HeapBlock");
  11861. Address(source,0); (* an empty heap block prevents GC marking *)
  11862. Info(source, "TypeDescriptor");
  11863. Address(source,0);
  11864. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  11865. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11866. Address(source,MPO-4);
  11867. Info(source, "type tag pointer");
  11868. Address( source,0);
  11869. Info(source, "type flags");
  11870. flags := {};
  11871. Set( source, flags);
  11872. Info(source, "pointer to module");
  11873. moduleSection := ModuleSection();
  11874. Symbol( source, moduleSection, moduleSection.pc,0);
  11875. Info(source, "type name");
  11876. i := 0;
  11877. sectionName := "@Self";
  11878. (*
  11879. Global.GetSymbolSegmentedName(td,name);
  11880. Basic.SegmentedNameToString(name, sectionName);
  11881. *)
  11882. Name(source,sectionName);
  11883. source.SetReferenced(FALSE);
  11884. patchInfoPC := source.pc;
  11885. Size(source, 0);
  11886. END NewModuleInfo;
  11887. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  11888. VAR
  11889. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  11890. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  11891. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  11892. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, maxPointers, numberProcs,temp,
  11893. referenceSectionOffset : LONGINT;
  11894. name: Basic.SegmentedName; offset: LONGINT;
  11895. flags: SET;
  11896. BEGIN
  11897. NewModuleInfo();
  11898. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  11899. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  11900. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  11901. ImportsArray(importSection);
  11902. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  11903. CommandArray(commandsSection);
  11904. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  11905. ExceptionArray(exceptionSection);
  11906. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  11907. AddPointer(typeInfoSection, typeInfoSectionOffset);
  11908. TypeInfoSection(typeInfoSection);
  11909. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  11910. References(referenceSection);
  11911. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  11912. ProcedureDescriptorArray(procTableSection, numberProcs);
  11913. IF ProtectModulesPointers THEN
  11914. name := "Heaps.AnyPtr";
  11915. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  11916. (* set base pointer *)
  11917. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  11918. END;
  11919. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  11920. ArrayBlock(emptyArraySection,temp,"", FALSE);
  11921. moduleSection := ModuleSection();
  11922. Info(moduleSection, "nextRoot*: RootObject");
  11923. Address(moduleSection,0);
  11924. Info(moduleSection, "next*: Module");
  11925. Address(moduleSection,0);
  11926. Info(moduleSection, "name*: Name");
  11927. Name(moduleSection,moduleName);
  11928. Info(moduleSection, "init, published: BOOLEAN");
  11929. Boolean(moduleSection,FALSE);
  11930. Boolean(moduleSection,FALSE);
  11931. Info(moduleSection,"filler"); (*! introduce alignment! *)
  11932. Boolean(moduleSection,FALSE);
  11933. Boolean(moduleSection,FALSE);
  11934. Info(moduleSection, "refcnt*: LONGINT");
  11935. Longint(moduleSection,0);
  11936. Info(moduleSection, "sb*: ADDRESS");
  11937. Address(moduleSection,0);
  11938. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  11939. Address(moduleSection,0);
  11940. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  11941. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  11942. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  11943. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  11944. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  11945. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  11946. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  11947. Symbol(moduleSection,importSection,importSectionOffset,0);
  11948. Info(moduleSection, "procTable*: ProcTable");
  11949. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  11950. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  11951. Address(moduleSection,0);
  11952. Address(moduleSection,0);
  11953. Address(moduleSection,0);
  11954. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  11955. Info(moduleSection, "export*: ExportDesc");
  11956. ExportDesc(moduleSection);
  11957. Info(moduleSection, "term*: TerminationHandler");
  11958. Address(moduleSection,0);
  11959. Info(moduleSection, "exTable*: ExceptionTable");
  11960. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  11961. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding -> alignment *)
  11962. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  11963. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  11964. Info(moduleSection, "crc*: LONGINT");
  11965. patchCRC:= moduleSection.pc;
  11966. Longint(moduleSection, 0); (*! must be implemented *)
  11967. Info(moduleSection, "body*: ADDRESS");
  11968. Symbol(moduleSection, bodyProc, 0,0);
  11969. Info(moduleSection, "module flags");
  11970. flags := {};
  11971. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  11972. Set( moduleSection, flags);
  11973. IF implementationVisitor.backend.cooperative THEN
  11974. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  11975. Info(moduleSection, "monitor.owner");
  11976. Address(moduleSection,0);
  11977. Info(moduleSection, "monitor.nestingLevel");
  11978. Address(moduleSection,0);
  11979. Info(moduleSection, "monitor.blockedQueue");
  11980. Address(moduleSection,0); Address(moduleSection,0);
  11981. Info(moduleSection, "monitor.waitingQueue");
  11982. Address(moduleSection,0); Address(moduleSection,0);
  11983. Info(moduleSection, "monitor.waitingSentinel");
  11984. Address(moduleSection,0);
  11985. END;
  11986. END Module;
  11987. PROCEDURE PatchCRC(crc: LONGINT);
  11988. BEGIN
  11989. IF implementationVisitor.newObjectFile & ~simple THEN
  11990. PatchLongint(ModuleSection(), patchCRC, crc);
  11991. END;
  11992. END PatchCRC;
  11993. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  11994. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  11995. BEGIN
  11996. ArrayBlock(source,pc,"",FALSE);
  11997. Info(source, "pointer offsets array data");
  11998. IF scope IS SyntaxTree.RecordScope THEN
  11999. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  12000. ELSIF scope IS SyntaxTree.CellScope THEN
  12001. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  12002. ELSIF scope IS SyntaxTree.ModuleScope THEN
  12003. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  12004. WHILE variable # NIL DO
  12005. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12006. symbol := module.allSections.FindBySymbol(variable);
  12007. ASSERT(symbol # NIL);
  12008. Pointers(0,symbol, source,variable.type,numberPointers);
  12009. END;
  12010. variable := variable.nextVariable;
  12011. END;
  12012. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  12013. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12014. WHILE parameter # NIL DO
  12015. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12016. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  12017. END;
  12018. parameter := parameter.nextParameter;
  12019. END;
  12020. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  12021. parametersSize := ProcedureParametersSize(module.system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  12022. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12023. IF implementationVisitor.backend.preciseGC THEN
  12024. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12025. END;
  12026. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  12027. END;
  12028. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  12029. WHILE(variable # NIL) DO
  12030. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12031. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  12032. END;
  12033. variable := variable.nextVariable
  12034. END;
  12035. END;
  12036. PatchArray(source,pc,numberPointers);
  12037. END PointerArray;
  12038. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  12039. VAR
  12040. name: Basic.SegmentedName;
  12041. section: IntermediateCode.Section;
  12042. BEGIN
  12043. ASSERT(implementationVisitor.newObjectFile);
  12044. Global.GetSymbolSegmentedName(symbol,name);
  12045. Basic.AppendToSegmentedName(name,suffix);
  12046. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL,declarationVisitor.dump);
  12047. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  12048. Info(section, "HeapBlock");
  12049. Address(section,0); (* empty such that GC does not go on traversing *)
  12050. Info(section, suffix);
  12051. Address(section,0);
  12052. pc := section.pc;
  12053. RETURN section;
  12054. END SymbolSection;
  12055. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  12056. VAR recordType: SyntaxTree.RecordType;
  12057. tir, tdInfo: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  12058. section: Sections.Section; cellType: SyntaxTree.CellType;
  12059. tdInfoOffset: LONGINT;
  12060. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  12061. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12062. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12063. sectionName: Basic.SectionName;
  12064. CONST MPO=-40000000H;
  12065. BEGIN
  12066. (*
  12067. TypeDesc* = POINTER TO RECORD
  12068. descSize: SIZE;
  12069. sentinel: LONGINT; (* = MPO-4 *)
  12070. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12071. flags*: SET;
  12072. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12073. name*: Name;
  12074. refsOffset: SIZE;
  12075. END;
  12076. *)
  12077. (* source := module.sections.FindByName(...) *)
  12078. Global.GetSymbolSegmentedName(td,name);
  12079. Basic.AppendToSegmentedName(name,".@Info");
  12080. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12081. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12082. Address(source,0);
  12083. Info(source, "TypeDescriptor");
  12084. Address(source,0);
  12085. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12086. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12087. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12088. Info(source, "type tag pointer");
  12089. Symbol( source, tag, offset, 0);
  12090. Info(source, "type flags");
  12091. flags := {};
  12092. IF isProtected THEN INCL(flags,31) END;
  12093. Set( source, flags);
  12094. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  12095. Info(source, "pointer to module");
  12096. moduleSection := ModuleSection();
  12097. Symbol( source, moduleSection, moduleSection.pc,0);
  12098. Info(source, "type name");
  12099. i := 0;
  12100. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12101. (*
  12102. Global.GetSymbolSegmentedName(td,name);
  12103. Basic.SegmentedNameToString(name, sectionName);
  12104. *)
  12105. Name(source,sectionName);
  12106. source.SetReferenced(FALSE);
  12107. Size(source, 0);
  12108. RETURN source;
  12109. END NewTypeDescriptorInfo;
  12110. PROCEDURE NewTypeDescriptor;
  12111. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12112. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12113. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12114. numberPointers: LONGINT; padding, i, tdInfoOffset: LONGINT;
  12115. CONST MPO=-40000000H;
  12116. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12117. VAR i: LONGINT;
  12118. PROCEDURE Td(record: SyntaxTree.RecordType);
  12119. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12120. BEGIN
  12121. IF record # NIL THEN
  12122. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12123. baseTD := record.typeDeclaration;
  12124. Global.GetSymbolSegmentedName(baseTD,name);
  12125. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12126. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12127. ELSE
  12128. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12129. END;
  12130. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12131. Symbol(source, tir, 0, offset);
  12132. IF reverse THEN Td(record.GetBaseRecord()) END;
  12133. END;
  12134. END Td;
  12135. BEGIN
  12136. Info(source, "tag table");
  12137. baseRecord := recordType;
  12138. i := 0;
  12139. WHILE baseRecord # NIL DO
  12140. INC(i);
  12141. baseRecord := baseRecord.GetBaseRecord();
  12142. END;
  12143. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12144. IF ~reverse THEN Td(recordType) END;
  12145. WHILE i < size DO
  12146. Address(source,0);
  12147. INC(i);
  12148. END;
  12149. IF reverse THEN Td(recordType) END;
  12150. END TdTable;
  12151. PROCEDURE MethodTable(reverse: BOOLEAN);
  12152. VAR i,methods: LONGINT;
  12153. BEGIN
  12154. Info(source, "method table");
  12155. IF recordType # NIL THEN
  12156. methods := recordType.recordScope.numberMethods;
  12157. IF reverse THEN
  12158. FOR i := methods-1 TO 0 BY -1 DO
  12159. procedure := recordType.recordScope.FindMethod(i);
  12160. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12161. NamedSymbol(source, name,procedure, 0,0);
  12162. END;
  12163. ELSE
  12164. FOR i := 0 TO methods-1 DO
  12165. procedure := recordType.recordScope.FindMethod(i);
  12166. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12167. NamedSymbol(source, name,procedure, 0,0);
  12168. END;
  12169. END;
  12170. END;
  12171. END MethodTable;
  12172. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12173. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12174. BEGIN
  12175. Info(source, "method table");
  12176. baseRecord := recordType;
  12177. WHILE baseRecord.baseType # NIL DO
  12178. baseRecord := baseRecord.GetBaseRecord ();
  12179. END;
  12180. GetRecordTypeName (baseRecord, name);
  12181. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12182. IF name = stackFrame THEN
  12183. start := 0;
  12184. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12185. baseRecord := recordType;
  12186. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12187. baseRecord := baseRecord.GetBaseRecord ();
  12188. END;
  12189. IF baseRecord # NIL THEN
  12190. GetRecordTypeName (baseRecord, name);
  12191. IF pointer & ~baseRecord.isObject THEN
  12192. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12193. END;
  12194. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12195. ELSIF recordType.isObject THEN
  12196. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12197. ELSIF pointer THEN
  12198. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12199. ELSE
  12200. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12201. END;
  12202. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12203. Symbol(source, tir, 0, 0);
  12204. start := 0;
  12205. baseRecord := recordType;
  12206. WHILE (baseRecord # NIL) DO
  12207. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12208. baseRecord := baseRecord.GetBaseRecord ();
  12209. END;
  12210. ELSE
  12211. (* explicit trace method: *)
  12212. procedure := recordType.recordScope.FindMethod(0);
  12213. IF ~procedure.isFinalizer THEN
  12214. Global.GetSymbolSegmentedName(procedure, name);
  12215. NamedSymbol(source, name,procedure, 0,0);
  12216. END;
  12217. start := 1;
  12218. END;
  12219. IF (name # stackFrame) & recordType.isObject THEN
  12220. baseRecord := recordType;
  12221. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12222. baseRecord := baseRecord.GetBaseRecord ();
  12223. END;
  12224. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12225. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12226. ELSE
  12227. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12228. END;
  12229. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12230. Symbol(source, tir, 0, 0);
  12231. END;
  12232. methods := recordType.recordScope.numberMethods;
  12233. FOR i := start TO methods-1 DO
  12234. procedure := recordType.recordScope.FindMethod(i);
  12235. IF ~procedure.isFinalizer THEN
  12236. Global.GetSymbolSegmentedName(procedure, name);
  12237. NamedSymbol(source, name,procedure, 0,0);
  12238. END;
  12239. END;
  12240. END CooperativeMethodTable;
  12241. BEGIN
  12242. Global.GetSymbolSegmentedName(td,name);
  12243. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12244. source.SetExported(IsExported(td));
  12245. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12246. IF implementationVisitor.backend.cooperative THEN
  12247. base := NIL;
  12248. baseRecord := recordType.GetBaseRecord();
  12249. IF baseRecord # NIL THEN
  12250. baseTD := baseRecord.typeDeclaration;
  12251. END;
  12252. IF ~recordType.isObject THEN
  12253. Info(source, "parent");
  12254. IF baseRecord # NIL THEN
  12255. Global.GetSymbolSegmentedName(baseTD,name);
  12256. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12257. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12258. ELSE
  12259. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12260. END;
  12261. Symbol(source, tir, 0, 0);
  12262. ELSE
  12263. Address(source,0);
  12264. END;
  12265. Info(source, "record size");
  12266. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12267. source.SetReferenced(FALSE);
  12268. CooperativeMethodTable(FALSE);
  12269. base := source;
  12270. Global.GetSymbolSegmentedName(td,name);
  12271. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12272. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12273. source.SetExported(IsExported(td));
  12274. source.SetReferenced(FALSE);
  12275. END;
  12276. Info(source, "parent");
  12277. IF baseRecord # NIL THEN
  12278. Global.GetSymbolSegmentedName(baseTD,name);
  12279. sym := baseTD;
  12280. IF ~recordType.isObject THEN
  12281. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12282. sym := NIL;
  12283. END;
  12284. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12285. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12286. ELSE
  12287. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12288. END;
  12289. Symbol(source, tir, 0, 0);
  12290. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12291. Address(source,0);
  12292. ELSE
  12293. IF recordType.isObject THEN
  12294. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12295. ELSE
  12296. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12297. END;
  12298. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12299. Symbol(source, tir, 0, 0);
  12300. END;
  12301. Info(source, "base record descriptor");
  12302. Symbol(source, base, 0, 0);
  12303. CooperativeMethodTable(TRUE);
  12304. source.SetReferenced(FALSE);
  12305. IF recordType.hasPointers THEN
  12306. IF ~HasExplicitTraceMethod (recordType) THEN
  12307. implementationVisitor.CreateTraceMethod(recordType);
  12308. END;
  12309. implementationVisitor.CreateResetProcedure(recordType);
  12310. implementationVisitor.CreateAssignProcedure(recordType);
  12311. END;
  12312. ELSIF ~simple THEN
  12313. (*
  12314. MethodEnd = MPO
  12315. ---
  12316. methods (# methods)
  12317. ---
  12318. tags (16)
  12319. ---
  12320. TypeDesc = TypeInfoAdr
  12321. ---
  12322. td adr ---> rec size
  12323. ----
  12324. pointer offsets
  12325. ----
  12326. (padding)
  12327. -----
  12328. empty [2 addresses aligned]
  12329. empty
  12330. empty
  12331. numPtrs
  12332. ---
  12333. pointer offsets
  12334. ---
  12335. *)
  12336. Info(source, "MethodEnd = MPO");
  12337. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12338. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12339. MethodTable(TRUE);
  12340. TdTable(TypeTags, TRUE);
  12341. Info(source, "type descriptor info pointer");
  12342. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12343. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12344. IF (cellType # NIL) THEN
  12345. IF cellType.sizeInBits < 0 THEN
  12346. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12347. END;
  12348. Info(source, "cell size");
  12349. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12350. ELSE
  12351. Info(source, "record size");
  12352. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12353. END;
  12354. Info(source, "pointer offsets pointer");
  12355. padding := 1- source.pc MOD 2;
  12356. Symbol(source, source, source.pc+1+padding,0);
  12357. IF padding >0 THEN
  12358. Info(source, "padding");
  12359. FOR i := 1 TO padding DO Address(source,0) END;
  12360. END;
  12361. IF cellType # NIL THEN
  12362. PointerArray(source, cellType.cellScope, numberPointers);
  12363. ELSE
  12364. PointerArray(source, recordType.recordScope, numberPointers);
  12365. END;
  12366. ELSE
  12367. (*
  12368. simple:
  12369. td adr --> size
  12370. tag(1)
  12371. tag(2)
  12372. tag(3)
  12373. methods ->
  12374. *)
  12375. Info(source, "record size");
  12376. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12377. TdTable(TypeTags, FALSE);
  12378. MethodTable(FALSE);
  12379. source.SetReferenced(FALSE);
  12380. END;
  12381. END NewTypeDescriptor;
  12382. BEGIN
  12383. x := x.resolved;
  12384. IF (x IS SyntaxTree.PointerType) THEN
  12385. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12386. END;
  12387. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12388. recordType := x(SyntaxTree.RecordType);
  12389. td := x.typeDeclaration;
  12390. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12391. ASSERT(td # NIL);
  12392. section := module.allSections.FindBySymbol(td); (* TODO *)
  12393. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12394. IF implementationVisitor.newObjectFile THEN
  12395. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12396. NewTypeDescriptor
  12397. END;
  12398. ELSE
  12399. (* data section in intermediate code *)
  12400. Global.GetSymbolSegmentedName(td,name);
  12401. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  12402. Basic.SuffixSegmentedName (name, module.module.name);
  12403. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  12404. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  12405. tir.Emit(Data(Basic.invalidPosition,op));
  12406. END;
  12407. END;
  12408. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12409. cellType := x(SyntaxTree.CellType);
  12410. td := x.typeDeclaration;
  12411. section := module.allSections.FindBySymbol(td); (* TODO *)
  12412. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12413. IF implementationVisitor.newObjectFile THEN
  12414. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12415. NewTypeDescriptor
  12416. END;
  12417. END;
  12418. END;
  12419. END
  12420. END CheckTypeDeclaration
  12421. END MetaDataGenerator;
  12422. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12423. VAR
  12424. trace-: BOOLEAN;
  12425. traceString-: SyntaxTree.IdentifierString;
  12426. traceModuleName-: SyntaxTree.IdentifierString;
  12427. newObjectFile-: BOOLEAN;
  12428. profile-: BOOLEAN;
  12429. noRuntimeChecks: BOOLEAN;
  12430. simpleMetaData-: BOOLEAN;
  12431. noAsserts: BOOLEAN;
  12432. optimize-: BOOLEAN;
  12433. cooperative-: BOOLEAN;
  12434. preregisterStatic-: BOOLEAN;
  12435. dump-: Basic.Writer;
  12436. cellsAreObjects: BOOLEAN;
  12437. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12438. experiment: BOOLEAN;
  12439. PROCEDURE &InitIntermediateBackend*;
  12440. BEGIN
  12441. simpleMetaData := FALSE;
  12442. newObjectFile := FALSE;
  12443. InitBackend;
  12444. SetRuntimeModuleName(DefaultRuntimeModuleName);
  12445. SetTraceModuleName(DefaultTraceModuleName);
  12446. END InitIntermediateBackend;
  12447. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12448. VAR
  12449. declarationVisitor: DeclarationVisitor;
  12450. implementationVisitor: ImplementationVisitor;
  12451. module: Sections.Module;
  12452. name, platformName: SyntaxTree.IdentifierString;
  12453. meta: MetaDataGenerator;
  12454. crc: CRC.CRC32Stream;
  12455. BEGIN
  12456. ResetError;
  12457. Global.GetSymbolName(x,name);
  12458. NEW(module,x,system); (* backend structures *)
  12459. Global.GetModuleName(x, name);
  12460. module.SetModuleName(name);
  12461. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  12462. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12463. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12464. declarationVisitor.Module(x,module);
  12465. IF newObjectFile & ~meta.simple THEN
  12466. meta.Module(implementationVisitor.moduleBodySection);
  12467. END;
  12468. GetDescription(platformName);
  12469. module.SetPlatformName(platformName);
  12470. IF newObjectFile THEN
  12471. NEW(crc);
  12472. module.allSections.WriteRaw(crc);
  12473. crc.Update;
  12474. meta.PatchCRC(crc.GetCRC());
  12475. END;
  12476. RETURN module
  12477. END GenerateIntermediate;
  12478. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12479. BEGIN RETURN TRUE
  12480. END SupportedImmediate;
  12481. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12482. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12483. END ProcessSyntaxTreeModule;
  12484. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12485. VAR
  12486. result: Sections.Module;
  12487. traceName: Basic.MessageString;
  12488. BEGIN
  12489. ASSERT(intermediateCodeModule IS Sections.Module);
  12490. result := intermediateCodeModule(Sections.Module);
  12491. IF trace THEN
  12492. traceName := "intermediate code trace: ";
  12493. Strings.Append(traceName,traceString);
  12494. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12495. IF (traceString="") OR (traceString="*") THEN
  12496. result.Dump(dump);
  12497. dump.Update
  12498. ELSE
  12499. Sections.DumpFiltered(dump, result, traceString);
  12500. END
  12501. END;
  12502. RETURN result
  12503. END ProcessIntermediateCodeModule;
  12504. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12505. BEGIN instructionSet := "Intermediate";
  12506. END GetDescription;
  12507. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  12508. BEGIN
  12509. SELF.newObjectFile := newObjectFile;
  12510. SELF.simpleMetaData := simpleMetaData;
  12511. END SetNewObjectFile;
  12512. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12513. BEGIN COPY(name, traceModuleName)
  12514. END SetTraceModuleName;
  12515. PROCEDURE DefineOptions(options: Options.Options);
  12516. BEGIN
  12517. DefineOptions^(options);
  12518. options.Add(0X,"trace",Options.String);
  12519. options.Add(0X,"runtime",Options.String);
  12520. options.Add(0X,"newObjectFile",Options.Flag);
  12521. options.Add(0X,"traceModule",Options.String);
  12522. options.Add(0X,"profile",Options.Flag);
  12523. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12524. options.Add(0X,"noAsserts",Options.Flag);
  12525. options.Add(0X,"metaData",Options.String);
  12526. options.Add('o',"optimize", Options.Flag);
  12527. options.Add(0X,"preregisterStatic", Options.Flag);
  12528. options.Add(0X,"cellsAreObjects", Options.Flag);
  12529. options.Add(0X,"preciseGC", Options.Flag);
  12530. options.Add(0X,"trackLeave", Options.Flag);
  12531. options.Add(0X,"writeBarriers", Options.Flag);
  12532. options.Add(0X,"experiment", Options.Flag);
  12533. END DefineOptions;
  12534. PROCEDURE GetOptions(options: Options.Options);
  12535. VAR name,string: SyntaxTree.IdentifierString;
  12536. BEGIN
  12537. GetOptions^(options);
  12538. trace := options.GetString("trace",traceString);
  12539. profile := options.GetFlag("profile");
  12540. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12541. noAsserts := options.GetFlag("noAsserts");
  12542. cooperative := options.GetFlag("cooperative");
  12543. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  12544. IF cooperative THEN
  12545. SetRuntimeModuleName("CPU") END
  12546. END;
  12547. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12548. simpleMetaData := TRUE
  12549. END;
  12550. IF options.GetString("metaData",string) THEN
  12551. IF string = "simple" THEN simpleMetaData := TRUE
  12552. ELSIF string ="full" THEN simpleMetaData := FALSE
  12553. END;
  12554. END;
  12555. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  12556. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12557. optimize := options.GetFlag("optimize");
  12558. preregisterStatic := options.GetFlag("preregisterStatic");
  12559. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12560. preciseGC := options.GetFlag("preciseGC");
  12561. trackLeave := options.GetFlag("trackLeave");
  12562. writeBarriers := options.GetFlag("writeBarriers");
  12563. experiment := options.GetFlag("experiment");
  12564. END GetOptions;
  12565. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  12566. BEGIN RETURN SymbolFileFormat.Get()
  12567. END DefaultSymbolFileFormat;
  12568. END IntermediateBackend;
  12569. (* ----------------------------------- register allocation ------------------------------------- *)
  12570. (* register mapping scheme
  12571. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12572. spill offset
  12573. part(n) --> ticket <--> physical register
  12574. spill offset
  12575. *)
  12576. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12577. emptyOperand: IntermediateCode.Operand;
  12578. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12579. statCoopResetVariables: LONGINT;
  12580. statCoopModifyAssignments: LONGINT;
  12581. modifyAssignmentsPC : LONGINT;
  12582. statCoopNilCheck: LONGINT;
  12583. statCoopSwitch: LONGINT;
  12584. statCoopAssignProcedure: LONGINT;
  12585. statCoopTraceMethod: LONGINT;
  12586. statCoopResetProcedure: LONGINT;
  12587. statCoopTraceModule: LONGINT;
  12588. PROCEDURE ResetStatistics*;
  12589. BEGIN
  12590. statCoopResetVariables := 0;
  12591. statCoopModifyAssignments := 0;
  12592. statCoopNilCheck:= 0;
  12593. statCoopSwitch:= 0;
  12594. statCoopAssignProcedure:= 0;
  12595. statCoopTraceMethod:= 0;
  12596. statCoopResetProcedure:= 0;
  12597. statCoopTraceModule:= 0;
  12598. END ResetStatistics;
  12599. PROCEDURE Statistics*;
  12600. BEGIN
  12601. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12602. TRACE(statCoopNilCheck, statCoopSwitch);
  12603. TRACE(statCoopAssignProcedure,
  12604. statCoopTraceMethod,
  12605. statCoopResetProcedure,
  12606. statCoopTraceModule)
  12607. END Statistics;
  12608. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12609. VAR h: LONGINT;
  12610. BEGIN
  12611. WHILE b # 0 DO
  12612. h := a MOD b;
  12613. a := b;
  12614. b := h;
  12615. END;
  12616. RETURN a
  12617. END GCD;
  12618. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12619. BEGIN
  12620. RETURN a*b DIV GCD(a,b)
  12621. END SCM;
  12622. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12623. BEGIN
  12624. (*TRACE(a,b);*)
  12625. IF a = 0 THEN RETURN b
  12626. ELSIF b = 0 THEN RETURN a
  12627. ELSE RETURN SCM(a,b)
  12628. END;
  12629. END CommonAlignment;
  12630. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  12631. BEGIN
  12632. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12633. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12634. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  12635. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12636. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  12637. END
  12638. END PassBySingleReference;
  12639. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  12640. BEGIN
  12641. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  12642. END PassInRegister;
  12643. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12644. VAR new: RegisterEntry;
  12645. BEGIN
  12646. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12647. IF queue = NIL THEN
  12648. queue := new
  12649. ELSE
  12650. new.next := queue;
  12651. IF queue#NIL THEN queue.prev := new END;
  12652. queue := new
  12653. END;
  12654. END AddRegisterEntry;
  12655. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12656. VAR this: RegisterEntry;
  12657. BEGIN
  12658. this := queue;
  12659. WHILE (this # NIL) & (this.register # register) DO
  12660. this := this.next;
  12661. END;
  12662. IF this = NIL THEN
  12663. RETURN FALSE
  12664. END;
  12665. ASSERT(this # NIL);
  12666. IF this = queue THEN queue := queue.next END;
  12667. IF this.prev # NIL THEN this.prev.next := this.next END;
  12668. IF this.next # NIL THEN this.next.prev := this.prev END;
  12669. RETURN TRUE
  12670. END RemoveRegisterEntry;
  12671. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12672. BEGIN ASSERT(cond);
  12673. END Assert;
  12674. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12675. BEGIN
  12676. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12677. END ReusableRegister;
  12678. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12679. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12680. BEGIN
  12681. procedure := moduleScope.bodyProcedure;
  12682. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12683. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12684. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12685. procedure.SetScope(moduleScope);
  12686. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12687. procedure.SetAccess(SyntaxTree.Hidden);
  12688. moduleScope.SetBodyProcedure(procedure);
  12689. moduleScope.AddProcedure(procedure);
  12690. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12691. END;
  12692. END EnsureBodyProcedure;
  12693. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12694. VAR import: SyntaxTree.Import;
  12695. selfName: SyntaxTree.IdentifierString;
  12696. module: SyntaxTree.Module;
  12697. BEGIN
  12698. scope.ownerModule.GetName(selfName);
  12699. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12700. module := scope.ownerModule
  12701. ELSE
  12702. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12703. IF import = NIL THEN
  12704. RETURN NIL
  12705. ELSIF import.module = NIL THEN
  12706. RETURN NIL
  12707. ELSE module := import.module
  12708. END;
  12709. END;
  12710. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12711. END GetSymbol;
  12712. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12713. BEGIN
  12714. op.mode := mode;
  12715. IntermediateCode.InitOperand(op.op);
  12716. IntermediateCode.InitOperand(op.tag);
  12717. IntermediateCode.InitOperand(op.extra);
  12718. op.dimOffset := 0;
  12719. END InitOperand;
  12720. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12721. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12722. BEGIN RETURN IntermediateCode.GetType(system, type)
  12723. END GetType;
  12724. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12725. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12726. BEGIN
  12727. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12728. (*
  12729. UniqueId(name,module,name,adr);
  12730. *)
  12731. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  12732. constant.SetValue(value);
  12733. constant.SetAccess(SyntaxTree.Hidden);
  12734. module.moduleScope.AddConstant(constant);
  12735. constant.SetScope(module.moduleScope);
  12736. RETURN constant
  12737. END BuildConstant;
  12738. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12739. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12740. BEGIN
  12741. variable := scope.firstVariable;
  12742. WHILE variable # NIL DO
  12743. IF variable.NeedsTrace() THEN
  12744. RETURN TRUE;
  12745. END;
  12746. variable := variable.nextVariable;
  12747. END;
  12748. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12749. WHILE parameter # NIL DO
  12750. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12751. RETURN TRUE;
  12752. END;
  12753. parameter := parameter.nextParameter;
  12754. END;
  12755. RETURN FALSE;
  12756. END HasPointers;
  12757. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12758. 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));
  12759. END IsVariableParameter;
  12760. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12761. VAR parameter: SyntaxTree.Parameter;
  12762. BEGIN
  12763. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12764. WHILE parameter # NIL DO
  12765. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12766. IF parameter.movable THEN RETURN TRUE END;
  12767. parameter := parameter.nextParameter;
  12768. END;
  12769. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12770. END HasVariableParameters;
  12771. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12772. BEGIN
  12773. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12774. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12775. END HasExplicitTraceMethod;
  12776. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12777. BEGIN
  12778. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12779. IF (expression IS SyntaxTree.IntegerValue) THEN
  12780. val := expression(SyntaxTree.IntegerValue).value;
  12781. RETURN TRUE
  12782. ELSE
  12783. RETURN FALSE
  12784. END;
  12785. END IsIntegerConstant;
  12786. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12787. BEGIN
  12788. IF val <= 0 THEN RETURN FALSE END;
  12789. exp := 0;
  12790. WHILE ~ODD(val) DO
  12791. val := val DIV 2;
  12792. INC(exp)
  12793. END;
  12794. RETURN val = 1
  12795. END PowerOf2;
  12796. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12797. VAR procedure: SyntaxTree.Procedure;
  12798. BEGIN
  12799. procedure := record.recordScope.constructor;
  12800. IF procedure = NIL THEN
  12801. record := record.GetBaseRecord();
  12802. IF record # NIL THEN
  12803. procedure := GetConstructor(record)
  12804. END;
  12805. END;
  12806. RETURN procedure;
  12807. END GetConstructor;
  12808. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12809. BEGIN
  12810. value := SHORT(op.intValue);
  12811. RETURN op.mode = IntermediateCode.ModeImmediate;
  12812. END IsIntegerImmediate;
  12813. (** whether a type strictily is a pointer to record or object type
  12814. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12815. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12816. BEGIN
  12817. IF type = NIL THEN
  12818. RETURN FALSE
  12819. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  12820. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  12821. ELSE
  12822. RETURN FALSE
  12823. END
  12824. END IsStrictlyPointerToRecord;
  12825. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  12826. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  12827. END IsUnsafePointer;
  12828. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  12829. BEGIN type := type.resolved;
  12830. IF type IS SyntaxTree.PointerType THEN
  12831. type := type(SyntaxTree.PointerType).pointerBase;
  12832. type := type.resolved;
  12833. IF type IS SyntaxTree.RecordType THEN
  12834. recordType := type(SyntaxTree.RecordType);
  12835. RETURN TRUE
  12836. ELSE
  12837. RETURN FALSE
  12838. END
  12839. ELSIF type IS SyntaxTree.RecordType THEN
  12840. recordType := type(SyntaxTree.RecordType);
  12841. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  12842. ELSIF type IS SyntaxTree.ObjectType THEN
  12843. RETURN TRUE
  12844. ELSIF type IS SyntaxTree.AnyType THEN
  12845. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  12846. ELSE
  12847. RETURN FALSE
  12848. END;
  12849. END IsPointerToRecord;
  12850. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  12851. BEGIN
  12852. type := type.resolved;
  12853. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  12854. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  12855. END IsArrayOfSystemByte;
  12856. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  12857. BEGIN
  12858. IF type = NIL THEN RETURN FALSE END;
  12859. type := type.resolved;
  12860. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  12861. END IsOpenArray;
  12862. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  12863. BEGIN
  12864. IF type = NIL THEN RETURN FALSE END;
  12865. type := type.resolved;
  12866. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  12867. END IsSemiDynamicArray;
  12868. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  12869. BEGIN
  12870. IF type = NIL THEN RETURN FALSE END;
  12871. type := type.resolved;
  12872. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  12873. END IsStaticArray;
  12874. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  12875. BEGIN
  12876. IF type = NIL THEN RETURN FALSE END;
  12877. type := type.resolved;
  12878. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  12879. END IsStaticMathArray;
  12880. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12881. BEGIN
  12882. WHILE (IsStaticMathArray(type)) DO
  12883. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  12884. END;
  12885. RETURN type;
  12886. END StaticMathArrayBaseType;
  12887. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12888. VAR size: LONGINT;
  12889. BEGIN
  12890. size := 1;
  12891. WHILE (IsStaticArray(type)) DO
  12892. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  12893. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12894. END;
  12895. RETURN size;
  12896. END StaticArrayNumElements;
  12897. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12898. VAR size: LONGINT;
  12899. BEGIN
  12900. size := 1;
  12901. WHILE (IsStaticMathArray(type)) DO
  12902. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  12903. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  12904. END;
  12905. RETURN size;
  12906. END StaticMathArrayNumElements;
  12907. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12908. BEGIN
  12909. WHILE (IsStaticArray(type)) DO
  12910. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12911. END;
  12912. RETURN type;
  12913. END StaticArrayBaseType;
  12914. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12915. BEGIN
  12916. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  12917. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12918. END;
  12919. RETURN type;
  12920. END ArrayBaseType;
  12921. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  12922. BEGIN
  12923. IF type = NIL THEN RETURN FALSE END;
  12924. type := type.resolved;
  12925. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  12926. END IsDelegate;
  12927. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  12928. VAR i: LONGINT;
  12929. BEGIN
  12930. i := 0; type := type.resolved;
  12931. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12932. INC(i);
  12933. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  12934. END;
  12935. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12936. INC(i);
  12937. type := type(SyntaxTree.MathArrayType).arrayBase;
  12938. IF type # NIL THEN type := type.resolved END;
  12939. END;
  12940. RETURN i
  12941. END DynamicDim;
  12942. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  12943. BEGIN
  12944. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12945. type := type(SyntaxTree.ArrayType).arrayBase;
  12946. END;
  12947. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12948. type := type(SyntaxTree.MathArrayType).arrayBase;
  12949. END;
  12950. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  12951. END StaticSize;
  12952. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  12953. BEGIN
  12954. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  12955. END IsImmediate;
  12956. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  12957. BEGIN
  12958. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  12959. END IsAddress;
  12960. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  12961. BEGIN
  12962. RETURN (x.mode = IntermediateCode.ModeRegister);
  12963. END IsRegister;
  12964. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  12965. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  12966. BEGIN
  12967. typeDeclaration := recordType.typeDeclaration;
  12968. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12969. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12970. END GetRecordTypeName;
  12971. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  12972. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  12973. BEGIN
  12974. parSize := 0;
  12975. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  12976. parameter := procedureType.returnParameter;
  12977. INC(parSize,system.SizeOfParameter(parameter));
  12978. parSize := parSize + (-parSize) MOD system.addressSize;
  12979. END;
  12980. parameter :=procedureType.lastParameter;
  12981. WHILE (parameter # NIL) DO
  12982. IF SysvABIorWINAPI(procedureType.callingConvention) THEN
  12983. INC(parSize, system.addressSize);
  12984. ELSE
  12985. INC(parSize,system.SizeOfParameter(parameter));
  12986. parSize := parSize + (-parSize) MOD system.addressSize;
  12987. END;
  12988. parameter := parameter.prevParameter;
  12989. END;
  12990. IF procedureType.selfParameter # NIL THEN
  12991. parameter := procedureType.selfParameter;
  12992. INC(parSize,system.SizeOfParameter(parameter));
  12993. parSize := parSize + (-parSize) MOD system.addressSize;
  12994. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  12995. END; (* method => self pointer *)
  12996. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  12997. RETURN ToMemoryUnits(system,parSize)
  12998. END ParametersSize;
  12999. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  13000. BEGIN
  13001. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  13002. END IsNested;
  13003. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  13004. BEGIN
  13005. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  13006. scope := scope.outerScope;
  13007. END;
  13008. RETURN scope # NIL;
  13009. END InCellScope;
  13010. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  13011. BEGIN
  13012. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  13013. RETURN 0
  13014. ELSE
  13015. *)
  13016. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  13017. (*END;*)
  13018. END ProcedureParametersSize;
  13019. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  13020. VAR dataUnit: LONGINT;
  13021. BEGIN dataUnit := system.dataUnit;
  13022. ASSERT(size MOD system.dataUnit = 0);
  13023. RETURN LONGINT(size DIV system.dataUnit)
  13024. END ToMemoryUnits;
  13025. PROCEDURE Get*(): Backend.Backend;
  13026. VAR backend: IntermediateBackend;
  13027. BEGIN NEW(backend); RETURN backend
  13028. END Get;
  13029. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  13030. VAR instruction: IntermediateCode.Instruction;
  13031. BEGIN
  13032. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  13033. RETURN instruction
  13034. END Nop;
  13035. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13036. VAR instruction: IntermediateCode.Instruction;
  13037. BEGIN
  13038. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  13039. RETURN instruction
  13040. END Mov;
  13041. (* like Mov but ensures that no new register will be allocated for dest *)
  13042. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13043. VAR instruction: IntermediateCode.Instruction;
  13044. BEGIN
  13045. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  13046. RETURN instruction
  13047. END MovReplace;
  13048. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13049. VAR instruction: IntermediateCode.Instruction;
  13050. BEGIN
  13051. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  13052. RETURN instruction
  13053. END Conv;
  13054. PROCEDURE SysvABI( cc: LONGINT ): BOOLEAN;
  13055. BEGIN
  13056. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention})
  13057. END SysvABI;
  13058. PROCEDURE SysvABIorWINAPI( cc: LONGINT ): BOOLEAN;
  13059. BEGIN
  13060. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention, SyntaxTree.WinAPICallingConvention})
  13061. END SysvABIorWINAPI;
  13062. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  13063. VAR instruction: IntermediateCode.Instruction;
  13064. BEGIN
  13065. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  13066. RETURN instruction
  13067. END Call;
  13068. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  13069. VAR op1, op2, op3: IntermediateCode.Operand;
  13070. VAR instruction: IntermediateCode.Instruction;
  13071. BEGIN
  13072. IntermediateCode.InitNumber(op1,pcOffset);
  13073. IntermediateCode.InitNumber(op2,callingConvention);
  13074. IntermediateCode.InitNumber(op3,unwind);
  13075. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  13076. RETURN instruction
  13077. END Exit;
  13078. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13079. VAR instruction: IntermediateCode.Instruction;
  13080. BEGIN
  13081. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  13082. RETURN instruction
  13083. END Return;
  13084. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13085. VAR instruction: IntermediateCode.Instruction;
  13086. BEGIN
  13087. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  13088. RETURN instruction
  13089. END Result;
  13090. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  13091. VAR op1: IntermediateCode.Operand;
  13092. VAR instruction: IntermediateCode.Instruction;
  13093. BEGIN
  13094. IntermediateCode.InitNumber(op1,nr);
  13095. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  13096. RETURN instruction
  13097. END Trap;
  13098. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  13099. VAR instruction: IntermediateCode.Instruction;
  13100. BEGIN
  13101. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  13102. RETURN instruction
  13103. END Br;
  13104. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13105. VAR instruction: IntermediateCode.Instruction;
  13106. BEGIN
  13107. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  13108. RETURN instruction
  13109. END Breq;
  13110. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13111. VAR instruction: IntermediateCode.Instruction;
  13112. BEGIN
  13113. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13114. RETURN instruction
  13115. END Brne;
  13116. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13117. VAR instruction: IntermediateCode.Instruction;
  13118. BEGIN
  13119. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13120. RETURN instruction
  13121. END Brge;
  13122. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13123. VAR instruction: IntermediateCode.Instruction;
  13124. BEGIN
  13125. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13126. RETURN instruction
  13127. END Brlt;
  13128. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13129. VAR instruction: IntermediateCode.Instruction;
  13130. BEGIN
  13131. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13132. RETURN instruction
  13133. END Pop;
  13134. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13135. VAR instruction: IntermediateCode.Instruction;
  13136. BEGIN
  13137. ASSERT(op.mode # IntermediateCode.Undefined);
  13138. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13139. RETURN instruction
  13140. END Push;
  13141. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13142. VAR instruction: IntermediateCode.Instruction;
  13143. BEGIN
  13144. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13145. RETURN instruction
  13146. END Neg;
  13147. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13148. VAR instruction: IntermediateCode.Instruction;
  13149. BEGIN
  13150. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13151. RETURN instruction
  13152. END Not;
  13153. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13154. VAR instruction: IntermediateCode.Instruction;
  13155. BEGIN
  13156. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13157. RETURN instruction
  13158. END Abs;
  13159. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13160. VAR instruction: IntermediateCode.Instruction;
  13161. BEGIN
  13162. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13163. ASSERT(~IsImmediate(instruction.op1));
  13164. RETURN instruction
  13165. END Mul;
  13166. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13167. VAR instruction: IntermediateCode.Instruction;
  13168. BEGIN
  13169. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13170. RETURN instruction
  13171. END Div;
  13172. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13173. VAR instruction: IntermediateCode.Instruction;
  13174. BEGIN
  13175. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13176. RETURN instruction
  13177. END Mod;
  13178. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13179. VAR instruction: IntermediateCode.Instruction;
  13180. BEGIN
  13181. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13182. RETURN instruction
  13183. END Sub;
  13184. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13185. VAR instruction: IntermediateCode.Instruction;
  13186. BEGIN
  13187. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13188. RETURN instruction
  13189. END Add;
  13190. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13191. VAR instruction: IntermediateCode.Instruction;
  13192. BEGIN
  13193. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13194. RETURN instruction
  13195. END And;
  13196. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13197. VAR instruction: IntermediateCode.Instruction;
  13198. BEGIN
  13199. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13200. RETURN instruction
  13201. END Or;
  13202. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13203. VAR instruction: IntermediateCode.Instruction;
  13204. BEGIN
  13205. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13206. RETURN instruction
  13207. END Xor;
  13208. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13209. VAR instruction: IntermediateCode.Instruction;
  13210. BEGIN
  13211. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13212. RETURN instruction
  13213. END Shl;
  13214. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13215. VAR instruction: IntermediateCode.Instruction;
  13216. BEGIN
  13217. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13218. RETURN instruction
  13219. END Shr;
  13220. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13221. VAR instruction: IntermediateCode.Instruction;
  13222. BEGIN
  13223. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13224. RETURN instruction
  13225. END Rol;
  13226. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13227. VAR instruction: IntermediateCode.Instruction;
  13228. BEGIN
  13229. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13230. RETURN instruction
  13231. END Ror;
  13232. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13233. VAR instruction: IntermediateCode.Instruction;
  13234. BEGIN
  13235. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13236. RETURN instruction
  13237. END Cas;
  13238. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13239. VAR instruction: IntermediateCode.Instruction;
  13240. BEGIN
  13241. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13242. RETURN instruction
  13243. END Copy;
  13244. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13245. VAR instruction: IntermediateCode.Instruction;
  13246. BEGIN
  13247. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13248. RETURN instruction
  13249. END Fill;
  13250. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13251. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13252. BEGIN
  13253. string := IntermediateCode.String(s);
  13254. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13255. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13256. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13257. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13258. RETURN instruction
  13259. END Asm;
  13260. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13261. VAR instruction: IntermediateCode.Instruction;
  13262. BEGIN
  13263. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13264. RETURN instruction
  13265. END Data;
  13266. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13267. VAR instruction: IntermediateCode.Instruction;
  13268. BEGIN
  13269. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13270. IntermediateCode.SetSubType(instruction, subtype);
  13271. RETURN instruction
  13272. END SpecialInstruction;
  13273. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13274. VAR op1: IntermediateCode.Operand;
  13275. VAR instruction: IntermediateCode.Instruction;
  13276. BEGIN
  13277. (*! generate a warning if size exceeds a certain limit *)
  13278. (*
  13279. ASSERT(bytes < 1000000); (* sanity check *)
  13280. *)
  13281. ASSERT(0 <= units); (* sanity check *)
  13282. IntermediateCode.InitNumber(op1,units);
  13283. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13284. RETURN instruction
  13285. END Reserve;
  13286. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13287. VAR op1: IntermediateCode.Operand;
  13288. VAR instruction: IntermediateCode.Instruction;
  13289. BEGIN
  13290. IntermediateCode.InitNumber(op1,position.start);
  13291. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13292. RETURN instruction
  13293. END LabelInstruction;
  13294. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13295. VAR pc: LONGINT;
  13296. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13297. BEGIN
  13298. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13299. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13300. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13301. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13302. IF instr.op1.type.form = IntermediateCode.Float THEN
  13303. RETURN instr.op1.floatValue = op.floatValue
  13304. ELSE
  13305. RETURN instr.op1.intValue = op.intValue
  13306. END;
  13307. END ProvidesValue;
  13308. BEGIN
  13309. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13310. pc := 0;
  13311. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13312. INC(pc);
  13313. END;
  13314. IF pc = data.pc THEN
  13315. data.Emit(Data(Basic.invalidPosition,vop));
  13316. END;
  13317. RETURN pc
  13318. END EnterImmediate;
  13319. PROCEDURE Init;
  13320. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13321. BEGIN
  13322. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13323. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13324. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13325. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13326. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13327. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13328. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13329. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13330. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13331. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13332. IntermediateCode.InitOperand(emptyOperand);
  13333. FOR i := 0 TO NumberSystemCalls-1 DO
  13334. name := "@SystemCall";
  13335. Basic.AppendNumber(name,i);
  13336. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13337. END;
  13338. END Init;
  13339. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13340. BEGIN
  13341. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  13342. END IsExported;
  13343. BEGIN
  13344. Init;
  13345. END FoxIntermediateBackend.
  13346. Compiler.Compile -p=Win32G FoxIntermediateBackend.Mod ~
  13347. # Release.Build --path="/temp/obg/" IinAosNewObjectFile ~
  13348. # StaticLinker.Link --fileFormat=PE32 --fileName=A2Z.exe --extension=GofW --displacement=401000H --path="/temp/obg/" Runtime Trace Kernel32 Machine Heaps Modules Objects Kernel KernelLog Streams Commands Files WinFS Clock Dates Reals Strings Diagnostics BitSets StringPool ObjectFile GenericLinker Reflection GenericLoader BootConsole ~
  13349. # Release.Build --path="/temp/obg/" WinAosNewObjectFile ~
  13350. # StaticLinker.Link --fileFormat=PE32 --fileName=A2H.exe --extension=GofW --displacement=401000H Runtime Trace Kernel32 Machine Heaps Modules Objects Kernel KernelLog Streams Commands Files WinFS Clock Dates Reals Strings Diagnostics BitSets StringPool ObjectFile GenericLinker Reflection GenericLoader BootConsole ~
  13351. FStols.CloseFiles A2Z.exe ~
  13352. SystemTools.FreeDownTo FoxIntermediateBackend ~
  13353. Compiler.Compile -p=Win32G --destPath=/temp/obg/ --traceModule=Trace
  13354. Runtime.Mod Trace.Mod Generic.Win32.Kernel32.Mod Win32.Machine.Mod Heaps.Mod
  13355. Generic.Modules.Mod Win32.Objects.Mod Win32.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13356. Commands.Mod I386.Reals.Mod Generic.Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13357. Win32.Traps.Mod Locks.Mod Win32.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13358. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13359. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Win32.User32.Mod
  13360. Win32.WinTrace.Mod Win32.ODBC.Mod Win32.Shell32.Mod Win32.SQL.Mod Win32.WinFS.Mod
  13361. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13362. GenericLinker.Mod GenericLoader.Mod BootConsole.Mod