FoxIntermediateBackend.Mod 536 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200620162026203620462056206620762086209621062116212621362146215621662176218621962206221622262236224622562266227622862296230623162326233623462356236623762386239624062416242624362446245624662476248624962506251625262536254625562566257625862596260626162626263626462656266626762686269627062716272627362746275627662776278627962806281628262836284628562866287628862896290629162926293629462956296629762986299630063016302630363046305630663076308630963106311631263136314631563166317631863196320632163226323632463256326632763286329633063316332633363346335633663376338633963406341634263436344634563466347634863496350635163526353635463556356635763586359636063616362636363646365636663676368636963706371637263736374637563766377637863796380638163826383638463856386638763886389639063916392639363946395639663976398639964006401640264036404640564066407640864096410641164126413641464156416641764186419642064216422642364246425642664276428642964306431643264336434643564366437643864396440644164426443644464456446644764486449645064516452645364546455645664576458645964606461646264636464646564666467646864696470647164726473647464756476647764786479648064816482648364846485648664876488648964906491649264936494649564966497649864996500650165026503650465056506650765086509651065116512651365146515651665176518651965206521652265236524652565266527652865296530653165326533653465356536653765386539654065416542654365446545654665476548654965506551655265536554655565566557655865596560656165626563656465656566656765686569657065716572657365746575657665776578657965806581658265836584658565866587658865896590659165926593659465956596659765986599660066016602660366046605660666076608660966106611661266136614661566166617661866196620662166226623662466256626662766286629663066316632663366346635663666376638663966406641664266436644664566466647664866496650665166526653665466556656665766586659666066616662666366646665666666676668666966706671667266736674667566766677667866796680668166826683668466856686668766886689669066916692669366946695669666976698669967006701670267036704670567066707670867096710671167126713671467156716671767186719672067216722672367246725672667276728672967306731673267336734673567366737673867396740674167426743674467456746674767486749675067516752675367546755675667576758675967606761676267636764676567666767676867696770677167726773677467756776677767786779678067816782678367846785678667876788678967906791679267936794679567966797679867996800680168026803680468056806680768086809681068116812681368146815681668176818681968206821682268236824682568266827682868296830683168326833683468356836683768386839684068416842684368446845684668476848684968506851685268536854685568566857685868596860686168626863686468656866686768686869687068716872687368746875687668776878687968806881688268836884688568866887688868896890689168926893689468956896689768986899690069016902690369046905690669076908690969106911691269136914691569166917691869196920692169226923692469256926692769286929693069316932693369346935693669376938693969406941694269436944694569466947694869496950695169526953695469556956695769586959696069616962696369646965696669676968696969706971697269736974697569766977697869796980698169826983698469856986698769886989699069916992699369946995699669976998699970007001700270037004700570067007700870097010701170127013701470157016701770187019702070217022702370247025702670277028702970307031703270337034703570367037703870397040704170427043704470457046704770487049705070517052705370547055705670577058705970607061706270637064706570667067706870697070707170727073707470757076707770787079708070817082708370847085708670877088708970907091709270937094709570967097709870997100710171027103710471057106710771087109711071117112711371147115711671177118711971207121712271237124712571267127712871297130713171327133713471357136713771387139714071417142714371447145714671477148714971507151715271537154715571567157715871597160716171627163716471657166716771687169717071717172717371747175717671777178717971807181718271837184718571867187718871897190719171927193719471957196719771987199720072017202720372047205720672077208720972107211721272137214721572167217721872197220722172227223722472257226722772287229723072317232723372347235723672377238723972407241724272437244724572467247724872497250725172527253725472557256725772587259726072617262726372647265726672677268726972707271727272737274727572767277727872797280728172827283728472857286728772887289729072917292729372947295729672977298729973007301730273037304730573067307730873097310731173127313731473157316731773187319732073217322732373247325732673277328732973307331733273337334733573367337733873397340734173427343734473457346734773487349735073517352735373547355735673577358735973607361736273637364736573667367736873697370737173727373737473757376737773787379738073817382738373847385738673877388738973907391739273937394739573967397739873997400740174027403740474057406740774087409741074117412741374147415741674177418741974207421742274237424742574267427742874297430743174327433743474357436743774387439744074417442744374447445744674477448744974507451745274537454745574567457745874597460746174627463746474657466746774687469747074717472747374747475747674777478747974807481748274837484748574867487748874897490749174927493749474957496749774987499750075017502750375047505750675077508750975107511751275137514751575167517751875197520752175227523752475257526752775287529753075317532753375347535753675377538753975407541754275437544754575467547754875497550755175527553755475557556755775587559756075617562756375647565756675677568756975707571757275737574757575767577757875797580758175827583758475857586758775887589759075917592759375947595759675977598759976007601760276037604760576067607760876097610761176127613761476157616761776187619762076217622762376247625762676277628762976307631763276337634763576367637763876397640764176427643764476457646764776487649765076517652765376547655765676577658765976607661766276637664766576667667766876697670767176727673767476757676767776787679768076817682768376847685768676877688768976907691769276937694769576967697769876997700770177027703770477057706770777087709771077117712771377147715771677177718771977207721772277237724772577267727772877297730773177327733773477357736773777387739774077417742774377447745774677477748774977507751775277537754775577567757775877597760776177627763776477657766776777687769777077717772777377747775777677777778777977807781778277837784778577867787778877897790779177927793779477957796779777987799780078017802780378047805780678077808780978107811781278137814781578167817781878197820782178227823782478257826782778287829783078317832783378347835783678377838783978407841784278437844784578467847784878497850785178527853785478557856785778587859786078617862786378647865786678677868786978707871787278737874787578767877787878797880788178827883788478857886788778887889789078917892789378947895789678977898789979007901790279037904790579067907790879097910791179127913791479157916791779187919792079217922792379247925792679277928792979307931793279337934793579367937793879397940794179427943794479457946794779487949795079517952795379547955795679577958795979607961796279637964796579667967796879697970797179727973797479757976797779787979798079817982798379847985798679877988798979907991799279937994799579967997799879998000800180028003800480058006800780088009801080118012801380148015801680178018801980208021802280238024802580268027802880298030803180328033803480358036803780388039804080418042804380448045804680478048804980508051805280538054805580568057805880598060806180628063806480658066806780688069807080718072807380748075807680778078807980808081808280838084808580868087808880898090809180928093809480958096809780988099810081018102810381048105810681078108810981108111811281138114811581168117811881198120812181228123812481258126812781288129813081318132813381348135813681378138813981408141814281438144814581468147814881498150815181528153815481558156815781588159816081618162816381648165816681678168816981708171817281738174817581768177817881798180818181828183818481858186818781888189819081918192819381948195819681978198819982008201820282038204820582068207820882098210821182128213821482158216821782188219822082218222822382248225822682278228822982308231823282338234823582368237823882398240824182428243824482458246824782488249825082518252825382548255825682578258825982608261826282638264826582668267826882698270827182728273827482758276827782788279828082818282828382848285828682878288828982908291829282938294829582968297829882998300830183028303830483058306830783088309831083118312831383148315831683178318831983208321832283238324832583268327832883298330833183328333833483358336833783388339834083418342834383448345834683478348834983508351835283538354835583568357835883598360836183628363836483658366836783688369837083718372837383748375837683778378837983808381838283838384838583868387838883898390839183928393839483958396839783988399840084018402840384048405840684078408840984108411841284138414841584168417841884198420842184228423842484258426842784288429843084318432843384348435843684378438843984408441844284438444844584468447844884498450845184528453845484558456845784588459846084618462846384648465846684678468846984708471847284738474847584768477847884798480848184828483848484858486848784888489849084918492849384948495849684978498849985008501850285038504850585068507850885098510851185128513851485158516851785188519852085218522852385248525852685278528852985308531853285338534853585368537853885398540854185428543854485458546854785488549855085518552855385548555855685578558855985608561856285638564856585668567856885698570857185728573857485758576857785788579858085818582858385848585858685878588858985908591859285938594859585968597859885998600860186028603860486058606860786088609861086118612861386148615861686178618861986208621862286238624862586268627862886298630863186328633863486358636863786388639864086418642864386448645864686478648864986508651865286538654865586568657865886598660866186628663866486658666866786688669867086718672867386748675867686778678867986808681868286838684868586868687868886898690869186928693869486958696869786988699870087018702870387048705870687078708870987108711871287138714871587168717871887198720872187228723872487258726872787288729873087318732873387348735873687378738873987408741874287438744874587468747874887498750875187528753875487558756875787588759876087618762876387648765876687678768876987708771877287738774877587768777877887798780878187828783878487858786878787888789879087918792879387948795879687978798879988008801880288038804880588068807880888098810881188128813881488158816881788188819882088218822882388248825882688278828882988308831883288338834883588368837883888398840884188428843884488458846884788488849885088518852885388548855885688578858885988608861886288638864886588668867886888698870887188728873887488758876887788788879888088818882888388848885888688878888888988908891889288938894889588968897889888998900890189028903890489058906890789088909891089118912891389148915891689178918891989208921892289238924892589268927892889298930893189328933893489358936893789388939894089418942894389448945894689478948894989508951895289538954895589568957895889598960896189628963896489658966896789688969897089718972897389748975897689778978897989808981898289838984898589868987898889898990899189928993899489958996899789988999900090019002900390049005900690079008900990109011901290139014901590169017901890199020902190229023902490259026902790289029903090319032903390349035903690379038903990409041904290439044904590469047904890499050905190529053905490559056905790589059906090619062906390649065906690679068906990709071907290739074907590769077907890799080908190829083908490859086908790889089909090919092909390949095909690979098909991009101910291039104910591069107910891099110911191129113911491159116911791189119912091219122912391249125912691279128912991309131913291339134913591369137913891399140914191429143914491459146914791489149915091519152915391549155915691579158915991609161916291639164916591669167916891699170917191729173917491759176917791789179918091819182918391849185918691879188918991909191919291939194919591969197919891999200920192029203920492059206920792089209921092119212921392149215921692179218921992209221922292239224922592269227922892299230923192329233923492359236923792389239924092419242924392449245924692479248924992509251925292539254925592569257925892599260926192629263926492659266926792689269927092719272927392749275927692779278927992809281928292839284928592869287928892899290929192929293929492959296929792989299930093019302930393049305930693079308930993109311931293139314931593169317931893199320932193229323932493259326932793289329933093319332933393349335933693379338933993409341934293439344934593469347934893499350935193529353935493559356935793589359936093619362936393649365936693679368936993709371937293739374937593769377937893799380938193829383938493859386938793889389939093919392939393949395939693979398939994009401940294039404940594069407940894099410941194129413941494159416941794189419942094219422942394249425942694279428942994309431943294339434943594369437943894399440944194429443944494459446944794489449945094519452945394549455945694579458945994609461946294639464946594669467946894699470947194729473947494759476947794789479948094819482948394849485948694879488948994909491949294939494949594969497949894999500950195029503950495059506950795089509951095119512951395149515951695179518951995209521952295239524952595269527952895299530953195329533953495359536953795389539954095419542954395449545954695479548954995509551955295539554955595569557955895599560956195629563956495659566956795689569957095719572957395749575957695779578957995809581958295839584958595869587958895899590959195929593959495959596959795989599960096019602960396049605960696079608960996109611961296139614961596169617961896199620962196229623962496259626962796289629963096319632963396349635963696379638963996409641964296439644964596469647964896499650965196529653965496559656965796589659966096619662966396649665966696679668966996709671967296739674967596769677967896799680968196829683968496859686968796889689969096919692969396949695969696979698969997009701970297039704970597069707970897099710971197129713971497159716971797189719972097219722972397249725972697279728972997309731973297339734973597369737973897399740974197429743974497459746974797489749975097519752975397549755975697579758975997609761976297639764976597669767976897699770977197729773977497759776977797789779978097819782978397849785978697879788978997909791979297939794979597969797979897999800980198029803980498059806980798089809981098119812981398149815981698179818981998209821982298239824982598269827982898299830983198329833983498359836983798389839984098419842984398449845984698479848984998509851985298539854985598569857985898599860986198629863986498659866986798689869987098719872987398749875987698779878987998809881988298839884988598869887988898899890989198929893989498959896989798989899990099019902990399049905990699079908990999109911991299139914991599169917991899199920992199229923992499259926992799289929993099319932993399349935993699379938993999409941994299439944994599469947994899499950995199529953995499559956995799589959996099619962996399649965996699679968996999709971997299739974997599769977997899799980998199829983998499859986998799889989999099919992999399949995999699979998999910000100011000210003100041000510006100071000810009100101001110012100131001410015100161001710018100191002010021100221002310024100251002610027100281002910030100311003210033100341003510036100371003810039100401004110042100431004410045100461004710048100491005010051100521005310054100551005610057100581005910060100611006210063100641006510066100671006810069100701007110072100731007410075100761007710078100791008010081100821008310084100851008610087100881008910090100911009210093100941009510096100971009810099101001010110102101031010410105101061010710108101091011010111101121011310114101151011610117101181011910120101211012210123101241012510126101271012810129101301013110132101331013410135101361013710138101391014010141101421014310144101451014610147101481014910150101511015210153101541015510156101571015810159101601016110162101631016410165101661016710168101691017010171101721017310174101751017610177101781017910180101811018210183101841018510186101871018810189101901019110192101931019410195101961019710198101991020010201102021020310204102051020610207102081020910210102111021210213102141021510216102171021810219102201022110222102231022410225102261022710228102291023010231102321023310234102351023610237102381023910240102411024210243102441024510246102471024810249102501025110252102531025410255102561025710258102591026010261102621026310264102651026610267102681026910270102711027210273102741027510276102771027810279102801028110282102831028410285102861028710288102891029010291102921029310294102951029610297102981029910300103011030210303103041030510306103071030810309103101031110312103131031410315103161031710318103191032010321103221032310324103251032610327103281032910330103311033210333103341033510336103371033810339103401034110342103431034410345103461034710348103491035010351103521035310354103551035610357103581035910360103611036210363103641036510366103671036810369103701037110372103731037410375103761037710378103791038010381103821038310384103851038610387103881038910390103911039210393103941039510396103971039810399104001040110402104031040410405104061040710408104091041010411104121041310414104151041610417104181041910420104211042210423104241042510426104271042810429104301043110432104331043410435104361043710438104391044010441104421044310444104451044610447104481044910450104511045210453104541045510456104571045810459104601046110462104631046410465104661046710468104691047010471104721047310474104751047610477104781047910480104811048210483104841048510486104871048810489104901049110492104931049410495104961049710498104991050010501105021050310504105051050610507105081050910510105111051210513105141051510516105171051810519105201052110522105231052410525105261052710528105291053010531105321053310534105351053610537105381053910540105411054210543105441054510546105471054810549105501055110552105531055410555105561055710558105591056010561105621056310564105651056610567105681056910570105711057210573105741057510576105771057810579105801058110582105831058410585105861058710588105891059010591105921059310594105951059610597105981059910600106011060210603106041060510606106071060810609106101061110612106131061410615106161061710618106191062010621106221062310624106251062610627106281062910630106311063210633106341063510636106371063810639106401064110642106431064410645106461064710648106491065010651106521065310654106551065610657106581065910660106611066210663106641066510666106671066810669106701067110672106731067410675106761067710678106791068010681106821068310684106851068610687106881068910690106911069210693106941069510696106971069810699107001070110702107031070410705107061070710708107091071010711107121071310714107151071610717107181071910720107211072210723107241072510726107271072810729107301073110732107331073410735107361073710738107391074010741107421074310744107451074610747107481074910750107511075210753107541075510756107571075810759107601076110762107631076410765107661076710768107691077010771107721077310774107751077610777107781077910780107811078210783107841078510786107871078810789107901079110792107931079410795107961079710798107991080010801108021080310804108051080610807108081080910810108111081210813108141081510816108171081810819108201082110822108231082410825108261082710828108291083010831108321083310834108351083610837108381083910840108411084210843108441084510846108471084810849108501085110852108531085410855108561085710858108591086010861108621086310864108651086610867108681086910870108711087210873108741087510876108771087810879108801088110882108831088410885108861088710888108891089010891108921089310894108951089610897108981089910900109011090210903109041090510906109071090810909109101091110912109131091410915109161091710918109191092010921109221092310924109251092610927109281092910930109311093210933109341093510936109371093810939109401094110942109431094410945109461094710948109491095010951109521095310954109551095610957109581095910960109611096210963109641096510966109671096810969109701097110972109731097410975109761097710978109791098010981109821098310984109851098610987109881098910990109911099210993109941099510996109971099810999110001100111002110031100411005110061100711008110091101011011110121101311014110151101611017110181101911020110211102211023110241102511026110271102811029110301103111032110331103411035110361103711038110391104011041110421104311044110451104611047110481104911050110511105211053110541105511056110571105811059110601106111062110631106411065110661106711068110691107011071110721107311074110751107611077110781107911080110811108211083110841108511086110871108811089110901109111092110931109411095110961109711098110991110011101111021110311104111051110611107111081110911110111111111211113111141111511116111171111811119111201112111122111231112411125111261112711128111291113011131111321113311134111351113611137111381113911140111411114211143111441114511146111471114811149111501115111152111531115411155111561115711158111591116011161111621116311164111651116611167111681116911170111711117211173111741117511176111771117811179111801118111182111831118411185111861118711188111891119011191111921119311194111951119611197111981119911200112011120211203112041120511206112071120811209112101121111212112131121411215112161121711218112191122011221112221122311224112251122611227112281122911230112311123211233112341123511236112371123811239112401124111242112431124411245112461124711248112491125011251112521125311254112551125611257112581125911260112611126211263112641126511266112671126811269112701127111272112731127411275112761127711278112791128011281112821128311284112851128611287112881128911290112911129211293112941129511296112971129811299113001130111302113031130411305113061130711308113091131011311113121131311314113151131611317113181131911320113211132211323113241132511326113271132811329113301133111332113331133411335113361133711338113391134011341113421134311344113451134611347113481134911350113511135211353113541135511356113571135811359113601136111362113631136411365113661136711368113691137011371113721137311374113751137611377113781137911380113811138211383113841138511386113871138811389113901139111392113931139411395113961139711398113991140011401114021140311404114051140611407114081140911410114111141211413114141141511416114171141811419114201142111422114231142411425114261142711428114291143011431114321143311434114351143611437114381143911440114411144211443114441144511446114471144811449114501145111452114531145411455114561145711458114591146011461114621146311464114651146611467114681146911470114711147211473114741147511476114771147811479114801148111482114831148411485114861148711488114891149011491114921149311494114951149611497114981149911500115011150211503115041150511506115071150811509115101151111512115131151411515115161151711518115191152011521115221152311524115251152611527115281152911530115311153211533115341153511536115371153811539115401154111542115431154411545115461154711548115491155011551115521155311554115551155611557115581155911560115611156211563115641156511566115671156811569115701157111572115731157411575115761157711578115791158011581115821158311584115851158611587115881158911590115911159211593115941159511596115971159811599116001160111602116031160411605116061160711608116091161011611116121161311614116151161611617116181161911620116211162211623116241162511626116271162811629116301163111632116331163411635116361163711638116391164011641116421164311644116451164611647116481164911650116511165211653116541165511656116571165811659116601166111662116631166411665116661166711668116691167011671116721167311674116751167611677116781167911680116811168211683116841168511686116871168811689116901169111692116931169411695116961169711698116991170011701117021170311704117051170611707117081170911710117111171211713117141171511716117171171811719117201172111722117231172411725117261172711728117291173011731117321173311734117351173611737117381173911740117411174211743117441174511746117471174811749117501175111752117531175411755117561175711758117591176011761117621176311764117651176611767117681176911770117711177211773117741177511776117771177811779117801178111782117831178411785117861178711788117891179011791117921179311794117951179611797117981179911800118011180211803118041180511806118071180811809118101181111812118131181411815118161181711818118191182011821118221182311824118251182611827118281182911830118311183211833118341183511836118371183811839118401184111842118431184411845118461184711848118491185011851118521185311854118551185611857118581185911860118611186211863118641186511866118671186811869118701187111872118731187411875118761187711878118791188011881118821188311884118851188611887118881188911890118911189211893118941189511896118971189811899119001190111902119031190411905119061190711908119091191011911119121191311914119151191611917119181191911920119211192211923119241192511926119271192811929119301193111932119331193411935119361193711938119391194011941119421194311944119451194611947119481194911950119511195211953119541195511956119571195811959119601196111962119631196411965119661196711968119691197011971119721197311974119751197611977119781197911980119811198211983119841198511986119871198811989119901199111992119931199411995119961199711998119991200012001120021200312004120051200612007120081200912010120111201212013120141201512016120171201812019120201202112022120231202412025120261202712028120291203012031120321203312034120351203612037120381203912040120411204212043120441204512046120471204812049120501205112052120531205412055120561205712058120591206012061120621206312064120651206612067120681206912070120711207212073120741207512076120771207812079120801208112082120831208412085120861208712088120891209012091120921209312094120951209612097120981209912100121011210212103121041210512106121071210812109121101211112112121131211412115121161211712118121191212012121121221212312124121251212612127121281212912130121311213212133121341213512136121371213812139121401214112142121431214412145121461214712148121491215012151121521215312154121551215612157121581215912160121611216212163121641216512166121671216812169121701217112172121731217412175121761217712178121791218012181121821218312184121851218612187121881218912190121911219212193121941219512196121971219812199122001220112202122031220412205122061220712208122091221012211122121221312214122151221612217122181221912220122211222212223122241222512226122271222812229122301223112232122331223412235122361223712238122391224012241122421224312244122451224612247122481224912250122511225212253122541225512256122571225812259122601226112262122631226412265122661226712268122691227012271122721227312274122751227612277122781227912280122811228212283122841228512286122871228812289122901229112292122931229412295122961229712298122991230012301123021230312304123051230612307123081230912310123111231212313123141231512316123171231812319123201232112322123231232412325123261232712328123291233012331123321233312334123351233612337123381233912340123411234212343123441234512346123471234812349123501235112352123531235412355123561235712358123591236012361123621236312364123651236612367123681236912370123711237212373123741237512376123771237812379123801238112382123831238412385123861238712388123891239012391123921239312394123951239612397123981239912400124011240212403124041240512406124071240812409124101241112412124131241412415124161241712418124191242012421124221242312424124251242612427124281242912430124311243212433124341243512436124371243812439124401244112442124431244412445124461244712448124491245012451124521245312454124551245612457124581245912460124611246212463124641246512466124671246812469124701247112472124731247412475124761247712478124791248012481124821248312484124851248612487124881248912490124911249212493124941249512496124971249812499125001250112502125031250412505125061250712508125091251012511125121251312514125151251612517125181251912520125211252212523125241252512526125271252812529125301253112532125331253412535125361253712538125391254012541125421254312544125451254612547125481254912550125511255212553125541255512556125571255812559125601256112562125631256412565125661256712568125691257012571125721257312574125751257612577125781257912580125811258212583125841258512586125871258812589125901259112592125931259412595125961259712598125991260012601126021260312604126051260612607126081260912610126111261212613126141261512616126171261812619126201262112622126231262412625126261262712628126291263012631126321263312634126351263612637126381263912640126411264212643126441264512646126471264812649126501265112652126531265412655126561265712658126591266012661126621266312664126651266612667126681266912670126711267212673126741267512676126771267812679126801268112682126831268412685126861268712688126891269012691126921269312694126951269612697126981269912700127011270212703127041270512706127071270812709127101271112712127131271412715127161271712718127191272012721127221272312724127251272612727127281272912730127311273212733127341273512736127371273812739127401274112742127431274412745127461274712748127491275012751127521275312754127551275612757127581275912760127611276212763127641276512766127671276812769127701277112772127731277412775127761277712778127791278012781127821278312784127851278612787127881278912790127911279212793127941279512796127971279812799128001280112802128031280412805128061280712808128091281012811128121281312814128151281612817128181281912820128211282212823128241282512826128271282812829128301283112832128331283412835128361283712838128391284012841128421284312844128451284612847128481284912850128511285212853128541285512856128571285812859128601286112862128631286412865128661286712868128691287012871128721287312874128751287612877128781287912880128811288212883128841288512886128871288812889128901289112892128931289412895128961289712898128991290012901129021290312904129051290612907129081290912910129111291212913129141291512916129171291812919129201292112922129231292412925129261292712928129291293012931129321293312934129351293612937129381293912940129411294212943129441294512946129471294812949129501295112952129531295412955129561295712958129591296012961129621296312964129651296612967129681296912970129711297212973129741297512976129771297812979129801298112982129831298412985129861298712988129891299012991129921299312994129951299612997129981299913000130011300213003130041300513006130071300813009130101301113012130131301413015130161301713018130191302013021130221302313024130251302613027130281302913030130311303213033130341303513036130371303813039130401304113042130431304413045130461304713048130491305013051130521305313054130551305613057130581305913060130611306213063130641306513066130671306813069130701307113072130731307413075130761307713078130791308013081130821308313084130851308613087130881308913090130911309213093130941309513096130971309813099131001310113102131031310413105131061310713108131091311013111131121311313114131151311613117131181311913120131211312213123131241312513126131271312813129131301313113132131331313413135131361313713138131391314013141131421314313144131451314613147131481314913150131511315213153131541315513156131571315813159131601316113162131631316413165131661316713168131691317013171131721317313174131751317613177131781317913180131811318213183131841318513186131871318813189131901319113192131931319413195131961319713198131991320013201132021320313204132051320613207132081320913210132111321213213132141321513216132171321813219132201322113222132231322413225132261322713228132291323013231132321323313234132351323613237132381323913240132411324213243132441324513246132471324813249132501325113252132531325413255132561325713258132591326013261132621326313264132651326613267132681326913270132711327213273132741327513276132771327813279132801328113282132831328413285132861328713288132891329013291132921329313294132951329613297132981329913300133011330213303133041330513306133071330813309133101331113312133131331413315133161331713318133191332013321133221332313324133251332613327133281332913330133311333213333133341333513336133371333813339133401334113342133431334413345133461334713348133491335013351133521335313354133551335613357133581335913360133611336213363133641336513366133671336813369133701337113372133731337413375133761337713378133791338013381133821338313384133851338613387133881338913390133911339213393133941339513396133971339813399134001340113402134031340413405134061340713408134091341013411134121341313414134151341613417134181341913420134211342213423134241342513426134271342813429134301343113432134331343413435134361343713438134391344013441134421344313444134451344613447134481344913450134511345213453134541345513456134571345813459134601346113462134631346413465134661346713468134691347013471134721347313474134751347613477134781347913480134811348213483134841348513486134871348813489134901349113492134931349413495134961349713498134991350013501135021350313504135051350613507135081350913510135111351213513135141351513516135171351813519135201352113522135231352413525135261352713528135291353013531135321353313534135351353613537135381353913540135411354213543135441354513546135471354813549135501355113552135531355413555135561355713558135591356013561135621356313564135651356613567135681356913570135711357213573135741357513576135771357813579135801358113582135831358413585135861358713588135891359013591135921359313594135951359613597135981359913600136011360213603136041360513606136071360813609136101361113612136131361413615136161361713618136191362013621136221362313624136251362613627136281362913630136311363213633136341363513636136371363813639136401364113642136431364413645136461364713648136491365013651136521365313654136551365613657136581365913660136611366213663136641366513666136671366813669136701367113672136731367413675136761367713678136791368013681136821368313684136851368613687136881368913690136911369213693136941369513696136971369813699137001370113702137031370413705137061370713708137091371013711137121371313714137151371613717137181371913720137211372213723137241372513726137271372813729137301373113732137331373413735137361373713738137391374013741137421374313744137451374613747137481374913750137511375213753137541375513756137571375813759137601376113762137631376413765137661376713768137691377013771137721377313774137751377613777137781377913780137811378213783
  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;
  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. suppressModuleRegistration=FALSE;
  53. NonPointer = -1; (* special pointer values *)
  54. NoType = 0; (* special type info values *)
  55. LhsIsPointer = 0; (* for the operator kind *)
  56. RhsIsPointer = 1;
  57. (* priority values, lower means higher priority *)
  58. EntryPriority=-4;
  59. FirstPriority=-3;
  60. InitPriority=-2;
  61. ExitPriority=-1;
  62. StrictChecks = FALSE;
  63. BasePointerTypeSize = 5;
  64. BaseArrayTypeSize = BasePointerTypeSize + 3;
  65. LengthOffset = BasePointerTypeSize + 0;
  66. DataOffset = BasePointerTypeSize + 1;
  67. DescriptorOffset = BasePointerTypeSize + 2;
  68. BaseRecordTypeSize = BasePointerTypeSize + 2;
  69. ActionOffset = BasePointerTypeSize + 0;
  70. MonitorOffset = BasePointerTypeSize + 1;
  71. BaseObjectTypeSize = BaseRecordTypeSize;
  72. ActionTypeSize = 3;
  73. MonitorTypeSize = 7;
  74. ProcessorOffset = BaseObjectTypeSize + 1;
  75. StackLimitOffset* = BaseObjectTypeSize + 3;
  76. QuantumOffset = BaseObjectTypeSize + 4;
  77. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  78. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  79. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  80. Size2Flag = 4; (* size = 2 *)
  81. Size3Flag = 5; (* size = 3 *)
  82. Size4Flag = 6; (* size = 4 *)
  83. Size5Flag = 7; (* size = 5 *)
  84. Size6Flag = 8; (* size = 6 *)
  85. Size7Flag = 9; (* size = 7 *)
  86. Size8Flag = 10; (* size = 8 *)
  87. ReflectionSupport = TRUE;
  88. TYPE
  89. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  90. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  91. Operand = RECORD
  92. mode: SHORTINT;
  93. op: IntermediateCode.Operand;
  94. tag: IntermediateCode.Operand;
  95. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  96. dimOffset: LONGINT;
  97. END;
  98. Fixup= POINTER TO RECORD
  99. pc: LONGINT;
  100. nextFixup: Fixup;
  101. END;
  102. WriteBackCall = POINTER TO RECORD
  103. call: SyntaxTree.ProcedureCallDesignator;
  104. next: WriteBackCall;
  105. END;
  106. Label= OBJECT
  107. VAR
  108. fixups: Fixup;
  109. section: IntermediateCode.Section;
  110. pc: LONGINT;
  111. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  112. BEGIN
  113. SELF.section := section; pc := -1;
  114. END InitLabel;
  115. PROCEDURE Resolve(pc: LONGINT);
  116. VAR at: LONGINT;
  117. BEGIN
  118. SELF.pc := pc;
  119. WHILE(fixups # NIL) DO
  120. at := fixups.pc;
  121. section.PatchAddress(at,pc);
  122. fixups := fixups.nextFixup;
  123. END;
  124. END Resolve;
  125. PROCEDURE AddFixup(at: LONGINT);
  126. VAR fixup: Fixup;
  127. BEGIN
  128. ASSERT(pc=-1);
  129. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  130. END AddFixup;
  131. END Label;
  132. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  133. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  134. VAR
  135. backend: IntermediateBackend;
  136. implementationVisitor: ImplementationVisitor;
  137. meta: MetaDataGenerator;
  138. system: Global.System;
  139. currentScope: SyntaxTree.Scope;
  140. module: Sections.Module;
  141. moduleSelf: SyntaxTree.Variable;
  142. dump: BOOLEAN;
  143. forceModuleBody: BOOLEAN;
  144. addressType: IntermediateCode.Type;
  145. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  146. BEGIN
  147. currentScope := NIL; module := NIL; moduleSelf := NIL;
  148. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  149. SELF.dump := dump;
  150. SELF.backend := backend;
  151. SELF.forceModuleBody := forceModuleBody;
  152. addressType := IntermediateCode.GetType(system,system.addressType)
  153. END Init;
  154. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  155. BEGIN
  156. backend.Error(module.module.sourceName, position, Diagnostics.Invalid, s);
  157. END Error;
  158. PROCEDURE Type(x: SyntaxTree.Type);
  159. BEGIN
  160. x.Accept(SELF);
  161. END Type;
  162. (** types **)
  163. PROCEDURE VisitBasicType(x: SyntaxTree.BasicType);
  164. BEGIN (* no code emission *) END VisitBasicType;
  165. PROCEDURE VisitCharacterType(x: SyntaxTree.CharacterType);
  166. BEGIN (* no code emission *) END VisitCharacterType;
  167. PROCEDURE VisitIntegerType(x: SyntaxTree.IntegerType);
  168. BEGIN (* no code emission *) END VisitIntegerType;
  169. PROCEDURE VisitFloatType(x: SyntaxTree.FloatType);
  170. BEGIN (* no code emission *) END VisitFloatType;
  171. PROCEDURE VisitComplexType(x: SyntaxTree.ComplexType);
  172. BEGIN (* no code emission *) END VisitComplexType;
  173. PROCEDURE VisitQualifiedType(x: SyntaxTree.QualifiedType);
  174. VAR type: SyntaxTree.Type;
  175. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  176. type := x.resolved;
  177. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  178. meta.CheckTypeDeclaration(type);
  179. END;
  180. END VisitQualifiedType;
  181. PROCEDURE VisitStringType(x: SyntaxTree.StringType);
  182. BEGIN (* no code emission *) END VisitStringType;
  183. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  184. BEGIN (* no code emission *)
  185. END VisitArrayRangeType;
  186. PROCEDURE VisitArrayType(x: SyntaxTree.ArrayType);
  187. BEGIN (* no code emission *) END VisitArrayType;
  188. PROCEDURE VisitMathArrayType(x: SyntaxTree.MathArrayType);
  189. BEGIN
  190. meta.CheckTypeDeclaration(x);
  191. END VisitMathArrayType;
  192. PROCEDURE VisitPointerType(x: SyntaxTree.PointerType);
  193. BEGIN
  194. meta.CheckTypeDeclaration(x);
  195. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  196. END VisitPointerType;
  197. PROCEDURE VisitRecordType(x: SyntaxTree.RecordType);
  198. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  199. BEGIN (* no code emission *)
  200. meta.CheckTypeDeclaration(x);
  201. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  202. IF x.pointerType.typeDeclaration # NIL THEN
  203. td := x.pointerType.typeDeclaration
  204. ELSE
  205. td := x.typeDeclaration
  206. END;
  207. Global.GetSymbolName(td,name);
  208. (* code section for object *)
  209. END;
  210. Scope(x.recordScope);
  211. END VisitRecordType;
  212. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  213. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  214. BEGIN
  215. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  216. WHILE (this # NIL) & (this.identifier# id) DO
  217. this := this.nextModifier;
  218. END;
  219. RETURN this # NIL
  220. END HasFlag;
  221. PROCEDURE VisitCellType(x: SyntaxTree.CellType);
  222. VAR port,adr: LONGINT; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  223. (*
  224. PROCEDURE CreatePorts(type: SyntaxTree.Type; len: LONGINT);
  225. VAR i,len2: LONGINT; baseType: SyntaxTree.Type;
  226. BEGIN
  227. FOR i := 0 TO len-1 DO
  228. IF SemanticChecker.IsStaticArray(type, baseType, len2) THEN
  229. CreatePorts(baseType, len*len2);
  230. ELSIF IsSemiDynamicArray(type) THEN
  231. port := MIN(LONGINT); (* unknown port address from here on *)
  232. ELSE
  233. IntermediateCode.InitImmediate(op,addressType,adr);
  234. symbol.Emit(Data(-1,op));
  235. INC(port);
  236. END;
  237. END;
  238. END CreatePorts;
  239. *)
  240. BEGIN
  241. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  242. (*
  243. IF (x.cellScope.ownerModule = module.module) THEN
  244. td := x.typeDeclaration;
  245. Global.GetSymbolSegmentedName(td,name);
  246. (* code section for object *)
  247. END;
  248. *)
  249. (* unnecessary to generate space for ports: already represented as hidden variables *)
  250. (*
  251. port := 0;
  252. parameter := x.firstParameter;
  253. WHILE parameter # NIL DO
  254. type := parameter.type.resolved;
  255. Global.GetSymbolSegmentedName(parameter,name);
  256. symbol := implementationVisitor.NewSection(module.allSections, Sections.ConstSection,name,parameter,dump);
  257. IF port >= 0 THEN
  258. (*! could be used for optimization: query value here ???
  259. parameter.SetResolved(SyntaxTree.NewIntegerValue(-1, port));
  260. *)
  261. END;
  262. CreatePorts(type, 1);
  263. IF backend.cellsAreObjects THEN
  264. IF IsStaticArray(parameter.type.resolved) THEN
  265. Error(parameter.position, "static arrays of ports are currently not implemented, please use a property (array property of port)");
  266. END;
  267. END;
  268. parameter := parameter.nextParameter;
  269. END;
  270. *)
  271. capabilities := {};
  272. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  273. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  274. backend.SetCapabilities(capabilities);
  275. Scope(x.cellScope);
  276. END VisitCellType;
  277. PROCEDURE VisitProcedureType(x: SyntaxTree.ProcedureType);
  278. BEGIN (* no code emission *) END VisitProcedureType;
  279. PROCEDURE VisitEnumerationType(x: SyntaxTree.EnumerationType);
  280. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  281. END VisitEnumerationType;
  282. (* symbols *)
  283. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  284. BEGIN
  285. Procedure(x);
  286. END VisitProcedure;
  287. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  288. BEGIN
  289. Procedure(x);
  290. END VisitOperator;
  291. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  292. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i, dim: LONGINT;
  293. size, addressSize: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  294. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  295. BEGIN
  296. type := type.resolved;
  297. IF type IS SyntaxTree.RecordType THEN
  298. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  299. ELSIF (type IS SyntaxTree.ArrayType) THEN
  300. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  301. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  302. END;
  303. ELSIF type IS SyntaxTree.MathArrayType THEN
  304. WITH type: SyntaxTree.MathArrayType DO
  305. IF type.form = SyntaxTree.Open THEN
  306. RETURN TRUE
  307. ELSIF type.form = SyntaxTree.Static THEN
  308. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  309. END;
  310. END;
  311. END;
  312. RETURN FALSE
  313. END TypeNeedsInitialization;
  314. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  315. VAR variable: SyntaxTree.Variable;
  316. BEGIN
  317. variable := scope.firstVariable;
  318. WHILE variable # NIL DO
  319. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  320. IF variable.initializer # NIL THEN RETURN TRUE END;
  321. variable := variable.nextVariable;
  322. END;
  323. RETURN FALSE
  324. END ScopeNeedsInitialization;
  325. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset: LONGINT);
  326. BEGIN
  327. size := offset - lastUpdated;
  328. IF size > 0 THEN
  329. irv.Emit(Reserve(x.position,size));
  330. END;
  331. irv.Emit(Data(x.position, op));
  332. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  333. END SingleInitialize;
  334. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset: LONGINT);
  335. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable;
  336. BEGIN
  337. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  338. WITH type: SyntaxTree.RecordType DO
  339. baseType := type.baseType;
  340. IF baseType # NIL THEN
  341. baseType := baseType.resolved;
  342. IF baseType IS SyntaxTree.PointerType THEN
  343. baseType := baseType(SyntaxTree.PointerType).pointerBase
  344. END;
  345. Initialize(baseType,NIL, offset);
  346. END;
  347. variable := type.recordScope.firstVariable;
  348. WHILE variable # NIL DO
  349. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  350. variable := variable.nextVariable
  351. END;
  352. | type: SyntaxTree.ArrayType DO
  353. IF type.form = SyntaxTree.Static THEN
  354. baseType := type.arrayBase;
  355. IF TypeNeedsInitialization(baseType) THEN
  356. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  357. FOR i := 0 TO type.staticLength-1 DO
  358. Initialize(baseType,NIL,offset+i*size);
  359. END;
  360. END;
  361. END;
  362. | type: SyntaxTree.MathArrayType DO
  363. IF type.form = SyntaxTree.Open THEN
  364. dim := DynamicDim(type);
  365. baseType := SemanticChecker.ArrayBase(type,dim);
  366. imm := IntermediateCode.Immediate(addressType,dim);
  367. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  368. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  369. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  370. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  371. (* flags remain empty (=0) for open array *)
  372. ELSIF type.form = SyntaxTree.Static THEN
  373. baseType := type.arrayBase;
  374. IF TypeNeedsInitialization(baseType) THEN
  375. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  376. ASSERT(type.staticLength < 1024*1024*1024);
  377. FOR i := 0 TO type.staticLength-1 DO
  378. Initialize(baseType,NIL,offset+i*size);
  379. END;
  380. END;
  381. END;
  382. ELSE
  383. IF initializer # NIL THEN
  384. implementationVisitor.Evaluate(initializer, op);
  385. SingleInitialize(op.op, offset);
  386. END;
  387. END;
  388. END Initialize;
  389. BEGIN
  390. IF x.externalName # NIL THEN RETURN END;
  391. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  392. (* code section for variable *)
  393. Global.GetSymbolSegmentedName(x,name);
  394. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  395. irv.SetExported(IsExported(x));
  396. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  397. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  398. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  399. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  400. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  401. FOR i := 0 TO DynamicDim(x.type)-1 DO
  402. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  403. END;
  404. ELSE
  405. lastUpdated:= 0;
  406. IF implementationVisitor.newObjectFile & ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  407. Initialize(x.type, x.initializer, 0);
  408. END;
  409. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  410. IF size > 0 THEN
  411. irv.Emit(Reserve(x.position,size));
  412. END;
  413. IF ~x.fixed THEN
  414. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  415. ELSE
  416. align := x.alignment;
  417. END;
  418. irv.SetPositionOrAlignment(x.fixed, align);
  419. meta.CheckTypeDeclaration(x.type);
  420. END;
  421. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  422. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  423. END;
  424. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  425. END VisitVariable;
  426. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  427. VAR name: Basic.SegmentedName; irv, irl: IntermediateCode.Section; op: Operand; dim: LONGINT;
  428. BEGIN
  429. HALT(100);
  430. (*
  431. ASSERT(currentScope.outerScope IS SyntaxTree.CellScope);
  432. (* code section for variable *)
  433. Global.GetSymbolSegmentedName(x,name);
  434. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  435. irv.SetPositionOrAlignment(x.fixed, x.alignment);
  436. (*
  437. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  438. *)
  439. IF IsSemiDynamicArray(x.type) & ~backend.cellsAreObjects THEN
  440. HALT(100);
  441. irv.Emit(Reserve(x.position, system.addressSize));
  442. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  443. irl := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  444. irl.Emit(Reserve(x.position, DynamicDim(x.type) * system.addressSize));
  445. ELSIF x.defaultValue = NIL THEN
  446. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))))
  447. ELSE
  448. implementationVisitor.inData := TRUE;
  449. implementationVisitor.Evaluate(x.defaultValue, op);
  450. irv.Emit(Data(x.position,op.op));
  451. implementationVisitor.inData := FALSE;
  452. END;
  453. meta.CheckTypeDeclaration(x.type);
  454. *)
  455. END VisitParameter;
  456. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  457. BEGIN
  458. Type(x.declaredType); (* => code in objects *)
  459. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  460. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  461. END;
  462. END VisitTypeDeclaration;
  463. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  464. BEGIN
  465. IF (SyntaxTree.Public * x.access # {}) THEN
  466. implementationVisitor.VisitConstant(x);
  467. END;
  468. END VisitConstant;
  469. PROCEDURE Scope(x: SyntaxTree.Scope);
  470. VAR procedure: SyntaxTree.Procedure;
  471. constant: SyntaxTree.Constant;
  472. variable: SyntaxTree.Variable;
  473. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  474. BEGIN
  475. prevScope := currentScope;
  476. currentScope := x;
  477. (* constants treated in implementation visitor *)
  478. typeDeclaration := x.firstTypeDeclaration;
  479. WHILE typeDeclaration # NIL DO
  480. VisitTypeDeclaration(typeDeclaration);
  481. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  482. END;
  483. variable := x.firstVariable;
  484. WHILE variable # NIL DO
  485. VisitVariable(variable);
  486. variable := variable.nextVariable;
  487. END;
  488. procedure := x.firstProcedure;
  489. WHILE procedure # NIL DO
  490. VisitProcedure(procedure);
  491. procedure := procedure.nextProcedure;
  492. END;
  493. constant := x.firstConstant;
  494. WHILE constant # NIL DO
  495. VisitConstant(constant);
  496. constant := constant.nextConstant;
  497. END;
  498. currentScope := prevScope;
  499. END Scope;
  500. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  501. VAR parameter: SyntaxTree.Parameter;
  502. BEGIN
  503. parameter := first;
  504. WHILE parameter # NIL DO
  505. VisitParameter(parameter);
  506. parameter := parameter.nextParameter;
  507. END;
  508. END Parameters;
  509. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  510. VAR scope: SyntaxTree.ProcedureScope;
  511. prevScope: SyntaxTree.Scope;
  512. inline, finalizer: BOOLEAN;
  513. procedureType: SyntaxTree.ProcedureType;
  514. pc: LONGINT;
  515. stackSize: LONGINT;
  516. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  517. null,size,src,dest,fp,res: IntermediateCode.Operand;
  518. cc: LONGINT;
  519. cellType: SyntaxTree.CellType;
  520. registerNumber: LONGINT;
  521. registerClass: IntermediateCode.RegisterClass;
  522. type: IntermediateCode.Type;
  523. formalParameter: SyntaxTree.Parameter;
  524. recordType: SyntaxTree.RecordType;
  525. isModuleBody: BOOLEAN;
  526. PROCEDURE Signature;
  527. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  528. BEGIN
  529. procedureType := x.type(SyntaxTree.ProcedureType);
  530. returnType := procedureType.returnType;
  531. IF returnType # NIL THEN
  532. meta.CheckTypeDeclaration(returnType)
  533. END;
  534. parameter := procedureType.firstParameter;
  535. WHILE parameter # NIL DO
  536. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  537. parameter := parameter.nextParameter;
  538. END;
  539. END Signature;
  540. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  541. VAR result: BOOLEAN;
  542. BEGIN
  543. result := FALSE;
  544. IF x = SyntaxTree.invalidExpression THEN
  545. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  546. result := TRUE;
  547. value := x.resolved(SyntaxTree.IntegerValue).value;
  548. ELSE
  549. Error(x.position,"expression is not an integer constant");
  550. END;
  551. RETURN result;
  552. END CheckIntegerValue;
  553. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  554. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  555. BEGIN
  556. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  557. WHILE (this # NIL) & (this.identifier # id) DO
  558. this := this.nextModifier;
  559. END;
  560. IF this # NIL THEN
  561. IF this.expression = NIL THEN
  562. Error(this.position,"expected expression value");
  563. ELSIF CheckIntegerValue(this.expression,value) THEN
  564. END;
  565. RETURN TRUE
  566. ELSE RETURN FALSE
  567. END;
  568. END HasValue;
  569. CONST DefaultDataMemorySize=512;
  570. BEGIN
  571. IF x.externalName # NIL THEN RETURN END;
  572. (*
  573. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  574. *)
  575. (* code section for this procedure *)
  576. scope := x.procedureScope;
  577. prevScope := currentScope;
  578. currentScope := scope;
  579. procedureType := x.type(SyntaxTree.ProcedureType);
  580. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  581. implementationVisitor.temporaries.Init;
  582. implementationVisitor.usedRegisters := NIL;
  583. implementationVisitor.registerUsageCount.Init;
  584. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  585. IF (scope.body # NIL) & (x.isInline) THEN
  586. inline := TRUE;
  587. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  588. ir.SetExported(IsExported(x));
  589. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  590. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  591. IF backend.cellsAreObjects THEN
  592. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  593. ir.SetExported(IsExported(x));
  594. ELSE
  595. RETURN; (* cellnet cannot be compiled for final static hardware *)
  596. END;
  597. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  598. inline := FALSE;
  599. AddBodyCallStub(x);
  600. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  601. ir.SetExported(IsExported(x));
  602. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  603. inline := FALSE;
  604. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  605. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := DefaultDataMemorySize END;
  606. AddBodyCallStub(x);
  607. AddStackAllocation(x,stackSize);
  608. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  609. ir.SetExported(IsExported(x));
  610. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  611. inline := FALSE;
  612. Parameters(procedureType.firstParameter);
  613. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  614. ir.SetExported(IsExported(x));
  615. ELSE
  616. inline := FALSE;
  617. IF x.isEntry OR x.isExit THEN
  618. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,x,dump);
  619. ir.SetExported(TRUE);
  620. IF x.isEntry THEN ir.SetPriority(EntryPriority) ELSE ir.SetPriority(ExitPriority) END;
  621. ELSE
  622. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  623. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  624. END;
  625. END;
  626. cc := procedureType.callingConvention;
  627. IF scope.body # NIL THEN
  628. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  629. registerNumber := 0;
  630. IF ~inline THEN
  631. IF scope.lastVariable = NIL THEN
  632. stackSize := 0
  633. ELSE
  634. stackSize := scope.lastVariable.offsetInBits;
  635. IF stackSize <0 THEN stackSize := -stackSize END;
  636. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  637. END;
  638. (*
  639. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  640. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  641. *)
  642. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  643. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  644. END;
  645. pc := ir.pc-1;
  646. (*
  647. ir.Emit(Nop(position)); (* placeholder for fill *)
  648. *)
  649. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  650. formalParameter := procedureType.lastParameter;
  651. WHILE (formalParameter # NIL) & (registerNumber < system.registerParameters) DO
  652. IF ~PassInRegister(formalParameter) THEN
  653. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  654. ELSE
  655. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(registerNumber));
  656. type := GetType(system, formalParameter.type);
  657. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  658. IntermediateCode.InitMemory(dest,GetType(system,formalParameter.type),implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  659. ir.Emit(Mov(-1,dest, src));
  660. implementationVisitor.ReleaseIntermediateOperand(src);
  661. INC(registerNumber);
  662. formalParameter := formalParameter.prevParameter;
  663. END;
  664. END;
  665. END;
  666. ir.EnterValidPAF;
  667. END;
  668. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  669. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  670. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  671. IF scope.lastVariable # NIL THEN
  672. stackSize := scope.lastVariable.offsetInBits;
  673. IF stackSize <0 THEN stackSize := -stackSize END;
  674. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  675. END;
  676. END;
  677. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  678. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  679. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  680. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  681. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  682. ir.EmitAt(pc,Push(size));
  683. implementationVisitor.StaticCallOperand(result,procedure);
  684. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  685. END;
  686. *)
  687. END;
  688. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  689. IF stackSize > 0 THEN
  690. IF (stackSize MOD system.addressSize = 0) THEN
  691. null := IntermediateCode.Immediate(addressType,0);
  692. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  693. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  694. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  695. ELSE
  696. null := IntermediateCode.Immediate(int8,0);
  697. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  698. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  699. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  700. END;
  701. (*! should potentially be called by backend -- enter might initialize
  702. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  703. *)
  704. END;
  705. ir.ExitValidPAF;
  706. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  707. finalizer := FALSE;
  708. IF backend.cooperative & x.isFinalizer THEN
  709. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  710. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  711. GetRecordTypeName(recordType,name);
  712. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  713. END;
  714. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  715. IF backend.cooperative THEN
  716. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  717. IF implementationVisitor.profile & ~isModuleBody THEN
  718. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  719. END;
  720. END;
  721. implementationVisitor.EmitLeave(ir, x.position,cc);
  722. IF finalizer THEN
  723. IF backend.hasLinkRegister THEN
  724. ir.Emit(Pop(-1, implementationVisitor.lr));
  725. END;
  726. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  727. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  728. ir.Emit(Br(x.position,dest));
  729. ELSE
  730. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  731. END;
  732. ELSE
  733. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  734. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  735. END;
  736. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  737. IF backend.cooperative THEN
  738. IF HasPointers (scope) THEN
  739. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  740. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  741. ir.Emit(Result(x.position, res));
  742. ir.Emit(Push(x.position, res));
  743. implementationVisitor.ResetVariables(scope);
  744. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  745. ir.Emit(Pop(x.position, res));
  746. ir.Emit(Return(x.position, res));
  747. ELSE
  748. implementationVisitor.ResetVariables(scope);
  749. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  750. END;
  751. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  752. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  753. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  754. ir.Emit(Result(x.position, res));
  755. ir.Emit(Push(x.position, res));
  756. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  757. ir.Emit(Pop(x.position, res));
  758. ir.Emit(Return(x.position, res));
  759. ELSE
  760. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  761. END;
  762. END;
  763. implementationVisitor.EmitLeave(ir,x.position,cc);
  764. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  765. ELSE
  766. ir.Emit(Nop(x.position));
  767. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  768. implementationVisitor.EmitLeave(ir,x.position,cc);
  769. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  770. END;
  771. END;
  772. END
  773. END;
  774. ELSE (* force body for procedures *)
  775. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  776. ir.EnterValidPAF;
  777. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  778. IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;
  779. ir.ExitValidPAF;
  780. implementationVisitor.EmitLeave(ir,x.position,cc);
  781. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  782. END;
  783. Scope(scope);
  784. Signature;
  785. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  786. currentScope := prevScope;
  787. END Procedure;
  788. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  789. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  790. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  791. BEGIN
  792. ASSERT (bodyProcedure # NIL);
  793. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  794. procedure := SyntaxTree.NewProcedure(-1,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  795. procedure.SetScope(bodyProcedure.scope);
  796. procedure.SetType(SyntaxTree.NewProcedureType(-1,bodyProcedure.scope));
  797. procedure.SetAccess(SyntaxTree.Hidden);
  798. Global.GetSymbolSegmentedName (procedure,name);
  799. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  800. ir.SetExported(TRUE);
  801. ir.SetPriority(InitPriority);
  802. Global.GetSymbolSegmentedName (bodyProcedure,name);
  803. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  804. implementationVisitor.currentScope := module.module.moduleScope;
  805. implementationVisitor.section := ir;
  806. implementationVisitor.PushSelfPointer();
  807. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  808. ELSIF backend.preregisterStatic THEN
  809. implementationVisitor.currentScope := module.module.moduleScope;
  810. implementationVisitor.section := ir;
  811. implementationVisitor.PushSelfPointer();
  812. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  813. ELSE
  814. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  815. ir.Emit(Call(bodyProcedure.position,op, 0));
  816. END;
  817. END AddBodyCallStub;
  818. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  819. VAR name: Basic.SegmentedName;
  820. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  821. BEGIN
  822. Global.GetSymbolSegmentedName (symbol,name);
  823. Basic.RemoveSuffix(name);
  824. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  825. ir := implementationVisitor.NewSection(module.allSections,Sections.InitCodeSection,name,NIL,dump);
  826. ir.SetExported(TRUE);
  827. ir.SetPriority(FirstPriority);
  828. IntermediateCode.InitImmediate(op,addressType,initStack);
  829. ir.Emit(Mov(-1,implementationVisitor.sp,op));
  830. END AddStackAllocation;
  831. (** entry function to visit a complete module *)
  832. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  833. VAR
  834. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  835. hasDynamicOperatorDeclarations: BOOLEAN;
  836. operator: SyntaxTree.Operator;
  837. import: SyntaxTree.Import;
  838. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  839. BEGIN
  840. type := type.resolved;
  841. IF type IS SyntaxTree.RecordType THEN
  842. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  843. ELSIF (type IS SyntaxTree.ArrayType) THEN
  844. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  845. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  846. END;
  847. ELSIF type IS SyntaxTree.MathArrayType THEN
  848. WITH type: SyntaxTree.MathArrayType DO
  849. IF type.form = SyntaxTree.Open THEN
  850. RETURN TRUE
  851. ELSIF type.form = SyntaxTree.Static THEN
  852. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  853. END;
  854. END;
  855. END;
  856. RETURN FALSE
  857. END TypeNeedsInitialization;
  858. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  859. VAR variable: SyntaxTree.Variable;
  860. BEGIN
  861. variable := scope.firstVariable;
  862. WHILE variable # NIL DO
  863. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  864. IF variable.initializer # NIL THEN RETURN TRUE END;
  865. variable := variable.nextVariable;
  866. END;
  867. RETURN FALSE
  868. END ScopeNeedsInitialization;
  869. BEGIN
  870. ASSERT(x # NIL); ASSERT(module # NIL);
  871. SELF.module := module;
  872. (* add import names to the generated Sections.Module *)
  873. import := x.moduleScope.firstImport;
  874. WHILE import # NIL DO
  875. import.module.GetName(idstr);
  876. module.imports.AddName(idstr);
  877. import := import.nextImport
  878. END;
  879. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  880. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  881. moduleSelf := SyntaxTree.NewVariable(0,SyntaxTree.NewIdentifier("@moduleSelf"));
  882. moduleSelf.SetType(system.anyType);
  883. moduleSelf.SetScope(x.moduleScope);
  884. moduleSelf.SetUntraced(TRUE);
  885. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  886. ir.SetExported(TRUE);
  887. IntermediateCode.InitImmediate(op,addressType,0);
  888. ir.Emit(Data(-1,op));
  889. END;
  890. implementationVisitor.module := module;
  891. implementationVisitor.moduleScope := x.moduleScope;
  892. implementationVisitor.moduleSelf := moduleSelf;
  893. implementationVisitor.canBeLoaded := TRUE;
  894. meta.SetModule(module);
  895. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  896. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  897. END;
  898. IF backend.profile THEN
  899. EnsureBodyProcedure(x.moduleScope);
  900. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  901. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  902. implementationVisitor.profileId.Emit(Reserve(-1,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  903. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  904. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  905. implementationVisitor.EmitEnter(implementationVisitor.profileInit,-1,NIL,0,0,0);
  906. Global.GetModuleName(module.module,idstr);
  907. implementationVisitor.ProfilerAddModule(idstr);
  908. implementationVisitor.numberProcedures := 0;
  909. END;
  910. implementationVisitor.profile := backend.profile;
  911. (* check if there is at least one dynamic operator locally defined *)
  912. hasDynamicOperatorDeclarations := FALSE;
  913. operator := x.moduleScope.firstOperator;
  914. WHILE operator # NIL DO
  915. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  916. operator := operator.nextOperator
  917. END;
  918. (* add operator initialization code section *)
  919. IF hasDynamicOperatorDeclarations THEN
  920. EnsureBodyProcedure(x.moduleScope);
  921. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  922. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  923. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,-1,NIL,0,0,0);
  924. END;
  925. Scope(x.moduleScope);
  926. IF hasDynamicOperatorDeclarations THEN
  927. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,-1,0);
  928. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(-1,0,0));
  929. END;
  930. IF backend.profile THEN
  931. implementationVisitor.ProfilerPatchInit;
  932. END;
  933. END Module;
  934. END DeclarationVisitor;
  935. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  936. RegisterUsageCount*=OBJECT
  937. VAR used: UsedArray; count: LONGINT;
  938. PROCEDURE &Init;
  939. VAR i: LONGINT;
  940. BEGIN
  941. count := 0;
  942. IF used = NIL THEN NEW(used,64); END;
  943. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  944. END Init;
  945. PROCEDURE Grow;
  946. VAR new: UsedArray; size,i: LONGINT;
  947. BEGIN
  948. size := LEN(used)*2;
  949. NEW(new,size);
  950. FOR i := 0 TO LEN(used)-1 DO
  951. new[i].count := used[i].count;
  952. new[i].type := used[i].type;
  953. new[i].map := used[i].map
  954. END;
  955. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  956. used := new
  957. END Grow;
  958. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  959. BEGIN
  960. INC(count);
  961. IF count = LEN(used) THEN Grow END;
  962. used[count].type := type;
  963. used[count].class := class;
  964. used[count].map := count;
  965. RETURN count;
  966. END Next;
  967. PROCEDURE IncUse(register: LONGINT);
  968. BEGIN
  969. INC(used[register].count);
  970. (*
  971. IF (register = 1) & (count > 30) THEN
  972. D.TraceBack;
  973. END;
  974. *)
  975. END IncUse;
  976. PROCEDURE DecUse(register: LONGINT);
  977. BEGIN
  978. DEC(used[register].count);
  979. END DecUse;
  980. PROCEDURE Map(register: LONGINT): LONGINT;
  981. VAR map : LONGINT;
  982. BEGIN
  983. IF register > 0 THEN
  984. map := used[register].map;
  985. WHILE register # map DO register := map; map := used[register].map END;
  986. END;
  987. RETURN register
  988. END Map;
  989. PROCEDURE Use(register: LONGINT): LONGINT;
  990. BEGIN
  991. IF register< LEN(used) THEN
  992. RETURN used[register].count
  993. ELSE
  994. RETURN 0
  995. END
  996. END Use;
  997. END RegisterUsageCount;
  998. RegisterEntry = POINTER TO RECORD
  999. prev,next: RegisterEntry;
  1000. register: LONGINT;
  1001. registerClass: IntermediateCode.RegisterClass;
  1002. type: IntermediateCode.Type;
  1003. END;
  1004. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1005. Variables = OBJECT (Basic.List)
  1006. VAR
  1007. inUse: VariableUse;
  1008. registerIndex: LONGINT;
  1009. PROCEDURE & Init;
  1010. VAR i: LONGINT;
  1011. BEGIN
  1012. InitList(16);
  1013. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1014. registerIndex := 1024;
  1015. END Init;
  1016. PROCEDURE GetUsage(VAR use: VariableUse);
  1017. BEGIN
  1018. use := inUse;
  1019. END GetUsage;
  1020. PROCEDURE SetUsage(CONST use: VariableUse);
  1021. BEGIN
  1022. inUse := use;
  1023. END SetUsage;
  1024. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1025. VAR any: ANY;
  1026. BEGIN
  1027. any := Get(i);;
  1028. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1029. END GetVariable;
  1030. PROCEDURE Occupy(pos: LONGINT);
  1031. BEGIN
  1032. INCL(inUse[pos DIV 32], pos MOD 32);
  1033. END Occupy;
  1034. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1035. BEGIN
  1036. Occupy(Length());
  1037. Add(v);
  1038. END AddVariable;
  1039. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; VAR pos: LONGINT): SyntaxTree.Variable;
  1040. VAR var : SyntaxTree.Variable;
  1041. BEGIN
  1042. FOR pos := 0 TO Length()-1 DO
  1043. IF ~((pos MOD 32) IN inUse[pos DIV 32]) THEN
  1044. var := GetVariable(pos);
  1045. IF type.SameType(var.type) THEN
  1046. Occupy(pos); RETURN var
  1047. END;
  1048. END;
  1049. END;
  1050. pos := Length();
  1051. RETURN NIL
  1052. END GetFreeVariable;
  1053. END Variables;
  1054. SymbolMap = POINTER TO RECORD this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap; END;
  1055. SymbolMapper = OBJECT
  1056. VAR
  1057. first: SymbolMap;
  1058. PROCEDURE & Init;
  1059. BEGIN
  1060. first := NIL;
  1061. END Init;
  1062. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression);
  1063. VAR new: SymbolMap;
  1064. BEGIN
  1065. NEW(new); new.this := this; new.to := to; new.tag := tag;
  1066. new.next := first; first := new;
  1067. END Add;
  1068. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1069. VAR s: SymbolMap;
  1070. BEGIN
  1071. s := first;
  1072. WHILE (s # NIL) & (s.this # this) DO
  1073. s := s.next
  1074. END;
  1075. RETURN s
  1076. END Get;
  1077. END SymbolMapper;
  1078. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1079. VAR
  1080. system: Global.System;
  1081. section: IntermediateCode.Section;
  1082. module: Sections.Module;
  1083. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1084. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1085. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1086. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1087. checker: SemanticChecker.Checker;
  1088. backend: IntermediateBackend;
  1089. meta: MetaDataGenerator;
  1090. position: LONGINT;
  1091. moduleSelf: SyntaxTree.Variable;
  1092. (* variables for hand over of variables / temporary state *)
  1093. currentScope: SyntaxTree.Scope;
  1094. constantDeclaration : SyntaxTree.Symbol;
  1095. result: Operand; (* result of the most recent expression / statement *)
  1096. destination: IntermediateCode.Operand;
  1097. arrayDestinationTag: IntermediateCode.Operand;
  1098. arrayDestinationDimension:LONGINT;
  1099. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1100. conditional: BOOLEAN;
  1101. trueLabel, falseLabel, exitLabel: Label;
  1102. locked: BOOLEAN;
  1103. (*
  1104. usedRegisters: Registers;
  1105. *)
  1106. registerUsageCount: RegisterUsageCount;
  1107. usedRegisters: RegisterEntry;
  1108. (* useful operands and types *)
  1109. nil,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1110. bool,addressType,setType, sizeType, byteType: IntermediateCode.Type;
  1111. commentPrintout: Printout.Printer;
  1112. dump: Streams.Writer;
  1113. tagsAvailable : BOOLEAN;
  1114. supportedInstruction: SupportedInstructionProcedure;
  1115. supportedImmediate: SupportedImmediateProcedure;
  1116. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1117. emitLabels: BOOLEAN;
  1118. runtimeModuleName : SyntaxTree.IdentifierString;
  1119. newObjectFile: BOOLEAN;
  1120. indexCounter: LONGINT;
  1121. profile: BOOLEAN;
  1122. profileId, profileInit: IntermediateCode.Section;
  1123. profileInitPatchPosition: LONGINT;
  1124. numberProcedures: LONGINT;
  1125. procedureResultDesignator : SyntaxTree.Designator;
  1126. operatorInitializationCodeSection: IntermediateCode.Section;
  1127. fingerPrinter: FingerPrinter.FingerPrinter;
  1128. temporaries: Variables;
  1129. canBeLoaded : BOOLEAN;
  1130. currentIsInline: BOOLEAN;
  1131. currentMapper: SymbolMapper;
  1132. currentInlineExit: Label;
  1133. moduleBodySection: IntermediateCode.Section;
  1134. NeedDescriptor : BOOLEAN;
  1135. cooperativeSwitches: BOOLEAN;
  1136. lastSwitchPC: LONGINT;
  1137. isUnchecked: BOOLEAN;
  1138. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1139. newObjectFile: BOOLEAN);
  1140. BEGIN
  1141. SELF.system := system;
  1142. SELF.runtimeModuleName := runtime;
  1143. currentScope := NIL;
  1144. hiddenPointerType := NIL;
  1145. delegatePointerType := NIL;
  1146. awaitProcCounter := 0;
  1147. labelId := 0; constId := 0; labelId := 0;
  1148. SELF.checker := checker;
  1149. SELF.backend := backend;
  1150. position := Diagnostics.Invalid;
  1151. conditional := FALSE;
  1152. locked := FALSE;
  1153. InitOperand(result,ModeUndefined);
  1154. addressType := IntermediateCode.GetType(system,system.addressType);
  1155. setType := IntermediateCode.GetType(system,system.setType);
  1156. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1157. byteType := IntermediateCode.GetType(system, system.byteType);
  1158. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1159. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1160. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1161. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1162. nil := IntermediateCode.Immediate(addressType,0);
  1163. IntermediateCode.InitOperand(destination);
  1164. tagsAvailable := TRUE;
  1165. supportedInstruction := supportedInstructionProcedure;
  1166. supportedImmediate := supportedImmediateProcedure;
  1167. inData := FALSE;
  1168. SELF.emitLabels := emitLabels;
  1169. IntermediateCode.InitOperand(arrayDestinationTag);
  1170. bool := IntermediateCode.GetType(system,system.booleanType);
  1171. IntermediateCode.InitImmediate(false,bool,0);
  1172. IntermediateCode.InitImmediate(true,bool,1);
  1173. SELF.newObjectFile := newObjectFile;
  1174. indexCounter := 0;
  1175. NEW(registerUsageCount);
  1176. usedRegisters := NIL;
  1177. procedureResultDesignator := NIL;
  1178. NEW(fingerPrinter, system);
  1179. NEW(temporaries);
  1180. currentIsInline := FALSE;
  1181. NeedDescriptor := FALSE;
  1182. isUnchecked := backend.noRuntimeChecks;
  1183. END Init;
  1184. TYPE Context = RECORD
  1185. section: IntermediateCode.Section;
  1186. registerUsageCount: RegisterUsageCount;
  1187. usedRegisters: RegisterEntry;
  1188. END;
  1189. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1190. VAR context: Context;
  1191. BEGIN
  1192. context.section := section;
  1193. context.registerUsageCount := registerUsageCount;
  1194. context.usedRegisters := usedRegisters;
  1195. section := new;
  1196. NEW(registerUsageCount);
  1197. usedRegisters := NIL;
  1198. RETURN context;
  1199. END SwitchContext;
  1200. PROCEDURE ReturnToContext(context: Context);
  1201. BEGIN
  1202. section := context.section;
  1203. registerUsageCount := context.registerUsageCount;
  1204. usedRegisters := context.usedRegisters;
  1205. END ReturnToContext;
  1206. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1207. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1208. BEGIN
  1209. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1210. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1211. END;
  1212. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1213. section.SetExported(IsExported(syntaxTreeSymbol));
  1214. RETURN section
  1215. END NewSection;
  1216. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1217. VAR new: LONGINT;
  1218. BEGIN
  1219. new := registerUsageCount.Next(type,class);
  1220. UseRegister(new);
  1221. RETURN new
  1222. END AcquireRegister;
  1223. (** get the name for the code section that represens a certain symbol
  1224. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1225. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1226. VAR
  1227. operatorFingerPrint: SyntaxTree.FingerPrint;
  1228. operatorFingerPrintString,string: ARRAY 32 OF CHAR;
  1229. BEGIN
  1230. Global.GetSymbolSegmentedName(symbol, name);
  1231. (* if the symbol is an operator, then append the fingerprint to the name *)
  1232. IF symbol IS SyntaxTree.Operator THEN
  1233. operatorFingerPrint := fingerPrinter.SymbolFP(symbol);
  1234. string := "[";
  1235. Strings.IntToHexStr(operatorFingerPrint.shallow, 8, operatorFingerPrintString);
  1236. Strings.Append(string, operatorFingerPrintString);
  1237. Strings.Append(string, "]");
  1238. Basic.AppendToSegmentedName(name,string);
  1239. END
  1240. END GetCodeSectionNameForSymbol;
  1241. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1242. BEGIN
  1243. IF dump # NIL THEN
  1244. dump.String("enter "); dump.String(s); dump.Ln;
  1245. END;
  1246. END TraceEnter;
  1247. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1248. BEGIN
  1249. IF dump # NIL THEN
  1250. dump.String("exit "); dump.String(s); dump.Ln;
  1251. END;
  1252. END TraceExit;
  1253. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1254. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1255. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1256. VAR i: LONGINT;
  1257. BEGIN
  1258. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1259. IF op.rule # NIL THEN
  1260. FOR i := 0 TO LEN(op.rule)-1 DO
  1261. CheckRegister(op.rule[i])
  1262. END;
  1263. END;
  1264. END CheckRegister;
  1265. BEGIN
  1266. CheckRegister(instruction.op1);
  1267. CheckRegister(instruction.op2);
  1268. CheckRegister(instruction.op3);
  1269. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1270. ELSE section.Emit(instruction);
  1271. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1272. END;
  1273. END Emit;
  1274. PROCEDURE EmitTrap (position, trapNo: LONGINT);
  1275. BEGIN
  1276. IF backend.cooperative THEN
  1277. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1278. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1279. ELSE
  1280. Emit(Trap(position,trapNo));
  1281. END;
  1282. END EmitTrap;
  1283. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: LONGINT; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1284. VAR name: Basic.SegmentedName;
  1285. VAR op1, op2, reg: IntermediateCode.Operand;
  1286. VAR call, nocall: Label;
  1287. VAR parametersSize: LONGINT;
  1288. VAR prevSection: IntermediateCode.Section;
  1289. VAR prevDump: Streams.Writer;
  1290. VAR body: SyntaxTree.Body;
  1291. BEGIN
  1292. ASSERT((procedure = NIL) OR ~procedure.type(SyntaxTree.ProcedureType).noPAF);
  1293. prevSection := SELF.section;
  1294. SELF.section := section;
  1295. prevDump := dump;
  1296. dump := section.comments;
  1297. IF backend.hasLinkRegister THEN
  1298. Emit(Push(-1, lr));
  1299. END;
  1300. Emit(Push(-1,fp));
  1301. IF backend.cooperative & (callconv = SyntaxTree.OberonCallingConvention) THEN
  1302. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1303. GetCodeSectionNameForSymbol(procedure, name);
  1304. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  1305. ELSE
  1306. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1307. END;
  1308. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1309. Emit(Push(-1,op1));
  1310. Emit(Mov(-1,fp, sp));
  1311. body := procedure.procedureScope.body;
  1312. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1313. NEW(call, section);
  1314. NEW(nocall, section);
  1315. reg := NewRegisterOperand(addressType);
  1316. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1317. Emit(Sub(-1,reg, sp, op1));
  1318. BrltL(call, sp, reg);
  1319. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1320. BrgeL(nocall, sp, op2);
  1321. call.Resolve(section.pc);
  1322. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1323. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1324. Emit(Push(-1, op2));
  1325. Emit(Push(-1, reg));
  1326. ReleaseIntermediateOperand(reg);
  1327. CallThis(position, "Activities","ExpandStack",2);
  1328. Emit(Result(-1, sp));
  1329. nocall.Resolve(section.pc);
  1330. END;
  1331. ELSE
  1332. Emit(Mov(-1, fp, sp));
  1333. END;
  1334. Emit(Enter(-1, callconv, varSize));
  1335. SELF.section := prevSection;
  1336. dump := prevDump;
  1337. END EmitEnter;
  1338. PROCEDURE Enter(position: LONGINT; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1339. VAR op1,op2: IntermediateCode.Operand;
  1340. VAR instruction: IntermediateCode.Instruction;
  1341. BEGIN
  1342. IntermediateCode.InitNumber(op1,callconv);
  1343. IntermediateCode.InitNumber(op2,varSize);
  1344. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1345. RETURN instruction
  1346. END Enter;
  1347. PROCEDURE Leave(position: LONGINT; callconv: LONGINT): IntermediateCode.Instruction;
  1348. VAR op1: IntermediateCode.Operand;
  1349. VAR instruction: IntermediateCode.Instruction;
  1350. BEGIN
  1351. IntermediateCode.InitNumber(op1,callconv);
  1352. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1353. RETURN instruction
  1354. END Leave;
  1355. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: LONGINT; callconv: LONGINT);
  1356. VAR prevSection: IntermediateCode.Section;
  1357. VAR op2: IntermediateCode.Operand;
  1358. BEGIN
  1359. prevSection := SELF.section;
  1360. SELF.section := section;
  1361. Emit(Leave(position, callconv));
  1362. IF backend.cooperative THEN
  1363. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1364. Emit(Add(position, sp, fp, op2));
  1365. ELSE
  1366. Emit(Mov(position, sp, fp));
  1367. END;
  1368. Emit(Pop(position, fp));
  1369. SELF.section := prevSection;
  1370. END EmitLeave;
  1371. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1372. VAR m: SymbolMap;
  1373. BEGIN
  1374. position := x.position;
  1375. IF currentIsInline THEN
  1376. m := currentMapper.Get(x);
  1377. IF m # NIL THEN
  1378. (*
  1379. Printout.Info("mapping from", x);
  1380. Printout.Info("mapping to ", m.to);
  1381. *)
  1382. m.to.Accept(SELF);
  1383. op := result;
  1384. IF m.tag # NIL THEN
  1385. ReleaseIntermediateOperand(result.tag);
  1386. m.tag.Accept(SELF);
  1387. op.tag := result.op;
  1388. ReleaseIntermediateOperand(result.tag);
  1389. END;
  1390. RETURN
  1391. END;
  1392. END;
  1393. x.Accept(SELF);
  1394. op := result;
  1395. END Symbol;
  1396. PROCEDURE Expression(x: SyntaxTree.Expression);
  1397. BEGIN
  1398. position := x.position;
  1399. constantDeclaration := NIL;
  1400. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1401. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1402. END;
  1403. IF x.resolved # NIL THEN
  1404. x.resolved.Accept(SELF)
  1405. ELSE
  1406. x.Accept(SELF)
  1407. END;
  1408. (* check this, was commented out in ActiveCells3 *)
  1409. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1410. Error(x.position, "unsupported modifier");
  1411. END;
  1412. END Expression;
  1413. (*
  1414. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1415. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1416. BEGIN
  1417. temporaries.GetUsage(current);
  1418. FOR i := 0 TO LEN(current)-1 DO
  1419. set := current[i] - previous[i];
  1420. IF set # {} THEN
  1421. FOR j := 0 TO MAX(SET)-1 DO
  1422. IF j IN set THEN
  1423. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1424. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1425. Symbol(variable, op);
  1426. MakeMemory(tmp,op.op,addressType,0);
  1427. ReleaseOperand(op);
  1428. Emit(Mov(position,tmp, nil ) );
  1429. ReleaseIntermediateOperand(tmp);
  1430. END;
  1431. END;
  1432. END;
  1433. END;
  1434. END;
  1435. END ResetUsedTemporaries;
  1436. *)
  1437. PROCEDURE Statement(x: SyntaxTree.Statement);
  1438. VAR use: VariableUse;
  1439. BEGIN
  1440. temporaries.GetUsage(use);
  1441. position := x.position;
  1442. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1443. IF commentPrintout # NIL THEN
  1444. commentPrintout.Statement(x);
  1445. dump.Ln;
  1446. (*dump.Update;*)
  1447. END;
  1448. x.Accept(SELF);
  1449. (*
  1450. CheckRegistersFree();
  1451. *)
  1452. (*ResetUsedTemporaries(use);*)
  1453. temporaries.SetUsage(use);
  1454. END Statement;
  1455. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1456. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1457. *)
  1458. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1459. BEGIN
  1460. IF op.mode = IntermediateCode.ModeMemory THEN
  1461. ReuseCopy(res,op);
  1462. ELSE
  1463. res := op;
  1464. UseIntermediateOperand(res);
  1465. END;
  1466. IntermediateCode.AddOffset(res,offset);
  1467. IntermediateCode.MakeMemory(res,type);
  1468. END MakeMemory;
  1469. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1470. VAR mem: IntermediateCode.Operand;
  1471. BEGIN
  1472. MakeMemory(mem,res,type,offset);
  1473. ReleaseIntermediateOperand(res);
  1474. res := mem;
  1475. END ToMemory;
  1476. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1477. VAR mem: IntermediateCode.Operand;
  1478. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1479. componentType: SyntaxTree.Type;
  1480. BEGIN
  1481. type := type.resolved;
  1482. IF operand.mode = ModeReference THEN
  1483. IF type IS SyntaxTree.RangeType THEN
  1484. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.longintType), 0);
  1485. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1486. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1487. ReleaseOperand(operand);
  1488. operand.op := firstOp;
  1489. operand.tag := lastOp;
  1490. operand.extra := stepOp;
  1491. ELSIF type IS SyntaxTree.ComplexType THEN
  1492. componentType := type(SyntaxTree.ComplexType).componentType;
  1493. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1494. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1495. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1496. ReleaseOperand(operand);
  1497. operand.op := firstOp;
  1498. operand.tag := lastOp
  1499. ELSE
  1500. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1501. ReleaseIntermediateOperand(operand.op);
  1502. operand.op := mem;
  1503. END;
  1504. operand.mode := ModeValue;
  1505. END;
  1506. ASSERT(operand.mode = ModeValue);
  1507. END LoadValue;
  1508. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1509. VAR prevConditional: BOOLEAN;
  1510. BEGIN
  1511. prevConditional := conditional;
  1512. conditional := FALSE;
  1513. InitOperand(result, ModeUndefined);
  1514. Expression(x);
  1515. op := result;
  1516. LoadValue(op,x.type.resolved);
  1517. conditional := prevConditional;
  1518. END Evaluate;
  1519. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1520. VAR prevConditional: BOOLEAN;
  1521. BEGIN
  1522. prevConditional := conditional;
  1523. conditional := FALSE;
  1524. InitOperand(result,ModeUndefined);
  1525. Expression(x);
  1526. op := result;
  1527. (*
  1528. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1529. *)
  1530. conditional := prevConditional;
  1531. END Designate;
  1532. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1533. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1534. BEGIN
  1535. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1536. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1537. conditional := TRUE;
  1538. trueLabel := trueL; falseLabel := falseL;
  1539. Expression(x);
  1540. trueL := trueLabel; falseL := falseLabel;
  1541. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1542. END Condition;
  1543. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1544. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1545. BEGIN
  1546. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1547. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1548. RETURN op
  1549. END NewRegisterOperand;
  1550. PROCEDURE UnuseRegister(register: LONGINT);
  1551. BEGIN
  1552. IF (register > 0) THEN
  1553. register := registerUsageCount.Map(register);
  1554. registerUsageCount.DecUse(register);
  1555. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1556. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1557. END;
  1558. IF registerUsageCount.Use(register)=0 THEN
  1559. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1560. Warning(position, "register cannot be removed");
  1561. END;
  1562. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1563. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1564. END;
  1565. ELSIF registerUsageCount.Use(register)<0 THEN
  1566. Warning(position, "register removed too often");
  1567. IF dump # NIL THEN
  1568. dump.String("register removed too often"); dump.Ln; dump.Update;
  1569. END;
  1570. D.TraceBack;
  1571. END;
  1572. END;
  1573. END UnuseRegister;
  1574. PROCEDURE UseRegister(register: LONGINT);
  1575. BEGIN
  1576. IF (register > 0) THEN
  1577. register := registerUsageCount.Map(register);
  1578. registerUsageCount.IncUse(register);
  1579. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1580. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1581. END;
  1582. IF registerUsageCount.Use(register)=1 THEN
  1583. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1584. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1585. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1586. END;
  1587. END;
  1588. END;
  1589. END UseRegister;
  1590. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1591. BEGIN
  1592. UnuseRegister(op.register)
  1593. END ReleaseIntermediateOperand;
  1594. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1595. BEGIN
  1596. UseRegister(op.register)
  1597. END UseIntermediateOperand;
  1598. PROCEDURE ReleaseOperand(CONST op: Operand);
  1599. BEGIN
  1600. UnuseRegister(op.op.register);
  1601. UnuseRegister(op.tag.register);
  1602. UnuseRegister(op.extra.register);
  1603. END ReleaseOperand;
  1604. (* save registers marked in array "markedRegisters" to the stack
  1605. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1606. *)
  1607. PROCEDURE SaveRegisters();
  1608. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1609. BEGIN
  1610. entry := usedRegisters;
  1611. WHILE entry # NIL DO
  1612. type := registerUsageCount.used[entry.register].type;
  1613. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1614. Emit(Push(position,op));
  1615. entry := entry.next;
  1616. END;
  1617. END SaveRegisters;
  1618. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1619. BEGIN
  1620. saved := usedRegisters;
  1621. usedRegisters := NIL;
  1622. END ReleaseUsedRegisters;
  1623. (** remove parameter registers from used queue *)
  1624. PROCEDURE ReleaseParameterRegisters;
  1625. VAR entry,prev,next: RegisterEntry;
  1626. BEGIN
  1627. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1628. WHILE entry # NIL DO
  1629. next := entry.next;
  1630. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1631. registerUsageCount.DecUse(entry.register);
  1632. ASSERT(registerUsageCount.Use(entry.register)=0);
  1633. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1634. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1635. END;
  1636. ELSIF prev = NIL THEN
  1637. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1638. ELSE
  1639. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1640. END;
  1641. entry := next;
  1642. END;
  1643. END ReleaseParameterRegisters;
  1644. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1645. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1646. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1647. BEGIN
  1648. entry := saved;
  1649. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1650. entry := prev;
  1651. WHILE entry # NIL DO
  1652. prev := entry.prev;
  1653. type := entry.type;
  1654. class := entry.registerClass;
  1655. IntermediateCode.InitRegister(op,type,class,entry.register);
  1656. (*
  1657. new := registerUsageCount.Next(type,class);
  1658. registerUsageCount.Remap(entry.register,new);
  1659. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1660. dump.String("remap register "); dump.Int(entry.register,1);
  1661. dump.String("to "); dump.Int(new,1);
  1662. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1663. END;
  1664. entry.register := new;
  1665. *)
  1666. Emit(Pop(position,op));
  1667. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1668. entry := prev;
  1669. END;
  1670. (*
  1671. usedRegisters := saved;
  1672. *)
  1673. END RestoreRegisters;
  1674. PROCEDURE CheckRegistersFree;
  1675. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1676. BEGIN
  1677. IF usedRegisters # NIL THEN
  1678. r := usedRegisters;
  1679. WHILE r # NIL DO
  1680. warning := "register ";
  1681. Strings.AppendInt(warning, r.register);
  1682. Strings.Append(warning, " not released.");
  1683. Warning(position,warning);
  1684. r := r .next;
  1685. END;
  1686. END;
  1687. FOR i := 0 TO registerUsageCount.count-1 DO
  1688. IF registerUsageCount.used[i].count < 0 THEN
  1689. warning := "register ";
  1690. Strings.AppendInt(warning, i);
  1691. Strings.Append(warning, " unused too often.");
  1692. Warning(position,warning);
  1693. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1694. warning := "register ";
  1695. Strings.AppendInt(warning, i);
  1696. Strings.Append(warning, " not unused often enough.");
  1697. Warning(position,warning);
  1698. END;
  1699. END;
  1700. END CheckRegistersFree;
  1701. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1702. Otherwise allocate a new register.
  1703. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1704. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1705. BEGIN
  1706. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1707. UseIntermediateOperand(result);
  1708. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1709. UseIntermediateOperand(result);
  1710. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1711. END;
  1712. END Reuse2;
  1713. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1714. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1715. If not then allocate a new register.
  1716. Does NOT necessarily keep the content of src1 or src2 in result!
  1717. *)
  1718. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1719. BEGIN
  1720. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1721. UseIntermediateOperand(result);
  1722. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1723. UseIntermediateOperand(result);
  1724. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1725. result := alternative; alternative := emptyOperand;
  1726. UseIntermediateOperand(result);
  1727. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1728. END;
  1729. END Reuse2a;
  1730. (* like reuse2 but only one source *)
  1731. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1732. BEGIN
  1733. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1734. UseIntermediateOperand(result);
  1735. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1736. END;
  1737. END Reuse1;
  1738. (* like reuse2a but only one source *)
  1739. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1740. BEGIN
  1741. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1742. UseIntermediateOperand(result);
  1743. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1744. UseIntermediateOperand(result);
  1745. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1746. END;
  1747. END Reuse1a;
  1748. (* like reuse1 but guarantees that content of src1 is in result *)
  1749. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1750. BEGIN
  1751. IF ReusableRegister(src1) THEN
  1752. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1753. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1754. UseIntermediateOperand(result);
  1755. ELSE
  1756. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1757. Emit(Mov(position,result,src1));
  1758. END
  1759. END ReuseCopy;
  1760. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1761. BEGIN
  1762. IF ReusableRegister(src) THEN
  1763. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1764. ELSE
  1765. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1766. Emit(Mov(position,result,src));
  1767. ReleaseIntermediateOperand(src);
  1768. END
  1769. END TransferToRegister;
  1770. (** labels and branches **)
  1771. PROCEDURE NewLabel(): Label;
  1772. VAR label: Label;
  1773. BEGIN
  1774. NEW(label,section); RETURN label;
  1775. END NewLabel;
  1776. PROCEDURE SetLabel(label: Label);
  1777. BEGIN label.Resolve(section.pc);
  1778. END SetLabel;
  1779. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1780. BEGIN
  1781. ASSERT(label # NIL);
  1782. IF label.pc < 0 THEN (* label not yet set *)
  1783. label.AddFixup(section.pc);
  1784. END;
  1785. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1786. END LabelOperand;
  1787. PROCEDURE BrL(label: Label);
  1788. BEGIN
  1789. Emit(Br(position,LabelOperand(label)));
  1790. END BrL;
  1791. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1792. BEGIN
  1793. Emit(Brge(position,LabelOperand(label),left,right));
  1794. END BrgeL;
  1795. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1796. BEGIN
  1797. Emit(Brlt(position,LabelOperand(label),left,right));
  1798. END BrltL;
  1799. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1800. BEGIN
  1801. Emit(Breq(position,LabelOperand(label),left,right));
  1802. END BreqL;
  1803. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1804. BEGIN
  1805. Emit(Brne(position,LabelOperand(label),left,right));
  1806. END BrneL;
  1807. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1808. VAR new: IntermediateCode.Operand;
  1809. BEGIN
  1810. IF Trace THEN TraceEnter("Convert") END;
  1811. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1812. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1813. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1814. & (operand.offset = 0)
  1815. THEN
  1816. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1817. Emit(Conv(position,new,operand));
  1818. ELSE
  1819. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1820. Emit(Conv(position,new,operand));
  1821. ReleaseIntermediateOperand(operand);
  1822. END;
  1823. operand := new;
  1824. 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
  1825. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1826. ELSE
  1827. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1828. Emit(Conv(position,new,operand));
  1829. ReleaseIntermediateOperand(operand);
  1830. operand := new;
  1831. END;
  1832. IF Trace THEN TraceExit("Convert") END;
  1833. END Convert;
  1834. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1835. VAR exit: Label;
  1836. BEGIN
  1837. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1838. exit := NewLabel();
  1839. br(exit,left,right);
  1840. EmitTrap(position,trapNo);
  1841. SetLabel(exit);
  1842. END TrapC;
  1843. (** expressions *)
  1844. (** emit necessary runtime check for set elements **)
  1845. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1846. VAR max: IntermediateCode.Operand;
  1847. BEGIN
  1848. IF isUnchecked THEN RETURN END;
  1849. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1850. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1851. TrapC(BrgeL, max, o, SetElementTrap);
  1852. END;
  1853. END CheckSetElement;
  1854. (** the set that a range represents **)
  1855. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1856. VAR
  1857. operand: Operand;
  1858. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1859. BEGIN
  1860. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1861. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1862. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1863. one := IntermediateCode.Immediate(setType, 1);
  1864. Evaluate(x, operand);
  1865. Convert(operand.op, setType);
  1866. Convert(operand.tag, setType);
  1867. CheckSetElement(operand.op);
  1868. CheckSetElement(operand.tag);
  1869. (* create mask for lower bound
  1870. i.e. shift 11111111 to the left by the value of the lower bound
  1871. *)
  1872. Reuse1(temp, operand.op);
  1873. Emit(Shl(position,temp, allBits, operand.op));
  1874. ReleaseIntermediateOperand(operand.op);
  1875. operand.op := temp;
  1876. (* create mask for upper bound
  1877. i.e. shift 11111111 to the right by the difference between the
  1878. upper bound and the maximum number of set elements
  1879. *)
  1880. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1881. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1882. Reuse1(temp, operand.tag);
  1883. ELSE
  1884. Reuse1(temp, operand.tag);
  1885. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1886. Emit(Sub(position,temp, size, operand.tag));
  1887. END;
  1888. Emit(Shr(position,temp, allBits, operand.tag));
  1889. ReleaseIntermediateOperand(operand.tag);
  1890. operand.tag := temp;
  1891. Reuse2(resultingSet, operand.op, operand.tag);
  1892. (* intersect the two masks *)
  1893. Emit(And(position,resultingSet, operand.op, operand.tag));
  1894. ReleaseOperand(operand);
  1895. RETURN resultingSet
  1896. END SetFromRange;
  1897. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1898. VAR
  1899. res, operand: Operand;
  1900. temp, one, noBits, dest: IntermediateCode.Operand;
  1901. expression: SyntaxTree.Expression;
  1902. i: LONGINT;
  1903. BEGIN
  1904. IF Trace THEN TraceEnter("VisitSet") END;
  1905. dest := destination;
  1906. destination := emptyOperand;
  1907. noBits := IntermediateCode.Immediate(setType, 0);
  1908. one := IntermediateCode.Immediate(setType, 1);
  1909. (* start off with the empty set *)
  1910. InitOperand(res, ModeValue);
  1911. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1912. Emit(Mov(position,res.op, noBits));
  1913. FOR i := 0 TO x.elements.Length() - 1 DO
  1914. expression := x.elements.GetExpression(i);
  1915. IF expression IS SyntaxTree.RangeExpression THEN
  1916. (* range of set elements *)
  1917. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  1918. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  1919. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1920. ReleaseIntermediateOperand(temp)
  1921. ELSE
  1922. (* singelton element *)
  1923. Evaluate(expression, operand);
  1924. Convert(operand.op, setType);
  1925. CheckSetElement(operand.op);
  1926. (* create subset containing single element *)
  1927. Reuse1(temp, operand.op);
  1928. Emit(Shl(position,temp, one, operand.op));
  1929. ReleaseOperand(operand);
  1930. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1931. ReleaseIntermediateOperand(temp);
  1932. END
  1933. END;
  1934. result := res;
  1935. destination := dest;
  1936. IF Trace THEN TraceExit("VisitSet") END;
  1937. END VisitSet;
  1938. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  1939. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  1940. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  1941. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  1942. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  1943. element: SyntaxTree.IntegerValue;
  1944. BEGIN
  1945. numberElements := x.elements.Length();
  1946. expression := index.parameters.GetExpression(dim);
  1947. element := expression(SyntaxTree.IntegerValue);
  1948. FOR i := 0 TO numberElements-1 DO
  1949. expression := x.elements.GetExpression(i);
  1950. element.SetValue(i);
  1951. IF expression IS SyntaxTree.MathArrayExpression THEN
  1952. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  1953. ELSE
  1954. Assign(index,expression);
  1955. END;
  1956. END;
  1957. END RecursiveAssignment;
  1958. BEGIN
  1959. variable := GetTemporaryVariable(x.type, FALSE);
  1960. designator := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  1961. designator.SetType(variable.type);
  1962. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  1963. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  1964. FOR i := 0 TO dim-1 DO
  1965. element := SyntaxTree.NewIntegerValue(x.position,0);
  1966. element.SetType(system.longintType);
  1967. index.parameters.AddExpression(element);
  1968. END;
  1969. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  1970. RecursiveAssignment(x,0);
  1971. Expression(designator);
  1972. END VisitMathArrayExpression;
  1973. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  1974. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1975. BEGIN
  1976. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  1977. dest := destination; destination := emptyOperand;
  1978. IF x.operator = Scanner.Not THEN
  1979. IF conditional THEN
  1980. Condition(x.left,falseLabel,trueLabel)
  1981. ELSE
  1982. Evaluate(x.left,operand);
  1983. InitOperand(result,ModeValue);
  1984. Reuse1a(result.op,operand.op,dest);
  1985. Emit(Xor(position,result.op,operand.op,true));
  1986. ReleaseOperand(operand);
  1987. END;
  1988. ELSIF x.operator = Scanner.Minus THEN
  1989. Evaluate(x.left,operand);
  1990. InitOperand(result,ModeValue);
  1991. Reuse1a(result.op,operand.op,dest);
  1992. type := x.left.type.resolved;
  1993. IF type IS SyntaxTree.SetType THEN
  1994. Emit(Not(position,result.op,operand.op));
  1995. ELSIF (type IS SyntaxTree.ComplexType) THEN
  1996. Reuse1(result.tag,operand.tag);
  1997. Emit(Neg(position,result.op,operand.op)); (* real part *)
  1998. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  1999. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2000. Emit(Neg(position,result.op,operand.op));
  2001. ELSE HALT(200)
  2002. END;
  2003. ReleaseOperand(operand);
  2004. ELSIF x.operator = Scanner.Address THEN
  2005. Designate(x.left,operand);
  2006. operand.mode := ModeValue;
  2007. t0 := x.left.type.resolved;
  2008. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2009. ReleaseIntermediateOperand(operand.op);
  2010. operand.op := operand.tag;
  2011. IntermediateCode.InitOperand(operand.tag);
  2012. END;
  2013. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2014. result := operand;
  2015. ELSE HALT(100)
  2016. END;
  2017. destination := dest;
  2018. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2019. END VisitUnaryExpression;
  2020. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2021. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2022. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2023. BEGIN
  2024. type := type.resolved;
  2025. originalType := type;
  2026. IF type IS SyntaxTree.PointerType THEN
  2027. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2028. END;
  2029. IF type IS SyntaxTree.ObjectType THEN
  2030. BrL(trueL);
  2031. ELSE
  2032. ASSERT(type IS SyntaxTree.RecordType);
  2033. (*
  2034. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2035. *)
  2036. ReuseCopy(left,tag);
  2037. right := TypeDescriptorAdr(type);
  2038. IF ~newObjectFile THEN
  2039. IntermediateCode.MakeMemory(right,addressType);
  2040. END;
  2041. IF backend.cooperative THEN
  2042. repeatL := NewLabel();
  2043. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2044. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2045. END;
  2046. SetLabel(repeatL);
  2047. BreqL(trueL,left,right);
  2048. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2049. BrneL(repeatL,left,nil);
  2050. ELSIF meta.simple THEN
  2051. level := type(SyntaxTree.RecordType).Level();
  2052. (* get type desc tag of level relative to base tag *)
  2053. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2054. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2055. IntermediateCode.MakeMemory(left,addressType);
  2056. BreqL(trueL,left,right);
  2057. ELSE
  2058. level := type(SyntaxTree.RecordType).Level();
  2059. (* get type desc tag of level relative to base tag *)
  2060. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2061. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2062. IntermediateCode.MakeMemory(left,addressType);
  2063. BreqL(trueL,left,right);
  2064. END;
  2065. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2066. BrL(falseL);
  2067. END;
  2068. END TypeTest;
  2069. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  2070. BEGIN
  2071. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  2072. IF dump # NIL THEN
  2073. dump.String(s); dump.Ln;
  2074. END;
  2075. END Error;
  2076. PROCEDURE Warning(position: LONGINT; CONST s: ARRAY OF CHAR);
  2077. BEGIN
  2078. backend.diagnostics.Warning(module.module.sourceName,position,Diagnostics.Invalid,s);
  2079. IF dump # NIL THEN
  2080. dump.String(s); dump.Ln; dump.Update;
  2081. END;
  2082. END Warning;
  2083. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2084. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2085. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2086. operand:Operand;
  2087. BEGIN
  2088. previousSection := section;
  2089. Global.GetModuleName(mod,name);
  2090. Strings.Append(name,".@Trace");
  2091. Basic.ToSegmentedName(name, pooledName);
  2092. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2093. IF dump # NIL THEN dump := section.comments END;
  2094. IF backend.hasLinkRegister THEN
  2095. Emit(Push(-1, lr));
  2096. END;
  2097. variable := mod.moduleScope.firstVariable;
  2098. WHILE variable # NIL DO
  2099. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2100. Symbol(variable, operand);
  2101. register := operand.op;
  2102. CallTraceMethod(register, variable.type);
  2103. ReleaseIntermediateOperand(register);
  2104. END;
  2105. variable := variable.nextVariable;
  2106. END;
  2107. IF backend.hasLinkRegister THEN
  2108. Emit(Pop(-1, lr));
  2109. END;
  2110. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2111. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2112. Emit(Br(position,op));
  2113. INC(statCoopTraceModule, section.pc);
  2114. section := previousSection;
  2115. IF dump # NIL THEN dump := section.comments END;
  2116. END CreateTraceModuleMethod;
  2117. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2118. BEGIN
  2119. Emit (Push(position, dst));
  2120. Emit (Push(position, src));
  2121. CallThis(position,"GarbageCollector","Assign", 2);
  2122. END CallAssignPointer;
  2123. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2124. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2125. BEGIN
  2126. IF SemanticChecker.IsPointerType (type) THEN
  2127. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2128. ELSIF type.IsRecordType() THEN
  2129. Emit (Push(position,dst));
  2130. Emit (Push(position,src));
  2131. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2132. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2133. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2134. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2135. ELSIF IsStaticArray(type) THEN
  2136. size := StaticArrayNumElements(type);
  2137. base := StaticArrayBaseType(type);
  2138. IF base.IsRecordType() THEN
  2139. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2140. Emit (Push(position, dst));
  2141. Emit (Push(position, src));
  2142. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2143. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2144. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2145. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2146. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2147. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2148. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2149. Emit (Push(position, dst));
  2150. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2151. Emit (Push(position, src));
  2152. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2153. ELSE
  2154. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2155. Emit (Push(position, dst));
  2156. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2157. Emit (Push(position, src));
  2158. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2159. ASSERT(StaticArrayBaseType(type).IsPointer());
  2160. END;
  2161. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2162. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2163. Emit (Push(position, dst));
  2164. Emit (Push(position, src));
  2165. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2166. ELSE HALT(100); (* missing ? *)
  2167. END;
  2168. END CallAssignMethod;
  2169. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2170. VAR name: Basic.SegmentedName;
  2171. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2172. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2173. context: Context;
  2174. BEGIN
  2175. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2176. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2177. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2178. GetRecordTypeName (recordType,name);
  2179. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2180. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2181. IF dump # NIL THEN dump := section.comments END;
  2182. IF backend.hasLinkRegister THEN
  2183. Emit(Push(-1, lr));
  2184. END;
  2185. variable := recordType.recordScope.firstVariable;
  2186. WHILE variable # NIL DO
  2187. IF variable.NeedsTrace() THEN
  2188. dst := NewRegisterOperand (addressType);
  2189. src := NewRegisterOperand (addressType);
  2190. Emit (Mov(position, dst, parameter1));
  2191. Emit (Mov(position, src, parameter2));
  2192. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2193. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2194. CallAssignMethod(dst, src, variable.type);
  2195. ReleaseIntermediateOperand(src);
  2196. ReleaseIntermediateOperand(dst);
  2197. END;
  2198. variable := variable.nextVariable;
  2199. END;
  2200. recordBase := recordType.GetBaseRecord();
  2201. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2202. IF backend.hasLinkRegister THEN
  2203. Emit(Pop(-1, lr));
  2204. END;
  2205. GetRecordTypeName (recordBase,name);
  2206. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2207. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2208. Emit(Br(position,op));
  2209. ELSE
  2210. Emit(Exit(position,0,0));
  2211. END;
  2212. IF ~recordType.isObject THEN
  2213. GetRecordTypeName (recordType,name);
  2214. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2215. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2216. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2217. NEW(registerUsageCount);
  2218. usedRegisters := NIL;
  2219. dst := NewRegisterOperand (addressType);
  2220. src := NewRegisterOperand (addressType);
  2221. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2222. Emit(Mov(position, dst, parameter1));
  2223. Emit(Mov(position, src, parameter2));
  2224. label := NewLabel();
  2225. SetLabel(label);
  2226. Emit(Push(position, dst));
  2227. Emit(Push(position, src));
  2228. GetRecordTypeName (recordType,name);
  2229. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2230. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2231. Emit(Call(position, op, 0));
  2232. Emit(Pop(position, src));
  2233. Emit(Pop(position, dst));
  2234. Emit(Add(position, dst, dst, ofs));
  2235. Emit(Add(position, src, src, ofs));
  2236. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2237. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2238. Emit(Exit(position,0,0));
  2239. END;
  2240. INC(statCoopAssignProcedure, section.pc);
  2241. ReturnToContext(context);
  2242. IF dump # NIL THEN dump := section.comments END;
  2243. END CreateAssignProcedure;
  2244. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2245. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2246. BEGIN
  2247. IF IsUnsafePointer (type) THEN
  2248. skip := NewLabel();
  2249. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2250. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2251. BreqL (skip, op, nil);
  2252. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2253. SetLabel (skip);
  2254. ELSIF SemanticChecker.IsPointerType (type) THEN
  2255. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2256. CallThis(position,"GarbageCollector","Mark", 1);
  2257. ELSIF type.IsRecordType() THEN
  2258. Emit (Push(position,register));
  2259. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2260. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2261. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2262. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2263. ELSIF IsStaticArray(type) THEN
  2264. size := StaticArrayNumElements(type);
  2265. base := StaticArrayBaseType(type);
  2266. IF base.IsRecordType() THEN
  2267. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2268. Emit (Push(position, register));
  2269. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2270. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2271. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2272. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2273. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2274. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2275. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2276. Emit (Push(position, register));
  2277. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2278. ELSE
  2279. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2280. Emit (Push(position, register));
  2281. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2282. ASSERT(base.IsPointer());
  2283. END;
  2284. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2285. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2286. CallThis(position,"GarbageCollector","Mark", 1);
  2287. ELSE HALT(100); (* missing ? *)
  2288. END;
  2289. END CallTraceMethod;
  2290. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2291. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2292. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2293. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2294. BEGIN
  2295. previousSection := section;
  2296. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2297. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2298. GetRecordTypeName (recordType,name);
  2299. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2300. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2301. IF dump # NIL THEN dump := section.comments END;
  2302. IF backend.hasLinkRegister THEN
  2303. Emit(Push(-1, lr));
  2304. END;
  2305. variable := recordType.recordScope.firstVariable;
  2306. WHILE variable # NIL DO
  2307. IF variable.NeedsTrace() THEN
  2308. register := NewRegisterOperand (addressType);
  2309. Emit (Mov(position,register,parameter1));
  2310. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2311. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2312. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2313. END;
  2314. CallTraceMethod(register, variable.type);
  2315. ReleaseIntermediateOperand(register);
  2316. END;
  2317. variable := variable.nextVariable;
  2318. END;
  2319. recordBase := recordType.GetBaseRecord();
  2320. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2321. recordBase := recordBase.GetBaseRecord();
  2322. END;
  2323. IF recordBase # NIL THEN
  2324. IF backend.hasLinkRegister THEN
  2325. Emit(Pop(-1, lr));
  2326. END;
  2327. GetRecordTypeName (recordBase,name);
  2328. IF HasExplicitTraceMethod (recordBase) THEN
  2329. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2330. ELSE
  2331. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2332. END;
  2333. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2334. Emit(Br(position,op));
  2335. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2336. Emit(Exit(position,0,0));
  2337. ELSE
  2338. IF backend.hasLinkRegister THEN
  2339. Emit(Pop(-1, lr));
  2340. END;
  2341. IF recordType.isObject THEN
  2342. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2343. ELSE
  2344. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2345. END;
  2346. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2347. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2348. Emit(Br(position,op));
  2349. END;
  2350. IF ~recordType.isObject THEN
  2351. GetRecordTypeName (recordType,name);
  2352. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2353. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2354. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2355. NEW(registerUsageCount);
  2356. usedRegisters := NIL;
  2357. IF dump # NIL THEN dump := section.comments END;
  2358. register := NewRegisterOperand (addressType);
  2359. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2360. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2361. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2362. END;
  2363. Emit (Push(position,register));
  2364. GetRecordTypeName (recordType,name);
  2365. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2366. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2367. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2368. ReleaseIntermediateOperand(register);
  2369. Emit(Exit(position,0,0));
  2370. GetRecordTypeName (recordType,name);
  2371. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2372. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2373. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2374. NEW(registerUsageCount);
  2375. usedRegisters := NIL;
  2376. register := NewRegisterOperand (addressType);
  2377. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2378. Emit(Mov(position, register, parameter1));
  2379. label := NewLabel();
  2380. SetLabel(label);
  2381. Emit(Push(position, register));
  2382. GetRecordTypeName (recordType,name);
  2383. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2384. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2385. Emit(Call(position, op, 0));
  2386. Emit(Pop(position, register));
  2387. Emit(Add(position, register, register, ofs));
  2388. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2389. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2390. Emit(Exit(position,0,0));
  2391. END;
  2392. INC(statCoopTraceMethod, section.pc);
  2393. ReturnToContext(context);
  2394. IF dump # NIL THEN dump := section.comments END;
  2395. END CreateTraceMethod;
  2396. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2397. VAR name: Basic.SegmentedName;
  2398. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2399. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2400. context: Context;
  2401. BEGIN
  2402. IF recordType.isObject THEN RETURN END;
  2403. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2404. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2405. GetRecordTypeName (recordType,name);
  2406. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2407. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2408. IF dump # NIL THEN dump := section.comments END;
  2409. IF backend.hasLinkRegister THEN
  2410. Emit(Push(-1, lr));
  2411. END;
  2412. variable := recordType.recordScope.firstVariable;
  2413. WHILE variable # NIL DO
  2414. IF variable.NeedsTrace() THEN
  2415. dst := NewRegisterOperand (addressType);
  2416. Emit (Mov(position, dst, parameter1));
  2417. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2418. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2419. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2420. END;
  2421. CallResetProcedure(dst, nil, variable.type);
  2422. ReleaseIntermediateOperand(dst);
  2423. END;
  2424. variable := variable.nextVariable;
  2425. END;
  2426. recordBase := recordType.GetBaseRecord();
  2427. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2428. IF backend.hasLinkRegister THEN
  2429. Emit(Pop(-1, lr));
  2430. END;
  2431. GetRecordTypeName (recordBase,name);
  2432. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2433. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2434. Emit(Br(position,op));
  2435. ELSE
  2436. Emit(Exit(position,0,0));
  2437. END;
  2438. GetRecordTypeName (recordType,name);
  2439. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2440. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2441. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2442. NEW(registerUsageCount);
  2443. usedRegisters := NIL;
  2444. dst := NewRegisterOperand (addressType);
  2445. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2446. Emit(Mov(position, dst, parameter1));
  2447. label := NewLabel();
  2448. SetLabel(label);
  2449. Emit(Push(position, dst));
  2450. GetRecordTypeName (recordType,name);
  2451. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2452. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2453. Emit(Call(position, op, 0));
  2454. Emit(Pop(position, dst));
  2455. Emit(Add(position, dst, dst, ofs));
  2456. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2457. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2458. Emit(Exit(position,0,0));
  2459. INC(statCoopResetProcedure, section.pc);
  2460. ReturnToContext(context);
  2461. IF dump # NIL THEN dump := section.comments END;
  2462. END CreateResetProcedure;
  2463. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2464. VAR name: Basic.SegmentedName; context: Context;
  2465. BEGIN
  2466. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2467. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2468. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2469. IF dump # NIL THEN dump := section.comments END;
  2470. IF backend.hasLinkRegister THEN
  2471. Emit(Push(-1, lr));
  2472. END;
  2473. Emit(Push(position,fp));
  2474. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2475. ResetVariables(scope);
  2476. Emit(Pop(position,fp));
  2477. Emit(Exit(position,0,0));
  2478. ReturnToContext(context);
  2479. IF dump # NIL THEN dump := section.comments END;
  2480. END CreateResetMethod;
  2481. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2482. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2483. BEGIN
  2484. IF SemanticChecker.IsPointerType (type) THEN
  2485. Emit (Push(position, dest));
  2486. CallThis(position,"GarbageCollector","Reset", 1);
  2487. ELSIF type.IsRecordType() THEN
  2488. Emit (Push(position, dest));
  2489. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2490. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2491. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2492. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2493. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2494. size := GetArrayLength(type, tag);
  2495. base := ArrayBaseType(type);
  2496. IF base.IsRecordType() THEN
  2497. Emit (Push(position, size));
  2498. Emit (Push(position, dest));
  2499. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2500. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2501. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2502. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2503. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2504. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2505. Emit (Push(position, size));
  2506. Emit (Push(position, dest));
  2507. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2508. ELSE
  2509. Emit (Push(position, size));
  2510. Emit (Push(position, dest));
  2511. CallThis(position,"GarbageCollector","ResetArray", 2);
  2512. ASSERT(ArrayBaseType(type).IsPointer());
  2513. END;
  2514. ReleaseIntermediateOperand(size);
  2515. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2516. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2517. Emit (Push(position, dest));
  2518. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2519. ELSE HALT(100); (* missing ? *)
  2520. END;
  2521. END CallResetProcedure;
  2522. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2523. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2524. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2525. VAR operand: Operand;
  2526. BEGIN
  2527. Symbol (symbol, operand);
  2528. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2529. ReleaseOperand(operand);
  2530. END Reset;
  2531. BEGIN
  2532. previousScope := currentScope;
  2533. currentScope := scope;
  2534. pc := section.pc;
  2535. variable := scope.firstVariable;
  2536. WHILE variable # NIL DO
  2537. IF variable.NeedsTrace() THEN
  2538. Reset (variable);
  2539. END;
  2540. variable := variable.nextVariable;
  2541. END;
  2542. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2543. WHILE parameter # NIL DO
  2544. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2545. Reset (parameter);
  2546. END;
  2547. parameter := parameter.nextParameter;
  2548. END;
  2549. INC(statCoopResetVariables, section.pc - pc);
  2550. currentScope := previousScope;
  2551. END ResetVariables;
  2552. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2553. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2554. VAR op: IntermediateCode.Operand; context: Context;
  2555. BEGIN
  2556. previousSection := section;
  2557. GetCodeSectionNameForSymbol(procedure, name);
  2558. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  2559. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE));
  2560. IF dump # NIL THEN dump := section.comments END;
  2561. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2562. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2563. Emit(Data(position,op));
  2564. Emit(Data(position,nil));
  2565. IF HasPointers (procedure.procedureScope) THEN
  2566. GetCodeSectionNameForSymbol(procedure, name);
  2567. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2568. ELSE
  2569. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2570. END;
  2571. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2572. Emit(Data(position,op));
  2573. ReturnToContext(context);
  2574. IF dump # NIL THEN dump := section.comments END;
  2575. END CreateProcedureDescriptor;
  2576. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2577. VAR import: SyntaxTree.Import;
  2578. s: Basic.MessageString;
  2579. selfName: SyntaxTree.IdentifierString;
  2580. BEGIN
  2581. moduleScope.ownerModule.GetName(selfName);
  2582. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2583. module := moduleScope.ownerModule
  2584. ELSE
  2585. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2586. IF import = NIL THEN
  2587. import := SyntaxTree.NewImport(-1,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2588. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2589. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2590. s := "Module ";
  2591. Strings.Append(s,moduleName);
  2592. Strings.Append(s," cannot be imported.");
  2593. IF force THEN
  2594. Error(position,s);
  2595. ELSIF canBeLoaded THEN
  2596. Strings.Append(s, "=> no dynamic linking.");
  2597. Warning(position, s);
  2598. canBeLoaded := FALSE;
  2599. END;
  2600. RETURN FALSE
  2601. ELSE
  2602. SELF.module.imports.AddName(moduleName)
  2603. END;
  2604. ELSIF import.module = NIL THEN (* already tried *)
  2605. RETURN FALSE
  2606. END;
  2607. module := import.module;
  2608. END;
  2609. RETURN TRUE
  2610. END AddImport;
  2611. (* needed for old binary object file format*)
  2612. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2613. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2614. BEGIN
  2615. IF AddImport(moduleName,module,TRUE) THEN
  2616. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2617. IF procedure = NIL THEN
  2618. s := "Instruction not supported on target, emulation procedure ";
  2619. Strings.Append(s,moduleName);
  2620. Strings.Append(s,".");
  2621. Strings.Append(s,procedureName);
  2622. Strings.Append(s," not present");
  2623. Error(position,s);
  2624. ELSE
  2625. StaticCallOperand(r,procedure);
  2626. ReleaseOperand(r);
  2627. fp := GetFingerprint(procedure);
  2628. END;
  2629. END;
  2630. END EnsureSymbol;
  2631. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2632. VAR exit: Label; trueL,falseL: Label;
  2633. BEGIN
  2634. trueL := NewLabel();
  2635. falseL := NewLabel();
  2636. exit := NewLabel();
  2637. Condition(x,trueL,falseL);
  2638. InitOperand(result,ModeValue);
  2639. SetLabel(trueL);
  2640. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2641. Emit(Mov(position,result.op,true));
  2642. BrL(exit);
  2643. SetLabel(falseL);
  2644. Emit(MovReplace(position,result.op,false));
  2645. SetLabel(exit);
  2646. END ConditionToValue;
  2647. PROCEDURE ValueToCondition(VAR op: Operand);
  2648. BEGIN
  2649. LoadValue(op,system.booleanType);
  2650. BrneL(trueLabel,op.op, false);
  2651. ReleaseOperand(op);
  2652. BrL(falseLabel);
  2653. END ValueToCondition;
  2654. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2655. VAR size: LONGINT;
  2656. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2657. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2658. BEGIN
  2659. ASSERT(type.form = SyntaxTree.Open);
  2660. baseType := type.arrayBase.resolved;
  2661. IF IsOpenArray(baseType) THEN
  2662. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2663. ELSE
  2664. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2665. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2666. END;
  2667. len := tag;
  2668. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2669. IntermediateCode.MakeMemory(len,addressType);
  2670. UseIntermediateOperand(len);
  2671. Reuse2(res,sizeOperand,len);
  2672. Emit(Mul(position,res,sizeOperand,len));
  2673. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2674. RETURN res
  2675. END GetArraySize;
  2676. BEGIN
  2677. type := type.resolved;
  2678. IF IsOpenArray(type) THEN
  2679. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2680. RETURN tag
  2681. ELSE
  2682. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2683. END;
  2684. ELSE
  2685. size := ToMemoryUnits(system,system.SizeOf(type));
  2686. RETURN IntermediateCode.Immediate(addressType,size)
  2687. END;
  2688. END GetDynamicSize;
  2689. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2690. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2691. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2692. BEGIN
  2693. ASSERT(type.form = SyntaxTree.Open);
  2694. baseType := type.arrayBase.resolved;
  2695. IF IsOpenArray(baseType) THEN
  2696. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2697. ELSE
  2698. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2699. END;
  2700. len := tag;
  2701. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2702. IntermediateCode.MakeMemory(len,addressType);
  2703. UseIntermediateOperand(len);
  2704. Reuse2(res,sizeOperand,len);
  2705. Emit(Mul(position,res,sizeOperand,len));
  2706. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2707. RETURN res
  2708. END GetLength;
  2709. BEGIN
  2710. type := type.resolved;
  2711. IF IsOpenArray(type) THEN
  2712. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2713. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2714. ELSE
  2715. RETURN IntermediateCode.Immediate(addressType,1)
  2716. END;
  2717. END GetArrayLength;
  2718. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2719. VAR result: IntermediateCode.Operand;
  2720. BEGIN
  2721. IF backend.cooperative THEN
  2722. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2723. ELSE
  2724. MakeMemory(result, tag, addressType, 0);
  2725. END;
  2726. RETURN result
  2727. END GetSizeFromTag;
  2728. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2729. VAR parameter: SyntaxTree.Parameter;
  2730. BEGIN
  2731. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2732. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2733. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2734. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2735. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2736. END;
  2737. RETURN GetDynamicSize(e.type, tag);
  2738. END GetArrayOfBytesSize;
  2739. (*
  2740. to find imported symbol. not needed ?
  2741. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2742. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2743. BEGIN
  2744. IF AddImport(moduleName,importedModule,FALSE) THEN
  2745. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2746. RETURN symbol
  2747. ELSE
  2748. RETURN NIL
  2749. END
  2750. END SymbolByName;
  2751. *)
  2752. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2753. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2754. BEGIN
  2755. IF AddImport(moduleName,runtimeModule,force) THEN
  2756. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2757. IF procedure = NIL THEN
  2758. s := "Procedure ";
  2759. Strings.Append(s,moduleName);
  2760. Strings.Append(s,".");
  2761. Strings.Append(s,procedureName);
  2762. Strings.Append(s," not present");
  2763. Error(position,s);
  2764. RETURN FALSE
  2765. ELSE
  2766. RETURN TRUE
  2767. END;
  2768. ELSE RETURN FALSE
  2769. END;
  2770. END GetRuntimeProcedure;
  2771. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2772. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2773. s: Basic.MessageString;
  2774. BEGIN
  2775. Basic.InitSegmentedName(name);
  2776. name[0] := Basic.MakeString(moduleName);
  2777. name[1] := Basic.MakeString(typeName);
  2778. name[2] := -1;
  2779. IF AddImport(moduleName,importedModule, FALSE) THEN
  2780. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2781. IF symbol = NIL THEN
  2782. s := "type ";
  2783. Strings.Append(s,moduleName);
  2784. Strings.Append(s,".");
  2785. Strings.Append(s,typeName);
  2786. Strings.Append(s," not present");
  2787. Error(position,s);
  2788. END;
  2789. ELSE symbol := NIL;
  2790. END;
  2791. IF importedModule = moduleScope.ownerModule THEN
  2792. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2793. ELSE
  2794. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2795. END;
  2796. RETURN symbol
  2797. END GetTypeDescriptor;
  2798. (* 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. *)
  2799. PROCEDURE CallThisChecked(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2800. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2801. pooledName: Basic.SegmentedName; size: LONGINT;
  2802. BEGIN
  2803. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2804. StaticCallOperand(result,procedure);
  2805. IF numberParameters < 0 THEN
  2806. size := ProcedureParametersSize(system,procedure);
  2807. ELSE
  2808. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2809. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2810. Error(position,"runtime call parameter count mismatch");
  2811. END;
  2812. END;
  2813. Emit(Call(position, result.op, size));
  2814. ReleaseOperand(result);
  2815. ELSE (* only static linking possible *)
  2816. ASSERT(numberParameters >= 0);
  2817. Basic.InitSegmentedName(pooledName);
  2818. pooledName[0] := Basic.MakeString(moduleName);
  2819. pooledName[1] := Basic.MakeString(procedureName);
  2820. pooledName[2] := -1;
  2821. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2822. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2823. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2824. END;
  2825. END CallThisChecked;
  2826. (* 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. *)
  2827. PROCEDURE CallThis(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2828. BEGIN
  2829. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2830. END CallThis;
  2831. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2832. VAR
  2833. left,right: Operand;
  2834. leftSize, rightSize: IntermediateCode.Operand;
  2835. saved: RegisterEntry;
  2836. reg: IntermediateCode.Operand;
  2837. procedureName: SyntaxTree.IdentifierString;
  2838. BEGIN
  2839. procedureName := "CompareString";
  2840. SaveRegisters();ReleaseUsedRegisters(saved);
  2841. Designate(leftExpression,left);
  2842. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2843. Emit(Push(position,leftSize));
  2844. ReleaseIntermediateOperand(leftSize);
  2845. Emit(Push(position,left.op));
  2846. ReleaseOperand(left);
  2847. Designate(rightExpression,right);
  2848. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2849. Emit(Push(position,rightSize));
  2850. ReleaseIntermediateOperand(rightSize);
  2851. Emit(Push(position,right.op));
  2852. ReleaseOperand(right);
  2853. IF backend.cooperative THEN
  2854. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2855. ELSE
  2856. CallThis(position,runtimeModuleName,procedureName, 4);
  2857. END;
  2858. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2859. Emit(Result(position,reg));
  2860. (*
  2861. AcquireThisRegister(int8,IntermediateCode.Result);
  2862. *)
  2863. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2864. (*
  2865. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2866. *)
  2867. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2868. ReleaseIntermediateOperand(reg);
  2869. BrL(falseLabel);
  2870. END CompareString;
  2871. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2872. VAR
  2873. left,right: Operand;
  2874. leftSize, rightSize: IntermediateCode.Operand;
  2875. saved: RegisterEntry;
  2876. procedureName: SyntaxTree.IdentifierString;
  2877. BEGIN
  2878. procedureName := "CopyString";
  2879. SaveRegisters();ReleaseUsedRegisters(saved);
  2880. Designate(leftExpression,left);
  2881. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2882. Emit(Push(position,leftSize));
  2883. ReleaseIntermediateOperand(leftSize);
  2884. Emit(Push(position,left.op));
  2885. ReleaseOperand(left);
  2886. Designate(rightExpression,right);
  2887. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2888. Emit(Push(position,rightSize));
  2889. ReleaseIntermediateOperand(rightSize);
  2890. Emit(Push(position,right.op));
  2891. ReleaseOperand(right);
  2892. IF backend.cooperative THEN
  2893. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2894. ELSE
  2895. CallThis(position,runtimeModuleName,procedureName,4);
  2896. END;
  2897. RestoreRegisters(saved);
  2898. END CopyString;
  2899. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  2900. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2901. leftType,rightType: SyntaxTree.Type;
  2902. leftExpression,rightExpression : SyntaxTree.Expression;
  2903. componentType: IntermediateCode.Type;
  2904. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  2905. size: LONGINT;
  2906. BEGIN
  2907. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2908. dest := destination; destination := emptyOperand;
  2909. leftType := x.left.type.resolved;
  2910. rightType := x.right.type.resolved;
  2911. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  2912. CASE x.operator OF
  2913. Scanner.Or:
  2914. (* shortcut evaluation of left OR right *)
  2915. IF ~conditional THEN ConditionToValue(x);
  2916. ELSE
  2917. next := NewLabel();
  2918. Condition(x.left,trueLabel,next);
  2919. SetLabel(next);
  2920. Condition(x.right,trueLabel,falseLabel);
  2921. END;
  2922. |Scanner.And:
  2923. (* shortcut evaluation of left & right *)
  2924. IF ~conditional THEN ConditionToValue(x);
  2925. ELSE
  2926. next := NewLabel();
  2927. Condition(x.left,next,falseLabel);
  2928. SetLabel(next);
  2929. Condition(x.right,trueLabel,falseLabel);
  2930. END;
  2931. |Scanner.Is:
  2932. IF ~conditional THEN ConditionToValue(x);
  2933. ELSE
  2934. (* get type desc tag *)
  2935. IF IsPointerToRecord(leftType,recordType) THEN
  2936. Evaluate(x.left,left);
  2937. Dereference(left,recordType,IsUnsafePointer(leftType))
  2938. ELSE
  2939. Designate(x.left,left);
  2940. END;
  2941. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  2942. ReleaseOperand(left);
  2943. END;
  2944. |Scanner.Plus:
  2945. Evaluate(x.left,left);
  2946. Evaluate(x.right,right);
  2947. IF leftType IS SyntaxTree.SetType THEN
  2948. InitOperand(result,ModeValue);
  2949. Reuse2a(result.op,left.op,right.op,dest);
  2950. Emit(Or(position,result.op,left.op,right.op));
  2951. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2952. InitOperand(result,ModeValue);
  2953. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2954. Reuse2(result.tag,left.tag,right.tag);
  2955. Emit(Add(position,result.op,left.op,right.op));
  2956. Emit(Add(position,result.tag,left.tag,right.tag))
  2957. ELSE
  2958. InitOperand(result,ModeValue);
  2959. Reuse2a(result.op,left.op,right.op,dest);
  2960. Emit(Add(position,result.op,left.op,right.op));
  2961. END;
  2962. ReleaseOperand(left); ReleaseOperand(right);
  2963. |Scanner.Minus:
  2964. Evaluate(x.left,left);
  2965. Evaluate(x.right,right);
  2966. IF leftType IS SyntaxTree.SetType THEN
  2967. InitOperand(result,ModeValue);
  2968. Reuse1(result.op,right.op);
  2969. Emit(Not(position,result.op,right.op));
  2970. ReleaseOperand(right);
  2971. Emit(And(position,result.op,result.op,left.op));
  2972. ReleaseOperand(left);
  2973. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2974. InitOperand(result,ModeValue);
  2975. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2976. Reuse2(result.tag,left.tag,right.tag);
  2977. Emit(Sub(position,result.op,left.op,right.op));
  2978. Emit(Sub(position,result.tag,left.tag,right.tag));
  2979. ReleaseOperand(left); ReleaseOperand(right)
  2980. ELSE
  2981. InitOperand(result,ModeValue);
  2982. Reuse2a(result.op,left.op,right.op,dest);
  2983. Emit(Sub(position,result.op,left.op,right.op));
  2984. ReleaseOperand(left); ReleaseOperand(right);
  2985. END;
  2986. |Scanner.Times:
  2987. Evaluate(x.left,left);
  2988. Evaluate(x.right,right);
  2989. IF leftType IS SyntaxTree.SetType THEN
  2990. InitOperand(result,ModeValue);
  2991. Reuse2a(result.op,left.op,right.op,dest);
  2992. Emit(And(position,result.op,left.op,right.op));
  2993. ELSIF (x.type.resolved IS SyntaxTree.IntegerType) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2994. InitOperand(result,ModeValue);
  2995. Reuse1a(result.op,left.op,dest);
  2996. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2997. Emit(Shl(position,result.op,left.op,right.op));
  2998. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2999. InitOperand(result, ModeValue);
  3000. componentType := left.op.type;
  3001. (* TODO: review this *)
  3002. (*
  3003. result.op = left.op * right.op - left.tag * right.tag
  3004. result.tag = left.tag * right.op + left.op * right.tag
  3005. *)
  3006. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3007. Emit(Mul(position,result.op, left.op, right.op));
  3008. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3009. Emit(Mul(position,tempReg, left.tag, right.tag));
  3010. Emit(Sub(position,result.op, result.op, tempReg));
  3011. Reuse2(result.tag, left.tag, right.op);
  3012. Emit(Mul(position,result.tag, left.tag, right.op));
  3013. Emit(Mul(position,tempReg, left.op, right.tag));
  3014. Emit(Add(position,result.tag, result.tag, tempReg));
  3015. ReleaseIntermediateOperand(tempReg)
  3016. ELSE
  3017. InitOperand(result,ModeValue);
  3018. Reuse2a(result.op,left.op,right.op,dest);
  3019. Emit(Mul(position,result.op,left.op,right.op));
  3020. END;
  3021. ReleaseOperand(left); ReleaseOperand(right);
  3022. |Scanner.Div:
  3023. Evaluate(x.left,left);
  3024. Evaluate(x.right,right);
  3025. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  3026. InitOperand(result,ModeValue);
  3027. Reuse1a(result.op,left.op,dest);
  3028. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  3029. Emit(Shr(position,result.op,left.op,right.op));
  3030. ELSE
  3031. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3032. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3033. IF ~isUnchecked THEN
  3034. exit := NewLabel();
  3035. BrltL(exit,zero,right.op);
  3036. EmitTrap(position,NegativeDivisorTrap);
  3037. SetLabel(exit);
  3038. END;
  3039. END;
  3040. InitOperand(result,ModeValue);
  3041. Reuse2a(result.op,left.op,right.op,dest);
  3042. Emit(Div(position,result.op,left.op,right.op));
  3043. END;
  3044. ReleaseOperand(left); ReleaseOperand(right);
  3045. |Scanner.Mod:
  3046. Evaluate(x.left,left);
  3047. Evaluate(x.right,right);
  3048. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  3049. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system,x.type),value-1);
  3050. InitOperand(result,ModeValue);
  3051. Reuse1a(result.op,left.op,dest);
  3052. Emit(And(position,result.op,left.op,right.op));
  3053. ELSE
  3054. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3055. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3056. IF ~isUnchecked THEN
  3057. exit := NewLabel();
  3058. BrltL(exit,zero,right.op);
  3059. EmitTrap(position,NegativeDivisorTrap);
  3060. SetLabel(exit);
  3061. END;
  3062. END;
  3063. InitOperand(result,ModeValue);
  3064. Reuse2a(result.op,left.op,right.op,dest);
  3065. Emit(Mod(position,result.op,left.op,right.op));
  3066. END;
  3067. ReleaseOperand(left); ReleaseOperand(right);
  3068. |Scanner.Slash:
  3069. Evaluate(x.left,left);
  3070. Evaluate(x.right,right);
  3071. IF leftType IS SyntaxTree.SetType THEN
  3072. InitOperand(result,ModeValue);
  3073. Reuse2a(result.op,left.op,right.op,dest);
  3074. Emit(Xor(position,result.op,left.op,right.op));
  3075. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3076. InitOperand(result,ModeValue);
  3077. componentType := left.op.type;
  3078. (* review this *)
  3079. (*
  3080. divisor = right.op * right.op + right.tag * right.tag
  3081. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3082. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3083. *)
  3084. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3085. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3086. Emit(Mul(position,tempReg, right.op, right.op));
  3087. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3088. Emit(Add(position,tempReg, tempReg, tempReg2));
  3089. result.op := tempReg2;
  3090. Emit(Mul(position,result.op, left.op, right.op));
  3091. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3092. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3093. Emit(Add(position,result.op, result.op, tempReg2));
  3094. Emit(Div(position,result.op, result.op, tempReg));
  3095. Reuse2(result.tag, left.tag, right.op);
  3096. Emit(Mul(position,result.tag, left.tag, right.op));
  3097. Emit(Mul(position,tempReg2, left.op, right.tag));
  3098. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3099. Emit(Div(position,result.tag, result.tag, tempReg));
  3100. ReleaseIntermediateOperand(tempReg);
  3101. ReleaseIntermediateOperand(tempReg2)
  3102. ELSE
  3103. InitOperand(result,ModeValue);
  3104. Reuse2a(result.op,left.op,right.op,dest);
  3105. Emit(Div(position,result.op,left.op,right.op));
  3106. END;
  3107. ReleaseOperand(left); ReleaseOperand(right);
  3108. |Scanner.Equal:
  3109. IF ~conditional THEN ConditionToValue(x);
  3110. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3111. CompareString(BreqL,x.left,x.right);
  3112. ELSE
  3113. Evaluate(x.left,left);
  3114. Evaluate(x.right,right);
  3115. IF leftType IS SyntaxTree.RangeType THEN
  3116. ASSERT(rightType IS SyntaxTree.RangeType);
  3117. BrneL(falseLabel, left.op, right.op); (* first *)
  3118. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3119. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3120. ReleaseOperand(left); ReleaseOperand(right);
  3121. BrL(trueLabel)
  3122. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3123. BrneL(falseLabel, left.op, right.op); (* first *)
  3124. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3125. ReleaseOperand(left); ReleaseOperand(right);
  3126. BrL(trueLabel)
  3127. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3128. (* TODO: review this *)
  3129. BrneL(falseLabel, left.op, right.op); (* real part *)
  3130. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3131. ReleaseOperand(left); ReleaseOperand(right);
  3132. BrL(trueLabel)
  3133. ELSE
  3134. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3135. ReleaseOperand(left); ReleaseOperand(right);
  3136. BrL(trueLabel);
  3137. END;
  3138. END;
  3139. |Scanner.LessEqual:
  3140. IF ~conditional THEN ConditionToValue(x);
  3141. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3142. CompareString(BrgeL,x.right,x.left);
  3143. ELSE
  3144. Evaluate(x.left,left);
  3145. Evaluate(x.right,right);
  3146. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3147. Reuse1(temp.op,right.op);
  3148. Emit(And(position,temp.op,left.op,right.op));
  3149. ReleaseOperand(right);
  3150. BreqL(trueLabel,temp.op,left.op);
  3151. BrL(falseLabel);
  3152. ReleaseOperand(temp);ReleaseOperand(left);
  3153. ELSE
  3154. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3155. ReleaseOperand(left); ReleaseOperand(right);
  3156. BrL(trueLabel);
  3157. END;
  3158. END;
  3159. |Scanner.Less:
  3160. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3161. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.LessEqual);
  3162. leftExpression.SetType(system.booleanType);
  3163. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3164. rightExpression.SetType(system.booleanType);
  3165. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3166. leftExpression.SetType(system.booleanType);
  3167. Expression(leftExpression);
  3168. ELSIF ~conditional THEN ConditionToValue(x);
  3169. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3170. CompareString(BrltL,x.left,x.right);
  3171. ELSE
  3172. Evaluate(x.left,left);
  3173. Evaluate(x.right,right);
  3174. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3175. ReleaseOperand(left); ReleaseOperand(right);
  3176. BrL(trueLabel);
  3177. END;
  3178. |Scanner.Greater:
  3179. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3180. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.GreaterEqual);
  3181. leftExpression.SetType(system.booleanType);
  3182. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3183. rightExpression.SetType(system.booleanType);
  3184. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3185. leftExpression.SetType(system.booleanType);
  3186. Expression(leftExpression);
  3187. ELSIF ~conditional THEN ConditionToValue(x);
  3188. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3189. CompareString(BrltL,x.right,x.left);
  3190. ELSE
  3191. Evaluate(x.left,left);
  3192. Evaluate(x.right,right);
  3193. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3194. ReleaseOperand(left); ReleaseOperand(right);
  3195. BrL(trueLabel);
  3196. END;
  3197. |Scanner.GreaterEqual:
  3198. IF ~conditional THEN ConditionToValue(x);
  3199. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3200. CompareString(BrgeL,x.left,x.right);
  3201. ELSE
  3202. Evaluate(x.left,left);
  3203. Evaluate(x.right,right);
  3204. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3205. Reuse1(temp.op,left.op);
  3206. Emit(And(position,temp.op,left.op,right.op));
  3207. ReleaseOperand(left);
  3208. BreqL(trueLabel, temp.op,right.op);
  3209. ReleaseOperand(temp); ReleaseOperand(right);
  3210. BrL(falseLabel);
  3211. ELSE
  3212. BrltL(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.Unequal:
  3218. IF ~conditional THEN ConditionToValue(x);
  3219. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3220. CompareString(BrneL,x.left,x.right);
  3221. ELSE
  3222. Evaluate(x.left,left);
  3223. Evaluate(x.right,right);
  3224. IF leftType IS SyntaxTree.RangeType THEN
  3225. ASSERT(rightType IS SyntaxTree.RangeType);
  3226. BrneL(trueLabel, left.op, right.op); (* first *)
  3227. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3228. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3229. ReleaseOperand(left); ReleaseOperand(right);
  3230. BrL(falseLabel)
  3231. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3232. BrneL(trueLabel, left.op, right.op); (* first *)
  3233. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3234. ReleaseOperand(left); ReleaseOperand(right);
  3235. BrL(falseLabel)
  3236. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3237. (* TODO: review this *)
  3238. BrneL(trueLabel, left.op, right.op); (* real part *)
  3239. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3240. ReleaseOperand(left); ReleaseOperand(right);
  3241. BrL(falseLabel)
  3242. ELSE
  3243. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3244. ReleaseOperand(left); ReleaseOperand(right);
  3245. BrL(trueLabel);
  3246. END;
  3247. END;
  3248. |Scanner.In:
  3249. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3250. Evaluate(x.left,left);
  3251. Evaluate(x.right,right);
  3252. Convert(left.op,setType);
  3253. ReuseCopy(temp.op,right.op);
  3254. Emit(Shr(position,temp.op,temp.op,left.op));
  3255. ReleaseOperand(right); ReleaseOperand(left);
  3256. IntermediateCode.InitImmediate(one,setType,1);
  3257. Emit(And(position,temp.op,temp.op,one));
  3258. IF conditional THEN
  3259. IntermediateCode.InitImmediate(zero,setType,0);
  3260. BrneL(trueLabel,temp.op,zero);
  3261. ReleaseOperand(temp);
  3262. BrL(falseLabel);
  3263. ELSE
  3264. Convert(temp.op,bool);
  3265. result.mode := ModeValue;
  3266. result.op := temp.op;
  3267. result.tag := nil; (* may be left over from calls to evaluate *)
  3268. END;
  3269. ELSE
  3270. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3271. IF x.operator = Scanner.Questionmarks THEN
  3272. leftExpression := x.left;
  3273. rightExpression := x.right;
  3274. ELSE
  3275. leftExpression := x.right;
  3276. rightExpression := x.left;
  3277. END;
  3278. Evaluate(leftExpression, left);
  3279. Emit(Push(position,left.op));
  3280. ReleaseOperand(left);
  3281. Designate(rightExpression, right);
  3282. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3283. IF ~backend.cellsAreObjects THEN
  3284. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3285. END;
  3286. Emit(Push(position,right.op));
  3287. ReleaseOperand(right);
  3288. IF backend.cellsAreObjects THEN
  3289. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3290. ELSE
  3291. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3292. END;
  3293. InitOperand(result, ModeValue);
  3294. result.op := NewRegisterOperand(bool);
  3295. Emit(Result(position,result.op));
  3296. IF conditional THEN
  3297. IntermediateCode.InitImmediate(zero,setType,0);
  3298. BrneL(trueLabel,result.op,zero);
  3299. ReleaseOperand(result);
  3300. BrL(falseLabel);
  3301. END;
  3302. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3303. leftExpression := x.left;
  3304. rightExpression := x.right;
  3305. Evaluate(leftExpression, left);
  3306. Emit(Push(position,left.op));
  3307. ReleaseOperand(left);
  3308. Evaluate(rightExpression, right);
  3309. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3310. IF ~backend.cellsAreObjects THEN
  3311. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3312. END;
  3313. Emit(Push(position,right.op));
  3314. ReleaseOperand(right);
  3315. IF backend.cellsAreObjects THEN
  3316. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3317. ELSE
  3318. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3319. END;
  3320. InitOperand(result, ModeValue);
  3321. result.op := NewRegisterOperand(bool);
  3322. Emit(Result(position,result.op));
  3323. IF conditional THEN
  3324. IntermediateCode.InitImmediate(zero,setType,0);
  3325. BrneL(trueLabel,result.op,zero);
  3326. ReleaseOperand(result);
  3327. BrL(falseLabel);
  3328. END;
  3329. ELSE
  3330. HALT(100);
  3331. END;
  3332. END;
  3333. destination := dest;
  3334. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3335. END VisitBinaryExpression;
  3336. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3337. VAR localResult, operand: Operand;
  3338. BEGIN
  3339. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3340. InitOperand(localResult, ModeValue);
  3341. ASSERT(x.first # NIL);
  3342. Evaluate(x.first, operand);
  3343. localResult.op := operand.op;
  3344. ReleaseOperand(operand);
  3345. UseIntermediateOperand(localResult.op);
  3346. ASSERT(x.last # NIL);
  3347. Evaluate(x.last, operand);
  3348. localResult.tag := operand.op;
  3349. ReleaseOperand(operand);
  3350. UseIntermediateOperand(localResult.tag);
  3351. IF x.step # NIL THEN
  3352. Evaluate(x.step, operand);
  3353. localResult.extra := operand.op;
  3354. ReleaseOperand(operand);
  3355. UseIntermediateOperand(localResult.extra);
  3356. END;
  3357. result := localResult;
  3358. IF Trace THEN TraceExit("VisitRangeExpression") END
  3359. END VisitRangeExpression;
  3360. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3361. BEGIN
  3362. HALT(100); (* should never be evaluated *)
  3363. END VisitTensorRangeExpression;
  3364. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3365. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3366. BEGIN
  3367. IF Trace THEN TraceEnter("VisitConversion") END;
  3368. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3369. dest := destination; destination := emptyOperand;
  3370. Evaluate(x.expression,old);
  3371. InitOperand(result,ModeValue);
  3372. result.op := old.op;
  3373. ASSERT(result.op.mode # 0);
  3374. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3375. (* convert TO a complex number *)
  3376. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3377. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3378. ASSERT(result.op.mode # 0);
  3379. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3380. (* convert FROM a complex number TO a complex number*)
  3381. result.tag := old.tag;
  3382. ASSERT(result.tag.mode # 0);
  3383. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3384. ASSERT(result.tag.mode # 0)
  3385. ELSE
  3386. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3387. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3388. END
  3389. ELSE
  3390. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3391. ASSERT(result.op.mode # 0);
  3392. result.tag := old.tag; (*! probably never used *)
  3393. END;
  3394. destination := dest;
  3395. IF Trace THEN TraceExit("VisitConversion") END;
  3396. END VisitConversion;
  3397. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3398. BEGIN
  3399. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3400. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3401. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3402. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3403. END VisitTypeDeclaration;
  3404. (** designators (expressions) *)
  3405. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3406. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3407. BEGIN
  3408. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3409. IF x.left # NIL THEN Expression(x.left) END;
  3410. Symbol(x.symbol,result);
  3411. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3412. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3413. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3414. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3415. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3416. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3417. END;
  3418. END;
  3419. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3420. END VisitSymbolDesignator;
  3421. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3422. BEGIN
  3423. IF isUnchecked THEN RETURN END;
  3424. IF tagsAvailable THEN
  3425. TrapC(BrltL,index,length,IndexCheckTrap);
  3426. END;
  3427. END BoundCheck;
  3428. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3429. VAR d: IntermediateCode.Operand;
  3430. BEGIN
  3431. IF isUnchecked THEN RETURN END;
  3432. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3433. TrapC(op,dim,d,ArraySizeTrap);
  3434. ReleaseIntermediateOperand(d);
  3435. END DimensionCheck;
  3436. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3437. VAR
  3438. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3439. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3440. expression: SyntaxTree.Expression;
  3441. resultingType, leftType, baseType: SyntaxTree.Type;
  3442. skipLabel1: Label;
  3443. i, indexListSize, indexDim, rangeCount, indexCount, tensorRangeCount, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3444. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3445. variableOp: Operand;
  3446. variable: SyntaxTree.Variable;
  3447. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList; VAR indexCount: LONGINT; VAR rangeCount: LONGINT; VAR tensorRangeCount: LONGINT);
  3448. VAR expression: SyntaxTree.Expression;
  3449. BEGIN
  3450. (* count the number of indices, ranges and tensorRanges in the index list *)
  3451. indexCount := 0; rangeCount := 0; tensorRangeCount := 0;
  3452. FOR i := 0 TO parameters.Length() - 1 DO
  3453. expression := parameters.GetExpression(i);
  3454. IF expression IS SyntaxTree.TensorRangeExpression THEN INC(tensorRangeCount)
  3455. ELSIF (expression.type # NIL) & (expression.type.resolved IS SyntaxTree.RangeType) THEN INC(indexCount)
  3456. ELSE INC(indexCount)
  3457. END
  3458. END;
  3459. END CountIndices;
  3460. BEGIN
  3461. ASSERT(tagsAvailable);
  3462. resultingType := x.type.resolved; (* resulting type *)
  3463. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3464. InitOperand(localResult, ModeReference);
  3465. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3466. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3467. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3468. (* a globally defined array destination tag is available -> use and invalidate it*)
  3469. localResult.tag := arrayDestinationTag;
  3470. IntermediateCode.InitOperand(arrayDestinationTag)
  3471. ELSE
  3472. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3473. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE);
  3474. Symbol(variable, variableOp);
  3475. ReuseCopy(localResult.tag, variableOp.op);
  3476. ReleaseOperand(variableOp);
  3477. END
  3478. END;
  3479. indexListSize := x.parameters.Length();
  3480. CountIndices(x.parameters, indexCount, rangeCount, tensorRangeCount);
  3481. ASSERT(tensorRangeCount <= 1);
  3482. (* designate the array to be indexed over, perform tensor range check if known *)
  3483. Designate(x.left, array);
  3484. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3485. Dereference(array, leftType,FALSE);
  3486. IF tensorRangeCount=0 THEN
  3487. DimensionCheck(array.tag, IntermediateCode.Immediate(int32, rangeCount+indexCount), BreqL)
  3488. END
  3489. END;
  3490. (* determine source and destination dimension offsets; this depends on if the list starts with a '?' *)
  3491. IF x.parameters.GetExpression(0) IS SyntaxTree.TensorRangeExpression THEN
  3492. srcDimOffset := -indexListSize;
  3493. destDimOffset := -rangeCount
  3494. ELSE
  3495. srcDimOffset := 0;
  3496. destDimOffset := 0
  3497. END;
  3498. indexDim := 0;
  3499. (* use address of source array as basis *)
  3500. (*
  3501. ReuseCopy(localResult.op, array.op);
  3502. *)
  3503. localResult.op := array.op;
  3504. UseIntermediateOperand(localResult.op);
  3505. (* go through the index list *)
  3506. FOR i := 0 TO indexListSize - 1 DO
  3507. expression := x.parameters.GetExpression(i);
  3508. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3509. (* nothing to do *)
  3510. ELSE
  3511. (* determine which dimension of source array is currently looked at *)
  3512. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3513. (* get the memory operand pointing to array descriptor dimension *)
  3514. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3515. (* make a reusable register from it *)
  3516. ReuseCopy(srcDim, tmp);
  3517. ReleaseIntermediateOperand(tmp);
  3518. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3519. ELSE
  3520. srcDim := IntermediateCode.Immediate(int32, i)
  3521. END;
  3522. (* get length and increment of source array for current dimension *)
  3523. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3524. Convert(sourceLength.op, sizeType);
  3525. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3526. Convert(sourceIncrement.op, sizeType);
  3527. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3528. ReleaseIntermediateOperand(srcDim);
  3529. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3530. (* SINGLE INDEX *)
  3531. Evaluate(expression, index);
  3532. ReleaseIntermediateOperand(index.tag);
  3533. index.tag := emptyOperand;
  3534. Convert(index.op, sizeType);
  3535. (* lower bound check *)
  3536. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3537. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3538. ELSIF isUnchecked THEN (* do nothing *)
  3539. ELSE
  3540. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3541. END;
  3542. (* upper bound check *)
  3543. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3544. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3545. ELSIF isUnchecked THEN (* do nothing *)
  3546. ELSE
  3547. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3548. END;
  3549. ReleaseOperand(sourceLength);
  3550. Convert(index.op, addressType);
  3551. summand := index.op;
  3552. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3553. (* RANGE OF INDICES *)
  3554. Evaluate(expression, range);
  3555. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3556. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3557. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3558. ReleaseOperand(range);
  3559. Convert(firstIndex, sizeType);
  3560. Convert(lastIndex, sizeType);
  3561. Convert(stepSize, sizeType);
  3562. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3563. if it is 'MAX(LONGINT)' *)
  3564. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3565. TransferToRegister(lastIndex, lastIndex);
  3566. skipLabel1 := NewLabel();
  3567. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3568. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3569. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3570. SetLabel(skipLabel1)
  3571. END;
  3572. (* check if step size is valid *)
  3573. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3574. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3575. ELSIF isUnchecked THEN (* do nothing *)
  3576. ELSE
  3577. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3578. END;
  3579. (* check lower bound check *)
  3580. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3581. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3582. ELSIF isUnchecked THEN (* do nothing *)
  3583. ELSE
  3584. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3585. END;
  3586. (* check upper bound check *)
  3587. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3588. (* statically open range: nothing to do *)
  3589. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3590. ASSERT(staticLastIndex < staticSourceLength)
  3591. ELSIF isUnchecked THEN (* do nothing *)
  3592. ELSE
  3593. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3594. END;
  3595. (* determine length of target array for current dimension *)
  3596. (* 1. incorporate last index: *)
  3597. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3598. (* last index is static *)
  3599. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3600. targetLength := sourceLength.op
  3601. ELSE
  3602. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3603. END;
  3604. UseIntermediateOperand(targetLength);
  3605. ELSE
  3606. (* targetLength := lastIndex + 1
  3607. Reuse1(targetLength, lastIndex);
  3608. *)
  3609. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3610. END;
  3611. ReleaseOperand(sourceLength);
  3612. ReleaseIntermediateOperand(lastIndex);
  3613. (* 2. incorporate first index: *)
  3614. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3615. (* first index and current target length are static *)
  3616. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3617. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3618. (* first index = 0: nothing to do *)
  3619. ELSE
  3620. (* targetLength := targetLength - firstIndex *)
  3621. TransferToRegister(targetLength, targetLength);
  3622. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3623. END;
  3624. (* clip negative lengths to 0 *)
  3625. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3626. IF staticTargetLength < 0 THEN
  3627. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3628. END
  3629. ELSE
  3630. skipLabel1 := NewLabel();
  3631. TransferToRegister(targetLength, targetLength);
  3632. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3633. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3634. SetLabel(skipLabel1)
  3635. END;
  3636. (* 3. incorporate index step size: *)
  3637. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3638. (*step size and current target length are static *)
  3639. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3640. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3641. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3642. (* step size = 1: nothing to do *)
  3643. ELSE
  3644. (* emit code for this:
  3645. targetLength := (targetLength-1) DIV stepSize +1;
  3646. *)
  3647. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3648. DivInt(targetLength, targetLength, stepSize);
  3649. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3650. END;
  3651. (* determine increment of target array for current dimension *)
  3652. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3653. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3654. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3655. (* step size = 1 *)
  3656. targetIncrement := sourceIncrement.op;
  3657. UseIntermediateOperand(targetIncrement)
  3658. ELSE
  3659. (* targetIncrement := sourceIncrement * stepSize *)
  3660. Reuse1(targetIncrement, stepSize);
  3661. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3662. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3663. END;
  3664. ReleaseIntermediateOperand(stepSize);
  3665. (* write length and increment of target array to descriptor *)
  3666. IF destDimOffset < 0 THEN
  3667. (* determine which dimension of target array is currently looked at *)
  3668. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3669. TransferToRegister(destDim, tmp);
  3670. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, indexDim + destDimOffset));
  3671. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3672. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3673. ReleaseIntermediateOperand(destDim)
  3674. ELSE
  3675. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3676. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim)
  3677. END;
  3678. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3679. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3680. INC(indexDim);
  3681. Convert(firstIndex, addressType);
  3682. TransferToRegister(summand, firstIndex);
  3683. ELSE HALT(100);
  3684. END;
  3685. (*
  3686. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3687. *)
  3688. Convert(sourceIncrement.op, addressType);
  3689. Convert(summand, addressType);
  3690. MulInt(summand, summand, sourceIncrement.op);
  3691. ReleaseIntermediateOperand(sourceIncrement.op);
  3692. AddInt(localResult.op, localResult.op, summand);
  3693. ReleaseIntermediateOperand(summand);
  3694. END
  3695. END;
  3696. result := localResult;
  3697. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3698. ReleaseIntermediateOperand(result.tag);
  3699. result.tag := TypeDescriptorAdr(resultingType);
  3700. IF ~newObjectFile THEN
  3701. IntermediateCode.MakeMemory(result.tag,addressType);
  3702. END;
  3703. ELSIF IsDelegate(resultingType) THEN
  3704. ReleaseIntermediateOperand(result.tag);
  3705. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3706. UseIntermediateOperand(result.tag);
  3707. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3708. ReleaseIntermediateOperand(result.tag);
  3709. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3710. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3711. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3712. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3713. (* finalize target array descriptor *)
  3714. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3715. (* write lengths and increments of target array for remaining dimensions *)
  3716. i := indexListSize;
  3717. WHILE indexDim < targetArrayDimensionality DO
  3718. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3719. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3720. ReleaseOperand(sourceLength);
  3721. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3722. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3723. ReleaseOperand(sourceIncrement);
  3724. INC(i); INC(indexDim);
  3725. END;
  3726. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3727. tmp := nil;
  3728. ELSE
  3729. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3730. END;
  3731. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3732. ReleaseIntermediateOperand(tmp);
  3733. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3734. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3735. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3736. ELSE
  3737. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3738. END;
  3739. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3740. ReleaseIntermediateOperand(tmp);
  3741. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3742. (* write dimensionality *)
  3743. IF targetArrayDimensionality # 0 THEN
  3744. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3745. END;
  3746. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3747. END;
  3748. ReleaseOperand(array);
  3749. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3750. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3751. END;
  3752. END MathIndexDesignator;
  3753. (* TENTATIVE *)
  3754. PROCEDURE DumpOperand(operand: Operand);
  3755. BEGIN
  3756. D.Log.String(" op = ");
  3757. IntermediateCode.DumpOperand(D.Log, operand.op );
  3758. D.Log.Ln;
  3759. D.Log.String(" tag = ");
  3760. IntermediateCode.DumpOperand(D.Log, operand.tag );
  3761. D.Log.Ln;
  3762. D.Log.String(" extra = ");
  3763. IntermediateCode.DumpOperand(D.Log, operand.extra );
  3764. D.Log.Ln;
  3765. D.Log.Update
  3766. END DumpOperand;
  3767. (* get the length of an array , trying to make use of static information *)
  3768. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3769. VAR res: IntermediateCode.Operand; size: LONGINT;
  3770. BEGIN
  3771. type := type.resolved;
  3772. IF type IS SyntaxTree.ArrayType THEN
  3773. WITH type: SyntaxTree.ArrayType DO
  3774. IF type.form = SyntaxTree.Static THEN
  3775. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3776. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3777. Evaluate(type.length, op);
  3778. ReleaseIntermediateOperand(op.tag);
  3779. RETURN op.op;*)
  3780. ELSE
  3781. res := tag;
  3782. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3783. IntermediateCode.MakeMemory(res,addressType);
  3784. UseIntermediateOperand(res);
  3785. RETURN res
  3786. END
  3787. END;
  3788. ELSE
  3789. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3790. RETURN IntermediateCode.Immediate(addressType,size);
  3791. END;
  3792. END ArrayLength;
  3793. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3794. BEGIN
  3795. ReleaseIntermediateOperand(res);
  3796. IF IsImmediate(x) & IsImmediate(y) THEN
  3797. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3798. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3799. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3800. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3801. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3802. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3803. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3804. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3805. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3806. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3807. UseIntermediateOperand(res);
  3808. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3809. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3810. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3811. UseIntermediateOperand(res);
  3812. ELSE
  3813. IF ~ReusableRegister(res) THEN
  3814. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3815. ELSE
  3816. UseIntermediateOperand(res);
  3817. END;
  3818. IF IsImmediate(x) & (x.intValue = 0) THEN
  3819. Emit(Mov(position,res,y))
  3820. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3821. Emit(Mov(position,res,x))
  3822. ELSE
  3823. Emit(Add(position,res, x, y));
  3824. END;
  3825. END;
  3826. END AddInt;
  3827. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3828. BEGIN
  3829. ReleaseIntermediateOperand(res);
  3830. IF IsImmediate(x) & IsImmediate(y) THEN
  3831. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3832. ELSE
  3833. IF ~ReusableRegister(res) THEN
  3834. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3835. ELSE UseIntermediateOperand(res);
  3836. END;
  3837. IF IsImmediate(x) & (x.intValue = 1) THEN
  3838. Emit(Mov(position,res,y))
  3839. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3840. Emit(Mov(position,res,x))
  3841. ELSE
  3842. Emit(Mul(position,res, x, y));
  3843. END;
  3844. END;
  3845. END MulInt;
  3846. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3847. BEGIN
  3848. ReleaseIntermediateOperand(res);
  3849. IF IsImmediate(x) & IsImmediate(y) THEN
  3850. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3851. ELSE
  3852. IF ~ReusableRegister(res) THEN
  3853. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3854. ELSE UseIntermediateOperand(res);
  3855. END;
  3856. IF IsImmediate(x) & (x.intValue = 1) THEN
  3857. Emit(Mov(position,res,y))
  3858. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3859. Emit(Mov(position,res,x))
  3860. ELSE
  3861. Emit(Div(position,res, x, y));
  3862. END;
  3863. END;
  3864. END DivInt;
  3865. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3866. VAR length,res: IntermediateCode.Operand; type: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3867. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3868. BEGIN
  3869. type := x.left.type.resolved;
  3870. IF type IS SyntaxTree.StringType THEN
  3871. atype := SyntaxTree.NewArrayType(-1, NIL, SyntaxTree.Static);
  3872. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3873. atype.SetLength(Global.NewIntegerValue(system,-1, type(SyntaxTree.StringType).length));
  3874. type := atype;
  3875. x.left.SetType(type);
  3876. END;
  3877. IntermediateCode.InitImmediate(res,addressType,0);
  3878. maxDim := x.parameters.Length()-1;
  3879. FOR i := 0 TO maxDim DO
  3880. e := x.parameters.GetExpression(i);
  3881. Evaluate(e,index);
  3882. Convert(index.op,addressType);
  3883. AddInt(res, res, index.op);
  3884. IF i = 0 THEN
  3885. (*
  3886. ReuseCopy(res, index.op);
  3887. *)
  3888. Designate(x.left,array);
  3889. type := x.left.type.resolved;
  3890. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3891. Dereference(array, type, FALSE);
  3892. END;
  3893. (*
  3894. ELSE AddInt(res, res, index.op);
  3895. *)
  3896. END;
  3897. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  3898. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  3899. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  3900. BoundCheck(index.op, length);
  3901. END;
  3902. ReleaseIntermediateOperand(length);
  3903. END;
  3904. ReleaseOperand(index);
  3905. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3906. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  3907. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3908. MulInt(res,res,length);
  3909. END;
  3910. ReleaseIntermediateOperand(length);
  3911. END;
  3912. IF (type IS SyntaxTree.ArrayType) THEN
  3913. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  3914. size := StaticSize(system, type);
  3915. IF size # 1 THEN
  3916. length := IntermediateCode.Immediate(addressType,size);
  3917. MulInt(res,res,length);
  3918. END;
  3919. ELSE
  3920. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  3921. IF size # 1 THEN
  3922. length := IntermediateCode.Immediate(addressType,size);
  3923. MulInt(res,res,length);
  3924. END;
  3925. END;
  3926. END;
  3927. AddInt(res,res,array.op);
  3928. InitOperand(result,ModeReference);
  3929. result.op := res;
  3930. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  3931. ReleaseIntermediateOperand(result.tag);
  3932. result.tag := TypeDescriptorAdr(type);
  3933. IF ~newObjectFile THEN
  3934. IntermediateCode.MakeMemory(result.tag,addressType);
  3935. END
  3936. ELSIF IsDelegate(type) THEN
  3937. ReleaseIntermediateOperand(result.tag);
  3938. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3939. UseIntermediateOperand(result.tag);
  3940. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3941. ReleaseIntermediateOperand(result.tag);
  3942. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  3943. ELSIF (type IS SyntaxTree.ArrayType) THEN
  3944. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  3945. END;
  3946. ReleaseOperand(array);
  3947. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  3948. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3949. END;
  3950. END IndexDesignator;
  3951. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  3952. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  3953. BEGIN
  3954. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  3955. dest := destination; destination := emptyOperand;
  3956. type := x.left.type.resolved;
  3957. IF type IS SyntaxTree.MathArrayType THEN
  3958. MathIndexDesignator(x);
  3959. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  3960. IndexDesignator(x);
  3961. END;
  3962. destination := dest;
  3963. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  3964. END VisitIndexDesignator;
  3965. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  3966. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  3967. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  3968. procedure: SyntaxTree.Procedure;
  3969. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  3970. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  3971. BEGIN
  3972. variable := GetTemporaryVariable(expression.left.type, FALSE);
  3973. parameters := expression.parameters;
  3974. moduleName := "FoxArrayBase";
  3975. procedureName := "CopyDescriptor";
  3976. IF AddImport(moduleName,arrayBase,TRUE) THEN
  3977. SaveRegisters();ReleaseUsedRegisters(saved);
  3978. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3979. IF procedure = NIL THEN
  3980. s := "procedure ";
  3981. Strings.Append(s,moduleName);
  3982. Strings.Append(s,".");
  3983. Strings.Append(s,procedureName);
  3984. Strings.Append(s," not present");
  3985. Error(position,s);
  3986. ELSE
  3987. (* push address of temporary variable *)
  3988. Symbol(variable,destOperand);
  3989. Emit(Push(position,destOperand.op));
  3990. ReleaseOperand(destOperand);
  3991. (* push src *)
  3992. Evaluate(expression.left,srcOperand);
  3993. (*
  3994. Dereference(srcOperand,expression.type.resolved);
  3995. Emit(Push(position,srcOperand.tag));
  3996. *)
  3997. Emit(Push(position,srcOperand.op));
  3998. ReleaseOperand(srcOperand);
  3999. tensorFound := FALSE;
  4000. FOR i := 0 TO parameters.Length()-1 DO
  4001. e := parameters.GetExpression(i);
  4002. IF e IS SyntaxTree.TensorRangeExpression THEN
  4003. tensorFound := TRUE;
  4004. ELSIF e IS SyntaxTree.RangeExpression THEN
  4005. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4006. ELSE
  4007. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4008. END;
  4009. END;
  4010. Emit(Push(position,IntermediateCode.Immediate(int32,prefixIndices)));
  4011. Emit(Push(position,IntermediateCode.Immediate(int32,prefixRanges)));
  4012. Emit(Push(position,IntermediateCode.Immediate(int32,suffixIndices)));
  4013. Emit(Push(position,IntermediateCode.Immediate(int32,suffixRanges)));
  4014. StaticCallOperand(procOp,procedure);
  4015. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  4016. ReleaseOperand(procOp);
  4017. END;
  4018. RestoreRegisters(saved);
  4019. END;
  4020. RETURN variable
  4021. END PrepareTensorDescriptor;
  4022. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4023. VAR
  4024. type, descriptorType, baseType: SyntaxTree.Type;
  4025. operand, tmpOperand, variableOp, variable2Op: Operand;
  4026. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4027. variable, variable2: SyntaxTree.Variable;
  4028. dim, i, size: LONGINT;
  4029. (* TODO: needed? *)
  4030. oldArrayDestinationTag: IntermediateCode.Operand;
  4031. oldArrayDestinationDimension: LONGINT;
  4032. position: LONGINT;
  4033. saved: RegisterEntry;
  4034. arrayFlags: SET;
  4035. m, n: LONGINT;
  4036. PROCEDURE Pass(op: IntermediateCode.Operand);
  4037. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4038. BEGIN
  4039. IF numberRegister >= 0 THEN
  4040. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  4041. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4042. Emit(Mov(position,parameterRegister, op));
  4043. ELSE
  4044. Emit(Push(position,op))
  4045. END
  4046. END Pass;
  4047. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4048. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4049. BEGIN
  4050. formalType := formalType.resolved; actualType := actualType.resolved;
  4051. IF IsOpenArray(formalType)THEN
  4052. IF actualType IS SyntaxTree.StringType THEN
  4053. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4054. RETURN;
  4055. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4056. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4057. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4058. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4059. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4060. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4061. ELSE
  4062. tmp := baseReg;
  4063. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4064. IntermediateCode.MakeMemory(tmp,addressType);
  4065. Pass((tmp));
  4066. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4067. END;
  4068. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4069. END;
  4070. END PushArrayLens;
  4071. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4072. BEGIN
  4073. CASE size OF
  4074. |2: INCL(flags,Size2Flag);
  4075. |3: INCL(flags,Size3Flag);
  4076. |4: INCL(flags,Size4Flag);
  4077. |5: INCL(flags,Size5Flag);
  4078. |6: INCL(flags,Size6Flag);
  4079. |7: INCL(flags,Size7Flag);
  4080. |8: INCL(flags,Size8Flag);
  4081. END;
  4082. END SetSmallArraySizeFlag;
  4083. BEGIN
  4084. IF Trace THEN TraceEnter("PushParameter") END;
  4085. position := expression.position;
  4086. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4087. type := expression.type.resolved;
  4088. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4089. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4090. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4091. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4092. );
  4093. (* TODO: needed? *)
  4094. oldArrayDestinationTag := arrayDestinationTag;
  4095. oldArrayDestinationDimension := arrayDestinationDimension;
  4096. IF IsArrayOfSystemByte(parameter.type) THEN
  4097. Designate(expression,operand);
  4098. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4099. ReleaseIntermediateOperand(operand.tag);
  4100. operand.tag := tmp;
  4101. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4102. Pass((operand.tag));
  4103. END;
  4104. Pass((operand.op));
  4105. ELSIF IsOpenArray(parameter.type) THEN
  4106. Designate(expression,operand);
  4107. baseReg := operand.tag;
  4108. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4109. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4110. END;
  4111. Pass((operand.op)); (* address of the array *)
  4112. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4113. (* case 1 *)
  4114. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4115. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4116. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4117. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4118. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4119. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4120. arrayDestinationTag := sp;
  4121. (* case 1b *)
  4122. IF expression IS SyntaxTree.IndexDesignator THEN
  4123. (*
  4124. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4125. descriptorType := GetMathArrayDescriptorType(dim);
  4126. variable := GetTemporaryVariable(descriptorType,expression.position);
  4127. Symbol(variable,variableOp);
  4128. arrayDestinationTag := variableOp.op;
  4129. *)
  4130. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4131. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4132. arrayDestinationDimension := dim;
  4133. Designate(expression,operand);
  4134. (* case 1a *)
  4135. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4136. Designate(expression,operand);
  4137. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4138. i := 0;
  4139. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4140. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4141. INC(i);
  4142. END;
  4143. type := expression.type.resolved;
  4144. WHILE (i<dim) DO (* remaining static dimensions *)
  4145. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4146. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4147. ReleaseOperand(tmpOperand);
  4148. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4149. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4150. ReleaseOperand(tmpOperand);
  4151. INC(i);
  4152. END;
  4153. dimOp := IntermediateCode.Immediate(addressType,dim);
  4154. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4155. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4156. (* case 1d *)
  4157. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4158. Designate(expression,operand);
  4159. Dereference(operand,type.resolved,FALSE);
  4160. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4161. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4162. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4163. (* case 1f *)
  4164. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4165. Designate(expression,operand);
  4166. FOR i := 0 TO dim-1 DO
  4167. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4168. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4169. ReleaseOperand(tmpOperand);
  4170. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4171. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4172. ReleaseOperand(tmpOperand);
  4173. END;
  4174. (*******
  4175. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4176. *)
  4177. arrayFlags := {StaticFlag};
  4178. IF dim = 1 THEN
  4179. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4180. ReleaseOperand(tmpOperand);
  4181. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4182. m := LONGINT(tmpOperand.op.intValue);
  4183. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4184. ELSIF dim = 2 THEN
  4185. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4186. ReleaseOperand(tmpOperand);
  4187. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4188. m := LONGINT(tmpOperand.op.intValue);
  4189. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4190. ReleaseOperand(tmpOperand);
  4191. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4192. n := LONGINT(tmpOperand.op.intValue);
  4193. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4194. INCL(arrayFlags,SmallMatrixFlag);
  4195. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4196. END;
  4197. END;
  4198. (*******)
  4199. dimOp := IntermediateCode.Immediate(addressType,dim);
  4200. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4201. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4202. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4203. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4204. baseType := SemanticChecker.ArrayBase(type,dim);
  4205. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4206. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4207. ELSE HALT(100);
  4208. END;
  4209. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4210. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4211. (* case 2b *)
  4212. IF expression IS SyntaxTree.IndexDesignator THEN
  4213. descriptorType := GetMathArrayDescriptorType(dim);
  4214. variable := GetTemporaryVariable(descriptorType, FALSE);
  4215. Symbol(variable,variableOp);
  4216. arrayDestinationTag := variableOp.op;
  4217. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4218. arrayDestinationDimension := dim;
  4219. NeedDescriptor := TRUE;
  4220. Designate(expression,operand);
  4221. Pass((operand.tag));
  4222. NeedDescriptor := FALSE;
  4223. (* case 2a *)
  4224. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4225. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4226. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4227. INC(i);
  4228. END;
  4229. IF i = dim THEN
  4230. Designate(expression,operand);
  4231. Pass((operand.tag));
  4232. ELSE (* open-static *)
  4233. type := expression.type.resolved;
  4234. descriptorType := GetMathArrayDescriptorType(dim);
  4235. variable := GetTemporaryVariable(descriptorType, FALSE);
  4236. Symbol(variable,variableOp);
  4237. arrayDestinationTag := variableOp.op;
  4238. Designate(expression,operand);
  4239. FOR i := 0 TO dim-1 DO
  4240. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4241. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4242. ReleaseOperand(tmpOperand);
  4243. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4244. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4245. ReleaseOperand(tmpOperand);
  4246. END;
  4247. dimOp := IntermediateCode.Immediate(addressType,dim);
  4248. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4249. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4250. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4251. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4252. baseType := SemanticChecker.ArrayBase(type,dim);
  4253. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4254. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4255. Pass((arrayDestinationTag));
  4256. END;
  4257. (* case 2d *)
  4258. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4259. Designate(expression,operand);
  4260. Dereference(operand,type.resolved,FALSE);
  4261. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4262. Pass((operand.tag));
  4263. (* case 2f *)
  4264. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4265. descriptorType := GetMathArrayDescriptorType(dim);
  4266. variable := GetTemporaryVariable(descriptorType, FALSE);
  4267. Symbol(variable,variableOp);
  4268. arrayDestinationTag := variableOp.op;
  4269. Designate(expression,operand);
  4270. FOR i := 0 TO dim-1 DO
  4271. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4272. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4273. ReleaseOperand(tmpOperand);
  4274. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4275. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4276. ReleaseOperand(tmpOperand);
  4277. END;
  4278. (*
  4279. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4280. *)
  4281. arrayFlags := {StaticFlag};
  4282. IF dim = 1 THEN
  4283. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4284. ReleaseOperand(tmpOperand);
  4285. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4286. m := LONGINT(tmpOperand.op.intValue);
  4287. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4288. ELSIF dim = 2 THEN
  4289. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4290. ReleaseOperand(tmpOperand);
  4291. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4292. m := LONGINT(tmpOperand.op.intValue);
  4293. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4294. ReleaseOperand(tmpOperand);
  4295. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4296. n := LONGINT(tmpOperand.op.intValue);
  4297. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4298. INCL(arrayFlags,SmallMatrixFlag);
  4299. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4300. END;
  4301. END;
  4302. (*******)
  4303. dimOp := IntermediateCode.Immediate(addressType,dim);
  4304. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4305. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4306. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4307. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4308. baseType := SemanticChecker.ArrayBase(type,dim);
  4309. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4310. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4311. Pass((arrayDestinationTag));
  4312. ELSE HALT(100);
  4313. END;
  4314. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4315. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4316. (* case 3b *)
  4317. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4318. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4319. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4320. Symbol(variable,variableOp);
  4321. LoadValue(variableOp,system.addressType);
  4322. ELSE
  4323. descriptorType := GetMathArrayDescriptorType(dim);
  4324. variable := GetTemporaryVariable(descriptorType, FALSE);
  4325. Symbol(variable,variableOp);
  4326. END;
  4327. arrayDestinationTag := variableOp.op;
  4328. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4329. arrayDestinationDimension := 0;
  4330. Designate(expression,operand);
  4331. Pass((operand.tag));
  4332. (* case 3a *)
  4333. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4334. i := 0;
  4335. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4336. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4337. INC(i);
  4338. END;
  4339. IF i = dim THEN
  4340. Designate(expression,operand);
  4341. Pass((operand.tag));
  4342. ELSE (* open-static *)
  4343. type := expression.type.resolved;
  4344. descriptorType := GetMathArrayDescriptorType(dim);
  4345. variable := GetTemporaryVariable(descriptorType, FALSE);
  4346. Symbol(variable,variableOp);
  4347. arrayDestinationTag := variableOp.op;
  4348. Designate(expression,operand);
  4349. FOR i := 0 TO dim-1 DO
  4350. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4351. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4352. ReleaseOperand(tmpOperand);
  4353. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4354. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4355. ReleaseOperand(tmpOperand);
  4356. END;
  4357. dimOp := IntermediateCode.Immediate(addressType,dim);
  4358. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4359. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4360. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4361. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4362. baseType := SemanticChecker.ArrayBase(type,dim);
  4363. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4364. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4365. Pass((arrayDestinationTag));
  4366. END;
  4367. (* case 3d *)
  4368. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4369. Designate(expression,operand);
  4370. Dereference(operand,type.resolved,FALSE);
  4371. (*
  4372. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4373. *)
  4374. Pass((operand.tag));
  4375. (* case 3f *)
  4376. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4377. descriptorType := GetMathArrayDescriptorType(dim);
  4378. variable := GetTemporaryVariable(descriptorType, FALSE);
  4379. Symbol(variable,variableOp);
  4380. arrayDestinationTag := variableOp.op;
  4381. Designate(expression,operand);
  4382. IF operand.op.type.length >1 THEN (* vector register *)
  4383. variable2 := GetTemporaryVariable(type, FALSE);
  4384. Symbol(variable2, variable2Op);
  4385. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4386. Emit(Mov(position,tmp, operand.op));
  4387. ReleaseOperand(operand);
  4388. Symbol(variable2, operand);
  4389. END;
  4390. FOR i := 0 TO dim-1 DO
  4391. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4392. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4393. ReleaseOperand(tmpOperand);
  4394. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4395. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4396. ReleaseOperand(tmpOperand);
  4397. END;
  4398. dimOp := IntermediateCode.Immediate(addressType,dim);
  4399. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4400. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4401. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4402. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4403. baseType := SemanticChecker.ArrayBase(type,dim);
  4404. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4405. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4406. Pass((arrayDestinationTag));
  4407. ELSE HALT(100);
  4408. END;
  4409. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4410. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4411. (* case 4b *)
  4412. IF (expression IS SyntaxTree.IndexDesignator) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4413. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4414. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4415. Symbol(variable,variableOp);
  4416. LoadValue(variableOp,system.addressType);
  4417. ELSE
  4418. descriptorType := GetMathArrayDescriptorType(dim);
  4419. variable := GetTemporaryVariable(descriptorType, FALSE);
  4420. Symbol(variable,variableOp);
  4421. END;
  4422. arrayDestinationTag := variableOp.op;
  4423. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4424. arrayDestinationDimension := 0;
  4425. Designate(expression,operand);
  4426. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4427. Symbol(variable,variableOp);
  4428. ELSE
  4429. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4430. Symbol(variable,variableOp);
  4431. MakeMemory(tmp,variableOp.op,addressType,0);
  4432. Emit(Mov(position,tmp,operand.tag));
  4433. ReleaseIntermediateOperand(tmp);
  4434. END;
  4435. Pass((variableOp.op));
  4436. ReleaseOperand(variableOp);
  4437. (* case 4a *)
  4438. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4439. i := 0;
  4440. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4441. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4442. INC(i);
  4443. END;
  4444. IF i = dim THEN
  4445. Designate(expression,operand);
  4446. arrayDestinationTag := operand.tag;
  4447. ELSE (* open-static *)
  4448. type := expression.type.resolved;
  4449. descriptorType := GetMathArrayDescriptorType(dim);
  4450. variable := GetTemporaryVariable(descriptorType, FALSE);
  4451. Symbol(variable,variableOp);
  4452. arrayDestinationTag := variableOp.op;
  4453. Designate(expression,operand);
  4454. FOR i := 0 TO dim-1 DO
  4455. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4456. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4457. ReleaseOperand(tmpOperand);
  4458. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4459. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4460. ReleaseOperand(tmpOperand);
  4461. END;
  4462. dimOp := IntermediateCode.Immediate(addressType,dim);
  4463. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4464. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4465. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4466. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4467. baseType := SemanticChecker.ArrayBase(type,dim);
  4468. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4469. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4470. END;
  4471. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4472. Symbol(variable,variableOp);
  4473. MakeMemory(tmp,variableOp.op,addressType,0);
  4474. Emit(Mov(position,tmp,arrayDestinationTag));
  4475. ReleaseIntermediateOperand(tmp);
  4476. Pass((variableOp.op));
  4477. ReleaseOperand(variableOp);
  4478. (* case 4d *)
  4479. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4480. Designate(expression,operand);
  4481. (*
  4482. Dereference(operand,type.resolved,FALSE);
  4483. *)
  4484. (*
  4485. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4486. *)
  4487. Pass((operand.op));
  4488. (* case 4f *)
  4489. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4490. descriptorType := GetMathArrayDescriptorType(dim);
  4491. variable := GetTemporaryVariable(descriptorType, FALSE);
  4492. Symbol(variable,variableOp);
  4493. arrayDestinationTag := variableOp.op;
  4494. Designate(expression,operand);
  4495. FOR i := 0 TO dim-1 DO
  4496. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4497. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4498. ReleaseOperand(tmpOperand);
  4499. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4500. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4501. ReleaseOperand(tmpOperand);
  4502. END;
  4503. dimOp := IntermediateCode.Immediate(addressType,dim);
  4504. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4505. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4506. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4507. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4508. baseType := SemanticChecker.ArrayBase(type,dim);
  4509. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4510. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4511. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4512. Symbol(variable,variableOp);
  4513. MakeMemory(tmp,variableOp.op,addressType,0);
  4514. Emit(Mov(position,tmp,arrayDestinationTag));
  4515. ReleaseIntermediateOperand(tmp);
  4516. Pass((variableOp.op));
  4517. ReleaseOperand(variableOp);
  4518. ELSE HALT(100);
  4519. END;
  4520. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4521. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4522. Designate(expression,operand);
  4523. IF operand.op.type.length > 1 THEN
  4524. Emit(Push(position, operand.op));
  4525. ReleaseOperand(operand);
  4526. ELSE
  4527. size := system.SizeOf(type);
  4528. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4529. size := ToMemoryUnits(system,size);
  4530. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4531. arrayDestinationTag := sp;
  4532. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4533. END;
  4534. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4535. Designate(expression,operand);
  4536. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4537. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4538. Symbol(variable,variableOp);
  4539. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4540. Emit(Mov(position,tmp,operand.op));
  4541. Emit(Push(position,variableOp.op));
  4542. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4543. Pass((operand.op));
  4544. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4545. END;
  4546. ELSE HALT(200)
  4547. END;
  4548. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4549. IF parameter.kind = SyntaxTree.VarParameter THEN
  4550. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4551. Designate(expression, operand);
  4552. Pass((operand.op));
  4553. ELSE
  4554. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4555. Evaluate(expression, operand);
  4556. Pass((operand.extra)); (* step *)
  4557. Pass((operand.tag)); (* last *)
  4558. Pass((operand.op)) (* first *)
  4559. END
  4560. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4561. IF parameter.kind = SyntaxTree.VarParameter THEN
  4562. Designate(expression, operand);
  4563. Pass((operand.op));
  4564. ELSE
  4565. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4566. Evaluate(expression, operand);
  4567. Pass((operand.tag)); (* real part *)
  4568. Pass((operand.op)) (* imaginary part *)
  4569. END
  4570. ELSE
  4571. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4572. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4573. Designate(expression,operand);
  4574. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4575. (* stack allocation *)
  4576. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4577. (*! parameter alignment to be discussed ... *)
  4578. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4579. size := type(SyntaxTree.StringType).length;
  4580. END;
  4581. IF backend.cooperative & parameter.NeedsTrace() THEN
  4582. dst := NewRegisterOperand (addressType);
  4583. Emit(Mov(position,dst, sp));
  4584. IntermediateCode.InitImmediate(null, byteType, 0);
  4585. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4586. ReleaseIntermediateOperand(dst);
  4587. SaveRegisters();ReleaseUsedRegisters(saved);
  4588. (* register dst has been freed before SaveRegisters already *)
  4589. CallAssignMethod(dst, operand.op, parameter.type);
  4590. RestoreRegisters(saved);
  4591. END;
  4592. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4593. ELSIF IsOpenArray(parameter.type) THEN
  4594. Designate(expression,operand);
  4595. baseReg := operand.tag;
  4596. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4597. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4598. END;
  4599. Pass((operand.op)); (* address of the array *)
  4600. ELSIF IsDelegate(parameter.type) THEN
  4601. Evaluate(expression,operand);
  4602. IF backend.cooperative & parameter.NeedsTrace() THEN
  4603. Emit(Push(position, nil));
  4604. dst := NewRegisterOperand (addressType);
  4605. Emit(Mov(position,dst, sp));
  4606. ReleaseIntermediateOperand(dst);
  4607. SaveRegisters();ReleaseUsedRegisters(saved);
  4608. Emit(Push(position, dst));
  4609. (* register dst has been freed before SaveRegisters already *)
  4610. Emit(Push(position, operand.tag));
  4611. CallThis(position,"GarbageCollector","Assign",2);
  4612. RestoreRegisters(saved);
  4613. ELSE
  4614. Pass((operand.tag));
  4615. END;
  4616. Pass((operand.op));
  4617. ELSE
  4618. Evaluate(expression,operand);
  4619. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4620. Emit(Push(position, nil));
  4621. dst := NewRegisterOperand (addressType);
  4622. Emit(Mov(position,dst, sp));
  4623. ReleaseIntermediateOperand(dst);
  4624. SaveRegisters();ReleaseUsedRegisters(saved);
  4625. Emit(Push(position, dst));
  4626. (* register dst has been freed before SaveRegisters already *)
  4627. Emit(Push(position, operand.op));
  4628. CallThis(position,"GarbageCollector","Assign",2);
  4629. RestoreRegisters(saved);
  4630. ELSE
  4631. Pass((operand.op));
  4632. END;
  4633. END;
  4634. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4635. Evaluate(expression,operand);
  4636. Pass((operand.op));
  4637. ELSE (* var parameter *)
  4638. Designate(expression,operand);
  4639. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4640. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4641. Pass((operand.tag));
  4642. END;
  4643. END;
  4644. Pass((operand.op));
  4645. END;
  4646. END;
  4647. (* TODO: needed? *)
  4648. arrayDestinationTag := oldArrayDestinationTag;
  4649. arrayDestinationDimension := oldArrayDestinationDimension;
  4650. IF needsParameterBackup THEN
  4651. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4652. ReuseCopy(parameterBackup, operand.op)
  4653. END;
  4654. ReleaseOperand(operand);
  4655. IF Trace THEN TraceExit("PushParameter") END;
  4656. END PushParameter;
  4657. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4658. VAR prevConditional: BOOLEAN;
  4659. BEGIN
  4660. prevConditional := conditional;
  4661. conditional := FALSE;
  4662. 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
  4663. Expression(x.result); (* use register *)
  4664. END;
  4665. Statement(x.statement);
  4666. conditional := prevConditional;
  4667. IF x.result # NIL THEN Expression(x.result) END;
  4668. 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
  4669. ReleaseIntermediateOperand(result.op);
  4670. END;
  4671. END VisitStatementDesignator;
  4672. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4673. VAR
  4674. procedure: SyntaxTree.Procedure;
  4675. procedureType: SyntaxTree.ProcedureType;
  4676. wasInline: BOOLEAN;
  4677. actualParameters: SyntaxTree.ExpressionList;
  4678. formalParameter: SyntaxTree.Parameter;
  4679. actualParameter: SyntaxTree.Expression;
  4680. i: LONGINT;
  4681. localVariable: SyntaxTree.Variable;
  4682. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4683. src, dest: Operand;
  4684. prevInlineExit : Label;
  4685. prevMapper: SymbolMapper;
  4686. tooComplex: BOOLEAN;
  4687. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4688. BEGIN
  4689. IF e = NIL THEN RETURN TRUE
  4690. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4691. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4692. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4693. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4694. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4695. ELSE RETURN FALSE
  4696. END;
  4697. END SimpleExpression;
  4698. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4699. BEGIN
  4700. RETURN checker.CanPassInRegister(type)
  4701. END FitsInRegister;
  4702. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4703. VAR
  4704. variable: SyntaxTree.Variable;
  4705. variableDesignator: SyntaxTree.Designator;
  4706. BEGIN
  4707. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type));
  4708. variableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4709. variableDesignator.SetType(type);
  4710. RETURN variableDesignator
  4711. END GetTemp;
  4712. BEGIN
  4713. wasInline := currentIsInline;
  4714. prevInlineExit := currentInlineExit;
  4715. prevMapper := currentMapper;
  4716. currentInlineExit := NewLabel();
  4717. tooComplex := FALSE;
  4718. NEW(currentMapper);
  4719. currentIsInline := TRUE;
  4720. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4721. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4722. formalParameter := procedureType.firstParameter;
  4723. actualParameters := x.parameters;
  4724. i := 0;
  4725. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4726. actualParameter := actualParameters.GetExpression(i);
  4727. IF actualParameter.resolved # NIL THEN
  4728. actualParameter := actualParameter.resolved
  4729. END;
  4730. (*
  4731. if expression is simple and can be passed immediately
  4732. or if type fits in register then we can proceed
  4733. otherwise we escape to ordinary procedure call.
  4734. *)
  4735. (* cases where the expression can be mapped identically *)
  4736. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4737. currentMapper.Add(formalParameter, actualParameter, NIL);
  4738. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4739. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4740. (*
  4741. Assign(variableDesignator, actualParameter);
  4742. *)
  4743. Evaluate(actualParameter, src);
  4744. Designate(variableDesignator, dest);
  4745. Emit(Mov(x.position, dest.op, src.op));
  4746. ReleaseOperand(dest);
  4747. ReleaseOperand(src);
  4748. currentMapper.Add(formalParameter, variableDesignator, NIL);
  4749. ELSE tooComplex := TRUE
  4750. END;
  4751. (*
  4752. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4753. currentMapper.Add(formalParameter, actualParameter, NIL);
  4754. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4755. variableDesignator := GetTemp(system.addressType, FALSE);
  4756. Designate(actualParameter, src);
  4757. Designate(variableDesignator, dest);
  4758. IntermediateCode.MakeMemory(dest.op,addressType);
  4759. Emit(Mov(x.position, dest.op, src.op));
  4760. ReleaseOperand(dest);
  4761. IF src.tag.mode # IntermediateCode.Undefined THEN
  4762. tagDesignator := GetTemp(system.addressType, FALSE);
  4763. Designate(tagDesignator, dest);
  4764. IntermediateCode.MakeMemory(dest.op,addressType);
  4765. Emit(Mov(x.position, dest.op, src.op));
  4766. END;
  4767. ReleaseOperand(dest); ReleaseOperand(src);
  4768. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4769. END;
  4770. *)
  4771. formalParameter := formalParameter.nextParameter;
  4772. INC(i);
  4773. END;
  4774. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4775. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4776. currentMapper.Add(NIL, returnDesignator, NIL);
  4777. END;
  4778. localVariable := procedure.procedureScope.firstVariable;
  4779. WHILE ~tooComplex & (localVariable # NIL) DO
  4780. variableDesignator := GetTemp(localVariable.type, FALSE);
  4781. currentMapper.Add(localVariable, variableDesignator, NIL);
  4782. localVariable := localVariable.nextVariable;
  4783. END;
  4784. IF ~tooComplex THEN
  4785. VisitStatementBlock(procedure.procedureScope.body);
  4786. SetLabel(currentInlineExit);
  4787. IF procedureType.returnType # NIL THEN
  4788. Designate(returnDesignator, result);
  4789. IF conditional THEN
  4790. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4791. ValueToCondition(result)
  4792. END;
  4793. END;
  4794. END;
  4795. currentMapper := prevMapper;
  4796. currentInlineExit := prevInlineExit;
  4797. currentIsInline := wasInline;
  4798. RETURN ~tooComplex
  4799. END InlineProcedureCall;
  4800. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4801. VAR
  4802. parameters: SyntaxTree.ExpressionList;
  4803. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4804. designator: SyntaxTree.Designator;
  4805. procedureType: SyntaxTree.ProcedureType;
  4806. formalParameter: SyntaxTree.Parameter;
  4807. operand, returnValue: Operand;
  4808. reg, size, mask, dest: IntermediateCode.Operand;
  4809. saved: RegisterEntry;
  4810. symbol: SyntaxTree.Symbol;
  4811. variable: SyntaxTree.Variable;
  4812. i, parametersSize, returnTypeSize : LONGINT;
  4813. structuredReturnType: BOOLEAN;
  4814. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4815. tempVariableDesignator: SyntaxTree.Designator;
  4816. gap, alignment: LONGINT; (*fld*)
  4817. (* TODO: remove unnecessary backup variables *)
  4818. oldResult: Operand;
  4819. oldCurrentScope: SyntaxTree.Scope;
  4820. oldArrayDestinationTag: IntermediateCode.Operand;
  4821. oldArrayDestinationDimension: LONGINT;
  4822. oldConstantDeclaration: SyntaxTree.Symbol;
  4823. oldDestination: IntermediateCode.Operand;
  4824. oldCurrentLoop: Label;
  4825. oldConditional: BOOLEAN;
  4826. oldTrueLabel, oldFalseLabel: Label;
  4827. oldLocked: BOOLEAN;
  4828. usedRegisters,oldUsedRegisters: RegisterEntry;
  4829. return: IntermediateCode.Operand;
  4830. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  4831. arg: IntermediateCode.Operand;
  4832. dummy: IntermediateCode.Operand;
  4833. recordType: SyntaxTree.RecordType;
  4834. operatorSelectionProcedureOperand: Operand;
  4835. operatorSelectionProcedure: SyntaxTree.Procedure;
  4836. fingerPrint: SyntaxTree.FingerPrint;
  4837. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  4838. identifierNumber: LONGINT;
  4839. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  4840. procedure: SyntaxTree.Procedure;
  4841. PROCEDURE BackupGlobalState;
  4842. BEGIN
  4843. oldResult := result;
  4844. oldCurrentScope := currentScope;
  4845. oldArrayDestinationTag := arrayDestinationTag;
  4846. oldArrayDestinationDimension := arrayDestinationDimension;
  4847. oldConstantDeclaration := constantDeclaration;
  4848. oldDestination := destination;
  4849. oldCurrentLoop := currentLoop;
  4850. oldConditional := conditional;
  4851. oldTrueLabel := trueLabel;
  4852. oldFalseLabel := falseLabel;
  4853. oldLocked := locked;
  4854. oldUsedRegisters := usedRegisters
  4855. END BackupGlobalState;
  4856. PROCEDURE RestoreGlobalState;
  4857. BEGIN
  4858. result := oldResult;
  4859. currentScope := oldCurrentScope;
  4860. arrayDestinationTag := oldArrayDestinationTag;
  4861. arrayDestinationDimension := oldArrayDestinationDimension;
  4862. constantDeclaration := oldConstantDeclaration;
  4863. destination := oldDestination;
  4864. currentLoop := oldCurrentLoop;
  4865. conditional := oldConditional;
  4866. trueLabel := oldTrueLabel;
  4867. falseLabel := oldFalseLabel;
  4868. locked := oldLocked;
  4869. usedRegisters := oldUsedRegisters
  4870. END RestoreGlobalState;
  4871. (** do preparations before parameter push for array-structured object types (ASOTs):
  4872. if ASOT is passed as VAR parameter:
  4873. - allocate temporary variable of math array type
  4874. - copy contents of ASOT to be passed to temporary variable
  4875. - use temporary variable as the actual parameter instead
  4876. - 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)
  4877. **)
  4878. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  4879. VAR
  4880. expression: SyntaxTree.Expression;
  4881. BEGIN
  4882. IF actualParameter IS SyntaxTree.Designator THEN
  4883. designator := actualParameter(SyntaxTree.Designator);
  4884. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  4885. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  4886. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  4887. ASSERT(checker # NIL);
  4888. checker.SetCurrentScope(currentScope);
  4889. (* allocate temporary variable *)
  4890. ASSERT(actualParameter.type # NIL);
  4891. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  4892. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4893. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4894. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4895. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  4896. ASSERT(tempVariableDesignator.type # NIL);
  4897. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  4898. (* copy math array stored in actual parameter to temporary variable *)
  4899. BackupGlobalState;
  4900. AssignMathArray(tempVariableDesignator, actualParameter);
  4901. RestoreGlobalState;
  4902. (* use temporary variable as actual parameter instead of the original one *)
  4903. actualParameter := tempVariableDesignator;
  4904. (* create write-back call and store it in linked list *)
  4905. (* create new list entry *)
  4906. IF firstWriteBackCall = NIL THEN
  4907. NEW(firstWriteBackCall);
  4908. currentWriteBackCall := firstWriteBackCall
  4909. ELSE
  4910. ASSERT(currentWriteBackCall # NIL);
  4911. NEW(currentWriteBackCall.next);
  4912. currentWriteBackCall := currentWriteBackCall.next
  4913. END;
  4914. expression := checker.NewIndexOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4915. ASSERT(expression.type = NIL);
  4916. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4917. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  4918. (* prepare writeback for any other "normal" indexer *)
  4919. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4920. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4921. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4922. Assign(tempVariableDesignator, actualParameter);
  4923. actualParameter := tempVariableDesignator;
  4924. IF firstWriteBackCall = NIL THEN
  4925. NEW(firstWriteBackCall);
  4926. currentWriteBackCall := firstWriteBackCall
  4927. ELSE
  4928. ASSERT(currentWriteBackCall # NIL);
  4929. NEW(currentWriteBackCall.next);
  4930. currentWriteBackCall := currentWriteBackCall.next
  4931. END;
  4932. expression := checker.NewObjectOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4933. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4934. END
  4935. END
  4936. END PrepareParameter;
  4937. BEGIN
  4938. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  4939. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  4940. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4941. IF procedure.isOberonInline & (procedure.scope.ownerModule = module.module) THEN
  4942. IF InlineProcedureCall(x) THEN
  4943. RETURN
  4944. ELSE
  4945. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  4946. END
  4947. END;
  4948. END;
  4949. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4950. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  4951. dest := destination; destination := emptyOperand;
  4952. SaveRegisters();ReleaseUsedRegisters(saved);
  4953. parameters := x.parameters;
  4954. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  4955. (* an operator is called *)
  4956. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4957. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  4958. (* check if a dynamic operator call should be performed *)
  4959. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic
  4960. ELSE
  4961. isCallOfDynamicOperator := FALSE
  4962. END;
  4963. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  4964. Emit(Push(position, ap));
  4965. END;
  4966. alignment := procedureType.stackAlignment;
  4967. IF alignment > 1 THEN
  4968. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4969. Emit(Mov(position,reg, sp));
  4970. gap := ParametersSize(system, procedureType, FALSE) + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  4971. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  4972. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  4973. Emit(And(position,sp, sp, mask));
  4974. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  4975. Emit(Push(position,reg));
  4976. (*
  4977. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  4978. Emit(Mov(position,mem,reg));
  4979. *)
  4980. ReleaseIntermediateOperand(reg);
  4981. END;
  4982. IF procedureType.callingConvention = SyntaxTree.DarwinCCallingConvention THEN (*fld*)
  4983. IntermediateCode.InitImmediate(mask,addressType,-16);
  4984. Emit(And(position,sp, sp, mask));
  4985. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  4986. IF gap # 0 THEN
  4987. IntermediateCode.InitImmediate(size,addressType,gap);
  4988. Emit(Sub(position,sp,sp,size))
  4989. END;
  4990. END;
  4991. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4992. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4993. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  4994. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4995. ELSE
  4996. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  4997. END;
  4998. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  4999. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5000. (* push ID *)
  5001. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5002. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5003. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5004. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5005. formalParameter := procedureType.firstParameter;
  5006. FOR i := 0 TO parameters.Length() - 1 DO
  5007. IF formalParameter.access # SyntaxTree.Hidden THEN
  5008. ASSERT(i < 2);
  5009. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5010. (* push pointer *)
  5011. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5012. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5013. (* add dereference *)
  5014. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5015. ReleaseIntermediateOperand(parameterBackups[i]);
  5016. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5017. END;
  5018. Emit(Push(position,parameterBackups[i]));
  5019. ReleaseIntermediateOperand(parameterBackups[i]);
  5020. (* push typetag *)
  5021. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5022. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5023. arg := TypeDescriptorAdr(recordType);
  5024. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5025. Emit(Push(position,arg));
  5026. ELSE
  5027. (* push 'NonPointer' *)
  5028. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5029. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5030. (* push fingerprint *)
  5031. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5032. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5033. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow))) (* TODO: push the type's fingerprint *)
  5034. END
  5035. END;
  5036. formalParameter := formalParameter.nextParameter
  5037. END;
  5038. (* for unary operators: complete the information for the second parameter *)
  5039. IF procedureType.numberParameters < 2 THEN
  5040. (* push 'NonPointer' *)
  5041. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5042. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5043. (* push 'NoType' *)
  5044. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5045. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5046. END;
  5047. (* call operator selection procedure *)
  5048. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5049. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5050. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  5051. ReleaseOperand(operatorSelectionProcedureOperand);
  5052. (* use the address that the operator selection procedure returned as the target address of the call *)
  5053. InitOperand(operand, ModeValue);
  5054. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5055. Emit(Result(position,operand.op))
  5056. END
  5057. ELSE
  5058. Evaluate(x.left, operand)
  5059. END;
  5060. IF symbol IS SyntaxTree.Procedure THEN
  5061. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5062. Emit(Push(position,operand.tag));
  5063. ELSIF (procedureType.isDelegate) THEN
  5064. Emit(Push(position,operand.tag));
  5065. END;
  5066. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5067. IF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5068. Emit(Push(position,operand.tag));
  5069. END;
  5070. ELSE HALT(200);
  5071. END;
  5072. ReleaseIntermediateOperand(operand.tag);
  5073. operand.tag := emptyOperand;
  5074. (* determine if a structured return type is needed *)
  5075. structuredReturnType := StructuredReturnType(procedureType);
  5076. IF structuredReturnType THEN
  5077. IF resultDesignator # NIL THEN
  5078. d := resultDesignator;
  5079. ELSE
  5080. variable := GetTemporaryVariable(procedureType.returnType, FALSE);
  5081. variable.SetUntraced(procedureType.hasUntracedReturn);
  5082. d := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  5083. d.SetType(variable.type);
  5084. END;
  5085. IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5086. Designate(d,returnValue);
  5087. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5088. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5089. Emit(Push(position,size));
  5090. Emit(Push(position,returnValue.op));
  5091. ReleaseOperand(returnValue);
  5092. ELSE
  5093. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  5094. END;
  5095. END;
  5096. firstWriteBackCall := NIL; (* reset write-back call list *)
  5097. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  5098. passByRegister := system.registerParameters > 0;
  5099. registerNumber := 0;
  5100. formalParameter := procedureType.lastParameter;
  5101. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5102. actualParameter := parameters.GetExpression(i);
  5103. PrepareParameter(actualParameter, formalParameter);
  5104. IF passByRegister & (i < system.registerParameters) THEN
  5105. IF ~PassInRegister(formalParameter) THEN
  5106. Error(actualParameter.position,"cannot be passed by register")
  5107. ELSE
  5108. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,i);
  5109. END;
  5110. INC(registerNumber);
  5111. ELSE
  5112. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5113. END;
  5114. formalParameter := formalParameter.prevParameter;
  5115. END;
  5116. IF passByRegister & (registerNumber > 0) THEN
  5117. stackSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  5118. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5119. END;
  5120. ELSE
  5121. hasDynamicOperands := FALSE;
  5122. formalParameter := procedureType.firstParameter;
  5123. FOR i := 0 TO parameters.Length() - 1 DO
  5124. actualParameter := parameters.GetExpression(i);
  5125. IF formalParameter # NIL THEN (* TENTATIVE *)
  5126. PrepareParameter(actualParameter, formalParameter);
  5127. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5128. ASSERT(i < 2);
  5129. hasDynamicOperands := TRUE;
  5130. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  5131. ELSE
  5132. IF passByRegister & (registerNumber > 0) THEN
  5133. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5134. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5135. END;
  5136. passByRegister := FALSE;
  5137. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5138. END;
  5139. formalParameter := formalParameter.nextParameter;
  5140. END;
  5141. END;
  5142. END;
  5143. IF symbol IS SyntaxTree.Procedure THEN
  5144. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5145. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5146. Emit(Push(position,reg));
  5147. ReleaseIntermediateOperand(reg);
  5148. END;
  5149. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5150. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5151. parametersSize := ParametersSize(system,procedureType,FALSE);
  5152. END;
  5153. ReleaseParameterRegisters();
  5154. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR (procedureType.callingConvention = SyntaxTree.CCallingConvention) THEN
  5155. Emit(Call(position,operand.op,0));
  5156. ELSE
  5157. Emit(Call(position,operand.op,parametersSize));
  5158. END;
  5159. ReleaseOperand(operand);
  5160. IF procedureType.noReturn THEN
  5161. EmitTrap(position,NoReturnTrap);
  5162. END;
  5163. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5164. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5165. Emit(Result(position,return));
  5166. END;
  5167. IF procedureType.callingConvention = SyntaxTree.CCallingConvention THEN
  5168. IF passByRegister & (registerNumber > 0) & (registerNumber < system.registerParameters) THEN (* allocated space for all registers *)
  5169. parametersSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  5170. END;
  5171. size := IntermediateCode.Immediate(addressType,parametersSize);
  5172. Emit(Add(position,sp,sp,size));
  5173. END;
  5174. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5175. IF structuredReturnType THEN
  5176. (* stack pointer rewinding done by callee
  5177. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5178. Emit(Add(position,sp,sp,size));
  5179. *)
  5180. RestoreRegisters(saved);
  5181. InitOperand(result,ModeReference);
  5182. Symbol(variable,result);
  5183. ELSE
  5184. RestoreRegisters(saved);
  5185. InitOperand(result,ModeValue);
  5186. result.op := return;
  5187. END;
  5188. END;
  5189. IF alignment > 1 THEN
  5190. Emit(Pop(position,sp));
  5191. END;
  5192. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5193. Emit(Pop(position, ap));
  5194. END;
  5195. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5196. ValueToCondition(result);
  5197. END;
  5198. destination := dest;
  5199. (* perform all write-back calls in the list *)
  5200. BackupGlobalState;
  5201. currentWriteBackCall := firstWriteBackCall;
  5202. WHILE currentWriteBackCall # NIL DO
  5203. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5204. currentWriteBackCall := currentWriteBackCall.next
  5205. END;
  5206. RestoreGlobalState;
  5207. (* TENATIVE *)
  5208. (*
  5209. IF isOperatorCall THEN
  5210. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5211. END;
  5212. *)
  5213. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5214. END VisitProcedureCallDesignator;
  5215. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5216. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5217. td: SyntaxTree.Symbol;
  5218. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5219. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5220. BEGIN
  5221. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5222. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5223. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5224. variable.SetType(system.anyType);
  5225. scope.AddVariable(variable);
  5226. hiddenPointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5227. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5228. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5229. typeDeclaration.SetScope(module.module.moduleScope);
  5230. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5231. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5232. END;
  5233. RETURN hiddenPointerType;
  5234. END GetHiddenPointerType;
  5235. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5236. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5237. BEGIN
  5238. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5239. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5240. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Procedure"));
  5241. variable.SetType(SyntaxTree.NewProcedureType(-1,NIL));
  5242. scope.AddVariable(variable);
  5243. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5244. variable.SetType(system.anyType);
  5245. scope.AddVariable(variable);
  5246. delegatePointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5247. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@Delegate"));
  5248. typeDeclaration.SetDeclaredType(delegatePointerType);
  5249. typeDeclaration.SetScope(module.module.moduleScope);
  5250. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5251. delegatePointerType.SetState(SyntaxTree.Resolved);
  5252. END;
  5253. RETURN delegatePointerType
  5254. END GetDelegateType;
  5255. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5256. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5257. such as in VAR a: RECORD ... END;
  5258. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5259. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5260. *)
  5261. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5262. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5263. BEGIN (* no code emission *)
  5264. source := NIL;
  5265. x := x.resolved;
  5266. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5267. x := GetHiddenPointerType();
  5268. ELSIF IsDelegate(x) THEN
  5269. x := GetDelegateType();
  5270. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5271. ELSE HALT(200);
  5272. END;
  5273. td := x.typeDeclaration;
  5274. IF td = NIL THEN
  5275. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5276. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5277. ASSERT(td # NIL);
  5278. END;
  5279. IF newObjectFile THEN
  5280. GetCodeSectionNameForSymbol(td,name);
  5281. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5282. meta.CheckTypeDeclaration(x);
  5283. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5284. ELSE
  5285. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5286. END;
  5287. IF backend.cooperative OR meta.simple THEN
  5288. offset := 0;
  5289. ELSE
  5290. IF x IS SyntaxTree.CellType THEN
  5291. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5292. IF baseRecord = NIL THEN
  5293. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5294. ELSE
  5295. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5296. END;
  5297. ELSE
  5298. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5299. END;
  5300. END;
  5301. ELSE
  5302. offset := 0;
  5303. source := module.allSections.FindBySymbol(td); (*TODO*)
  5304. IF source = NIL THEN
  5305. null := 0;
  5306. GetCodeSectionNameForSymbol(td,name);
  5307. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5308. IntermediateCode.InitImmediate(op,addressType,0);
  5309. source(IntermediateCode.Section).Emit(Data(position,op));
  5310. source.SetReferenced(FALSE)
  5311. ELSE
  5312. name := source.name;
  5313. END;
  5314. END;
  5315. RETURN td
  5316. END GetBackendType;
  5317. BEGIN
  5318. (*td := t.typeDeclaration;*)
  5319. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5320. (*
  5321. IF t IS SyntaxTree.PointerType THEN
  5322. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5323. ELSE
  5324. source := GetBackendType(t);
  5325. END;
  5326. *)
  5327. IF newObjectFile THEN
  5328. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5329. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5330. IntermediateCode.SetOffset(res,offset);
  5331. ELSE
  5332. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5333. END;
  5334. (*
  5335. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5336. make memory should be used when tag is used, not earlier
  5337. *)
  5338. RETURN res
  5339. END TypeDescriptorAdr;
  5340. (*
  5341. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5342. VAR result: IntermediateCode.Operand;
  5343. BEGIN
  5344. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5345. operand.tag := TypeDescriptorAdr(operand.type);
  5346. IntermediateCode.MakeMemory(operand.tag,addressType);
  5347. UseIntermediateOperand(operand.tag);
  5348. END;
  5349. END MakeTypeTag;
  5350. *)
  5351. PROCEDURE ProfilerInit;
  5352. VAR reg: IntermediateCode.Operand;
  5353. BEGIN
  5354. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5355. Emit(Call(position,reg,0));
  5356. END ProfilerInit;
  5357. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5358. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5359. BEGIN
  5360. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5361. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5362. THEN
  5363. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5364. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5365. Emit(Push(position,reg));
  5366. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5367. Emit(Push(position,reg));
  5368. StaticCallOperand(result,procedure);
  5369. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5370. ReleaseOperand(result);
  5371. END;
  5372. END ProfilerEnterExit;
  5373. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5374. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5375. BEGIN
  5376. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5377. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5378. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5379. profileInit.Emit(Push(position,reg));
  5380. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5381. profileInit.Emit(Push(position,reg));
  5382. NEW(string, LEN(name)); COPY(name, string^);
  5383. sv := SyntaxTree.NewStringValue(-1,string);
  5384. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5385. sv.SetType(type);
  5386. Designate(sv,result);
  5387. profileInit.Emit(Push(position,result.tag));
  5388. profileInit.Emit(Push(position,result.op));
  5389. StaticCallOperand(result,procedure);
  5390. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5391. ReleaseOperand(result);
  5392. END;
  5393. END ProfilerAddProcedure;
  5394. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5395. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5396. BEGIN
  5397. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5398. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5399. profileInit.Emit(Push(position,reg));
  5400. profileInitPatchPosition := profileInit.pc;
  5401. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5402. NEW(string, LEN(name)); COPY(name, string^);
  5403. sv := SyntaxTree.NewStringValue(-1,string);
  5404. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5405. sv.SetType(type);
  5406. Designate(sv,result);
  5407. profileInit.Emit(Push(position,result.tag));
  5408. profileInit.Emit(Push(position,result.op));
  5409. StaticCallOperand(result,procedure);
  5410. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5411. ReleaseOperand(result);
  5412. END;
  5413. END ProfilerAddModule;
  5414. PROCEDURE ProfilerPatchInit;
  5415. VAR reg: IntermediateCode.Operand;
  5416. BEGIN
  5417. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5418. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5419. EmitLeave(profileInit,position,0);
  5420. profileInit.Emit(Exit(position,0,0));
  5421. END ProfilerPatchInit;
  5422. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5423. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5424. VAR
  5425. id: LONGINT;
  5426. leftType, rightType: SyntaxTree.Type;
  5427. procedureType: SyntaxTree.ProcedureType;
  5428. runtimeProcedure: SyntaxTree.Procedure;
  5429. runtimeProcedureOperand, operatorOperand: Operand;
  5430. kind: SET;
  5431. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5432. VAR
  5433. arg: IntermediateCode.Operand;
  5434. recordType: SyntaxTree.RecordType;
  5435. fingerPrint: SyntaxTree.FingerPrint;
  5436. BEGIN
  5437. IF type = NIL THEN
  5438. (* no type: push 'NoType' *)
  5439. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5440. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5441. ELSIF IsStrictlyPointerToRecord(type) THEN
  5442. (* pointer to record type: push typetag *)
  5443. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5444. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5445. arg := TypeDescriptorAdr(recordType);
  5446. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5447. ELSE
  5448. (* non-pointer to record type: push fingerprint *)
  5449. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5450. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5451. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow)
  5452. END;
  5453. operatorInitializationCodeSection.Emit(Push(position,arg))
  5454. END PushTypeInfo;
  5455. BEGIN
  5456. ASSERT(operatorInitializationCodeSection # NIL);
  5457. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5458. procedureType := operator.type(SyntaxTree.ProcedureType);
  5459. (* determine types *)
  5460. leftType := procedureType.firstParameter.type;
  5461. IF procedureType.numberParameters = 2 THEN
  5462. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5463. rightType := procedureType.firstParameter.nextParameter.type;
  5464. ELSE
  5465. rightType := NIL
  5466. END;
  5467. (* determine operator kind *)
  5468. IF IsStrictlyPointerToRecord(leftType) THEN
  5469. kind := {LhsIsPointer}
  5470. ELSE
  5471. kind := {}
  5472. END;
  5473. IF IsStrictlyPointerToRecord(rightType) THEN
  5474. kind := kind + {RhsIsPointer}
  5475. END;
  5476. IF kind # {} THEN (* TODO: to be removed later on *)
  5477. (* at least one of the types is a pointer to record *)
  5478. (* emit a code that registers this specific operator in the runtime *)
  5479. dump := operatorInitializationCodeSection.comments;
  5480. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5481. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5482. (* push ID *)
  5483. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5484. id := Global.GetSymbol(module.module.case, operator.name);
  5485. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5486. (* push kind *)
  5487. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5488. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5489. (* push type infos *)
  5490. PushTypeInfo(leftType);
  5491. PushTypeInfo(rightType);
  5492. (* push operator address *)
  5493. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5494. StaticCallOperand(operatorOperand, operator);
  5495. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5496. ReleaseOperand(operatorOperand);
  5497. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5498. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5499. ReleaseOperand(runtimeProcedureOperand)
  5500. END
  5501. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5502. END
  5503. END RegisterDynamicOperator;
  5504. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: LONGINT);
  5505. VAR
  5506. traceModule: SyntaxTree.Module;
  5507. procedure: SyntaxTree.Procedure;
  5508. procedureVariable: SyntaxTree.Variable;
  5509. s,msg: Basic.MessageString;
  5510. res: Operand;
  5511. i: LONGINT;
  5512. sv: SyntaxTree.StringValue;
  5513. type: SyntaxTree.Type;
  5514. recordType: SyntaxTree.RecordType;
  5515. printout: Printout.Printer;
  5516. stringWriter: Streams.StringWriter;
  5517. expression: SyntaxTree.Expression;
  5518. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5519. BEGIN
  5520. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5521. IF procedure = NIL THEN
  5522. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5523. END;
  5524. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5525. s := "procedure ";
  5526. Strings.Append(s,backend.traceModuleName);
  5527. Strings.Append(s,".");
  5528. Strings.Append(s,procedureName);
  5529. Strings.Append(s," not present");
  5530. Error(position,s);
  5531. RETURN FALSE
  5532. ELSE
  5533. RETURN TRUE
  5534. END;
  5535. END GetProcedure;
  5536. PROCEDURE CallProcedure;
  5537. VAR size: LONGINT;
  5538. BEGIN
  5539. IF procedure # NIL THEN
  5540. StaticCallOperand(result,procedure);
  5541. size := ProcedureParametersSize(system,procedure);
  5542. ELSE
  5543. Symbol(procedureVariable, result);
  5544. LoadValue(result, procedureVariable.type.resolved);
  5545. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5546. END;
  5547. Emit(Call(position,result.op,size));
  5548. END CallProcedure;
  5549. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5550. VAR res: Operand; string: SyntaxTree.String;
  5551. BEGIN
  5552. IF GetProcedure("String") THEN
  5553. NEW(string, LEN(s)); COPY(s, string^);
  5554. sv := SyntaxTree.NewStringValue(-1,string);
  5555. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  5556. sv.SetType(type);
  5557. Designate(sv,res);
  5558. Emit(Push(position,res.tag));
  5559. Emit(Push(position,res.op));
  5560. ReleaseOperand(res);
  5561. CallProcedure;
  5562. END;
  5563. END String;
  5564. PROCEDURE Integer(op: IntermediateCode.Operand);
  5565. BEGIN
  5566. IF GetProcedure("Int") THEN
  5567. Emit(Push(position,op));
  5568. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5569. CallProcedure;
  5570. END;
  5571. END Integer;
  5572. PROCEDURE Float(op: IntermediateCode.Operand);
  5573. BEGIN
  5574. IF GetProcedure("HIntHex") THEN
  5575. Emit(Push(position,op));
  5576. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5577. CallProcedure;
  5578. END;
  5579. END Float;
  5580. PROCEDURE Set(op: IntermediateCode.Operand);
  5581. BEGIN
  5582. IF GetProcedure("Set") THEN
  5583. Emit(Push(position,op));
  5584. (*
  5585. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5586. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5587. *)
  5588. CallProcedure;
  5589. END;
  5590. END Set;
  5591. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5592. BEGIN
  5593. IF GetProcedure("Boolean") THEN
  5594. Emit(Push(position,op));
  5595. CallProcedure;
  5596. END;
  5597. END Boolean;
  5598. PROCEDURE Char(op: IntermediateCode.Operand);
  5599. BEGIN
  5600. IF GetProcedure("Char") THEN
  5601. Emit(Push(position,op));
  5602. CallProcedure;
  5603. END;
  5604. END Char;
  5605. PROCEDURE Address(op: IntermediateCode.Operand);
  5606. BEGIN
  5607. IF GetProcedure("Address") THEN
  5608. Emit(Push(position,op));
  5609. CallProcedure;
  5610. END;
  5611. END Address;
  5612. PROCEDURE StringOperand(op,tag: IntermediateCode.Operand);
  5613. BEGIN
  5614. IF GetProcedure("String") THEN
  5615. Emit(Push(position,tag));
  5616. Emit(Push(position,op));
  5617. CallProcedure;
  5618. END;
  5619. END StringOperand;
  5620. PROCEDURE Ln;
  5621. BEGIN
  5622. IF GetProcedure("Ln") THEN
  5623. CallProcedure;
  5624. END;
  5625. END Ln;
  5626. BEGIN
  5627. IF backend.traceModuleName = "" THEN RETURN END;
  5628. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5629. IF GetProcedure("Enter") THEN
  5630. CallProcedure
  5631. END;
  5632. NEW(stringWriter,LEN(s));
  5633. FOR i := 0 TO x.Length()-1 DO
  5634. msg := "";
  5635. expression := x.GetExpression(i);
  5636. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5637. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5638. ELSE
  5639. Global.GetModuleName(module.module, s);
  5640. END;
  5641. IF i = 0 THEN
  5642. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos,1);
  5643. stringWriter.String(":");
  5644. END;
  5645. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5646. IF ~(expression IS SyntaxTree.StringValue) THEN
  5647. printout.Expression(expression);
  5648. stringWriter.Get(s);
  5649. Strings.Append(msg,s);
  5650. Strings.Append(msg,"= ");
  5651. ELSE stringWriter.Get(s); (* remove from string writer *)
  5652. Strings.Append(msg, s);
  5653. END;
  5654. String(msg);
  5655. IF SemanticChecker.IsStringType(expression.type) THEN
  5656. Designate(expression,res);
  5657. StringOperand(res.op,res.tag);
  5658. ELSE
  5659. Evaluate(expression,res);
  5660. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5661. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5662. Convert(res.op,int64);
  5663. END;
  5664. Integer(res.op);
  5665. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5666. Boolean(res.op);
  5667. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5668. Set(res.op);
  5669. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5670. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5671. Convert(res.op,float64);
  5672. END;
  5673. Float(res.op);
  5674. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5675. Char(res.op);
  5676. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5677. Address(res.op);String("H");
  5678. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5679. Address(res.op);String("H");
  5680. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5681. Address(res.op);String("H");
  5682. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5683. Address(res.op);String("H");
  5684. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5685. String("NIL");
  5686. ELSE HALT(200);
  5687. END;
  5688. END;
  5689. ReleaseOperand(res);
  5690. String("; ");
  5691. END;
  5692. IF GetProcedure("Exit") THEN
  5693. CallProcedure
  5694. ELSE
  5695. Ln;
  5696. END;
  5697. END;
  5698. END SystemTrace;
  5699. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5700. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5701. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5702. BEGIN
  5703. type := type.resolved;
  5704. IF type IS SyntaxTree.RecordType THEN
  5705. WITH type: SyntaxTree.RecordType DO
  5706. baseType := type.baseType;
  5707. IF baseType # NIL THEN
  5708. baseType := baseType.resolved;
  5709. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5710. InitFields(baseType,adr,offset);
  5711. END;
  5712. variable := type.recordScope.firstVariable;
  5713. WHILE variable # NIL DO
  5714. IF variable.initializer # NIL THEN
  5715. Evaluate(variable.initializer,initializerOp);
  5716. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5717. Emit(Mov(position,mem,initializerOp.op));
  5718. ReleaseOperand(initializerOp);
  5719. ReleaseIntermediateOperand(mem);
  5720. END;
  5721. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5722. variable := variable.nextVariable
  5723. END;
  5724. END;
  5725. ELSIF (type IS SyntaxTree.ArrayType) THEN
  5726. WITH type: SyntaxTree.ArrayType DO
  5727. IF type.form = SyntaxTree.Static THEN
  5728. baseType := type.arrayBase;
  5729. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5730. FOR i := 0 TO type.staticLength-1 DO
  5731. InitFields(baseType,adr,offset+i*size);
  5732. END;
  5733. END;
  5734. END;
  5735. ELSIF type IS SyntaxTree.MathArrayType THEN
  5736. WITH type: SyntaxTree.MathArrayType DO
  5737. IF type.form = SyntaxTree.Open THEN
  5738. dim := DynamicDim(type);
  5739. imm := IntermediateCode.Immediate(addressType,dim);
  5740. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  5741. baseType := SemanticChecker.ArrayBase(type,dim);
  5742. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  5743. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  5744. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  5745. ReleaseIntermediateOperand(imm);
  5746. (* flags remain empty (=0) for open array *)
  5747. ELSIF type.form = SyntaxTree.Static THEN
  5748. baseType := type.arrayBase;
  5749. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5750. ASSERT(type.staticLength < 1024*1024*1024);
  5751. FOR i := 0 TO type.staticLength-1 DO
  5752. InitFields(baseType,adr,offset+i*size);
  5753. END;
  5754. END;
  5755. END;
  5756. END;
  5757. END InitFields;
  5758. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable);
  5759. VAR type: SyntaxTree.Type; operand: Operand; tmp: IntermediateCode.Operand; reference: SyntaxTree.Expression;
  5760. BEGIN
  5761. type := variable.type.resolved;
  5762. IF (type IS SyntaxTree.MathArrayType) THEN
  5763. WITH type: SyntaxTree.MathArrayType DO
  5764. IF type.form = SyntaxTree.Open THEN
  5765. Symbol(variable,operand);
  5766. InitFields(type, operand.tag,0);
  5767. ELSIF type.form = SyntaxTree.Tensor THEN
  5768. Symbol(variable, operand);
  5769. MakeMemory(tmp,operand.op,addressType,0);
  5770. ReleaseOperand(operand);
  5771. Emit(Mov(position,tmp, nil ) );
  5772. ReleaseIntermediateOperand(tmp);
  5773. END;
  5774. END;
  5775. ELSE
  5776. Symbol(variable,operand);
  5777. IF variable.initializer # NIL THEN
  5778. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  5779. reference.SetType(variable.type.resolved);
  5780. reference.SetAssignable(TRUE);
  5781. Assign(reference,variable.initializer);
  5782. END;
  5783. InitFields(type, operand.op,0);
  5784. ReleaseOperand(operand);
  5785. END;
  5786. END InitVariable;
  5787. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  5788. VAR end: Label;
  5789. BEGIN
  5790. IF type.form = SyntaxTree.Tensor THEN
  5791. InitOperand(result,ModeValue);
  5792. ReuseCopy(result.op,base);
  5793. end := NewLabel();
  5794. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  5795. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  5796. SetLabel(end);
  5797. Convert(result.op,int32);
  5798. ELSE
  5799. InitOperand(result,ModeValue);
  5800. IntermediateCode.InitImmediate(result.op, int32, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  5801. END
  5802. END MathArrayDim;
  5803. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  5804. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  5805. BEGIN
  5806. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5807. MakeMemory(mem,base,addressType,offset);
  5808. Emit(Mov(position,mem,value));
  5809. ReleaseIntermediateOperand(mem);
  5810. END PutMathArrayField;
  5811. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  5812. VAR mem: IntermediateCode.Operand;
  5813. BEGIN
  5814. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5815. MakeMemory(mem,base,addressType,offset);
  5816. Emit(Mov(position,mem,value));
  5817. ReleaseIntermediateOperand(mem);
  5818. END PutMathArrayFieldOffset;
  5819. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  5820. BEGIN
  5821. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  5822. MakeMemory(value,base,addressType,offset);
  5823. END GetMathArrayField;
  5824. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  5825. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  5826. BEGIN
  5827. IF incr THEN
  5828. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  5829. ELSE
  5830. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  5831. END;
  5832. IF dim.mode=IntermediateCode.ModeImmediate THEN
  5833. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  5834. ELSE
  5835. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5836. Emit(Mov(position,reg,dim));
  5837. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  5838. Emit(Add(position,reg,reg,base));
  5839. MakeMemory(mem, reg, addressType, offset);
  5840. ReleaseIntermediateOperand(reg);
  5841. Emit(Mov(position,mem,value));
  5842. ReleaseIntermediateOperand(mem);
  5843. END;
  5844. END PutMathArrayLenOrIncr;
  5845. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  5846. BEGIN
  5847. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  5848. END PutMathArrayLength;
  5849. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  5850. BEGIN
  5851. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  5852. END PutMathArrayIncrement;
  5853. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5854. BEGIN
  5855. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  5856. END GetMathArrayIncrement;
  5857. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5858. BEGIN
  5859. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  5860. END GetMathArrayLength;
  5861. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5862. VAR dimOp: IntermediateCode.Operand;
  5863. BEGIN
  5864. dimOp := IntermediateCode.Immediate(int32, dim);
  5865. GetMathArrayLength(type, operand, dimOp, check, result);
  5866. END GetMathArrayLengthAt;
  5867. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5868. VAR dimOp: IntermediateCode.Operand;
  5869. BEGIN
  5870. dimOp := IntermediateCode.Immediate(int32, dim);
  5871. GetMathArrayIncrement(type, operand, dimOp, check, result);
  5872. END GetMathArrayIncrementAt;
  5873. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  5874. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5875. offset: LONGINT;
  5876. BEGIN
  5877. IF increment THEN
  5878. offset := MathIncrOffset;
  5879. ELSE
  5880. offset := MathLenOffset;
  5881. END;
  5882. INC(offset,operand.dimOffset*2);
  5883. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  5884. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  5885. END;
  5886. (* static dimension *)
  5887. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5888. IF check & (type.form = SyntaxTree.Tensor) THEN
  5889. DimensionCheck(operand.tag,dim,BrltL);
  5890. END;
  5891. val := SHORT(dim.intValue);
  5892. IF type.form # SyntaxTree.Tensor THEN
  5893. t := SemanticChecker.ArrayBase(type,val);
  5894. type := t.resolved(SyntaxTree.MathArrayType);
  5895. IF type.form = SyntaxTree.Static THEN
  5896. IF increment THEN
  5897. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  5898. ELSE
  5899. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5900. END;
  5901. InitOperand(result,ModeValue);
  5902. result.op := res;
  5903. RETURN;
  5904. END;
  5905. END;
  5906. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  5907. MakeMemory(res,operand.tag,addressType,offset);
  5908. (*
  5909. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5910. *)
  5911. InitOperand(result,ModeValue);
  5912. result.op := res;
  5913. ELSE
  5914. Convert(dim,addressType);
  5915. IF check THEN
  5916. IF type.form = SyntaxTree.Tensor THEN
  5917. DimensionCheck(operand.tag,dim,BrltL);
  5918. ELSIF isUnchecked THEN (* do nothing *)
  5919. ELSE
  5920. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5921. END;
  5922. END;
  5923. end := NewLabel(); next := NIL;
  5924. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5925. Emit(Mov(position,res,dim));
  5926. Convert(res,int32);
  5927. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5928. WHILE t IS SyntaxTree.MathArrayType DO
  5929. type := t(SyntaxTree.MathArrayType);
  5930. IF type.form = SyntaxTree.Static THEN
  5931. imm := IntermediateCode.Immediate(int32,val);
  5932. next := NewLabel();
  5933. BrneL(next,imm,res);
  5934. IF increment THEN
  5935. imm := IntermediateCode.Immediate(int32,ToMemoryUnits(system,type.staticIncrementInBits));
  5936. ELSE
  5937. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5938. END;
  5939. Emit(MovReplace(position,res,imm));
  5940. BrL(end);
  5941. ELSE hasDynamicPart := TRUE;
  5942. END;
  5943. t := type.arrayBase.resolved;
  5944. val := val + 1;
  5945. IF next # NIL THEN SetLabel(next) END;
  5946. END;
  5947. IF hasDynamicPart THEN
  5948. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5949. Emit(Mov(position,res2,dim));
  5950. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  5951. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5952. Emit(Add(position,res2,res2,imm));
  5953. Emit(Add(position,res2,res2,operand.tag));
  5954. IntermediateCode.MakeMemory(res2,int32);
  5955. Emit(MovReplace(position,res,res2));
  5956. ReleaseIntermediateOperand(res2);
  5957. END;
  5958. SetLabel(end);
  5959. Convert(res,int32);
  5960. InitOperand(result,ModeValue);
  5961. result.op := res;
  5962. END;
  5963. END MathArrayLenOrIncr;
  5964. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  5965. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5966. offset: LONGINT;
  5967. BEGIN
  5968. offset := operand.dimOffset+DynamicDim(type)-1;
  5969. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5970. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  5971. val := SHORT(dim.intValue);
  5972. t := SemanticChecker.ArrayBase(type,val);
  5973. type := t.resolved(SyntaxTree.ArrayType);
  5974. IF type.form = SyntaxTree.Static THEN
  5975. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5976. ELSE
  5977. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  5978. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5979. END;
  5980. UseIntermediateOperand(res);
  5981. InitOperand(result,ModeValue);
  5982. result.op := res;
  5983. ELSE
  5984. Convert(dim,addressType);
  5985. IF ~isUnchecked THEN
  5986. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5987. END;
  5988. end := NewLabel(); next := NIL;
  5989. (* ReuseCopy(dim,res); *)
  5990. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  5991. Emit(Mov(position,res,dim));
  5992. Convert(res,int32);
  5993. Convert(res,int32);
  5994. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5995. WHILE t IS SyntaxTree.ArrayType DO
  5996. type := t(SyntaxTree.ArrayType);
  5997. IF type.form = SyntaxTree.Static THEN
  5998. imm := IntermediateCode.Immediate(int32,val);
  5999. next := NewLabel();
  6000. BrneL(next,imm,res);
  6001. imm := IntermediateCode.Immediate(int32,type.staticLength);
  6002. Emit(MovReplace(position,res,imm));
  6003. BrL(end);
  6004. ELSE hasDynamicPart := TRUE;
  6005. END;
  6006. t := type.arrayBase.resolved;
  6007. val := val + 1;
  6008. IF next # NIL THEN SetLabel(next) END;
  6009. END;
  6010. IF hasDynamicPart THEN
  6011. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6012. Convert(res2,addressType);
  6013. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6014. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6015. Emit(Sub(position,res2,imm,res2));
  6016. Emit(Add(position,res2,res2,operand.tag));
  6017. IntermediateCode.MakeMemory(res2,int32);
  6018. Emit(MovReplace(position,res,res2));
  6019. ReleaseIntermediateOperand(res2);
  6020. END;
  6021. SetLabel(end);
  6022. Convert(res,int32);
  6023. InitOperand(result,ModeValue);
  6024. result.op := res;
  6025. END;
  6026. END ArrayLen;
  6027. (**
  6028. create a temporary variable in current scope
  6029. **)
  6030. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN): SyntaxTree.Variable;
  6031. VAR name: SyntaxTree.Identifier; string: SyntaxTree.IdentifierString ; variable: SyntaxTree.Variable;
  6032. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6033. BEGIN
  6034. IF ~register THEN
  6035. variable := temporaries.GetFreeVariable(type, index);
  6036. ELSE
  6037. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6038. END;
  6039. scope := currentScope;
  6040. IF variable = NIL THEN
  6041. COPY("@hiddenIRVar",string);
  6042. Basic.AppendNumber(string,index);
  6043. name := SyntaxTree.NewIdentifier(string);
  6044. variable := SyntaxTree.NewVariable(Diagnostics.Invalid,name);
  6045. variable.SetType(type);
  6046. variable.SetAccess(SyntaxTree.Hidden);
  6047. IF ~register THEN
  6048. temporaries.AddVariable(variable);
  6049. IF scope.lastVariable # NIL THEN
  6050. offset := scope.lastVariable.offsetInBits;
  6051. ELSE
  6052. offset := 0;
  6053. END;
  6054. DEC(offset,system.SizeOf(variable.type));
  6055. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6056. variable(SyntaxTree.Variable).SetOffset(offset);
  6057. scope.AddVariable(variable(SyntaxTree.Variable));
  6058. scope.EnterSymbol(variable, duplicate);
  6059. ASSERT(~duplicate);
  6060. InitVariable(variable(SyntaxTree.Variable));
  6061. ELSE
  6062. variable.SetUseRegister(TRUE);
  6063. variable(SyntaxTree.Variable).SetOffset(0);
  6064. END;
  6065. ELSE
  6066. InitVariable(variable(SyntaxTree.Variable));
  6067. (*
  6068. ASSERT(variable.type.resolved = type.resolved)
  6069. *)
  6070. END;
  6071. RETURN variable(SyntaxTree.Variable)
  6072. END GetTemporaryVariable;
  6073. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6074. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6075. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6076. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6077. i: LONGINT; duplicate: BOOLEAN;
  6078. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6079. VAR variable: SyntaxTree.Variable;
  6080. BEGIN
  6081. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier(name));
  6082. variable.SetType(type);
  6083. recordScope.AddVariable(variable);
  6084. END AddVariable;
  6085. BEGIN
  6086. name := "@ArrayDescriptor";
  6087. Basic.AppendNumber(name,dimensions);
  6088. identifier := SyntaxTree.NewIdentifier(name);
  6089. parentScope := module.module.moduleScope;
  6090. symbol := parentScope.FindSymbol(identifier);
  6091. IF symbol # NIL THEN
  6092. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6093. type := typeDeclaration.declaredType;
  6094. ELSE
  6095. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier(name));
  6096. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6097. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6098. recordType := SyntaxTree.NewRecordType( -1, parentScope, recordScope);
  6099. recordType.SetTypeDeclaration(typeDeclaration);
  6100. recordType.SetState(SyntaxTree.Resolved);
  6101. typeDeclaration.SetDeclaredType(recordType);
  6102. AddVariable("@ptr",system.anyType);
  6103. AddVariable("@adr",system.addressType);
  6104. AddVariable("@flags",system.addressType);
  6105. AddVariable("@dim",system.addressType);
  6106. AddVariable("@elementSize",system.addressType);
  6107. FOR i := 0 TO dimensions-1 DO
  6108. name := "@len";
  6109. Basic.AppendNumber(name,i);
  6110. AddVariable(name,system.addressType);
  6111. name := "@incr";
  6112. Basic.AppendNumber(name,i);
  6113. AddVariable(name,system.addressType);
  6114. END;
  6115. parentScope.AddTypeDeclaration(typeDeclaration);
  6116. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6117. ASSERT(~duplicate);
  6118. type := recordType;
  6119. END;
  6120. RETURN type
  6121. END GetMathArrayDescriptorType;
  6122. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6123. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6124. BEGIN
  6125. type := GetMathArrayDescriptorType(dimensions);
  6126. Emit(Push(position,op.op));
  6127. (* push type descriptor *)
  6128. reg := TypeDescriptorAdr(type);
  6129. IF ~newObjectFile THEN
  6130. IntermediateCode.MakeMemory(reg,addressType);
  6131. END;
  6132. Emit(Push(position,reg));
  6133. ReleaseIntermediateOperand(reg);
  6134. (* push realtime flag: false by default *)
  6135. Emit(Push(position,false));
  6136. CallThis(position,"Heaps","NewRec",3);
  6137. END NewMathArrayDescriptor;
  6138. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6139. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6140. BEGIN
  6141. NEW(string, LEN(s)); COPY(s, string^);
  6142. sv := SyntaxTree.NewStringValue(-1,string);
  6143. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  6144. sv.SetType(type);
  6145. Designate(sv,res);
  6146. Emit(Push(position,res.tag));
  6147. Emit(Push(position,res.op));
  6148. ReleaseOperand(res);
  6149. END PushConstString;
  6150. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6151. BEGIN
  6152. IF b THEN
  6153. Emit(Push(-1, true));
  6154. ELSE
  6155. Emit(Push(-1, false));
  6156. END;
  6157. END PushConstBoolean;
  6158. PROCEDURE PushConstSet(v: SET);
  6159. VAR value: SyntaxTree.Value; op: Operand;
  6160. BEGIN
  6161. value := SyntaxTree.NewSetValue(-1, v);
  6162. value.SetType(system.setType);
  6163. Evaluate(value, op);
  6164. Emit(Push(-1, op.op));
  6165. ReleaseOperand(op);
  6166. END PushConstSet;
  6167. PROCEDURE PushConstInteger(v: LONGINT);
  6168. VAR value: SyntaxTree.Value; op: Operand;
  6169. BEGIN
  6170. value := SyntaxTree.NewIntegerValue(-1, v);
  6171. value.SetType(system.longintType);
  6172. Evaluate(value, op);
  6173. Emit(Push(-1, op.op));
  6174. ReleaseOperand(op);
  6175. END PushConstInteger;
  6176. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6177. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6178. section: IntermediateCode.Section;
  6179. BEGIN
  6180. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6181. Global.GetSymbolSegmentedName(symbol, name);
  6182. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6183. procedure := SyntaxTree.NewProcedure(-1, SyntaxTree.NewIdentifier(""), procedureScope);
  6184. procedure.SetScope(moduleScope);
  6185. procedure.SetType(SyntaxTree.NewProcedureType(-1,scope));
  6186. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6187. procedure.SetAccess(SyntaxTree.Hidden);
  6188. currentScope := procedureScope;
  6189. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6190. EmitEnter(section, -1,NIL,0,0,0);
  6191. RETURN section;
  6192. END OpenInitializer;
  6193. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6194. BEGIN
  6195. EmitLeave(section, 0, 0 );
  6196. Emit(Exit(-1,ToMemoryUnits(system,addressType.sizeInBits),0));
  6197. section := prev;
  6198. END CloseInitializer;
  6199. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6200. VAR name: SyntaxTree.IdentifierString;
  6201. variable: SyntaxTree.Variable;
  6202. type: SyntaxTree.Type;
  6203. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6204. BEGIN
  6205. InitOperand(op,ModeReference);
  6206. op.op := fp;
  6207. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6208. Dereference(op, x, FALSE);
  6209. result := op;
  6210. Symbol(symbol, op);
  6211. END Field;
  6212. PROCEDURE Direction(direction: LONGINT): SET;
  6213. BEGIN
  6214. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6215. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6216. ELSE HALT(100);
  6217. END;
  6218. END Direction;
  6219. PROCEDURE AddPortProperty(port: SyntaxTree.Variable; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6220. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6221. BEGIN
  6222. Field(port, op);
  6223. ToMemory(op.op,addressType,0);
  6224. Emit(Push(-1, op.op));
  6225. ReleaseOperand(op);
  6226. Basic.GetString(modifier.identifier, name);
  6227. PushConstString(name);
  6228. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6229. ASSERT(SemanticChecker.IsStringType(value.type));
  6230. Designate(value, op);
  6231. Emit(Push(modifier.position, op.tag));
  6232. Emit(Push(modifier.position, op.op));
  6233. ReleaseOperand(op);
  6234. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6235. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6236. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6237. Evaluate(value, op);
  6238. Emit(Push(modifier.position, op.op));
  6239. ReleaseOperand(op);
  6240. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6241. ELSE
  6242. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6243. END;
  6244. END AddPortProperty;
  6245. PROCEDURE AddPortProperties(variable: SyntaxTree.Variable);
  6246. VAR modifier: SyntaxTree.Modifier;
  6247. BEGIN
  6248. modifier := variable.modifiers;
  6249. WHILE modifier # NIL DO
  6250. AddPortProperty(variable,modifier, modifier.expression);
  6251. modifier := modifier.nextModifier;
  6252. END;
  6253. END AddPortProperties;
  6254. PROCEDURE Variable(name: ARRAY OF CHAR; variable: SyntaxTree.Variable);
  6255. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6256. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6257. PROCEDURE PushLens(type: SyntaxTree.Type);
  6258. BEGIN
  6259. IF IsSemiDynamicArray(type) THEN
  6260. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6261. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6262. Emit(Push(-1, op.op));
  6263. ReleaseOperand(op);
  6264. INC(dim);
  6265. ELSIF IsStaticArray(type) THEN
  6266. len := len * type(SyntaxTree.ArrayType).staticLength;
  6267. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6268. INC(dim);
  6269. ELSE
  6270. baseType := type;
  6271. END;
  6272. END PushLens;
  6273. BEGIN
  6274. (* cell *)
  6275. IF variable.type IS SyntaxTree.ArrayType THEN
  6276. type := variable.type;
  6277. dim := 0;
  6278. len := 1;
  6279. PushLens(type);
  6280. portType := baseType.resolved(SyntaxTree.PortType);
  6281. ELSE
  6282. portType := variable.type(SyntaxTree.PortType);
  6283. END;
  6284. PushSelfPointer();
  6285. (* port / array of ports *)
  6286. IF IsStaticArray(type) THEN
  6287. PushConstInteger(len);
  6288. END;
  6289. Field(variable, op);
  6290. (*left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6291. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(x);
  6292. d := SyntaxTree.NewSymbolDesignator(-1, left, variable); d.SetType(variable.type);
  6293. Designate(d, op);*)
  6294. Emit(Push(-1, op.op));
  6295. ReleaseOperand(op);
  6296. (* name *)
  6297. PushConstString(name);
  6298. (* inout *)
  6299. PushConstSet(Direction(portType.direction));
  6300. (* width *)
  6301. PushConstInteger(portType.sizeInBits);
  6302. IF variable.type IS SyntaxTree.PortType THEN
  6303. CallThis(variable.position,"ActiveCellsRuntime","AddPort",6);
  6304. AddPortProperties(variable);
  6305. ELSIF IsStaticArray(type)THEN
  6306. CallThis(variable.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6307. ELSIF IsSemiDynamicArray(type) THEN
  6308. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6309. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6310. Emit(Add(position,reg, sp, size));
  6311. (* dim *)
  6312. PushConstInteger(dim);
  6313. (* len array *)
  6314. Emit(Push(position, reg));
  6315. ReleaseIntermediateOperand(reg);
  6316. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6317. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6318. Emit(Add(position, sp,sp, size));
  6319. ELSE
  6320. HALT(100);
  6321. END;
  6322. END Variable;
  6323. BEGIN
  6324. IF backend.cellsAreObjects THEN
  6325. variable := x.cellScope.firstVariable;
  6326. WHILE (variable # NIL) DO
  6327. type := variable.type.resolved;
  6328. WHILE (type IS SyntaxTree.ArrayType) DO
  6329. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6330. END;
  6331. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6332. Global.GetSymbolNameInScope(variable,x.cellScope,name);
  6333. Variable(name,variable);
  6334. END;
  6335. variable := variable.nextVariable;
  6336. END;
  6337. ELSE HALT(200)
  6338. END;
  6339. (*prevActiveCellsScope := currentActiveCellsScope;*)
  6340. (*
  6341. x.typeDeclaration.GetName(componentName);
  6342. instanceType := currentActiveCellsScope.NewType(componentName); (*backend.cification.NewType(componentName);*)
  6343. IF HasValue(x.modifiers,Global.StringDataMemorySize,dataMemorySize) THEN
  6344. instanceType.SetDataMemorySize(dataMemorySize);
  6345. END;
  6346. IF HasValue(x.modifiers,Global.StringCodeMemorySize,codeMemorySize) THEN
  6347. instanceType.SetInstructionMemorySize(codeMemorySize)
  6348. END;
  6349. IF HasFlag(x.modifiers, Global.StringVector) THEN
  6350. instanceType.AddCapability(ActiveCells.VectorCapability)
  6351. END;
  6352. IF HasFlag(x.modifiers, Global.StringTRMS) THEN
  6353. instanceType.AddCapability(ActiveCells.TRMSCapability)
  6354. END;
  6355. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN
  6356. instanceType.AddCapability(ActiveCells.FloatingPointCapability)
  6357. END;
  6358. AddDevices(instanceType, x);
  6359. *)
  6360. (*
  6361. IF x.isCellNet THEN
  6362. IF HasValue(x.modifiers,Global.StringFrequencyDivider,value) THEN backend.activeCellsSpecification.SetFrequencyDivider(value) END;
  6363. END;
  6364. *)
  6365. (*currentActiveCellsScope := instanceType;*)
  6366. (*
  6367. parameter := x.firstParameter;
  6368. portIndex := 0;
  6369. WHILE parameter # NIL DO
  6370. parameter.GetName(parameterName);
  6371. parameterType := parameter.type.resolved;
  6372. Parameter(parameterName, parameterType);
  6373. (*
  6374. IF SemanticChecker.IsStaticArray(parameterType,parameterType,len) THEN
  6375. ParameterArray(parameterType);
  6376. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6377. FOR i := 0 TO len-1 DO
  6378. COPY(parameterName,name);
  6379. AppendIndex(name,i);
  6380. port := instanceType.NewPort(name,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6381. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6382. INC(portIndex);
  6383. END;
  6384. ELSE
  6385. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6386. port := instanceType.NewPort(parameterName,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6387. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6388. INC(portIndex);
  6389. END;
  6390. *)
  6391. parameter := parameter.nextParameter;
  6392. END;
  6393. *)
  6394. (*
  6395. Scope(x.cellScope);
  6396. currentActiveCellsScope := prevActiveCellsScope;
  6397. AddModules(instanceType,x.cellScope);
  6398. *)
  6399. END AddPorts;
  6400. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6401. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6402. BEGIN
  6403. Symbol(cell,op);
  6404. ToMemory(op.op,addressType,0);
  6405. Emit(Push(position,op.op));
  6406. ReleaseOperand(op);
  6407. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6408. PushConstString(name);
  6409. IF SemanticChecker.IsStringType(property.type) OR (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6410. left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6411. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(cellType);
  6412. d := SyntaxTree.NewSymbolDesignator(-1, left, property); d.SetType(property.type);
  6413. Designate(d, op);
  6414. IF SemanticChecker.IsStringType(property.type) THEN
  6415. Emit(Push(-1, op.tag))
  6416. END;
  6417. Emit(Push(-1, op.op));
  6418. ReleaseOperand(op);
  6419. END;
  6420. IF SemanticChecker.IsStringType(property.type) THEN
  6421. ASSERT(SemanticChecker.IsStringType(value.type));
  6422. Designate(value, op);
  6423. Emit(Push(property.position, op.tag));
  6424. Emit(Push(property.position, op.op));
  6425. ReleaseOperand(op);
  6426. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6427. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6428. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6429. Evaluate(value, op);
  6430. Emit(Push(property.position, op.op));
  6431. ReleaseOperand(op);
  6432. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6433. ELSE
  6434. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6435. END;
  6436. END AddProperty;
  6437. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6438. VAR symbol: SyntaxTree.Symbol;
  6439. BEGIN
  6440. WHILE modifier # NIL DO
  6441. symbol := cellType.cellScope.FindSymbol(modifier.identifier);
  6442. IF (symbol # NIL) & (symbol IS SyntaxTree.Property) THEN
  6443. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6444. ELSE
  6445. (*! move this check to checker *)
  6446. Error(modifier.position, "undefined property");
  6447. END;
  6448. modifier := modifier.nextModifier;
  6449. END;
  6450. END AddModifiers;
  6451. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6452. VAR last: SyntaxTree.Modifier;
  6453. BEGIN
  6454. IF to = NIL THEN
  6455. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6456. ELSE
  6457. last := to;
  6458. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6459. last := last.nextModifier;
  6460. END;
  6461. IF last.identifier # this.identifier THEN
  6462. ASSERT(last.nextModifier = NIL);
  6463. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6464. END;
  6465. END;
  6466. END AppendModifier;
  6467. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6468. BEGIN
  6469. WHILE this # NIL DO
  6470. AppendModifier(to, this);
  6471. this := this.nextModifier;
  6472. END;
  6473. END AppendModifiers;
  6474. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6475. VAR op: Operand;
  6476. BEGIN
  6477. Evaluate(p, op);
  6478. Emit(Push(p.position, op.op));
  6479. ReleaseOperand(op);
  6480. (*
  6481. WHILE (p # NIL) & ~(p.type.resolved IS SyntaxTree.CellType) DO
  6482. p := p(SyntaxTree.Designator).left;
  6483. END;
  6484. IF p # NIL THEN
  6485. Evaluate(p, op);
  6486. Emit(Push(p.position, op.op));
  6487. ReleaseOperand(op);
  6488. ELSE
  6489. Emit(Push(-1, nil));
  6490. END;
  6491. *)
  6492. END PushPort;
  6493. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6494. VAR
  6495. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6496. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6497. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6498. tmp:IntermediateCode.Operand;
  6499. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6500. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6501. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6502. dest: IntermediateCode.Operand;
  6503. staticLength: LONGINT; itype: IntermediateCode.Type;
  6504. convert,isTensor: BOOLEAN;
  6505. recordType: SyntaxTree.RecordType;
  6506. baseType: SyntaxTree.Type;
  6507. flags: SET;
  6508. left: SyntaxTree.Expression;
  6509. call: SyntaxTree.Designator;
  6510. procedure: SyntaxTree.Procedure;
  6511. temporaryVariable: SyntaxTree.Variable;
  6512. dummy: IntermediateCode.Operand;
  6513. customBuiltin: SyntaxTree.CustomBuiltin;
  6514. isVarPar: ARRAY 3 OF BOOLEAN;
  6515. callsection: Sections.Section;
  6516. segmentedName: Basic.SegmentedName;
  6517. needsTrace: BOOLEAN;
  6518. n: ARRAY 256 OF CHAR;
  6519. modifier: SyntaxTree.Modifier;
  6520. previous, init: IntermediateCode.Section;
  6521. prevScope: SyntaxTree.Scope;
  6522. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6523. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6524. priority: IntermediateCode.Operand;
  6525. op,callop: Operand;
  6526. BEGIN
  6527. IF type = NIL THEN RETURN END;
  6528. type := type.resolved;
  6529. IF type IS SyntaxTree.PointerType THEN
  6530. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6531. END;
  6532. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6533. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6534. recordScope := type(SyntaxTree.RecordType).recordScope;
  6535. IF recordScope.bodyProcedure # NIL THEN
  6536. procedure := recordScope.bodyProcedure;
  6537. body := procedure.procedureScope.body;
  6538. Emit(Push(position,self));
  6539. IF body.isActive THEN
  6540. StaticCallOperand(callop,procedure);
  6541. Emit(Push(position,callop.op));
  6542. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6543. Convert(priority,sizeType);
  6544. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6545. END;
  6546. Emit(Push(position,priority));
  6547. ReleaseIntermediateOperand(priority);
  6548. IF backend.cooperative THEN
  6549. Emit(Push(position,self));
  6550. CallThis(position,"Activities","Create",3)
  6551. ELSE
  6552. flags := 0;
  6553. IF body.isSafe THEN
  6554. flags := 1;
  6555. END;
  6556. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6557. Emit(Push(position,self));
  6558. CallThis(position,"Objects","CreateProcess",4)
  6559. END;
  6560. ELSE
  6561. Emit(Push(position,self));
  6562. StaticCallOperand(callop,procedure);
  6563. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6564. END;
  6565. Emit(Pop(position,self));
  6566. END;
  6567. END CallBodies;
  6568. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6569. BEGIN
  6570. actualType := actualType.resolved;
  6571. IF actualType IS SyntaxTree.StringType THEN
  6572. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6573. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6574. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6575. ELSE
  6576. tmp := op.tag;
  6577. IntermediateCode.MakeMemory(tmp,addressType);
  6578. Emit(Push(position,tmp));
  6579. END;
  6580. Emit(Push(position,op.op))
  6581. END PushString;
  6582. PROCEDURE PushTD(type: SyntaxTree.Type);
  6583. VAR op: IntermediateCode.Operand;
  6584. BEGIN
  6585. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6586. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6587. ELSE
  6588. IF type.resolved IS SyntaxTree.PointerType THEN
  6589. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6590. END;
  6591. op := TypeDescriptorAdr(type.resolved);
  6592. IF ~newObjectFile THEN
  6593. IntermediateCode.MakeMemory(op,addressType);
  6594. END;
  6595. Emit(Push(position,op));
  6596. END
  6597. END PushTD;
  6598. BEGIN
  6599. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6600. dest := destination; destination := emptyOperand;
  6601. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6602. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6603. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6604. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6605. CASE x.id OF
  6606. (* ---- COPY ----- *)
  6607. |Global.Copy:
  6608. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6609. (* ---- EXCL, INCL----- *)
  6610. |Global.Excl,Global.Incl:
  6611. Evaluate(p0,s0);
  6612. Evaluate(p1,s1);
  6613. Convert(s1.op,setType);
  6614. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6615. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6616. END;
  6617. ReuseCopy(res,s0.op);
  6618. ReleaseOperand(s0);
  6619. Reuse1(tmp,s1.op);
  6620. ReleaseOperand(s1);
  6621. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6622. IF x.id = Global.Excl THEN
  6623. Emit(Not(position,tmp,tmp));
  6624. Emit(And(position,res,res,tmp));
  6625. ELSE
  6626. Emit(Or(position,res,res,tmp));
  6627. END;
  6628. ReleaseIntermediateOperand(tmp);
  6629. Designate(p0,s0);
  6630. ToMemory(s0.op,setType,0);
  6631. Emit(Mov(position,s0.op,res));
  6632. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6633. (* ---- DISPOSE ----- *)
  6634. |Global.Dispose:
  6635. Designate(p0,s0);
  6636. Emit(Push(position,s0.op));
  6637. ReleaseOperand(s0);
  6638. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6639. (* ---- GETPROCEDURE ----- *)
  6640. |Global.GetProcedure:
  6641. Designate(p0,s0);
  6642. PushString(s0,p0.type);
  6643. Designate(p1,s1);
  6644. PushString(s1,p1.type);
  6645. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6646. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6647. ELSE PushTD(procedureType.firstParameter.type)
  6648. END;
  6649. PushTD(procedureType.returnType);
  6650. Designate(p2,s2);
  6651. Emit(Push(position,s2.op));
  6652. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6653. CallThis(position,"Modules","GetProcedure", 7);
  6654. (* ---- ASH, LSH, ROT ----- *)
  6655. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6656. Evaluate(p0,s0);
  6657. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6658. (* make unsigned arguments in order to produced a logical shift *)
  6659. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6660. convert:= TRUE;
  6661. itype := s0.op.type;
  6662. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6663. Convert(s0.op,itype);
  6664. ELSE
  6665. convert := FALSE;
  6666. END;
  6667. END;
  6668. Evaluate(p1,s1);
  6669. IF IsIntegerConstant(p1,hint) THEN
  6670. ReuseCopy(reg,s0.op);
  6671. IF hint > 0 THEN
  6672. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6673. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6674. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6675. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  6676. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  6677. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  6678. END;
  6679. ELSIF hint < 0 THEN
  6680. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  6681. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  6682. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  6683. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  6684. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  6685. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  6686. END;
  6687. END;
  6688. ReleaseOperand(s0); ReleaseOperand(s1);
  6689. ELSE
  6690. exit := NewLabel();
  6691. end := NewLabel();
  6692. ReuseCopy(reg,s0.op);
  6693. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  6694. Reuse1(tmp,s1.op);
  6695. Emit(Neg(position,tmp,s1.op));
  6696. Convert(tmp,s1.op.type);
  6697. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  6698. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  6699. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  6700. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  6701. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  6702. END;
  6703. ReleaseIntermediateOperand(tmp);
  6704. BrL(end);
  6705. SetLabel(exit);
  6706. ReuseCopy(tmp,s1.op);
  6707. Convert(tmp,s1.op.type);
  6708. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  6709. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  6710. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  6711. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  6712. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  6713. END;
  6714. ReleaseIntermediateOperand(tmp);
  6715. SetLabel(end);
  6716. ReleaseOperand(s0); ReleaseOperand(s1);
  6717. END;
  6718. InitOperand(result,ModeValue);
  6719. IF convert THEN
  6720. itype := reg.type;
  6721. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  6722. Convert(reg,itype);
  6723. END;
  6724. result.op := reg;
  6725. (* ---- CAP ----- *)
  6726. |Global.Cap:
  6727. Evaluate(p0,result);
  6728. ReuseCopy(reg,result.op);
  6729. ReleaseIntermediateOperand(result.op);
  6730. ignore := NewLabel();
  6731. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  6732. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  6733. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  6734. SetLabel(ignore);
  6735. result.op := reg;
  6736. (* ---- CHR ----- *)
  6737. |Global.Chr, Global.Chr32:
  6738. Evaluate(p0,result);
  6739. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6740. |Global.Entier, Global.EntierH:
  6741. Evaluate(p0,result);
  6742. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6743. (* ---- MIN and MAX ----- *)
  6744. |Global.Max,Global.Min:
  6745. Evaluate(p0,s0);
  6746. Evaluate(p1,s1);
  6747. Reuse2(res,s0.op,s1.op);
  6748. else := NewLabel();
  6749. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  6750. ELSE BrltL(else,s1.op,s0.op) END;
  6751. Emit(Mov(position,res,s0.op));
  6752. ReleaseOperand(s0);
  6753. end := NewLabel();
  6754. BrL(end);
  6755. SetLabel(else);
  6756. Emit(MovReplace(position,res,s1.op));
  6757. SetLabel(end);
  6758. ReleaseOperand(s1);
  6759. InitOperand(result,ModeValue);
  6760. result.op := res;
  6761. (* ---- ODD ----- *)
  6762. |Global.Odd:
  6763. IF ~conditional THEN
  6764. ConditionToValue(x)
  6765. ELSE
  6766. Evaluate(p0,result);
  6767. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6768. Reuse1(res,result.op);
  6769. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  6770. ReleaseIntermediateOperand(result.op);
  6771. result.op := res;
  6772. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  6773. ReleaseOperand(result);
  6774. BrL(falseLabel);
  6775. END;
  6776. (* ---- ORD ----- *)
  6777. |Global.Ord, Global.Ord32:
  6778. Evaluate(p0,result);
  6779. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6780. (* ---- SHORT, LONG ----- *)
  6781. |Global.Short, Global.Long:
  6782. Evaluate(p0,result);
  6783. IF x.type IS SyntaxTree.ComplexType THEN
  6784. componentType := x.type(SyntaxTree.ComplexType).componentType;
  6785. Convert(result.op, IntermediateCode.GetType(system, componentType));
  6786. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  6787. ELSE
  6788. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6789. END
  6790. (* ---- HALT, SYSTEM.HALT----- *)
  6791. |Global.Halt, Global.systemHalt:
  6792. val := p0.resolved(SyntaxTree.IntegerValue).value;
  6793. EmitTrap (position, val);
  6794. (* ---- ASSERT ----- *)
  6795. |Global.Assert:
  6796. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  6797. trueL := NewLabel();
  6798. falseL := NewLabel();
  6799. Condition(p0,trueL,falseL);
  6800. IF p1 = NIL THEN val := AssertTrap
  6801. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  6802. END;
  6803. SetLabel(falseL);
  6804. EmitTrap(position,val);
  6805. SetLabel(trueL);
  6806. END;
  6807. (*
  6808. Emit(TrapC(result.op,val);
  6809. *)
  6810. (* ---- INC, DEC----- *)
  6811. |Global.Inc,Global.Dec:
  6812. Expression(p0); adr := result.op;
  6813. LoadValue(result,p0.type); l := result;
  6814. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6815. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  6816. END;
  6817. IF x.id = Global.Inc THEN
  6818. Emit(Add(position,l.op,l.op,r.op));
  6819. ELSE
  6820. Emit(Sub(position,l.op,l.op,r.op));
  6821. END;
  6822. ReleaseOperand(l); ReleaseOperand(r);
  6823. (* ---- LEN ----- *)
  6824. |Global.Len: (* dynamic length, static length done by checker *)
  6825. Designate(p0,operand);
  6826. IF p1 = NIL THEN
  6827. InitOperand(l,ModeValue);
  6828. l.op := IntermediateCode.Immediate(int32,0);
  6829. ELSE
  6830. Evaluate(p1,l);
  6831. END;
  6832. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  6833. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  6834. Dereference(operand, p0.type.resolved, FALSE);
  6835. END;
  6836. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  6837. ReleaseOperand(operand); ReleaseOperand(l);
  6838. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  6839. ASSERT(p1 # NIL);
  6840. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  6841. Dereference(operand,p0.type.resolved,FALSE);
  6842. END;
  6843. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  6844. ReleaseOperand(operand); ReleaseOperand(l);
  6845. ELSE HALT(100);
  6846. END;
  6847. Convert(result.op,IntermediateCode.GetType(system, x.type));
  6848. (* ---- FIRST ---- *)
  6849. |Global.First:
  6850. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6851. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  6852. ELSE
  6853. Designate(p0, result)
  6854. END
  6855. (* ---- LAST ---- *)
  6856. |Global.Last:
  6857. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6858. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  6859. ELSE
  6860. Designate(p0, result);
  6861. (* make sure result.op is a register *)
  6862. tmp := result.op;
  6863. ReuseCopy(result.op, result.op);
  6864. ReleaseIntermediateOperand(tmp);
  6865. (* add offset to result.op *)
  6866. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6867. END
  6868. (* ---- STEP ---- *)
  6869. |Global.Step:
  6870. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6871. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  6872. ELSE
  6873. Designate(p0, result);
  6874. (* make sure result.op is a register *)
  6875. tmp := result.op;
  6876. ReuseCopy(result.op, result.op);
  6877. ReleaseIntermediateOperand(tmp);
  6878. (* add offset to result.op *)
  6879. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6880. END
  6881. (* ---- RE ---- *)
  6882. |Global.Re:
  6883. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  6884. Designate(p0, result)
  6885. ELSE
  6886. Evaluate(p0, result)
  6887. END
  6888. (* ---- IM ---- *)
  6889. |Global.Im:
  6890. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  6891. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  6892. Designate(p0, result);
  6893. (* make sure result.op is a register *)
  6894. tmp := result.op;
  6895. ReuseCopy(result.op, result.op);
  6896. ReleaseIntermediateOperand(tmp);
  6897. (* add offset to result.op *)
  6898. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  6899. (* ---- ABS ----- *)
  6900. |Global.Abs:
  6901. Evaluate(p0,operand);
  6902. type := p0.type.resolved;
  6903. InitOperand(result,ModeValue);
  6904. Reuse1a(result.op,operand.op,dest);
  6905. Emit(Abs(position,result.op,operand.op));
  6906. ReleaseOperand(operand);
  6907. (* ---- WAIT ----- *)
  6908. |Global.Wait:
  6909. Evaluate(p0,operand);
  6910. Emit(Push(position,operand.op));
  6911. ReleaseOperand(operand);
  6912. CallThis(position,"Activities","Wait", 1);
  6913. (* ---- NEW ----- *)
  6914. |Global.New:
  6915. (*! the following code is only correct for "standard" Oberon calling convention *)
  6916. type := p0.type.resolved;
  6917. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  6918. THEN
  6919. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  6920. IF backend.cooperative THEN
  6921. size := ToMemoryUnits(system,system.SizeOf(recordType));
  6922. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6923. IF recordType.isObject THEN
  6924. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6925. IF recordType.IsActive() THEN
  6926. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6927. END;
  6928. IF recordType.IsProtected() THEN
  6929. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6930. END;
  6931. ELSE
  6932. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6933. END;
  6934. END;
  6935. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  6936. CallThis(position,"Runtime","New", 1);
  6937. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  6938. Emit(Result(position, pointer));
  6939. exit := NewLabel();
  6940. BreqL(exit,pointer,nil);
  6941. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6942. GetRecordTypeName (recordType,name);
  6943. IF ~recordType.isObject THEN
  6944. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  6945. END;
  6946. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  6947. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  6948. IF recordType.isObject THEN
  6949. IF recordType.IsProtected() THEN
  6950. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6951. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6952. END;
  6953. IF recordType.IsActive() THEN
  6954. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6955. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6956. END;
  6957. END;
  6958. END;
  6959. (* initialize fields *)
  6960. IF type(SyntaxTree.PointerType).isPlain THEN
  6961. size := 0;
  6962. ELSIF recordType.isObject THEN
  6963. size := BaseObjectTypeSize;
  6964. ELSE
  6965. size := BaseRecordTypeSize;
  6966. END;
  6967. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  6968. (* call initializer *)
  6969. constructor := GetConstructor(recordType);
  6970. IF constructor # NIL THEN
  6971. (*! should be unified with ProcedureCallDesignator *)
  6972. Emit(Push(position,pointer));
  6973. ReleaseIntermediateOperand(pointer);
  6974. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  6975. FOR i := 1 TO x.parameters.Length()-1 DO
  6976. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  6977. formalParameter := formalParameter.nextParameter;
  6978. END;
  6979. (* static call of the constructor *)
  6980. GetCodeSectionNameForSymbol(constructor,name);
  6981. ASSERT(~constructor.isInline);
  6982. IF constructor.scope.ownerModule # module.module THEN
  6983. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6984. ELSE
  6985. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6986. END;
  6987. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  6988. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6989. Emit(Pop(position,pointer));
  6990. END;
  6991. (* call bodies *)
  6992. CallBodies(pointer,p0.type);
  6993. SetLabel(exit);
  6994. needsTrace := p0.NeedsTrace();
  6995. IF needsTrace THEN ModifyAssignments(true) END;
  6996. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  6997. Emit(Push(position, pointer));
  6998. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  6999. Emit(Pop(position, pointer));
  7000. END;
  7001. Designate(p0,l);
  7002. IF needsTrace THEN
  7003. CallAssignPointer(l.op, pointer);
  7004. ELSE
  7005. ToMemory(l.op,addressType,0);
  7006. Emit(Mov(position,l.op,pointer));
  7007. END;
  7008. ReleaseIntermediateOperand(pointer);
  7009. ReleaseOperand(l);
  7010. IF needsTrace THEN ModifyAssignments(false) END;
  7011. ELSE
  7012. temporaryVariable := GetTemporaryVariable(type, FALSE);
  7013. IF temporaryVariable # NIL THEN
  7014. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7015. ELSE
  7016. Designate(p0,l);
  7017. END;
  7018. (* l.op contains address of pointer to record *)
  7019. Emit(Push(position,l.op)); (* address for use after syscall *)
  7020. Emit(Push(position,l.op));
  7021. ReleaseOperand(l);
  7022. (* push type descriptor *)
  7023. reg := TypeDescriptorAdr(recordType);
  7024. IF ~newObjectFile THEN
  7025. IntermediateCode.MakeMemory(reg,addressType);
  7026. END;
  7027. Emit(Push(position,reg));
  7028. ReleaseIntermediateOperand(reg);
  7029. (* push realtime flag *)
  7030. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7031. ELSE Emit(Push(position,false));
  7032. END;
  7033. CallThis(position,"Heaps","NewRec", 3);
  7034. (* check allocation success, if not successful then do not call initializers and bodies *)
  7035. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7036. Emit(Pop(position,pointer));
  7037. MakeMemory(reg,pointer,addressType,0);
  7038. ReleaseIntermediateOperand(pointer);
  7039. pointer := reg;
  7040. exit := NewLabel();
  7041. BreqL(exit,pointer,nil);
  7042. Emit(Push(position,pointer));
  7043. (* initialize fields *)
  7044. InitFields(recordType, pointer,0);
  7045. (* call initializer *)
  7046. constructor := GetConstructor(recordType);
  7047. IF constructor # NIL THEN
  7048. (*! should be unified with ProcedureCallDesignator *)
  7049. Emit(Push(position,pointer));
  7050. ReleaseIntermediateOperand(pointer);
  7051. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7052. FOR i := 1 TO x.parameters.Length()-1 DO
  7053. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7054. formalParameter := formalParameter.nextParameter;
  7055. END;
  7056. (* static call of the constructor *)
  7057. GetCodeSectionNameForSymbol(constructor,name);
  7058. ASSERT(~constructor.isInline);
  7059. IF constructor.scope.ownerModule # module.module THEN
  7060. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7061. ELSE
  7062. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7063. END;
  7064. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7065. ELSE
  7066. ReleaseIntermediateOperand(pointer);
  7067. END;
  7068. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7069. Emit(Pop(position,pointer));
  7070. IF temporaryVariable # NIL THEN
  7071. Designate(p0,l);
  7072. ToMemory(l.op,addressType,0);
  7073. Emit(Mov(position,l.op,pointer));
  7074. ReleaseOperand(l);
  7075. result.tag := emptyOperand;
  7076. END;
  7077. (* call bodies *)
  7078. CallBodies(pointer,p0.type);
  7079. ReleaseIntermediateOperand(pointer);
  7080. IF temporaryVariable # NIL THEN
  7081. end := NewLabel();
  7082. BrL(end);
  7083. SetLabel(exit);
  7084. Designate(p0,l);
  7085. ToMemory(l.op,addressType,0);
  7086. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7087. ReleaseOperand(l);
  7088. SetLabel(end);
  7089. ELSE
  7090. SetLabel(exit);
  7091. END;
  7092. END;
  7093. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7094. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7095. dim := 0;
  7096. IF p1 # NIL THEN
  7097. FOR i := 1 TO x.parameters.Length()-1 DO
  7098. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7099. parameter := x.parameters.GetExpression(i);
  7100. Evaluate(parameter,r);
  7101. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7102. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7103. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7104. END;
  7105. Emit(Push(position,r.op));
  7106. IF i=1 THEN
  7107. ReuseCopy(reg,r.op);
  7108. ELSE
  7109. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7110. END;
  7111. ReleaseOperand(r);
  7112. INC(dim);
  7113. END;
  7114. Convert(reg,addressType);
  7115. ELSE
  7116. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7117. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7118. END;
  7119. openDim := dim;
  7120. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7121. IF backend.cooperative THEN
  7122. size := ToMemoryUnits(system,system.SizeOf(type));
  7123. WHILE type IS SyntaxTree.ArrayType DO
  7124. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7125. END;
  7126. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7127. IF (size # 1) THEN
  7128. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7129. END;
  7130. Emit(Push(position,reg));
  7131. size := ToMemoryUnits(system,system.SizeOf(type));
  7132. IF (size # 1) THEN
  7133. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7134. END;
  7135. Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));
  7136. Emit(Push(position,reg));
  7137. ReleaseIntermediateOperand(reg);
  7138. CallThis(position,"Runtime","New", 1);
  7139. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7140. Emit(Result(position, pointer));
  7141. exit := NewLabel();
  7142. else := NewLabel();
  7143. BreqL(else,pointer,nil);
  7144. IF ~type.hasPointers THEN
  7145. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7146. ELSIF type IS SyntaxTree.RecordType THEN
  7147. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7148. ELSIF type IS SyntaxTree.ProcedureType THEN
  7149. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7150. ELSE
  7151. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7152. END;
  7153. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7154. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7155. 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))));
  7156. IF type IS SyntaxTree.RecordType THEN
  7157. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7158. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7159. ELSE
  7160. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7161. END;
  7162. i := openDim;
  7163. WHILE i > 0 DO
  7164. DEC (i);
  7165. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7166. END;
  7167. needsTrace := p0.NeedsTrace();
  7168. IF needsTrace THEN ModifyAssignments(true) END;
  7169. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7170. Emit(Push(position, pointer));
  7171. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7172. Emit(Pop(position, pointer));
  7173. END;
  7174. Designate(p0,l);
  7175. IF needsTrace THEN
  7176. CallAssignPointer(l.op, pointer);
  7177. ModifyAssignments(false);
  7178. ELSE
  7179. ToMemory(l.op,addressType,0);
  7180. Emit(Mov(position,l.op,pointer));
  7181. END;
  7182. ReleaseIntermediateOperand(pointer);
  7183. ReleaseOperand(l);
  7184. BrL(exit);
  7185. SetLabel(else);
  7186. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7187. Designate(p0,l);
  7188. IF needsTrace THEN
  7189. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7190. ELSE
  7191. ToMemory(l.op,addressType,0);
  7192. Emit(Mov(position,l.op,pointer));
  7193. END;
  7194. ReleaseOperand(l);
  7195. SetLabel(exit);
  7196. ELSE
  7197. (*! the following code is only correct for "standard" Oberon calling convention *)
  7198. IF SemanticChecker.ContainsPointer(type) THEN
  7199. IF type IS SyntaxTree.ArrayType THEN
  7200. staticLength := 1;
  7201. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7202. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7203. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7204. END;
  7205. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7206. Emit(Mul(position,reg,reg,tmp));
  7207. END;
  7208. Designate(p0,l);
  7209. IF openDim > 0 THEN
  7210. Emit(Push(position,l.op)); (* address for use after syscall *)
  7211. END;
  7212. Emit(Push(position,l.op)); (* address *)
  7213. ReleaseOperand(l);
  7214. tmp := TypeDescriptorAdr(type);
  7215. IF ~newObjectFile THEN
  7216. IntermediateCode.MakeMemory(tmp,addressType);
  7217. END;
  7218. Emit(Push(position,tmp)); (* type descriptor *)
  7219. ReleaseIntermediateOperand(tmp);
  7220. Emit(Push(position,reg)); (* number Elements *)
  7221. ReleaseIntermediateOperand(reg);
  7222. tmp := IntermediateCode.Immediate(addressType,dim);
  7223. Emit(Push(position,tmp)); (* dimensions *)
  7224. (* push realtime flag *)
  7225. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7226. ELSE Emit(Push(position,false));
  7227. END;
  7228. CallThis(position,"Heaps","NewArr",5)
  7229. ELSE
  7230. size := ToMemoryUnits(system,system.SizeOf(type));
  7231. IF (size # 1) THEN
  7232. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7233. END;
  7234. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7235. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7236. Emit(Add(position,reg,reg,tmp));
  7237. Designate(p0,l);
  7238. IF openDim >0 THEN
  7239. Emit(Push(position,l.op)); (* address for use after syscall *)
  7240. END;
  7241. Emit(Push(position,l.op)); (* address for syscall *)
  7242. ReleaseOperand(l); (* pointer address *)
  7243. Emit(Push(position,reg)); (* size *)
  7244. ReleaseIntermediateOperand(reg);
  7245. (* push realtime flag *)
  7246. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7247. ELSE Emit(Push(position,false));
  7248. END;
  7249. CallThis(position,"Heaps","NewSys", 3)
  7250. END;
  7251. IF openDim > 0 THEN
  7252. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7253. Emit(Pop(position,adr));
  7254. ToMemory(adr,addressType,0);
  7255. ReuseCopy(tmp,adr);
  7256. ReleaseIntermediateOperand(adr);
  7257. adr := tmp;
  7258. else := NewLabel();
  7259. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7260. i := openDim-1;
  7261. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7262. WHILE (i >= 0) DO
  7263. Emit(Pop(position,reg));
  7264. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7265. Emit(Mov(position,res,reg));
  7266. DEC(i);
  7267. END;
  7268. ReleaseIntermediateOperand(adr);
  7269. ReleaseIntermediateOperand(reg);
  7270. exit := NewLabel();
  7271. BrL(exit);
  7272. SetLabel(else);
  7273. (* else part: array could not be allocated *)
  7274. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7275. Emit(Add(position,sp,sp,tmp));
  7276. SetLabel(exit);
  7277. END;
  7278. END;
  7279. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7280. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7281. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7282. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7283. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7284. left.SetType(procedure.type);
  7285. formalParameter := procedureType.firstParameter;
  7286. (* push array to allocate *)
  7287. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7288. formalParameter :=formalParameter.nextParameter;
  7289. (* push length array *)
  7290. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7291. (* push size *)
  7292. type := t0;
  7293. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7294. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7295. END;
  7296. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7297. Emit(Push(position,tmp));
  7298. (* *)
  7299. IF SemanticChecker.ContainsPointer(type) THEN
  7300. tmp := TypeDescriptorAdr(type);
  7301. IF ~newObjectFile THEN
  7302. IntermediateCode.MakeMemory(tmp,addressType);
  7303. END;
  7304. ELSE
  7305. tmp := IntermediateCode.Immediate(addressType, 0);
  7306. END;
  7307. Emit(Push(position,tmp)); (* type descriptor *)
  7308. StaticCallOperand(result,procedure);
  7309. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7310. ReleaseOperand(result);
  7311. END;
  7312. (*
  7313. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7314. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7315. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7316. *)
  7317. ELSE
  7318. dim := 0;
  7319. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7320. (* generate geometry descriptor *)
  7321. Designate(p0,l);
  7322. NewMathArrayDescriptor(l, x.parameters.Length()-1);
  7323. ReleaseOperand(l);
  7324. isTensor := TRUE;
  7325. ELSE
  7326. isTensor := FALSE;
  7327. END;
  7328. FOR i := 1 TO x.parameters.Length()-1 DO
  7329. IF ~isTensor THEN
  7330. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7331. END;
  7332. parameter := x.parameters.GetExpression(i);
  7333. Evaluate(parameter,r);
  7334. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7335. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7336. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7337. END;
  7338. Emit(Push(position,r.op));
  7339. IF i=1 THEN
  7340. ReuseCopy(reg,r.op);
  7341. ELSE
  7342. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7343. END;
  7344. ReleaseOperand(r);
  7345. INC(dim);
  7346. END;
  7347. Convert(reg,addressType);
  7348. openDim := dim;
  7349. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7350. (*! the following code is only correct for "standard" Oberon calling convention *)
  7351. IF SemanticChecker.ContainsPointer(SemanticChecker.ArrayBase(type,MAX(LONGINT))) THEN
  7352. t := type;
  7353. IF ~isTensor & (t IS SyntaxTree.MathArrayType) THEN
  7354. staticLength := 1;
  7355. WHILE (t IS SyntaxTree.MathArrayType) DO (* static array *)
  7356. staticLength := staticLength * t(SyntaxTree.MathArrayType).staticLength;
  7357. t := t(SyntaxTree.MathArrayType).arrayBase.resolved;
  7358. END;
  7359. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7360. Emit(Mul(position,reg,reg,tmp));
  7361. END;
  7362. Designate(p0,l);
  7363. IF isTensor THEN
  7364. Dereference(l,type,FALSE);
  7365. t := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7366. END;
  7367. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7368. Emit(Push(position,l.tag)); (* address *)
  7369. ReleaseOperand(l);
  7370. tmp := TypeDescriptorAdr(t);
  7371. IF ~newObjectFile THEN
  7372. IntermediateCode.MakeMemory(tmp,addressType);
  7373. END;
  7374. Emit(Push(position,tmp)); (* type descriptor *)
  7375. ReleaseIntermediateOperand(tmp);
  7376. Emit(Push(position,reg)); (* number Elements *)
  7377. ReleaseIntermediateOperand(reg);
  7378. tmp := IntermediateCode.Immediate(addressType,0);
  7379. Emit(Push(position,tmp)); (* dimensions = 0, we control dimensions in the geometry descriptor *)
  7380. (* push realtime flag: false by default *)
  7381. Emit(Push(position,false));
  7382. CallThis(position,"Heaps","NewArr",5);
  7383. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7384. Emit(Pop(position,adr));
  7385. GetMathArrayField(tmp,adr,MathPtrOffset);
  7386. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7387. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrDataArrayOffset))));
  7388. PutMathArrayField(adr,reg,MathAdrOffset);
  7389. ReleaseIntermediateOperand(tmp);
  7390. ReleaseIntermediateOperand(reg);
  7391. ELSE
  7392. IF isTensor THEN
  7393. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT))));
  7394. ELSE
  7395. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim)));
  7396. END;
  7397. IF (size # 1) THEN
  7398. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7399. END;
  7400. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset));
  7401. Emit(Add(position,reg,reg,tmp));
  7402. Designate(p0,l);
  7403. IF isTensor THEN
  7404. Dereference(l,type,FALSE);
  7405. END;
  7406. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7407. Emit(Push(position,l.tag)); (* address for syscall *)
  7408. ReleaseOperand(l); (* pointer address *)
  7409. Emit(Push(position,reg)); (* size *)
  7410. ReleaseIntermediateOperand(reg);
  7411. (* push realtime flag: false by default *)
  7412. Emit(Push(position,false));
  7413. CallThis(position,"Heaps","NewSys",3);
  7414. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7415. Emit(Pop(position,adr));
  7416. GetMathArrayField(tmp,adr,MathPtrOffset);
  7417. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7418. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset))));
  7419. PutMathArrayField(adr,reg,MathAdrOffset);
  7420. ReleaseIntermediateOperand(tmp);
  7421. ReleaseIntermediateOperand(reg);
  7422. END;
  7423. flags := {};
  7424. IntermediateCode.InitImmediate(tmp,addressType,SYSTEM.VAL(LONGINT,flags));
  7425. PutMathArrayField(adr,tmp,MathFlagsOffset);
  7426. IntermediateCode.InitImmediate(tmp,addressType,openDim);
  7427. PutMathArrayField(adr,tmp,MathDimOffset);
  7428. else := NewLabel();
  7429. BreqL(else,IntermediateCode.Memory(addressType,adr,0),IntermediateCode.Immediate(addressType,0));
  7430. i := openDim-1;
  7431. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7432. IF isTensor THEN
  7433. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT)))));
  7434. ELSE
  7435. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim))));
  7436. END;
  7437. PutMathArrayField(adr,tmp,MathElementSizeOffset);
  7438. WHILE (i >= 0) DO
  7439. Emit(Pop(position,reg));
  7440. PutMathArrayLength(adr,reg,i);
  7441. PutMathArrayIncrement(adr,tmp,i);
  7442. IF i > 0 THEN
  7443. IF i=openDim-1 THEN
  7444. ReuseCopy(tmp,tmp);
  7445. END;
  7446. Emit(Mul(position,tmp,tmp,reg));
  7447. END;
  7448. DEC(i);
  7449. END;
  7450. ReleaseIntermediateOperand(adr);
  7451. ReleaseIntermediateOperand(reg);
  7452. ReleaseIntermediateOperand(tmp);
  7453. exit := NewLabel();
  7454. BrL(exit);
  7455. SetLabel(else);
  7456. (* else part: array could not be allocated *)
  7457. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7458. Emit(Add(position,sp,sp,tmp));
  7459. SetLabel(exit);
  7460. END;
  7461. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7462. THEN
  7463. IF ~backend.cellsAreObjects THEN RETURN END;
  7464. IF InCellScope(currentScope) THEN
  7465. PushSelfPointer()
  7466. ELSE
  7467. Emit(Push(position, nil));
  7468. END;
  7469. (* push temp address *)
  7470. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7471. temporaryVariable := GetTemporaryVariable(type, FALSE);
  7472. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7473. (* l.op contains address of pointer to record *)
  7474. Emit(Push(position,l.op)); (* address for use after syscall *)
  7475. ReleaseOperand(l);
  7476. (* push type descriptor *)
  7477. reg := TypeDescriptorAdr(baseType);
  7478. IF ~newObjectFile THEN
  7479. IntermediateCode.MakeMemory(reg,addressType);
  7480. END;
  7481. Emit(Push(position,reg));
  7482. ReleaseIntermediateOperand(reg);
  7483. (* push name *)
  7484. (*Global.GetSymbolName(p0, n);*)
  7485. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7486. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7487. ELSE
  7488. Global.GetModuleName(module.module, n);
  7489. END;
  7490. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position);
  7491. (*type.typeDeclaration.GetName(n);*)
  7492. PushConstString(n);
  7493. (* push cellnet boolean *)
  7494. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7495. (* push engine boolean *)
  7496. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7497. (* allocate *)
  7498. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7499. (* add capabilities *)
  7500. modifier := p0(SyntaxTree.Designator).modifiers;
  7501. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7502. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7503. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7504. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7505. END;
  7506. AppendModifiers(modifier, baseType(SyntaxTree.CellType).modifiers);
  7507. (*
  7508. modifier := baseType(SyntaxTree.CellType).modifiers;
  7509. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7510. modifier := p0(SyntaxTree.Designator).modifiers;
  7511. *)
  7512. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7513. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7514. (* l.op contains address of pointer to record *)
  7515. ToMemory(l.op,addressType,0);
  7516. (* l.op contains value of pointer to record *)
  7517. Emit(Push(position,l.op)); (* address for use after syscall *)
  7518. ReleaseOperand(l);
  7519. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7520. prevScope := currentScope;
  7521. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7522. previous := section;
  7523. section := init;
  7524. (* add ports *)
  7525. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7526. CloseInitializer(previous);
  7527. currentScope := prevScope;
  7528. Symbol(temporaryVariable,l);
  7529. ToMemory(l.op,addressType,0);
  7530. Emit(Push(position,l.op));
  7531. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7532. (*
  7533. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7534. IF constructor # NIL THEN
  7535. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7536. FOR i := 1 TO x.parameters.Length()-1 DO
  7537. p := x.parameters.GetExpression(i);
  7538. Global.GetSymbolName(parameter,name);
  7539. Evaluate(p, value);
  7540. ASSERT(value.type # NIL);
  7541. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7542. par := instance.AddParameter(name);
  7543. par.SetInteger(value.integer);
  7544. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7545. par := instance.AddParameter(name);
  7546. par.SetBoolean(value.boolean);
  7547. ELSE Error(x.position,NotYetImplemented)
  7548. END;
  7549. parameter := parameter.nextParameter
  7550. END;
  7551. END;
  7552. *)
  7553. (* call initializer *)
  7554. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7555. IF constructor # NIL THEN
  7556. (*! should be unified with ProcedureCallDesignator *)
  7557. IF backend.cellsAreObjects THEN
  7558. Symbol(temporaryVariable,l);
  7559. ToMemory(l.op,addressType,0);
  7560. Emit(Push(position,l.op));
  7561. ReleaseOperand(l);
  7562. END;
  7563. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7564. FOR i := 1 TO x.parameters.Length()-1 DO
  7565. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7566. formalParameter := formalParameter.nextParameter;
  7567. END;
  7568. (* static call of the constructor *)
  7569. Global.GetSymbolSegmentedName(constructor,name);
  7570. ASSERT(~constructor.isInline);
  7571. IF constructor.scope.ownerModule # module.module THEN
  7572. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7573. ELSE
  7574. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7575. END;
  7576. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7577. (*ELSE
  7578. ReleaseIntermediateOperand(pointer);*)
  7579. END;
  7580. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7581. ToMemory(l.op, addressType, 0);
  7582. Designate(p0,s0);
  7583. ToMemory(s0.op,addressType,0);
  7584. Emit(Mov(position,s0.op,l.op));
  7585. ReleaseOperand(l);
  7586. ReleaseOperand(s0);
  7587. result.tag := emptyOperand;
  7588. (* start *)
  7589. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7590. (* push cell *)
  7591. Symbol(temporaryVariable, l);
  7592. ToMemory(l.op,addressType,0);
  7593. Emit(Push(-1,l.op));
  7594. (* push delegate *)
  7595. Emit(Push(-1,l.op));
  7596. ReleaseOperand(l);
  7597. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7598. Emit(Push(position, s1.op));
  7599. ReleaseOperand(s1);
  7600. CallThis(position,"ActiveCellsRuntime","Start",3);
  7601. END;
  7602. (*IF temporaryVariable # NIL THEN
  7603. end := NewLabel();
  7604. BrL(end);
  7605. SetLabel(exit);
  7606. Designate(p0,l);
  7607. ToMemory(l.op,addressType,0);
  7608. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7609. ReleaseOperand(l);
  7610. SetLabel(end);
  7611. ELSE
  7612. SetLabel(exit);
  7613. END;
  7614. *)
  7615. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7616. ELSE (* no pointer to record, no pointer to array *)
  7617. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7618. (* ignore new statement *)
  7619. Warning(p0.position, "cannot run on final hardware");
  7620. ELSE
  7621. HALT(200);
  7622. END;
  7623. END;
  7624. (* ---- ADDRESSOF----- *)
  7625. |Global.systemAdr:
  7626. Designate(p0,s0);
  7627. s0.mode := ModeValue;
  7628. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7629. ReleaseIntermediateOperand(s0.op);
  7630. s0.op := s0.tag;
  7631. IntermediateCode.InitOperand(s0.tag);
  7632. END;
  7633. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7634. result := s0;
  7635. (* ---- BIT ----- *)
  7636. |Global.systemBit:
  7637. Evaluate(p0,s0);
  7638. ToMemory(s0.op,addressType,0);
  7639. ReuseCopy(res,s0.op);
  7640. ReleaseOperand(s0);
  7641. Evaluate(p1,s1);
  7642. Emit(Ror(position,res,res,s1.op));
  7643. ReleaseOperand(s1);
  7644. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7645. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7646. IF ~conditional THEN
  7647. InitOperand(result,ModeValue); result.op := res;
  7648. ELSE
  7649. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7650. BrL(falseLabel);
  7651. ReleaseIntermediateOperand(res);
  7652. END;
  7653. (* --- MSK ----*)
  7654. |Global.systemMsk:
  7655. Evaluate(p0,s0);
  7656. Evaluate(p1,s1);
  7657. ReuseCopy(res,s0.op);
  7658. ReleaseOperand(s0);
  7659. Emit(And(position,res,res,s1.op));
  7660. ReleaseOperand(s1);
  7661. InitOperand(result,ModeValue);
  7662. result.op := res;
  7663. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  7664. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  7665. Evaluate(p0,s0);
  7666. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  7667. ReleaseOperand(s0);
  7668. InitOperand(result,ModeValue);
  7669. result.op := res;
  7670. (* ---- SYSTEM.GetStackPointer ----- *)
  7671. |Global.systemGetStackPointer:
  7672. InitOperand(result,ModeValue);
  7673. result.op := sp;
  7674. (* ---- SYSTEM.GetFramePointer ----- *)
  7675. |Global.systemGetFramePointer:
  7676. InitOperand(result,ModeValue);
  7677. result.op := fp;
  7678. (* ---- SYSTEM.GetActivity ----- *)
  7679. |Global.systemGetActivity:
  7680. ASSERT(backend.cooperative);
  7681. InitOperand(result,ModeValue);
  7682. result.op := ap;
  7683. (* ---- SYSTEM.SetStackPointer ----- *)
  7684. |Global.systemSetStackPointer:
  7685. Evaluate(p0,s0); (* *)
  7686. Emit(Mov(position,sp,s0.op));
  7687. ReleaseOperand(s0);
  7688. (* ---- SYSTEM.SetFramePointer ----- *)
  7689. |Global.systemSetFramePointer:
  7690. Evaluate(p0,s0); (* *)
  7691. Emit(Mov(position,fp,s0.op));
  7692. ReleaseOperand(s0);
  7693. (* ---- SYSTEM.Activity ----- *)
  7694. |Global.systemSetActivity:
  7695. ASSERT(backend.cooperative);
  7696. Evaluate(p0,s0); (* *)
  7697. Emit(Mov(position,ap,s0.op));
  7698. ReleaseOperand(s0);
  7699. (* ---- SYSTEM.VAL ----- *)
  7700. |Global.systemVal:
  7701. Expression(p1);
  7702. s1 := result;
  7703. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7704. IF s1.mode = ModeReference THEN
  7705. (* nothing to be done if not record type, just take over new type *)
  7706. IF (type IS SyntaxTree.RecordType) THEN
  7707. ReleaseIntermediateOperand(s1.tag);
  7708. s1.tag := TypeDescriptorAdr(type);
  7709. IF ~newObjectFile THEN
  7710. IntermediateCode.MakeMemory(s1.tag,addressType);
  7711. END;
  7712. UseIntermediateOperand(s1.tag);
  7713. END;
  7714. result := s1;
  7715. ELSE (* copy over result to different type, may not use convert *)
  7716. itype := IntermediateCode.GetType(system,type);
  7717. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  7718. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  7719. Emit(Mov(position,s0.op,s1.op));
  7720. ReleaseOperand(s1);
  7721. InitOperand(result,ModeValue);
  7722. result.op := s0.op;
  7723. ELSE (* different size, must convert *)
  7724. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  7725. Convert(s1.op, IntermediateCode.GetType(system,type));
  7726. result := s1;
  7727. END;
  7728. END;
  7729. (* ---- SYSTEM.GET ----- *)
  7730. |Global.systemGet:
  7731. Evaluate(p0,s0); (* adr *)
  7732. Designate(p1,s1); (* variable *)
  7733. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  7734. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  7735. Emit(Mov(position,s1.op,s0.op));
  7736. ReleaseOperand(s1);
  7737. ReleaseOperand(s0);
  7738. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  7739. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  7740. Evaluate(p0,s0); (* *)
  7741. Evaluate(p1,s1); (* variable *)
  7742. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  7743. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  7744. (* real part *)
  7745. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  7746. Emit(Mov(position,res, s1.op));
  7747. ReleaseIntermediateOperand(res);
  7748. (* imaginary part *)
  7749. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  7750. Emit(Mov(position,res, s1.tag));
  7751. ReleaseIntermediateOperand(res);
  7752. ReleaseOperand(s1);
  7753. ReleaseOperand(s0);
  7754. ELSE
  7755. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  7756. ReleaseOperand(s0);
  7757. Emit(Mov(position,res,s1.op));
  7758. ReleaseIntermediateOperand(res);
  7759. ReleaseOperand(s1);
  7760. END;
  7761. (* ---- SYSTEM.MOVE ----- *)
  7762. |Global.systemMove:
  7763. Evaluate(p0,s0);
  7764. Evaluate(p1,s1);
  7765. Evaluate(p2,s2);
  7766. Emit(Copy(position,s1.op,s0.op,s2.op));
  7767. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7768. (* ---- SYSTEM.NEW ----- *)
  7769. |Global.systemNew:
  7770. Designate(p0,s0);
  7771. Emit(Push(position,s0.op));
  7772. ReleaseOperand(s0);
  7773. Evaluate(p1,s1);
  7774. Emit(Push(position,s1.op));
  7775. ReleaseOperand(s1);
  7776. (* push realtime flag: false by default *)
  7777. Emit(Push(position,false));
  7778. CallThis(position,"Heaps","NewSys",3);
  7779. (* ---- SYSTEM.CALL ----- *)
  7780. |Global.systemRef:
  7781. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  7782. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  7783. s0.mode := ModeValue;
  7784. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  7785. result := s0
  7786. (* ---- INCR ----- *)
  7787. |Global.Incr:
  7788. Designate(p0,operand);
  7789. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7790. Dereference(operand,p0.type.resolved,FALSE);
  7791. END;
  7792. ASSERT(p1 # NIL);
  7793. Evaluate(p1,l);
  7794. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  7795. ReleaseOperand(operand); ReleaseOperand(l);
  7796. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7797. (* ---- SUM ----- *)
  7798. |Global.Sum: HALT(200);
  7799. (* ---- ALL ----- *)
  7800. |Global.All: HALT(200);
  7801. (* ---- CAS ----- *)
  7802. |Global.Cas:
  7803. needsTrace := p0.NeedsTrace();
  7804. IF needsTrace THEN ModifyAssignments(true) END;
  7805. Designate(p0,s0);
  7806. Evaluate(p1,s1);
  7807. Evaluate(p2,s2);
  7808. IF needsTrace THEN
  7809. Emit(Push(position, s0.op));
  7810. Emit(Push(position, s1.op));
  7811. Emit(Push(position, s2.op));
  7812. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  7813. ELSE
  7814. Emit(Cas(position,s0.op,s1.op,s2.op));
  7815. END;
  7816. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7817. IF needsTrace THEN ModifyAssignments(false) END;
  7818. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7819. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  7820. IF conditional THEN
  7821. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7822. BrL(falseLabel);
  7823. ReleaseIntermediateOperand(res);
  7824. END;
  7825. (* ---- DIM ----- *)
  7826. |Global.Dim:
  7827. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  7828. Designate(p0,s0);
  7829. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7830. Dereference(s0,p0.type.resolved,FALSE);
  7831. END;
  7832. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  7833. ReleaseOperand(s0);
  7834. (* ---- RESHAPE ----- *)
  7835. |Global.Reshape:
  7836. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  7837. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7838. left.SetType(procedure.type);
  7839. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  7840. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  7841. END;
  7842. (* ---- SYSTEM.TYPECODE ----- *)
  7843. |Global.systemTypeCode:
  7844. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7845. IF type.resolved IS SyntaxTree.PointerType THEN
  7846. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7847. END;
  7848. result.op := TypeDescriptorAdr(type);
  7849. IF ~newObjectFile THEN
  7850. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  7851. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  7852. END;
  7853. result.mode := ModeValue;
  7854. (* ---- SYSTEM.TRACE ----- *)
  7855. |Global.systemTrace:
  7856. SystemTrace(x.parameters, x.position);
  7857. (* ----- CONNECT ------*)
  7858. |Global.Connect:
  7859. IF backend.cellsAreObjects THEN
  7860. PushPort(p0);
  7861. PushPort(p1);
  7862. IF p2 # NIL THEN
  7863. Evaluate(p2, s2);
  7864. Emit(Push(p2.position, s2.op));
  7865. ReleaseOperand(s2);
  7866. ELSE
  7867. Emit(Push(-1, IntermediateCode.Immediate(int32, -1)));
  7868. END;
  7869. CallThis(position,"ActiveCellsRuntime","Connect",3);
  7870. ELSE
  7871. Warning(x.position, "cannot run on final hardware");
  7872. END;
  7873. (* ----- DELEGATE ------*)
  7874. |Global.Delegate:
  7875. IF backend.cellsAreObjects THEN
  7876. PushPort(p0);
  7877. PushPort(p1);
  7878. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  7879. ELSE
  7880. Warning(x.position, "cannot run on final hardware");
  7881. END;
  7882. (* ----- SEND ------*)
  7883. |Global.Send:
  7884. Evaluate(p0,s0);
  7885. Evaluate(p1,s1);
  7886. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7887. Emit(Push(position,s0.op));
  7888. Emit(Push(position,s1.op));
  7889. (*
  7890. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7891. *)
  7892. IF ~backend.cellsAreObjects THEN
  7893. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  7894. END;
  7895. ReleaseOperand(s0);
  7896. ReleaseOperand(s1);
  7897. IF backend.cellsAreObjects THEN
  7898. CallThis(position,"ActiveCellsRuntime","Send",2);
  7899. ELSE
  7900. CallThis(position,ChannelModuleName,"Send",2);
  7901. END;
  7902. (* ----- RECEIVE ------*)
  7903. |Global.Receive:
  7904. Evaluate(p0,s0);
  7905. Emit(Push(position,s0.op));
  7906. Designate(p1,s1);
  7907. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7908. Emit(Push(position,s1.op));
  7909. IF p2 # NIL THEN
  7910. Designate(p2,s2);
  7911. Emit(Push(position,s2.op));
  7912. END;
  7913. (*
  7914. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7915. *)
  7916. IF ~backend.cellsAreObjects THEN
  7917. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  7918. END;
  7919. ReleaseOperand(s0);
  7920. ReleaseOperand(s1);
  7921. ReleaseOperand(s2);
  7922. IF backend.cellsAreObjects THEN
  7923. IF p2 = NIL THEN
  7924. CallThis(position,"ActiveCellsRuntime","Receive",2)
  7925. ELSE
  7926. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  7927. END;
  7928. ELSE
  7929. IF p2 = NIL THEN
  7930. CallThis(position,ChannelModuleName,"Receive",2)
  7931. ELSE
  7932. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  7933. END;
  7934. END;
  7935. | Global.systemSpecial:
  7936. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  7937. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  7938. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  7939. (* determine if parameters are of the VAR kind *)
  7940. ASSERT(x.parameters.Length() <= 3);
  7941. formalParameter := procedureType.firstParameter;
  7942. FOR i := 0 TO x.parameters.Length() - 1 DO
  7943. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  7944. formalParameter := formalParameter.nextParameter
  7945. END;
  7946. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  7947. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  7948. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  7949. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  7950. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7951. IF procedureType.returnType # NIL THEN
  7952. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  7953. Emit(Result(position, res));
  7954. (*InitOperand(result,ModeValue);
  7955. result.op := res;
  7956. *)
  7957. IF ~conditional THEN
  7958. InitOperand(result,ModeValue); result.op := res;
  7959. ELSE
  7960. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7961. BrL(falseLabel);
  7962. ReleaseIntermediateOperand(res);
  7963. END;
  7964. END
  7965. ELSE (* function not yet implemented *)
  7966. Error(position,"not yet implemented");
  7967. END;
  7968. destination := dest;
  7969. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  7970. END VisitBuiltinCallDesignator;
  7971. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  7972. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  7973. BEGIN
  7974. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  7975. dest := destination; destination := emptyOperand;
  7976. Expression(x.left);
  7977. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  7978. ELSIF isUnchecked THEN (* no check *)
  7979. ELSE
  7980. trueL := NewLabel();
  7981. falseL := NewLabel();
  7982. IF IsPointerToRecord(x.left.type,recordType) THEN
  7983. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7984. Emit(Mov(position,tag, result.op));
  7985. IF result.mode # ModeValue THEN
  7986. ptr := tag;
  7987. IntermediateCode.MakeMemory(ptr,addressType);
  7988. Emit(Mov(position,tag, ptr));
  7989. END;
  7990. IF ~backend.cooperative THEN
  7991. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  7992. END;
  7993. IntermediateCode.MakeMemory(tag,addressType);
  7994. ELSE
  7995. tag := result.tag;
  7996. END;
  7997. TypeTest(tag,x.type,trueL,falseL);
  7998. ReleaseIntermediateOperand(tag);
  7999. SetLabel(falseL);
  8000. EmitTrap(position,TypeCheckTrap);
  8001. SetLabel(trueL);
  8002. END;
  8003. destination := dest;
  8004. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8005. END VisitTypeGuardDesignator;
  8006. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8007. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8008. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8009. VAR label: Label; pc: LONGINT;
  8010. BEGIN
  8011. IF backend.cooperative & ~isUnchecked THEN
  8012. pc := section.pc;
  8013. label := NewLabel();
  8014. BrneL(label, operand.op, nil);
  8015. EmitTrap(position, NilPointerTrap);
  8016. SetLabel(label);
  8017. INC(statCoopNilCheck, section.pc - pc);
  8018. END;
  8019. END NilCheck;
  8020. BEGIN
  8021. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8022. ReuseCopy(dereferenced,operand.op);
  8023. ReleaseOperand(operand);
  8024. operand.mode := ModeReference;
  8025. operand.op := dereferenced;
  8026. operand.tag := dereferenced;
  8027. UseIntermediateOperand(operand.tag);
  8028. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8029. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8030. ReleaseIntermediateOperand(operand.tag);
  8031. operand.tag := TypeDescriptorAdr(type);
  8032. IF ~newObjectFile THEN
  8033. IntermediateCode.MakeMemory(operand.tag,addressType);
  8034. END;
  8035. ELSE
  8036. IF ~backend.cooperative THEN
  8037. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8038. END;
  8039. IntermediateCode.MakeMemory(operand.tag,addressType);
  8040. END;
  8041. NilCheck(operand.op);
  8042. ELSIF type IS SyntaxTree.ArrayType THEN
  8043. IF isUnsafe THEN
  8044. NilCheck(operand.op);
  8045. ReleaseIntermediateOperand(operand.tag);
  8046. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8047. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8048. ELSE
  8049. operand.tag := emptyOperand;
  8050. END;
  8051. ELSE
  8052. NilCheck(operand.op);
  8053. IF backend.cooperative THEN
  8054. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8055. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8056. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8057. ELSE
  8058. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8059. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8060. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8061. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8062. END;
  8063. END;
  8064. ELSIF type IS SyntaxTree.MathArrayType THEN
  8065. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8066. IntermediateCode.MakeMemory(operand.op,addressType);
  8067. ELSE HALT(100);
  8068. END;
  8069. END Dereference;
  8070. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  8071. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8072. BEGIN
  8073. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8074. dest := destination; destination := emptyOperand;
  8075. Evaluate(x.left,d);
  8076. type := x.type.resolved;
  8077. prevIsUnchecked := isUnchecked;
  8078. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8079. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8080. END;
  8081. Dereference(d,type,IsUnsafePointer(x.left.type));
  8082. isUnchecked := prevIsUnchecked;
  8083. result := d;
  8084. 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
  8085. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8086. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8087. END;
  8088. END;
  8089. destination := dest;
  8090. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8091. END VisitDereferenceDesignator;
  8092. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  8093. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8094. BEGIN
  8095. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8096. dest := destination; destination := emptyOperand;
  8097. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8098. tag := result.op;
  8099. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8100. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8101. StaticCallOperand(result,procedure.super);
  8102. ReleaseIntermediateOperand(result.tag);
  8103. UseIntermediateOperand(tag); (* necessary ? *)
  8104. result.tag := tag;
  8105. destination := dest;
  8106. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8107. END VisitSupercallDesignator;
  8108. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  8109. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8110. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8111. name: Basic.SegmentedName;
  8112. BEGIN
  8113. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8114. dest := destination; destination := emptyOperand;
  8115. scope := currentScope;
  8116. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8117. scope := scope.outerScope;
  8118. END;
  8119. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8120. IF newObjectFile THEN
  8121. moduleSection := meta.ModuleSection();
  8122. IF backend.cooperative THEN
  8123. moduleOffset := 0;
  8124. ELSE
  8125. moduleOffset := moduleSection.pc;
  8126. END;
  8127. result.mode := ModeValue;
  8128. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8129. ELSE
  8130. Symbol(moduleSelf,result);
  8131. IntermediateCode.MakeMemory(result.op,addressType);
  8132. END
  8133. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8134. result.mode := ModeValue;
  8135. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8136. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8137. ELSE
  8138. GetBaseRegister(basereg,currentScope,scope);
  8139. InitOperand(result,ModeReference);
  8140. result.op := basereg;
  8141. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  8142. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  8143. IF backend.cooperative THEN
  8144. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8145. END;
  8146. (* tag must be loaded when dereferencing SELF pointer *)
  8147. END;
  8148. destination := dest;
  8149. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8150. END VisitSelfDesignator;
  8151. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  8152. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8153. BEGIN
  8154. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8155. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8156. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8157. parameter := procedureType.returnParameter;
  8158. VisitParameter(parameter);
  8159. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8160. END VisitResultDesignator;
  8161. (** values *)
  8162. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  8163. BEGIN
  8164. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8165. IF conditional THEN
  8166. IF x.value THEN BrL(trueLabel)
  8167. ELSE BrL(falseLabel)
  8168. END;
  8169. ELSE
  8170. InitOperand(result,ModeValue);
  8171. IF x.value THEN result.op := true ELSE result.op := false END;
  8172. END;
  8173. END VisitBooleanValue;
  8174. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8175. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8176. BEGIN
  8177. Global.GetModuleSegmentedName(module.module, name);
  8178. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8179. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE);
  8180. RETURN section
  8181. END GetDataSection;
  8182. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8183. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8184. BEGIN
  8185. type := vop.type;
  8186. data := GetDataSection();
  8187. pc := EnterImmediate(data,vop);
  8188. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8189. IntermediateCode.MakeMemory(vop, type);
  8190. END GetImmediateMem;
  8191. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  8192. BEGIN
  8193. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8194. InitOperand(result,ModeValue);
  8195. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8196. IF ~supportedImmediate(result.op) &~inData THEN
  8197. GetImmediateMem(result.op)
  8198. END;
  8199. END VisitIntegerValue;
  8200. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  8201. BEGIN
  8202. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8203. InitOperand(result,ModeValue);
  8204. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8205. END VisitCharacterValue;
  8206. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  8207. BEGIN
  8208. IF Trace THEN TraceEnter("VisitSetValue") END;
  8209. InitOperand(result,ModeValue);
  8210. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8211. END VisitSetValue;
  8212. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  8213. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8214. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8215. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8216. BEGIN
  8217. numberElements := x.elements.Length();
  8218. FOR i := 0 TO numberElements-1 DO
  8219. expression := x.elements.GetExpression(i);
  8220. IF expression IS SyntaxTree.MathArrayExpression THEN
  8221. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8222. ELSE
  8223. inData := TRUE;
  8224. Evaluate(expression,op);
  8225. irv.Emit(Data(position,op.op));
  8226. inData := FALSE;
  8227. ReleaseOperand(op);
  8228. END;
  8229. END;
  8230. END RecursiveData;
  8231. BEGIN
  8232. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8233. IF ~TryConstantDeclaration() THEN
  8234. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8235. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8236. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8237. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8238. ELSE
  8239. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8240. END;
  8241. RecursiveData(x.array);
  8242. InitOperand(result,ModeReference);
  8243. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8244. END
  8245. END VisitMathArrayValue;
  8246. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8247. VAR constant: Sections.Section;
  8248. BEGIN
  8249. IF constantDeclaration = NIL THEN
  8250. RETURN FALSE
  8251. ELSE
  8252. (* Is a constant in this module: did we generate it already? *)
  8253. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8254. IF constant # NIL THEN
  8255. InitOperand(result,ModeReference);
  8256. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8257. RETURN TRUE;
  8258. END;
  8259. END;
  8260. RETURN FALSE
  8261. END TryConstantDeclaration;
  8262. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  8263. BEGIN
  8264. constantDeclaration := x;
  8265. x.value.resolved.Accept(SELF);
  8266. END VisitConstant;
  8267. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  8268. BEGIN
  8269. IF Trace THEN TraceEnter("VisitRealValue") END;
  8270. InitOperand(result,ModeValue);
  8271. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8272. END VisitRealValue;
  8273. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  8274. VAR
  8275. componentType: SyntaxTree.Type;
  8276. BEGIN
  8277. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8278. ASSERT(x.type IS SyntaxTree.ComplexType);
  8279. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8280. InitOperand(result,ModeValue);
  8281. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8282. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8283. END VisitComplexValue;
  8284. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  8285. VAR i: LONGINT; name: Basic.SegmentedName;
  8286. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8287. BEGIN
  8288. IF Trace THEN TraceEnter("VisitStringValue") END;
  8289. IF ~TryConstantDeclaration() THEN
  8290. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8291. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8292. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8293. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8294. ELSE
  8295. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8296. END;
  8297. FOR i := 0 TO x.length-1 DO
  8298. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8299. irv.Emit(Data(position,op));
  8300. END;
  8301. InitOperand(result,ModeReference);
  8302. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8303. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8304. END
  8305. END VisitStringValue;
  8306. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8307. BEGIN
  8308. IF Trace THEN TraceEnter("VisitNilValue") END;
  8309. InitOperand(result,ModeValue);
  8310. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8311. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8312. END VisitNilValue;
  8313. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8314. BEGIN
  8315. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8316. InitOperand(result,ModeValue);
  8317. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8318. END VisitEnumerationValue;
  8319. (** symbols *)
  8320. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8321. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8322. END VisitImport;
  8323. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8324. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8325. BEGIN
  8326. IF scope # baseScope THEN
  8327. (* left := [fp+8] *)
  8328. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8329. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8330. ReuseCopy(left,right);
  8331. ReleaseIntermediateOperand(right);
  8332. scope := scope.outerScope; DEC(level);
  8333. (* { left := [left+8] } *)
  8334. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8335. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8336. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8337. Emit(Mov(position,left,right));
  8338. scope := scope.outerScope; DEC(level);
  8339. END;
  8340. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8341. result := left;
  8342. ELSE
  8343. result := fp;
  8344. END;
  8345. END GetBaseRegister;
  8346. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8347. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8348. BEGIN
  8349. IF Trace THEN TraceEnter("VisitVariable"); END;
  8350. type := x.type.resolved;
  8351. IF (x.useRegister) THEN
  8352. InitOperand(result, ModeValue);
  8353. IF x.registerNumber < 0 THEN
  8354. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8355. reg := x.registerNumber;
  8356. ELSE
  8357. reg := registerUsageCount.Map(x.registerNumber);
  8358. UseRegister(reg);
  8359. END;
  8360. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8361. ELSIF x.externalName # NIL THEN
  8362. InitOperand(result,ModeReference);
  8363. Basic.ToSegmentedName(x.externalName^, name);
  8364. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8365. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8366. InitOperand(result,ModeReference);
  8367. GetBaseRegister(result.op,currentScope,x.scope);
  8368. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8369. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8370. InitOperand(result,ModeReference);
  8371. GetCodeSectionNameForSymbol(x,name);
  8372. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8373. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8374. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8375. InitOperand(result,ModeReference);
  8376. GetCodeSectionNameForSymbol(x,name);
  8377. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8378. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8379. ELSE (* field, left designator must have been emitted *)
  8380. ASSERT(result.mode = ModeReference);
  8381. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8382. ReuseCopy(temp,result.op);
  8383. ReleaseIntermediateOperand(result.op);
  8384. result.op := temp;
  8385. END;
  8386. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8387. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8388. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8389. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8390. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8391. END;
  8392. END;
  8393. END;
  8394. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8395. ValueToCondition(result);
  8396. ELSIF type IS SyntaxTree.ProcedureType THEN
  8397. ReleaseIntermediateOperand(result.tag);
  8398. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8399. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8400. UseIntermediateOperand(result.tag);
  8401. ELSE
  8402. result.tag := nil; (* nil *)
  8403. END;
  8404. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8405. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8406. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8407. ReleaseIntermediateOperand(result.tag);
  8408. Global.GetSymbolSegmentedName(x,name);
  8409. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8410. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8411. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8412. ELSE
  8413. END;
  8414. ELSE
  8415. ReleaseIntermediateOperand(result.tag);
  8416. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8417. END;
  8418. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8419. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8420. ReleaseIntermediateOperand(result.tag);
  8421. result.tag := result.op;
  8422. UseIntermediateOperand(result.tag);
  8423. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8424. IntermediateCode.MakeMemory(result.op,addressType);
  8425. END;
  8426. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8427. ReleaseIntermediateOperand(result.tag);
  8428. result.tag := TypeDescriptorAdr(type);
  8429. IF ~newObjectFile THEN
  8430. IntermediateCode.MakeMemory(result.tag,addressType);
  8431. END;
  8432. UseIntermediateOperand(result.tag);
  8433. (* tag for pointer type computed not here but during dereferencing *)
  8434. END;
  8435. IF Trace THEN TraceExit("VisitVariable") END;
  8436. END VisitVariable;
  8437. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8438. BEGIN
  8439. VisitVariable(property);
  8440. END VisitProperty;
  8441. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8442. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8443. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT;
  8444. BEGIN
  8445. type := x.type.resolved;
  8446. IF Trace THEN TraceEnter("VisitParameter") END;
  8447. IF x.ownerType IS SyntaxTree.CellType THEN
  8448. ptype := x.type.resolved;
  8449. IF ptype IS SyntaxTree.ArrayType THEN ptype := ptype(SyntaxTree.ArrayType).arrayBase.resolved END;
  8450. IF ~(ptype IS SyntaxTree.PortType) THEN
  8451. InitOperand(result,ModeReference);
  8452. GetCodeSectionNameForSymbol(x,name);
  8453. symbol := NewSection(module.allSections, Sections.ConstSection, name,x,commentPrintout # NIL);
  8454. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol),0);
  8455. RETURN
  8456. ELSE
  8457. InitOperand(result, ModeValue);
  8458. parameter := x.ownerType(SyntaxTree.CellType).firstParameter;
  8459. adr := 0;
  8460. WHILE parameter # x DO
  8461. parameterType := parameter.type;
  8462. inc := 1;
  8463. WHILE SemanticChecker.IsStaticArray(parameterType, parameterType, len) DO inc := inc * len END;
  8464. INC(adr, inc);
  8465. parameter := parameter.nextParameter
  8466. END;
  8467. IntermediateCode.InitImmediate(result.op,addressType,adr);
  8468. RETURN
  8469. END;
  8470. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8471. InitOperand(result,ModeReference);
  8472. GetCodeSectionNameForSymbol(x,name);
  8473. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8474. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8475. RETURN
  8476. ELSE
  8477. GetBaseRegister(basereg,currentScope,x.scope);
  8478. InitOperand(result,ModeReference);
  8479. result.op := basereg;
  8480. END;
  8481. IF IsOpenArray(type) THEN
  8482. result.tag := basereg;
  8483. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8484. IntermediateCode.MakeMemory(result.op,addressType);
  8485. IF Global.IsOberonProcedure(x.ownerType) THEN
  8486. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8487. UseIntermediateOperand(result.tag);
  8488. ELSE
  8489. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8490. END;
  8491. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8492. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8493. ELSIF IsStaticArray(type) THEN
  8494. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8495. IntermediateCode.MakeMemory(result.op,addressType);
  8496. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8497. ELSIF type IS SyntaxTree.MathArrayType THEN
  8498. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8499. WITH type: SyntaxTree.MathArrayType DO
  8500. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8501. IF type.form = SyntaxTree.Tensor THEN
  8502. ELSIF type.form = SyntaxTree.Open THEN
  8503. result.tag := result.op;
  8504. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8505. IntermediateCode.MakeMemory(result.op,addressType);
  8506. UseIntermediateOperand(result.tag);
  8507. ELSIF type.form = SyntaxTree.Static THEN
  8508. IF x.kind = SyntaxTree.ConstParameter THEN
  8509. IntermediateCode.MakeMemory(result.op,addressType);
  8510. END;
  8511. ELSE HALT(100)
  8512. END;
  8513. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8514. IF type.form = SyntaxTree.Tensor THEN
  8515. ToMemory(result.op,addressType,0);
  8516. ELSIF type.form = SyntaxTree.Open THEN
  8517. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8518. ReuseCopy(result.tag, mem);
  8519. ReleaseIntermediateOperand(mem);
  8520. ReleaseIntermediateOperand(result.op);
  8521. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8522. ELSIF type.form = SyntaxTree.Static THEN
  8523. IntermediateCode.MakeMemory(result.op,addressType);
  8524. ELSE HALT(100)
  8525. END;
  8526. ELSE HALT(100)
  8527. END;
  8528. END;
  8529. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8530. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8531. IntermediateCode.MakeMemory(result.op,addressType);
  8532. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8533. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8534. END;
  8535. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8536. ValueToCondition(result);
  8537. ELSIF type IS SyntaxTree.ProcedureType THEN
  8538. ReleaseIntermediateOperand(result.tag);
  8539. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8540. IF x.kind = SyntaxTree.VarParameter THEN
  8541. ReuseCopy(result.tag,result.op);
  8542. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8543. IntermediateCode.MakeMemory(result.tag,addressType);
  8544. ELSE
  8545. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8546. UseIntermediateOperand(result.tag);
  8547. END;
  8548. ELSE
  8549. result.tag := nil;
  8550. END;
  8551. (* tag for pointer type computed not here but during dereferencing *)
  8552. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) THEN
  8553. ReleaseIntermediateOperand(result.tag);
  8554. result.tag := basereg;
  8555. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8556. IntermediateCode.MakeMemory(result.tag,addressType);
  8557. UseIntermediateOperand(result.tag);
  8558. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind = SyntaxTree.ValueParameter) THEN
  8559. ReleaseIntermediateOperand(result.tag);
  8560. result.tag := TypeDescriptorAdr(type);
  8561. IF ~newObjectFile THEN
  8562. IntermediateCode.MakeMemory(result.tag,addressType);
  8563. END;
  8564. UseIntermediateOperand(result.tag);
  8565. END;
  8566. IF Trace THEN TraceExit("VisitParameter") END;
  8567. END VisitParameter;
  8568. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8569. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8570. BEGIN
  8571. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8572. (* left.p: left already emitted *)
  8573. tag := result.op; (* value of pointer to left *)
  8574. (* get type desc *)
  8575. tmp := result.tag;
  8576. IntermediateCode.MakeMemory(tmp,addressType);
  8577. (* get method adr *)
  8578. Reuse1(reg,tmp);
  8579. ReleaseIntermediateOperand(tmp);
  8580. IF backend.cooperative THEN
  8581. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8582. WHILE recordType.baseType # NIL DO
  8583. recordType := recordType.GetBaseRecord ();
  8584. END;
  8585. GetRecordTypeName (recordType,name);
  8586. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8587. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8588. offset := 0;
  8589. ELSE
  8590. offset := 2;
  8591. END;
  8592. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8593. ELSE
  8594. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8595. END;
  8596. InitOperand(operand,ModeReference);
  8597. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8598. operand.op := reg;
  8599. operand.tag := tag;
  8600. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8601. END DynamicCallOperand;
  8602. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8603. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8604. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8605. BEGIN
  8606. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8607. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8608. tag := operand.op;
  8609. ReleaseIntermediateOperand(operand.tag);
  8610. ELSE tag := nil
  8611. END;
  8612. IF x.isInline THEN
  8613. sectionType := Sections.InlineCodeSection;
  8614. ELSE
  8615. sectionType := Sections.CodeSection;
  8616. END;
  8617. IF x.externalName # NIL THEN
  8618. Basic.ToSegmentedName(x.externalName^, name);
  8619. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8620. ELSE
  8621. GetCodeSectionNameForSymbol(x, name);
  8622. IF (x.scope.ownerModule = module.module) THEN
  8623. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8624. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8625. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8626. IF source.pc = 0 THEN (* no code yet *)
  8627. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8628. END;
  8629. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8630. bits := x.procedureScope.body.code.inlineCode;
  8631. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8632. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8633. binary.CopyBits(bits, 0, bits.GetSize());
  8634. source.SetResolved(binary);
  8635. ELSE
  8636. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8637. END;
  8638. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8639. END;
  8640. InitOperand(operand,ModeValue);
  8641. operand.op := reg;
  8642. operand.tag := tag;
  8643. IF Trace THEN TraceExit("StaticCallOperand") END;
  8644. END StaticCallOperand;
  8645. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8646. (* handle expressions of the form designator.procedure or procedure *)
  8647. BEGIN
  8648. IF Trace THEN TraceEnter("VisitProcedure") END;
  8649. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) THEN
  8650. DynamicCallOperand(result,x);
  8651. ELSIF x.isInline THEN
  8652. StaticCallOperand(result,x);
  8653. ELSE
  8654. StaticCallOperand(result,x);
  8655. END;
  8656. IF Trace THEN TraceExit("VisitProcedure") END;
  8657. END VisitProcedure;
  8658. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  8659. BEGIN
  8660. VisitProcedure(x);
  8661. END VisitOperator;
  8662. (** statements *)
  8663. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  8664. BEGIN
  8665. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  8666. Expression(x.call);
  8667. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  8668. ReleaseOperand(result)
  8669. END;
  8670. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  8671. END VisitProcedureCallStatement;
  8672. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  8673. VAR leftType, rightType: SyntaxTree.MathArrayType;
  8674. leftBase, rightBase: SyntaxTree.Type;
  8675. procedureName,s: SyntaxTree.IdentifierString;
  8676. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  8677. size: LONGINT; rightKind: LONGINT;
  8678. dummy: IntermediateCode.Operand;
  8679. CONST moduleName = "FoxArrayBase";
  8680. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  8681. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  8682. BEGIN
  8683. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  8684. IF base IS SyntaxTree.MathArrayType THEN
  8685. base := OpenArray(base(SyntaxTree.MathArrayType));
  8686. END;
  8687. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  8688. result.SetArrayBase(base);
  8689. RETURN result
  8690. END OpenArray;
  8691. BEGIN
  8692. IF AddImport(moduleName,arrayBase,TRUE) THEN
  8693. SaveRegisters();ReleaseUsedRegisters(saved);
  8694. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  8695. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  8696. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  8697. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  8698. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  8699. IF leftType.form = SyntaxTree.Tensor THEN
  8700. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  8701. ELSIF leftType.form = SyntaxTree.Open THEN
  8702. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  8703. ELSIF leftType.form = SyntaxTree.Static THEN
  8704. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  8705. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  8706. END;
  8707. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  8708. IF procedure = NIL THEN
  8709. s := "Instruction not supported on target, emulation procedure ";
  8710. Strings.Append(s,moduleName);
  8711. Strings.Append(s,".");
  8712. Strings.Append(s,procedureName);
  8713. Strings.Append(s," not present");
  8714. Error(position,s);
  8715. ELSE
  8716. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  8717. parameter.SetType(leftType);
  8718. parameter.SetAccess(SyntaxTree.Internal);
  8719. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8720. parameter.SetKind(rightKind);
  8721. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8722. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  8723. Emit(Push(position,IntermediateCode.Immediate(int32,size)));
  8724. StaticCallOperand(result,procedure);
  8725. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  8726. ReleaseOperand(result);
  8727. END;
  8728. RestoreRegisters(saved);
  8729. END;
  8730. END AssignMathArray;
  8731. VAR modifyAssignmentCounter := 0: LONGINT;
  8732. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  8733. VAR processor,mem,dst: IntermediateCode.Operand;
  8734. BEGIN
  8735. IF value.intValue = true.intValue THEN
  8736. INC(modifyAssignmentCounter);
  8737. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  8738. modifyAssignmentsPC := section.pc;
  8739. ELSE
  8740. DEC(modifyAssignmentCounter);
  8741. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  8742. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  8743. END;
  8744. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  8745. dst := NewRegisterOperand (addressType);
  8746. Emit(Mov(position,dst, processor));
  8747. IntermediateCode.InitMemory(mem,bool, dst, 0);
  8748. Emit(Mov(position,mem, value));
  8749. ReleaseIntermediateOperand(dst);
  8750. END ModifyAssignments;
  8751. PROCEDURE CopySize(left: SyntaxTree.Expression): IntermediateCode.Operand;
  8752. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8753. BEGIN
  8754. type := left.type.resolved;
  8755. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  8756. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  8757. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  8758. IF procedureType.returnParameter = parameter THEN
  8759. RETURN IntermediateCode.Memory(addressType, fp, ToMemoryUnits(system, parameter.offsetInBits + system.addressSize));
  8760. END;
  8761. END;
  8762. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  8763. END CopySize;
  8764. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  8765. VAR
  8766. leftO, rightO: Operand;
  8767. mem, sizeOp: IntermediateCode.Operand;
  8768. leftType, rightType, componentType: SyntaxTree.Type;
  8769. size: LONGINT;
  8770. parameters: SyntaxTree.ExpressionList;
  8771. procedure: SyntaxTree.Procedure;
  8772. call: SyntaxTree.ProcedureCallDesignator;
  8773. designator: SyntaxTree.Designator;
  8774. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  8775. VAR procedureType: SyntaxTree.ProcedureType;
  8776. BEGIN
  8777. IF ReturnedAsParameter(right.type) THEN
  8778. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  8779. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  8780. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  8781. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  8782. WITH right: SyntaxTree.BuiltinCallDesignator DO
  8783. IF right.id = Global.Reshape THEN RETURN TRUE
  8784. END;
  8785. END;
  8786. END;
  8787. END;
  8788. RETURN FALSE
  8789. END CanPassAsResultParameter;
  8790. BEGIN
  8791. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  8792. leftType := left.type.resolved; rightType:= right.type.resolved;
  8793. IF backend.cooperative & left.NeedsTrace() THEN
  8794. ModifyAssignments(true);
  8795. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  8796. Designate(right, rightO);
  8797. Designate(left, leftO);
  8798. ASSERT(leftO.mode = ModeReference);
  8799. TransferToRegister(leftO.op, leftO.op);
  8800. TransferToRegister(rightO.op, rightO.op);
  8801. Emit(Push(position, leftO.op));
  8802. Emit(Push(position, rightO.op));
  8803. CallAssignMethod(leftO.op, rightO.op, left.type);
  8804. Emit(Pop(position, rightO.op));
  8805. Emit(Pop(position, leftO.op));
  8806. sizeOp := CopySize(left);
  8807. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8808. ReleaseOperand(leftO);
  8809. ReleaseOperand(rightO);
  8810. ELSE
  8811. Evaluate(right,rightO);
  8812. Designate(left,leftO);
  8813. ASSERT(leftO.mode = ModeReference);
  8814. IF (leftType IS SyntaxTree.ProcedureType) THEN
  8815. (* copy procedure address first *)
  8816. MakeMemory(mem,leftO.op,addressType,0);
  8817. Emit(Mov(position,mem,rightO.op));
  8818. ReleaseIntermediateOperand(mem);
  8819. (* copy pointer address *)
  8820. IntermediateCode.MakeAddress(leftO.tag, addressType);
  8821. CallAssignPointer(leftO.tag, rightO.tag);
  8822. ELSE
  8823. ASSERT(system.SizeOf(left.type) = system.addressSize);
  8824. CallAssignPointer(leftO.op, rightO.op);
  8825. END;
  8826. ReleaseOperand(leftO);
  8827. ReleaseOperand(rightO);
  8828. END;
  8829. ModifyAssignments(false);
  8830. RETURN;
  8831. END;
  8832. IF CanPassAsResultParameter(right) THEN
  8833. procedureResultDesignator := left(SyntaxTree.Designator);
  8834. Expression(right);
  8835. procedureResultDesignator := NIL;
  8836. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  8837. (* left <-- ALIAS OF right: zerocopy *)
  8838. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  8839. designator := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid, NIL, procedure);
  8840. designator.SetType(procedure.type);
  8841. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  8842. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  8843. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8844. END;
  8845. ELSIF leftType IS SyntaxTree.RangeType THEN
  8846. (* LHS is of array range type *)
  8847. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  8848. Evaluate(right, rightO);
  8849. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  8850. (* first *)
  8851. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 0);
  8852. Emit(Mov(position,mem, rightO.op));
  8853. ReleaseIntermediateOperand(mem);
  8854. (* last *)
  8855. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8856. Emit(Mov(position,mem, rightO.tag));
  8857. ReleaseIntermediateOperand(mem);
  8858. (* step *)
  8859. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8860. Emit(Mov(position,mem, rightO.extra));
  8861. ReleaseIntermediateOperand(mem);
  8862. ReleaseOperand(rightO);
  8863. ReleaseOperand(leftO)
  8864. ELSIF leftType IS SyntaxTree.ComplexType THEN
  8865. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  8866. Evaluate(right, rightO);
  8867. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  8868. componentType := leftType(SyntaxTree.ComplexType).componentType;
  8869. (* real part *)
  8870. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  8871. Emit(Mov(position,mem, rightO.op));
  8872. ReleaseIntermediateOperand(mem);
  8873. (* imaginary part *)
  8874. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8875. Emit(Mov(position,mem, rightO.tag));
  8876. ReleaseIntermediateOperand(mem);
  8877. ReleaseOperand(rightO);
  8878. ReleaseOperand(leftO)
  8879. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  8880. OR (leftType IS SyntaxTree.PortType) THEN
  8881. (* rightO := leftO;*)
  8882. Evaluate(right,rightO);
  8883. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  8884. Designate(left,leftO);
  8885. IF leftO.mode = ModeReference THEN
  8886. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  8887. destination := mem;
  8888. ELSE
  8889. destination := leftO.op;
  8890. END;
  8891. ReleaseOperand(leftO);
  8892. IF destination.mode # IntermediateCode.Undefined THEN
  8893. Emit(Mov(position,destination,rightO.op));
  8894. END;
  8895. ReleaseOperand(rightO);
  8896. ReleaseIntermediateOperand(mem);
  8897. IntermediateCode.InitOperand(destination);
  8898. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  8899. Evaluate(right,rightO);
  8900. Designate(left,leftO);
  8901. MakeMemory(mem,leftO.op,addressType,0);
  8902. Emit(Mov(position,mem,rightO.op));
  8903. ReleaseIntermediateOperand(mem);
  8904. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  8905. (* delegate *)
  8906. (*
  8907. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  8908. *)
  8909. Emit(Mov(position,leftO.tag,rightO.tag));
  8910. END;
  8911. ReleaseOperand(leftO);
  8912. ReleaseOperand(rightO);
  8913. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  8914. Designate(right,rightO);
  8915. Designate(left,leftO);
  8916. sizeOp := CopySize(left);
  8917. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8918. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8919. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  8920. IF (rightType IS SyntaxTree.StringType) THEN
  8921. CopyString(left,right);
  8922. 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
  8923. Designate(right,rightO);
  8924. Designate(left,leftO);
  8925. size := ToMemoryUnits(system,system.SizeOf(rightType));
  8926. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  8927. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8928. ELSE
  8929. HALT(201)
  8930. END;
  8931. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  8932. AssignMathArray(left,right);
  8933. ELSE
  8934. HALT(200);
  8935. END;
  8936. END Assign;
  8937. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  8938. BEGIN
  8939. IF Trace THEN TraceEnter("VisitAssignment") END;
  8940. Assign(x.left,x.right);
  8941. IF Trace THEN TraceExit("VisitAssignment") END;
  8942. END VisitAssignment;
  8943. PROCEDURE EmitCooperativeSwitch;
  8944. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  8945. BEGIN
  8946. ASSERT (cooperativeSwitches);
  8947. pc := section.pc;
  8948. IF lastSwitchPC = section.pc THEN RETURN END;
  8949. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  8950. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  8951. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  8952. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  8953. INC(statCoopSwitch, section.pc - pc);
  8954. END EmitCooperativeSwitch;
  8955. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  8956. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  8957. BEGIN
  8958. p0 := communication.left; p1 := communication.right;
  8959. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  8960. Evaluate(p0,s0);
  8961. Evaluate(p1,s1);
  8962. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8963. Emit(Push(position,s0.op));
  8964. Emit(Push(position,s1.op));
  8965. (*
  8966. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8967. *)
  8968. IF ~backend.cellsAreObjects THEN
  8969. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  8970. END;
  8971. ReleaseOperand(s0);
  8972. ReleaseOperand(s1);
  8973. IF backend.cellsAreObjects THEN
  8974. CallThis(position,"ActiveCellsRuntime","Send",2);
  8975. ELSE
  8976. CallThis(position,ChannelModuleName,"Send",2);
  8977. END;
  8978. (* ----- RECEIVE ------*)
  8979. ELSE
  8980. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  8981. tmp := p0; p0 := p1; p1 := tmp;
  8982. END;
  8983. Evaluate(p0,s0);
  8984. Emit(Push(position,s0.op));
  8985. Designate(p1,s1);
  8986. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8987. Emit(Push(position,s1.op));
  8988. (*
  8989. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8990. *)
  8991. IF ~backend.cellsAreObjects THEN
  8992. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  8993. END;
  8994. ReleaseOperand(s0);
  8995. ReleaseOperand(s1);
  8996. IF backend.cellsAreObjects THEN
  8997. CallThis(position,"ActiveCellsRuntime","Receive",2);
  8998. ELSE
  8999. CallThis(position,ChannelModuleName,"Receive",2)
  9000. END;
  9001. END;
  9002. END VisitCommunicationStatement;
  9003. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  9004. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9005. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9006. VAR true, false: Label; condition, value: BOOLEAN;
  9007. BEGIN
  9008. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9009. IF condition THEN
  9010. true := NewLabel();
  9011. false := NewLabel();
  9012. Condition(if.condition,true,false);
  9013. SetLabel(true);
  9014. StatementSequence(if.statements);
  9015. BrL(end);
  9016. SetLabel(false);
  9017. ELSE
  9018. IF value THEN (* always true *)
  9019. escape := TRUE;
  9020. StatementSequence(if.statements);
  9021. (* no branch necessary -- rest skipped *)
  9022. END;
  9023. END;
  9024. END IfPart;
  9025. BEGIN
  9026. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9027. end := NewLabel();
  9028. elsifs := x.ElsifParts();
  9029. IfPart(x.ifPart);
  9030. FOR i := 0 TO elsifs-1 DO
  9031. IF ~escape THEN
  9032. elsif := x.GetElsifPart(i);
  9033. IfPart(elsif);
  9034. END;
  9035. END;
  9036. IF (x.elsePart # NIL) & ~escape THEN
  9037. StatementSequence(x.elsePart);
  9038. END;
  9039. SetLabel(end);
  9040. IF Trace THEN TraceExit("VisitIfStatement") END;
  9041. END VisitIfStatement;
  9042. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9043. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9044. BEGIN
  9045. (*IF x.variable.type.resolved = x.type.resolved THEN
  9046. (* always true, do nothing *)
  9047. ELSE*)
  9048. Designate(x.variable,res);
  9049. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9050. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9051. END;
  9052. trueL := NewLabel();
  9053. TypeTest(res.tag,x.type,trueL,falseL);
  9054. ReleaseOperand(res);
  9055. SetLabel(trueL);
  9056. StatementSequence(x.statements);
  9057. BrL(endL);
  9058. END WithPart;
  9059. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  9060. VAR endL,falseL: Label;i: LONGINT;
  9061. BEGIN
  9062. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9063. endL := NewLabel();
  9064. FOR i := 0 TO x.WithParts()-1 DO
  9065. falseL := NewLabel();
  9066. WithPart(x.GetWithPart(i),falseL,endL);
  9067. SetLabel(falseL);
  9068. END;
  9069. IF x.elsePart = NIL THEN
  9070. IF ~isUnchecked THEN
  9071. EmitTrap(position,WithTrap);
  9072. END;
  9073. ELSE
  9074. StatementSequence(x.elsePart)
  9075. END;
  9076. SetLabel(endL);
  9077. IF Trace THEN TraceExit("VisitWithStatement") END;
  9078. END VisitWithStatement;
  9079. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  9080. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9081. out,else: Label; label: Label;
  9082. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9083. symbol: SyntaxTree.Symbol;
  9084. BEGIN
  9085. (*! split case statement into if-elsif statements for large case label lists *)
  9086. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9087. size := x.max-x.min+1;
  9088. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9089. END;
  9090. Evaluate(x.variable,var);
  9091. ReuseCopy(tmp,var.op);
  9092. ReleaseIntermediateOperand(var.op);
  9093. var.op := tmp;
  9094. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9095. Convert(var.op,addressType);
  9096. size := x.max-x.min+1;
  9097. else := NewLabel();
  9098. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9099. (*
  9100. UniqueId(name,module.module,"case",caseId);
  9101. *)
  9102. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9103. Global.GetModuleSegmentedName(module.module, name);
  9104. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9105. symbol := SyntaxTree.NewSymbol(name[1]);
  9106. symbol.SetScope(moduleScope);
  9107. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9108. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9109. section.isCaseTable := TRUE;
  9110. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9111. ReuseCopy(res,var.op);
  9112. ReleaseOperand(var);
  9113. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9114. Emit(Add(position,res,res,jmp));
  9115. IntermediateCode.MakeMemory(res,addressType);
  9116. Emit(Br(position,res));
  9117. ReleaseIntermediateOperand(res);
  9118. out := NewLabel();
  9119. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9120. part := x.GetCasePart(i);
  9121. constant := part.firstConstant;
  9122. label := NewLabel();
  9123. SetLabel(label);
  9124. WHILE(constant # NIL) DO (* case labels for this case part *)
  9125. FOR j := constant.min TO constant.max DO
  9126. fixups[j-x.min] := label;
  9127. END;
  9128. constant := constant.next;
  9129. END;
  9130. StatementSequence(part.statements);
  9131. BrL(out);
  9132. END;
  9133. SetLabel(else);
  9134. FOR i := 0 TO size-1 DO
  9135. IF fixups[i] = NIL THEN
  9136. fixups[i] := else;
  9137. END;
  9138. END;
  9139. IF x.elsePart # NIL THEN
  9140. StatementSequence(x.elsePart);
  9141. ELSIF ~isUnchecked THEN
  9142. EmitTrap(position,CaseTrap);
  9143. END;
  9144. SetLabel(out);
  9145. FOR i := 0 TO size-1 DO
  9146. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9147. section.Emit(Data(position,op));
  9148. END;
  9149. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9150. END VisitCaseStatement;
  9151. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  9152. VAR start: Label; true,false: Label;
  9153. BEGIN
  9154. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9155. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9156. start := NewLabel();
  9157. true := NewLabel();
  9158. false := NewLabel();
  9159. SetLabel(start);
  9160. Condition(x.condition,true,false);
  9161. SetLabel(true);
  9162. StatementSequence(x.statements);
  9163. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9164. BrL(start);
  9165. SetLabel(false);
  9166. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9167. END VisitWhileStatement;
  9168. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  9169. VAR false,true: Label;
  9170. BEGIN
  9171. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9172. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9173. true := NewLabel();
  9174. false := NewLabel();
  9175. SetLabel(false);
  9176. StatementSequence(x.statements);
  9177. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9178. Condition(x.condition,true,false);
  9179. SetLabel(true);
  9180. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9181. END VisitRepeatStatement;
  9182. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  9183. VAR
  9184. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9185. temporaryVariable: SyntaxTree.Variable;
  9186. temporaryVariableDesignator : SyntaxTree.Designator;
  9187. BEGIN
  9188. IF Trace THEN TraceEnter("VisitForStatement") END;
  9189. true := NewLabel();
  9190. false := NewLabel();
  9191. start := NewLabel();
  9192. Assign(x.variable,x.from);
  9193. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE);
  9194. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, temporaryVariable);
  9195. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9196. Assign(temporaryVariableDesignator,x.to);
  9197. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9198. IF by > 0 THEN
  9199. cmp := Scanner.LessEqual
  9200. ELSE
  9201. cmp := Scanner.GreaterEqual
  9202. END;
  9203. binary := SyntaxTree.NewBinaryExpression(0,x.variable,temporaryVariableDesignator,cmp);
  9204. binary.SetType(system.booleanType);
  9205. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9206. SetLabel(start);
  9207. Condition(binary,true,false);
  9208. SetLabel(true);
  9209. StatementSequence(x.statements);
  9210. binary := SyntaxTree.NewBinaryExpression(0,x.variable,x.by,Scanner.Plus);
  9211. binary.SetType(x.variable.type);
  9212. Assign(x.variable,binary);
  9213. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9214. BrL(start);
  9215. SetLabel(false);
  9216. IF Trace THEN TraceExit("VisitForStatement") END;
  9217. END VisitForStatement;
  9218. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  9219. VAR prevLoop: Label;
  9220. BEGIN
  9221. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9222. prevLoop := currentLoop;
  9223. currentLoop := NewLabel();
  9224. StatementSequence(x.statements);
  9225. SetLabel(currentLoop);
  9226. currentLoop := prevLoop;
  9227. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9228. END VisitExitableBlock;
  9229. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  9230. VAR prevLoop,start: Label;
  9231. BEGIN
  9232. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9233. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9234. start := NewLabel();
  9235. prevLoop := currentLoop;
  9236. SetLabel(start);
  9237. currentLoop := NewLabel();
  9238. StatementSequence(x.statements);
  9239. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9240. BrL(start);
  9241. SetLabel(currentLoop);
  9242. currentLoop := prevLoop;
  9243. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9244. END VisitLoopStatement;
  9245. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  9246. VAR outer: SyntaxTree.Statement;
  9247. BEGIN
  9248. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9249. IF locked THEN (* r if we jump out of an exclusive block *)
  9250. outer := x.outer;
  9251. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9252. outer := outer.outer;
  9253. END;
  9254. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9255. Lock(FALSE);
  9256. END;
  9257. END;
  9258. BrL(currentLoop);
  9259. IF Trace THEN TraceExit("VisitExitStatement") END;
  9260. END VisitExitStatement;
  9261. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  9262. VAR
  9263. expression, parameterDesignator: SyntaxTree.Expression;
  9264. type, componentType: SyntaxTree.Type;
  9265. res, right: Operand;
  9266. left, mem, reg: IntermediateCode.Operand;
  9267. parameter: SyntaxTree.Parameter;
  9268. procedure: SyntaxTree.Procedure;
  9269. procedureType: SyntaxTree.ProcedureType;
  9270. returnTypeOffset: LONGINT;
  9271. delegate: BOOLEAN;
  9272. map: SymbolMap;
  9273. BEGIN
  9274. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9275. expression := x.returnValue;
  9276. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9277. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9278. IF currentIsInline THEN
  9279. IF expression # NIL THEN
  9280. map := currentMapper.Get(NIL);
  9281. IF map # NIL THEN
  9282. Assign(map.to, expression);
  9283. END;
  9284. END;
  9285. BrL(currentInlineExit);
  9286. RETURN;
  9287. END;
  9288. IF expression # NIL THEN
  9289. type := expression.type.resolved;
  9290. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9291. IF locked THEN Lock(FALSE) END;
  9292. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9293. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9294. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9295. (* return without structured return parameter *)
  9296. Evaluate(expression,res);
  9297. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9298. IF locked OR profile THEN
  9299. Emit(Push(position,res.op));
  9300. IF delegate THEN HALT(200) END;
  9301. ReleaseOperand(res);
  9302. IF locked THEN Lock(FALSE) END;
  9303. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9304. reg := NewRegisterOperand(res.op.type);
  9305. Emit(Pop(position,reg));
  9306. Emit(Return(position,reg));
  9307. ReleaseIntermediateOperand(reg);
  9308. ELSE
  9309. Emit(Return(position,res.op));
  9310. ReleaseOperand(res);
  9311. END;
  9312. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9313. THEN
  9314. (* return using structured return parameter *)
  9315. 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)
  9316. OR SemanticChecker.IsPointerType(type));
  9317. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9318. parameter :=procedureType.returnParameter;
  9319. ASSERT(parameter # NIL);
  9320. returnTypeOffset := parameter.offsetInBits;
  9321. (*
  9322. IF parameter# NIL THEN
  9323. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9324. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9325. ELSE
  9326. returnTypeOffset := system.offsetFirstParameter
  9327. END;
  9328. *)
  9329. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9330. IF type IS SyntaxTree.RangeType THEN
  9331. (* array range type *)
  9332. Evaluate(expression, right);
  9333. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 0);
  9334. Emit(Mov(position,mem, right.op)); (* first *)
  9335. ReleaseIntermediateOperand(mem);
  9336. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9337. Emit(Mov(position,mem, right.tag)); (* last *)
  9338. ReleaseIntermediateOperand(mem);
  9339. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9340. Emit(Mov(position,mem, right.extra)); (* step *)
  9341. ReleaseIntermediateOperand(mem);
  9342. ReleaseOperand(right);
  9343. ELSIF type IS SyntaxTree.ComplexType THEN
  9344. Evaluate(expression, right);
  9345. componentType := type(SyntaxTree.ComplexType).componentType;
  9346. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9347. Emit(Mov(position,mem, right.op)); (* real part *)
  9348. ReleaseIntermediateOperand(mem);
  9349. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9350. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9351. ReleaseIntermediateOperand(mem);
  9352. ReleaseOperand(right);
  9353. ELSE (* covers cases: pointer / record / array *)
  9354. parameter := procedureType.returnParameter;
  9355. checker.SetCurrentScope(currentScope);
  9356. ASSERT(parameter # NIL);
  9357. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9358. Assign(parameterDesignator,expression);
  9359. END;
  9360. ReleaseIntermediateOperand(left);
  9361. IF locked THEN Lock(FALSE) END;
  9362. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9363. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9364. parameter := procedureType.returnParameter;
  9365. checker.SetCurrentScope(currentScope);
  9366. IF parameter = NIL THEN
  9367. Error(procedure.position, "structured return of parameter of procedure not found");
  9368. ELSE
  9369. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9370. Assign(parameterDesignator,expression);
  9371. END;
  9372. IF locked THEN Lock(FALSE) END;
  9373. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9374. ELSE
  9375. HALT(200);
  9376. END;
  9377. ELSE
  9378. IF locked THEN Lock(FALSE) END;
  9379. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9380. END;
  9381. IF backend.cooperative THEN
  9382. BrL(exitLabel);
  9383. ELSE
  9384. EmitLeave(section, position,procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9385. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention));
  9386. END;
  9387. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9388. END VisitReturnStatement;
  9389. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9390. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9391. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9392. statements: SyntaxTree.StatementSequence;
  9393. name, suffix: SyntaxTree.IdentifierString;
  9394. BEGIN
  9395. Strings.IntToStr(awaitProcCounter,suffix);
  9396. Strings.Concat("@AwaitProcedure",suffix,name);
  9397. identifier := SyntaxTree.NewIdentifier(name);
  9398. INC(awaitProcCounter);
  9399. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9400. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9401. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9402. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9403. procedure.SetAccess(SyntaxTree.Hidden);
  9404. procedure.SetScope(currentScope);
  9405. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9406. procedureType.SetReturnType(system.booleanType);
  9407. procedure.SetType(procedureType);
  9408. body := SyntaxTree.NewBody(x.position,procedureScope);
  9409. procedureScope.SetBody(body);
  9410. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9411. returnStatement.SetReturnValue(x.condition);
  9412. statements := SyntaxTree.NewStatementSequence();
  9413. statements.AddStatement(returnStatement);
  9414. body.SetStatementSequence(statements);
  9415. currentScope.AddProcedure(procedure);
  9416. RETURN procedure
  9417. END MakeAwaitProcedure;
  9418. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9419. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9420. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9421. BEGIN
  9422. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9423. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9424. IF backend.cooperative THEN
  9425. start := NewLabel();
  9426. true := NewLabel();
  9427. false := NewLabel();
  9428. SetLabel(start);
  9429. Condition(x.condition,true,false);
  9430. SetLabel(false);
  9431. PushSelfPointer();
  9432. CallThis(position,"ExclusiveBlocks","Await",1);
  9433. BrL(start);
  9434. SetLabel(true);
  9435. PushSelfPointer();
  9436. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9437. ELSE
  9438. proc := MakeAwaitProcedure(x);
  9439. Emit(Push(position,fp));
  9440. GetCodeSectionNameForSymbol(proc,name);
  9441. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9442. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9443. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9444. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9445. Emit(Result(position,res));
  9446. (*
  9447. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9448. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9449. *)
  9450. InitOperand(result,ModeValue);
  9451. result.op := res;
  9452. label := NewLabel();
  9453. BreqL(label, result.op, SELF.true);
  9454. ReleaseOperand(result);
  9455. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9456. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9457. Emit(Push(position,res));
  9458. Emit(Push(position,fp));
  9459. PushSelfPointer();
  9460. Emit(Push(position,nil));
  9461. CallThis(position,"Objects","Await",4);
  9462. SetLabel(label);
  9463. END;
  9464. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9465. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9466. END VisitAwaitStatement;
  9467. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9468. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9469. BEGIN
  9470. FOR i := 0 TO x.Length() - 1 DO
  9471. statement := x.GetStatement( i );
  9472. Statement(statement);
  9473. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9474. END;
  9475. END StatementSequence;
  9476. PROCEDURE PushSelfPointer;
  9477. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9478. BEGIN
  9479. scope := currentScope;
  9480. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9481. scope := scope.outerScope;
  9482. END;
  9483. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9484. IF ~newObjectFile THEN
  9485. Symbol(moduleSelf,op);
  9486. IntermediateCode.MakeMemory(op.op,addressType);
  9487. ELSE
  9488. moduleSection := meta.ModuleSection();
  9489. IF backend.cooperative THEN
  9490. moduleOffset := 0;
  9491. ELSE
  9492. moduleOffset := moduleSection.pc;
  9493. END;
  9494. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9495. END;
  9496. ELSE
  9497. GetBaseRegister(op.op,currentScope,scope);
  9498. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  9499. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  9500. IF backend.cooperative THEN
  9501. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9502. END;
  9503. IntermediateCode.MakeMemory(op.op,addressType);
  9504. END;
  9505. Emit(Push(position,op.op));
  9506. ReleaseOperand(op);
  9507. END PushSelfPointer;
  9508. PROCEDURE Lock(lock: BOOLEAN);
  9509. BEGIN
  9510. IF Trace THEN TraceEnter("Lock") END;
  9511. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9512. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9513. ASSERT(modifyAssignmentCounter = 0);
  9514. IF dump # NIL THEN
  9515. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9516. dump.Ln;dump.Update;
  9517. END;
  9518. PushSelfPointer;
  9519. IF backend.cooperative THEN
  9520. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9521. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9522. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9523. END;
  9524. ELSE
  9525. Emit(Push(position,true));
  9526. IF lock THEN CallThis(position,"Objects","Lock",2)
  9527. ELSE CallThis(position,"Objects","Unlock",2);
  9528. END;
  9529. END;
  9530. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9531. IF Trace THEN TraceExit("Lock") END;
  9532. END Lock;
  9533. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9534. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9535. BEGIN
  9536. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9537. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9538. previouslyUnchecked := isUnchecked;
  9539. isUnchecked := isUnchecked OR x.isUnchecked;
  9540. previouslyCooperativeSwitches := cooperativeSwitches;
  9541. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9542. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9543. IF x.statements # NIL THEN
  9544. StatementSequence(x.statements);
  9545. END;
  9546. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9547. isUnchecked := previouslyUnchecked;
  9548. cooperativeSwitches := previouslyCooperativeSwitches;
  9549. IF Trace THEN TraceExit("VisitStatementBlock") END;
  9550. END VisitStatementBlock;
  9551. PROCEDURE VisitCode(x: SyntaxTree.Code);
  9552. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  9553. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  9554. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  9555. procedure: SyntaxTree.Procedure;
  9556. map: SymbolMap;
  9557. BEGIN
  9558. scope := currentScope;
  9559. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  9560. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9561. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9562. return := emptyOperand;
  9563. IF Trace THEN TraceEnter("VisitCode") END;
  9564. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  9565. NEW(in, x.inRules.Length());
  9566. FOR i := 0 TO LEN(in)-1 DO
  9567. statement := x.inRules.GetStatement(i);
  9568. WITH statement: SyntaxTree.Assignment DO
  9569. Evaluate(statement.right, operand);
  9570. result := operand.op;
  9571. NEW(str, 64);
  9572. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  9573. in[i] := result; IntermediateCode.SetString(in[i], str);
  9574. ReleaseIntermediateOperand(operand.tag);
  9575. END;
  9576. END;
  9577. ELSE in := NIL
  9578. END;
  9579. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  9580. NEW(out, x.outRules.Length());
  9581. FOR i := 0 TO LEN(out)-1 DO
  9582. statement := x.outRules.GetStatement(i);
  9583. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  9584. WITH statement: SyntaxTree.Assignment DO
  9585. Evaluate(statement.left, operand); (*?? or designate *)
  9586. result := operand.op;
  9587. NEW(str, 64);
  9588. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  9589. out[i] := result; IntermediateCode.SetString(out[i], str);
  9590. ReleaseIntermediateOperand(operand.tag);
  9591. |statement: SyntaxTree.ReturnStatement DO
  9592. NEW(str, 64);
  9593. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  9594. IF currentIsInline THEN
  9595. map := currentMapper.Get(NIL);
  9596. Evaluate(map.to, operand);
  9597. out[i] := operand.op;
  9598. ELSE
  9599. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9600. END;
  9601. IntermediateCode.SetString(out[i], str);
  9602. ReleaseIntermediateOperand(operand.tag);
  9603. return := out[i];
  9604. ELSE
  9605. END;
  9606. END;
  9607. ELSE out := NIL
  9608. END;
  9609. Emit(Asm(x.position,x.sourceCode, in, out));
  9610. IF in # NIL THEN
  9611. FOR i := 0 TO LEN(in)-1 DO
  9612. ReleaseIntermediateOperand(in[i]);
  9613. END;
  9614. END;
  9615. IF out # NIL THEN
  9616. FOR i := 0 TO LEN(out)-1 DO
  9617. WITH statement: SyntaxTree.Assignment DO
  9618. ReleaseIntermediateOperand(out[i]);
  9619. ELSE
  9620. IF currentIsInline THEN
  9621. ReleaseIntermediateOperand(out[i]);
  9622. END;
  9623. END;
  9624. statement := x.outRules.GetStatement(i);
  9625. END;
  9626. END;
  9627. IF return.mode # IntermediateCode.Undefined THEN
  9628. IF currentIsInline THEN
  9629. ELSIF ReturnedAsParameter(procedureType.returnType) THEN
  9630. Symbol(procedureType.returnParameter, par);
  9631. MakeMemory(mem, par.op, return.type, 0);
  9632. ReleaseOperand(par);
  9633. Emit(Mov(position, mem, return));
  9634. ReleaseIntermediateOperand(mem);
  9635. ELSE
  9636. Emit(Return(position,return));
  9637. END;
  9638. IF currentIsInline THEN RETURN END;
  9639. EmitLeave(section, position,procedureType(SyntaxTree.ProcedureType).callingConvention);
  9640. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,procedureType(SyntaxTree.ProcedureType).callingConvention));
  9641. ReleaseIntermediateOperand(return);
  9642. END;
  9643. IF Trace THEN TraceExit("VisitCode") END;
  9644. END VisitCode;
  9645. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  9646. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  9647. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  9648. const, call: IntermediateCode.Operand;
  9649. parameterDesignator: SyntaxTree.Expression;
  9650. saved: RegisterEntry;
  9651. name: Basic.SegmentedName;
  9652. BEGIN
  9653. IF Trace THEN TraceEnter("ParameterCopies") END;
  9654. parameter := x.firstParameter;
  9655. WHILE parameter # NIL DO
  9656. IF parameter.kind = SyntaxTree.ValueParameter THEN
  9657. type := parameter.type.resolved;
  9658. IF IsOpenArray(type) THEN
  9659. VisitParameter(parameter);
  9660. op := result;
  9661. IF backend.cooperative & parameter.NeedsTrace() THEN
  9662. length := GetArrayLength(type, op.tag);
  9663. size := NewRegisterOperand(addressType);
  9664. base := ArrayBaseType(type);
  9665. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  9666. Emit(Mul(position, size, length, const));
  9667. dst := NewRegisterOperand (addressType);
  9668. Emit(Mov(position, dst, size));
  9669. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9670. Emit(Sub(position,dst,sp,dst));
  9671. Emit(And(position,dst,dst,const));
  9672. Emit(Mov(position,sp,dst));
  9673. par := fp;
  9674. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9675. IntermediateCode.InitImmediate(null, byteType, 0);
  9676. Emit(Fill(position, dst, size, null));
  9677. ReleaseIntermediateOperand(dst);
  9678. ReleaseIntermediateOperand(length);
  9679. SaveRegisters();ReleaseUsedRegisters(saved);
  9680. (* register dst has been freed before SaveRegisters already *)
  9681. base := ArrayBaseType(type);
  9682. (* assign method of open array *)
  9683. IF base.IsRecordType() THEN
  9684. Emit (Push(position, length));
  9685. Emit (Push(position, dst));
  9686. Emit (Push(position, op.op));
  9687. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  9688. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  9689. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  9690. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  9691. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  9692. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  9693. Emit (Push(position,length));
  9694. Emit (Push(position, dst));
  9695. Emit (Push(position, length));
  9696. Emit (Push(position, op.op));
  9697. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  9698. ELSE
  9699. Emit (Push(position, length));
  9700. Emit (Push(position, dst));
  9701. Emit (Push(position, length));
  9702. Emit (Push(position, op.op));
  9703. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  9704. ASSERT(ArrayBaseType(type).IsPointer());
  9705. END;
  9706. RestoreRegisters(saved);
  9707. ELSE
  9708. temp := GetDynamicSize(type,op.tag);
  9709. ReuseCopy(size,temp);
  9710. ReleaseIntermediateOperand(temp);
  9711. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9712. Emit(Sub(position,size,sp,size));
  9713. Emit(And(position,size,size,const));
  9714. Emit(Mov(position,sp,size));
  9715. par := fp;
  9716. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9717. ReleaseIntermediateOperand(size);
  9718. size := GetDynamicSize(type,op.tag);
  9719. END;
  9720. Emit(Copy(position,sp,op.op,size));
  9721. ReleaseIntermediateOperand(size);
  9722. ReleaseOperand(op);
  9723. IntermediateCode.MakeMemory(par,addressType);
  9724. Emit(Mov(position,par,sp));
  9725. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  9726. checker.SetCurrentScope(currentScope);
  9727. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  9728. Assign(parameterDesignator,parameterDesignator);
  9729. END;
  9730. END;
  9731. parameter := parameter.nextParameter;
  9732. END;
  9733. IF Trace THEN TraceExit("ParameterCopies") END;
  9734. END ParameterCopies;
  9735. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  9736. VAR x: SyntaxTree.Variable;
  9737. BEGIN
  9738. x := scope.firstVariable;
  9739. WHILE x # NIL DO
  9740. InitVariable(x);
  9741. x := x.nextVariable;
  9742. END;
  9743. END InitVariables;
  9744. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  9745. BEGIN
  9746. IF (symbol # NIL) THEN
  9747. RETURN fingerPrinter.SymbolFP(symbol).shallow
  9748. ELSE
  9749. RETURN 0
  9750. END;
  9751. END GetFingerprint;
  9752. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  9753. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  9754. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  9755. saved: RegisterEntry;
  9756. BEGIN
  9757. IF Trace THEN TraceEnter("Body") END;
  9758. ReleaseUsedRegisters(saved); (* just in case ... *)
  9759. section := ir;
  9760. exitLabel := NewLabel ();
  9761. IF moduleBody THEN moduleBodySection := section END;
  9762. IF ir.comments # NIL THEN
  9763. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  9764. commentPrintout.SingleStatement(TRUE);
  9765. dump := ir.comments;
  9766. ELSE
  9767. commentPrintout := NIL;
  9768. dump := NIL;
  9769. END;
  9770. prevScope := currentScope;
  9771. currentScope := scope;
  9772. lastSwitchPC := 0;
  9773. cooperativeSwitches := backend.cooperative;
  9774. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9775. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9776. IF x # NIL THEN
  9777. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9778. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  9779. IF moduleBody THEN
  9780. ProfilerInit();
  9781. ELSE
  9782. Basic.SegmentedNameToString(ir.name, string);
  9783. ProfilerAddProcedure(numberProcedures,string);
  9784. ProfilerEnterExit(numberProcedures,TRUE);
  9785. END;
  9786. END;
  9787. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  9788. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  9789. END;
  9790. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  9791. IF moduleBody & ~newObjectFile THEN
  9792. InitVariables(moduleScope)
  9793. END;
  9794. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  9795. cellScope := scope.outerScope(SyntaxTree.CellScope);
  9796. IF procedure = cellScope.bodyProcedure THEN
  9797. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  9798. StaticCallOperand(op, cellScope.constructor);
  9799. Emit(Call(position,op.op,0));
  9800. END;
  9801. END;
  9802. END;
  9803. ParameterCopies(procedureType);
  9804. InitVariables(scope);
  9805. IF x.code = NIL THEN
  9806. VisitStatementBlock(x);
  9807. ELSE
  9808. VisitCode(x.code)
  9809. END;
  9810. IF x.finally # NIL THEN (*! mark finally block for object file *)
  9811. ir.SetFinally(ir.pc);
  9812. StatementSequence(x.finally)
  9813. END;
  9814. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  9815. IF ~backend.cooperative THEN
  9816. ProfilerEnterExit(numberProcedures,FALSE);
  9817. END;
  9818. INC(numberProcedures);
  9819. END;
  9820. END;
  9821. IF backend.cooperative THEN
  9822. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  9823. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  9824. ELSIF newObjectFile & moduleBody & ~suppressModuleRegistration & ~meta.simple THEN
  9825. (*! not required any more? check and delete!
  9826. PushSelfPointer();
  9827. CallThis(position,"Modules","SetInitialized",1);
  9828. *)
  9829. (*
  9830. SetLabel(end);
  9831. *)
  9832. END;
  9833. IF x # NIL THEN
  9834. SELF.position := x.position;
  9835. END;
  9836. CheckRegistersFree();
  9837. ASSERT(modifyAssignmentCounter = 0);
  9838. currentScope := prevScope;
  9839. IF Trace THEN TraceExit("Body") END;
  9840. END Body;
  9841. END ImplementationVisitor;
  9842. MetaDataGenerator=OBJECT
  9843. VAR
  9844. implementationVisitor: ImplementationVisitor;
  9845. declarationVisitor: DeclarationVisitor;
  9846. module: Sections.Module;
  9847. moduleName: ARRAY 128 OF CHAR;
  9848. moduleNamePool: Basic.HashTableInt;
  9849. moduleNamePoolSection: IntermediateCode.Section;
  9850. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  9851. MethodTableOffset: LONGINT; (* method table offset from zero *)
  9852. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  9853. TypeTags: LONGINT; (* type extension level support *)
  9854. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  9855. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  9856. BEGIN
  9857. IF implementationVisitor.backend.cooperative THEN
  9858. TypeTags := MAX(LONGINT);
  9859. BaseTypesTableOffset := 0;
  9860. MethodTableOffset := 2;
  9861. TypeRecordBaseOffset := 0;
  9862. ELSIF simple THEN
  9863. TypeTags := 3; (* only 3 extensions allowed *)
  9864. BaseTypesTableOffset := 1;
  9865. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  9866. TypeRecordBaseOffset := 0;
  9867. ELSE
  9868. TypeTags := 16;
  9869. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  9870. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  9871. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  9872. END;
  9873. SELF.simple := simple;
  9874. SELF.implementationVisitor := implementationVisitor;
  9875. SELF.declarationVisitor := declarationVisitor;
  9876. implementationVisitor.meta := SELF;
  9877. declarationVisitor.meta := SELF;
  9878. END InitMetaDataGenerator;
  9879. PROCEDURE SetModule(module: Sections.Module);
  9880. VAR namePoolOffset: LONGINT;
  9881. BEGIN
  9882. SELF.module := module;
  9883. Global.GetModuleName(module.module,moduleName);
  9884. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple THEN
  9885. NEW(moduleNamePool, 32);
  9886. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  9887. END;
  9888. END SetModule;
  9889. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  9890. BEGIN
  9891. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  9892. END GetTypeRecordBaseOffset;
  9893. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9894. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  9895. BEGIN
  9896. INC(dataAdrOffset,6);
  9897. Info(section,"headerAdr");
  9898. Address(section,0);
  9899. Info(section,"typeDesc");
  9900. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  9901. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  9902. NamedSymbol(section, name, symbol, 0, offset);
  9903. Info(section,"mark: LONGINT;");
  9904. Longint(section,-1);
  9905. Info(section,"dataAdr-: ADDRESS");
  9906. Symbol(section,section, dataAdrOffset,0);
  9907. Info(section,"size-: SIZE");
  9908. Address(section,0);
  9909. Info(section,"nextRealtime: HeapBlock;");
  9910. Address(section,0);
  9911. END HeapBlock;
  9912. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9913. VAR i: LONGINT;
  9914. BEGIN
  9915. INC(dataAdrOffset,14);
  9916. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  9917. Info(section,"count*: LONGINT");
  9918. Longint(section,0);
  9919. Info(section,"locked*: BOOLEAN");
  9920. Longint(section,0);
  9921. Info(section,"awaitingLock*: ProcessQueue");
  9922. Address(section,0);
  9923. Address(section,0);
  9924. Info(section,"awaitingCond*: ProcessQueue");
  9925. Address(section,0);
  9926. Address(section,0);
  9927. Info(section,"lockedBy*: ANY");
  9928. Address(section,0);
  9929. Info(section,"lock*: ANY");
  9930. Address(section,0);
  9931. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  9932. Longint(section,1);
  9933. FOR i := 2 TO 6 DO
  9934. Longint(section,0);
  9935. END;
  9936. END ProtectedHeapBlock;
  9937. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  9938. BEGIN
  9939. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  9940. END Info;
  9941. PROCEDURE Address(section: IntermediateCode.Section; value: LONGINT);
  9942. VAR op: IntermediateCode.Operand;
  9943. BEGIN
  9944. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  9945. section.Emit(Data(-11,op));
  9946. END Address;
  9947. PROCEDURE Size(section: IntermediateCode.Section; value: LONGINT);
  9948. VAR op: IntermediateCode.Operand;
  9949. BEGIN
  9950. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  9951. section.Emit(Data(-12,op));
  9952. END Size;
  9953. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  9954. VAR op: IntermediateCode.Operand;
  9955. BEGIN
  9956. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  9957. section.Emit(Data(-1,op));
  9958. END Set;
  9959. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  9960. VAR op: IntermediateCode.Operand;
  9961. BEGIN
  9962. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9963. section.Emit(Data(-1,op));
  9964. END Longint;
  9965. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  9966. VAR op,noOperand: IntermediateCode.Operand;
  9967. BEGIN
  9968. IntermediateCode.InitOperand(noOperand);
  9969. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9970. section.PatchOperands(pc,op,noOperand,noOperand);
  9971. END PatchLongint;
  9972. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  9973. VAR op, noOperand: IntermediateCode.Operand;
  9974. BEGIN
  9975. IntermediateCode.InitOperand(noOperand);
  9976. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  9977. section.PatchOperands(pc,op,noOperand,noOperand);
  9978. END PatchSymbol;
  9979. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  9980. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  9981. BEGIN
  9982. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  9983. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  9984. section.Emit(Data(-1,op));
  9985. END Boolean;
  9986. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  9987. VAR op: IntermediateCode.Operand;
  9988. BEGIN
  9989. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  9990. section.Emit(Data(-1,op));
  9991. END Char;
  9992. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  9993. VAR i: LONGINT;
  9994. BEGIN
  9995. Info(section,str);
  9996. i := 0;
  9997. WHILE(str[i] # 0X) DO
  9998. Char(section,str[i]);
  9999. INC(i);
  10000. END;
  10001. Char(section,0X);
  10002. END String;
  10003. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10004. VAR op: IntermediateCode.Operand;
  10005. BEGIN
  10006. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10007. IntermediateCode.SetOffset(op,realOffset);
  10008. section.Emit(Data(-1,op));
  10009. END NamedSymbol;
  10010. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10011. BEGIN
  10012. IF symbol= NIL THEN
  10013. Address( section, realOffset);
  10014. ASSERT(virtualOffset = 0);
  10015. ELSE
  10016. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10017. END;
  10018. END Symbol;
  10019. (* OutPointers delivers
  10020. {pointerOffset}
  10021. *)
  10022. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10023. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type;
  10024. BEGIN
  10025. type := type.resolved;
  10026. IF type IS SyntaxTree.AnyType THEN
  10027. Symbol(section, symbol, 0, (offset ));
  10028. INC(numberPointers);
  10029. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10030. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10031. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10032. ELSIF type IS SyntaxTree.PointerType THEN
  10033. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10034. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10035. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10036. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10037. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10038. ELSIF (type IS SyntaxTree.RecordType) THEN
  10039. (* never treat a record like a pointer, even if the pointer field is set! *)
  10040. WITH type: SyntaxTree.RecordType DO
  10041. base := type.GetBaseRecord();
  10042. IF base # NIL THEN
  10043. Pointers(offset,symbol,section, base,numberPointers);
  10044. END;
  10045. variable := type.recordScope.firstVariable;
  10046. WHILE(variable # NIL) DO
  10047. IF ~(variable.untraced) THEN
  10048. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10049. END;
  10050. variable := variable.nextVariable;
  10051. END;
  10052. END;
  10053. ELSIF (type IS SyntaxTree.CellType) THEN
  10054. WITH type: SyntaxTree.CellType DO
  10055. base := type.GetBaseRecord();
  10056. IF base # NIL THEN
  10057. Pointers(offset,symbol,section, base,numberPointers);
  10058. END;
  10059. variable := type.cellScope.firstVariable;
  10060. WHILE(variable # NIL) DO
  10061. IF ~(variable.untraced) THEN
  10062. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10063. END;
  10064. variable := variable.nextVariable;
  10065. END;
  10066. END;
  10067. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10068. WITH type: SyntaxTree.ArrayType DO
  10069. IF type.form= SyntaxTree.Static THEN
  10070. n := type.staticLength;
  10071. base := type.arrayBase.resolved;
  10072. WHILE(base IS SyntaxTree.ArrayType) DO
  10073. type := base(SyntaxTree.ArrayType);
  10074. n := n* type.staticLength;
  10075. base := type.arrayBase.resolved;
  10076. END;
  10077. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10078. IF SemanticChecker.ContainsPointer(base) THEN
  10079. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10080. FOR i := 0 TO n-1 DO
  10081. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10082. END;
  10083. END;
  10084. ELSE
  10085. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10086. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10087. END;
  10088. END;
  10089. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10090. WITH type: SyntaxTree.MathArrayType DO
  10091. IF type.form = SyntaxTree.Static THEN
  10092. n := type.staticLength;
  10093. base := type.arrayBase.resolved;
  10094. WHILE(base IS SyntaxTree.MathArrayType) DO
  10095. type := base(SyntaxTree.MathArrayType);
  10096. n := n* type.staticLength;
  10097. base := type.arrayBase.resolved;
  10098. END;
  10099. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10100. IF SemanticChecker.ContainsPointer(base) THEN
  10101. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10102. FOR i := 0 TO n-1 DO
  10103. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10104. END;
  10105. END;
  10106. ELSE
  10107. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10108. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10109. END
  10110. END;
  10111. (* ELSE no pointers in type *)
  10112. END;
  10113. END Pointers;
  10114. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10115. VAR position,i: LONGINT; ch: CHAR;
  10116. BEGIN
  10117. IF pool.Has(index) THEN
  10118. RETURN pool.GetInt(index)
  10119. ELSE
  10120. position := source.pc;
  10121. pool.PutInt(index, position);
  10122. Info(source, name);
  10123. i := 0;
  10124. REPEAT
  10125. ch := name[i]; INC(i);
  10126. Char( source, ch);
  10127. UNTIL ch = 0X;
  10128. END;
  10129. RETURN position;
  10130. END EnterDynamicName;
  10131. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10132. VAR name: Basic.SectionName; position: LONGINT;
  10133. BEGIN
  10134. IF pool.Has(index) THEN
  10135. RETURN pool.GetInt(index)
  10136. ELSE
  10137. StringPool.GetString(index, name);
  10138. position := EnterDynamicName(source,name,index, pool);
  10139. END;
  10140. RETURN position;
  10141. END DynamicName;
  10142. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10143. VAR name: ARRAY 128 OF CHAR; section: IntermediateCode.Section; pooledName: Basic.SegmentedName;
  10144. BEGIN
  10145. COPY(moduleName,name);
  10146. Strings.Append(name,suffix);
  10147. Basic.ToSegmentedName(name, pooledName);
  10148. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName, NIL,TRUE);
  10149. IF implementationVisitor.backend.cooperative THEN
  10150. Info(section, "TypeDescriptor");
  10151. Basic.ToSegmentedName("BaseTypes.Array", pooledName);
  10152. NamedSymbol(section, pooledName,NIL, 0, 0);
  10153. BasePointer(section);
  10154. offset := 0;
  10155. ELSE
  10156. HeapBlock(mName,typeName,section,2);
  10157. Info(section, "HeapBlock");
  10158. (*
  10159. Symbol(section,section,2,0);
  10160. *)
  10161. Address(section,0); (* empty such that GC does not go on traversing *)
  10162. Info(section, "TypeDescriptor");
  10163. Address(section,0);
  10164. offset := section.pc;
  10165. END;
  10166. RETURN section
  10167. END Block;
  10168. PROCEDURE Array(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR);
  10169. VAR name: Basic.SegmentedName;
  10170. BEGIN
  10171. Info(source,"ArrayHeader");
  10172. IF implementationVisitor.backend.cooperative THEN
  10173. sizePC := source.pc;
  10174. Address(source,0);
  10175. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10176. IF baseType # "" THEN
  10177. Basic.ToSegmentedName(baseType, name);
  10178. NamedSymbol(source, name,NIL, 0, 0);
  10179. ELSE
  10180. Address(source,0);
  10181. END;
  10182. Address(source,0);
  10183. ELSE
  10184. Address(source,0);
  10185. Address(source,0);
  10186. Address(source,0);
  10187. sizePC := source.pc;
  10188. Address(source,0);
  10189. Info(source,"array data");
  10190. END;
  10191. END Array;
  10192. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10193. BEGIN
  10194. IF implementationVisitor.backend.cooperative THEN
  10195. PatchLongint(section, pc, size);
  10196. PatchLongint(section, pc + 3, size);
  10197. ELSE
  10198. PatchLongint(section, pc, size);
  10199. END;
  10200. END PatchArray;
  10201. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10202. VAR
  10203. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10204. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10205. poolMap: Basic.HashTableInt;
  10206. namePool: IntermediateCode.Section;
  10207. namePoolOffset: LONGINT;
  10208. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10209. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10210. BEGIN
  10211. Basic.SegmentedNameToString(s1.name,n1);
  10212. Basic.SegmentedNameToString(s2.name,n2);
  10213. index := 0;
  10214. ch1 := n1[index];
  10215. ch2 := n2[index];
  10216. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10217. INC(index);
  10218. ch1 := n1[index];
  10219. ch2 := n2[index];
  10220. END;
  10221. RETURN ch1 < ch2;
  10222. END Compare;
  10223. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10224. VAR
  10225. i, j: LONGINT;
  10226. x, t: Sections.Section;
  10227. BEGIN
  10228. IF lo < hi THEN
  10229. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10230. WHILE i <= j DO
  10231. WHILE Compare(list[i], x) DO INC(i) END;
  10232. WHILE Compare(x, list[j]) DO DEC(j) END;
  10233. IF i <= j THEN
  10234. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10235. INC(i); DEC(j)
  10236. END
  10237. END;
  10238. IF lo < j THEN QuickSort(list, lo, j) END;
  10239. IF i < hi THEN QuickSort(list, i, hi) END
  10240. END;
  10241. END QuickSort;
  10242. (*
  10243. ExportDesc* = RECORD
  10244. fp*: ADDRESS;
  10245. name* {UNTRACED}: DynamicName;
  10246. adr*: ADDRESS;
  10247. exports*: LONGINT;
  10248. dsc* {UNTRACED}: ExportArray
  10249. END;
  10250. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10251. *)
  10252. PROCEDURE ExportDesc2(
  10253. source: IntermediateCode.Section;
  10254. namePool: IntermediateCode.Section;
  10255. fingerPrinter: FingerPrinter.FingerPrinter;
  10256. symbol: Sections.Section;
  10257. name: StringPool.Index;
  10258. VAR patchAdr: LONGINT
  10259. ): BOOLEAN;
  10260. VAR fingerPrint: SyntaxTree.FingerPrint;
  10261. BEGIN
  10262. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10263. & (symbol.type # Sections.InlineCodeSection)
  10264. THEN
  10265. *)
  10266. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10267. & (symbol.type # Sections.InlineCodeSection))
  10268. THEN
  10269. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10270. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10271. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10272. Longint(source,fingerPrint.shallow);
  10273. ELSE
  10274. Longint(source, 0);
  10275. END;
  10276. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10277. Symbol(source, symbol,0,0);
  10278. patchAdr := source.pc;
  10279. Address(source,0);
  10280. Address(source,0);
  10281. END;
  10282. RETURN TRUE
  10283. ELSE
  10284. RETURN FALSE
  10285. END;
  10286. END ExportDesc2;
  10287. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10288. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10289. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10290. sym: Sections.Section; ignore: LONGINT; symbol: Sections.Section;
  10291. TYPE
  10292. Scope = RECORD
  10293. elements: LONGINT;
  10294. gelements: LONGINT;
  10295. section: IntermediateCode.Section;
  10296. patchAdr: LONGINT;
  10297. arraySizePC: LONGINT;
  10298. beginPC: LONGINT; (* current scope start pc *)
  10299. END;
  10300. BEGIN
  10301. Basic.InitSegmentedName(prev);
  10302. olevel := -1;
  10303. scopes[0].section := source;
  10304. FOR s := 0 TO LEN(sections)-1 DO
  10305. symbol := sections[s];
  10306. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10307. this := sections[s].name;
  10308. level := 0;
  10309. WHILE (this[level] > 0) DO
  10310. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10311. INC(level);
  10312. END;
  10313. WHILE level < olevel DO
  10314. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10315. IF olevel > 0 THEN
  10316. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10317. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10318. END;
  10319. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10320. DEC(olevel);
  10321. END;
  10322. IF (this[level] > 0) THEN
  10323. IF level > olevel THEN
  10324. (*TRACE("opening",level); *)
  10325. IF scopes[level].section = NIL THEN
  10326. arrayName := ".@ExportArray";
  10327. Strings.AppendInt(arrayName, level);
  10328. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,ignore);
  10329. Array(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc");
  10330. END;
  10331. scopes[level].beginPC := scopes[level].section.pc;
  10332. olevel := level;
  10333. scopes[olevel].elements := 0;
  10334. END;
  10335. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10336. sym := sections[s];
  10337. ELSE
  10338. sym := NIL;
  10339. END;
  10340. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10341. THEN
  10342. INC(scopes[olevel].elements);
  10343. END;
  10344. (*StringPool.GetString(this[level], name);*)
  10345. (*TRACE(level, name);*)
  10346. (* enter string in scope *)
  10347. INC(level);
  10348. END;
  10349. END;
  10350. Basic.SegmentedNameToString(this, name);
  10351. (*TRACE(level, "enter", name);*)
  10352. prev := this;
  10353. END;
  10354. END;
  10355. WHILE 0 <= olevel DO
  10356. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10357. IF olevel > 0 THEN
  10358. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10359. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10360. END;
  10361. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10362. DEC(olevel);
  10363. END;
  10364. level := 0;
  10365. WHILE (level < LEN(scopes)) DO
  10366. IF scopes[level].section # NIL THEN
  10367. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10368. END;
  10369. INC(level);
  10370. END;
  10371. END Export;
  10372. BEGIN
  10373. NEW(fingerPrinter, module.system);
  10374. NEW(poolMap, 64);
  10375. (* 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 *)
  10376. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10377. NEW(sectionArray, module.allSections.Length());
  10378. FOR i := 0 TO module.allSections.Length() - 1 DO
  10379. section := module.allSections.GetSection(i);
  10380. sectionArray[i] := section;
  10381. END;
  10382. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10383. Export(sectionArray^);
  10384. END ExportDesc;
  10385. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10386. VAR
  10387. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10388. BEGIN
  10389. Info(source, "exception table offsets array descriptor");
  10390. size := 0;
  10391. Array(source,sizePC,"Modules.ExceptionTableEntry");
  10392. Info(source, "exception table content");
  10393. FOR i := 0 TO module.allSections.Length() - 1 DO
  10394. p := module.allSections.GetSection(i);
  10395. IF p.type = Sections.CodeSection THEN
  10396. finallyPC := p(IntermediateCode.Section).finally;
  10397. IF finallyPC>=0 THEN
  10398. Symbol( source, p, 0,0);
  10399. Symbol( source, p, finallyPC, 0);
  10400. Symbol( source, p, finallyPC,0);
  10401. INC(size);
  10402. END;
  10403. END
  10404. END;
  10405. PatchArray(source,sizePC,size);
  10406. END ExceptionArray;
  10407. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10408. VAR i: LONGINT; ch: CHAR;
  10409. BEGIN
  10410. i := 0;
  10411. REPEAT
  10412. ch := name[i]; INC(i);
  10413. Char( section, ch);
  10414. UNTIL ch = 0X;
  10415. WHILE i < 32 DO
  10416. Char( section, 0X); INC(i);
  10417. END;
  10418. END Name;
  10419. PROCEDURE References(section: IntermediateCode.Section);
  10420. CONST
  10421. rfDirect = 1X; rfIndirect = 3X;
  10422. rfStaticArray= 12X; rfDynamicArray=14X; rfOpenArray=15X;
  10423. rfByte = 1X; rfBoolean = 2X; rfChar8=3X; rfShortint=04X; rfInteger = 05X; rfLongint = 06X;
  10424. rfReal = 07X; rfLongreal = 08X; rfSet = 09X; rfDelegate = 0EX; rfString = 0FH; rfPointer = 0DX; rfHugeint = 10X;
  10425. rfChar16=11X; rfChar32=12X; rfAll=13X; rfSame=14X; rfRange=15X; rfRecord=16X; rfComplex = 17X; rfLongcomplex = 18X;
  10426. rfRecordPointer=1DX;
  10427. rfArrayFlag = 80X;
  10428. VAR
  10429. s: Sections.Section; sizePC, i, startPC, endPC: LONGINT;
  10430. PROCEDURE BaseType(type: SyntaxTree.Type): CHAR;
  10431. VAR char: CHAR;
  10432. BEGIN
  10433. IF type = NIL THEN char := rfLongint
  10434. ELSIF type IS SyntaxTree.ByteType THEN char := rfByte
  10435. ELSIF type IS SyntaxTree.BooleanType THEN char := rfBoolean
  10436. ELSIF type IS SyntaxTree.CharacterType THEN
  10437. IF type.sizeInBits = 8 THEN char := rfChar8
  10438. ELSIF type.sizeInBits = 16 THEN char := rfChar16
  10439. ELSIF type.sizeInBits = 32 THEN char := rfChar32
  10440. END;
  10441. ELSIF (type IS SyntaxTree.IntegerType) OR (type IS SyntaxTree.AddressType) OR (type IS SyntaxTree.SizeType) THEN
  10442. IF type.sizeInBits = 8 THEN char := rfShortint
  10443. ELSIF type.sizeInBits = 16 THEN char := rfInteger
  10444. ELSIF type.sizeInBits = 32 THEN char := rfLongint
  10445. ELSIF type.sizeInBits = 64 THEN char := rfHugeint
  10446. END;
  10447. ELSIF type IS SyntaxTree.SizeType THEN char := rfLongint
  10448. ELSIF type IS SyntaxTree.FloatType THEN
  10449. IF type.sizeInBits = 32 THEN char := rfReal
  10450. ELSIF type.sizeInBits = 64 THEN char := rfLongreal
  10451. END;
  10452. ELSIF type IS SyntaxTree.ComplexType THEN
  10453. IF type.sizeInBits = 64 THEN char := rfComplex
  10454. ELSIF type.sizeInBits = 128 THEN char := rfLongcomplex
  10455. END;
  10456. ELSIF type IS SyntaxTree.SetType THEN char := rfSet
  10457. ELSIF type IS SyntaxTree.AnyType THEN char := rfPointer
  10458. ELSIF type IS SyntaxTree.ObjectType THEN char := rfPointer
  10459. ELSIF type IS SyntaxTree.PointerType THEN char := rfPointer
  10460. ELSIF type IS SyntaxTree.ProcedureType THEN char := rfDelegate
  10461. ELSIF type IS SyntaxTree.RangeType THEN char := rfRange
  10462. ELSE (*ASSERT(arrayOf);*) char := rfPointer; (*RETURN (* ARRAY OF unknown (record): do not write anything *)*)
  10463. END;
  10464. RETURN char
  10465. END BaseType;
  10466. PROCEDURE RecordType(type: SyntaxTree.RecordType);
  10467. VAR destination: Sections.Section;
  10468. BEGIN
  10469. destination := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10470. IF type.pointerType # NIL THEN
  10471. Char(section,rfRecordPointer)
  10472. ELSE
  10473. Char(section,rfRecord);
  10474. END;
  10475. IF destination = NIL THEN
  10476. Longint(section,0);
  10477. ELSE
  10478. Longint(section,destination.offset); (* used for ? *)
  10479. END;
  10480. END RecordType;
  10481. PROCEDURE StaticArrayLength(type: SyntaxTree.ArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10482. BEGIN
  10483. baseType := type.arrayBase.resolved;
  10484. IF type.form = SyntaxTree.Static THEN
  10485. IF baseType IS SyntaxTree.ArrayType THEN
  10486. RETURN type.staticLength * StaticArrayLength(baseType(SyntaxTree.ArrayType),baseType)
  10487. ELSE
  10488. RETURN type.staticLength
  10489. END
  10490. ELSE
  10491. RETURN 0
  10492. END;
  10493. END StaticArrayLength;
  10494. PROCEDURE ArrayType(type: SyntaxTree.ArrayType);
  10495. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10496. BEGIN
  10497. length := StaticArrayLength(type, baseType);
  10498. char := BaseType(baseType);
  10499. IF type.form # SyntaxTree.Open THEN
  10500. Char(section,CHR(ORD(char)+ORD(rfArrayFlag)));
  10501. Longint(section, length)
  10502. ELSE
  10503. length :=0;
  10504. (*length := 1+SemanticChecker.Dimension(type,{SyntaxTree.Open});*)
  10505. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10506. Longint(section, length)
  10507. END;
  10508. END ArrayType;
  10509. PROCEDURE StaticMathArrayLength(type: SyntaxTree.MathArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10510. BEGIN
  10511. baseType := type.arrayBase;
  10512. IF baseType # NIL THEN
  10513. baseType := baseType.resolved;
  10514. END;
  10515. IF type.form = SyntaxTree.Static THEN
  10516. IF (baseType # NIL) & (baseType IS SyntaxTree.MathArrayType) THEN
  10517. RETURN type.staticLength * StaticMathArrayLength(baseType(SyntaxTree.MathArrayType),baseType)
  10518. ELSE
  10519. RETURN type.staticLength
  10520. END
  10521. ELSE
  10522. RETURN 0
  10523. END;
  10524. END StaticMathArrayLength;
  10525. PROCEDURE MathArrayType(type: SyntaxTree.MathArrayType);
  10526. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10527. BEGIN
  10528. length := StaticMathArrayLength(type, baseType);
  10529. char := BaseType(baseType);
  10530. IF type.form = SyntaxTree.Open THEN
  10531. char := BaseType(module.system.addressType);
  10532. length := 5+2*SemanticChecker.Dimension(type,{SyntaxTree.Open});
  10533. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10534. Longint(section, length)
  10535. ELSIF type.form=SyntaxTree.Tensor THEN
  10536. char := BaseType(module.system.addressType);
  10537. Char(section, CHR(ORD(char)));
  10538. ELSE
  10539. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10540. Longint(section, length)
  10541. END;
  10542. END MathArrayType;
  10543. PROCEDURE Type(type: SyntaxTree.Type);
  10544. BEGIN
  10545. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10546. IF type IS SyntaxTree.BasicType THEN
  10547. Char(section, BaseType(type));
  10548. ELSIF type IS SyntaxTree.RecordType THEN
  10549. RecordType(type(SyntaxTree.RecordType));
  10550. ELSIF type IS SyntaxTree.ArrayType THEN
  10551. ArrayType(type(SyntaxTree.ArrayType))
  10552. ELSIF type IS SyntaxTree.EnumerationType THEN
  10553. Char(section, BaseType(module.system.longintType))
  10554. ELSIF type IS SyntaxTree.PointerType THEN
  10555. IF type(SyntaxTree.PointerType).pointerBase IS SyntaxTree.RecordType THEN
  10556. RecordType(type(SyntaxTree.PointerType).pointerBase(SyntaxTree.RecordType));
  10557. ELSE
  10558. Char(section, BaseType(type))
  10559. END;
  10560. ELSIF type IS SyntaxTree.ProcedureType THEN
  10561. Char(section, BaseType(type));
  10562. ELSIF type IS SyntaxTree.MathArrayType THEN
  10563. MathArrayType(type(SyntaxTree.MathArrayType));
  10564. ELSIF type IS SyntaxTree.CellType THEN
  10565. Char(section, BaseType(module.system.anyType));
  10566. ELSE HALT(200)
  10567. END;
  10568. END Type;
  10569. PROCEDURE WriteVariable(variable: SyntaxTree.Variable; indirect: BOOLEAN);
  10570. VAR name: ARRAY 256 OF CHAR;
  10571. BEGIN
  10572. IF variable.externalName # NIL THEN RETURN END;
  10573. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10574. variable.GetName(name);
  10575. Type(variable.type);
  10576. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10577. String(section,name);
  10578. END WriteVariable;
  10579. PROCEDURE WriteParameter(variable: SyntaxTree.Parameter; indirect: BOOLEAN);
  10580. VAR name: ARRAY 256 OF CHAR;
  10581. BEGIN
  10582. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10583. variable.GetName(name);
  10584. Type(variable.type);
  10585. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10586. variable.GetName(name);
  10587. String(section,name);
  10588. END WriteParameter;
  10589. PROCEDURE ReturnType(type: SyntaxTree.Type);
  10590. BEGIN
  10591. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10592. IF type IS SyntaxTree.ArrayType THEN
  10593. WITH type: SyntaxTree.ArrayType DO
  10594. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10595. ELSE Char(section,rfOpenArray)
  10596. END;
  10597. END
  10598. ELSIF type IS SyntaxTree.MathArrayType THEN
  10599. WITH type: SyntaxTree.MathArrayType DO
  10600. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10601. ELSE Char(section,rfOpenArray)
  10602. END;
  10603. END
  10604. ELSIF type IS SyntaxTree.RecordType THEN
  10605. Char(section,rfRecord);
  10606. ELSE
  10607. Char(section, BaseType(type));
  10608. END;
  10609. END ReturnType;
  10610. PROCEDURE Procedure(s: Sections.Section);
  10611. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10612. parameter: SyntaxTree.Parameter; variable: SyntaxTree.Variable;
  10613. name: ARRAY 256 OF CHAR;
  10614. BEGIN
  10615. procedure := s.symbol(SyntaxTree.Procedure); (*! check for variable or type symbol for object body *)
  10616. (*procedure.name,name);*)
  10617. Global.GetSymbolNameInScope(procedure,module.module.moduleScope,name);
  10618. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10619. Char(section,0F9X);
  10620. Symbol(section,s,0,0);
  10621. Symbol(section,s,s(IntermediateCode.Section).pc,0);
  10622. Longint(section,procedureType.numberParameters);
  10623. ReturnType(procedureType.returnType);
  10624. Longint(section,0); (*! level *)
  10625. Longint(section,0);
  10626. (*
  10627. IF procedure.scope IS SyntaxTree.RecordScope THEN (* add object name *)
  10628. record := procedure.scope(SyntaxTree.RecordScope).ownerRecord;
  10629. recordName := "";
  10630. IF record.pointerType # NIL THEN
  10631. DeclarationName(record.pointerType.typeDeclaration,recordName);
  10632. ELSE
  10633. DeclarationName(record.typeDeclaration,recordName);
  10634. END;
  10635. i := 0;
  10636. Info(section,recordName);
  10637. WHILE recordName[i] # 0X DO
  10638. Char(section,recordName[i]); INC(i);
  10639. INC(size);
  10640. END;
  10641. Char(section,".");
  10642. INC(size);
  10643. END;
  10644. *)
  10645. String(section,name);
  10646. parameter := procedureType.firstParameter;
  10647. WHILE(parameter # NIL) DO
  10648. WriteParameter(parameter,parameter.kind # SyntaxTree.ValueParameter); (*!treat exceptions !*)
  10649. parameter := parameter.nextParameter;
  10650. END;
  10651. variable := procedure.procedureScope.firstVariable;
  10652. WHILE(variable # NIL) DO
  10653. WriteVariable(variable,FALSE);
  10654. variable := variable.nextVariable;
  10655. END;
  10656. END Procedure;
  10657. PROCEDURE Scope(s: Sections.Section);
  10658. BEGIN
  10659. Char(section,0F8X);
  10660. Symbol(section,s,0,0); (* start *)
  10661. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  10662. String(section,"$$");
  10663. (* removed variables -- wrongly interpreted by Reflection
  10664. variable := module.module.moduleScope.firstVariable;
  10665. WHILE(variable # NIL) DO
  10666. WriteVariable(variable,FALSE);
  10667. variable := variable.nextVariable;
  10668. END;
  10669. *)
  10670. END Scope;
  10671. PROCEDURE ComputeSize(startPC, endPC: LONGINT): SIZE;
  10672. VAR result, i: LONGINT;
  10673. BEGIN
  10674. FOR i := startPC TO endPC -1 DO
  10675. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  10676. INC(result, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  10677. END;
  10678. RETURN result;
  10679. END ComputeSize;
  10680. BEGIN
  10681. Array(section,sizePC,"");
  10682. startPC := section.pc;
  10683. Char(section,0FFX); (* sign for trap writer *)
  10684. FOR i := 0 TO module.allSections.Length() - 1 DO
  10685. s := module.allSections.GetSection(i);
  10686. IF (s.type # Sections.InitCodeSection) & (s.symbol = module.module.moduleScope.bodyProcedure) THEN
  10687. Scope(s) (*! must be first procedure in ref section *)
  10688. END
  10689. END;
  10690. FOR i := 0 TO module.allSections.Length() - 1 DO
  10691. s := module.allSections.GetSection(i);
  10692. IF (s.symbol = module.module.moduleScope.bodyProcedure) THEN (* already done, see above *)
  10693. ELSIF (s.type # Sections.InitCodeSection) & (s.symbol # NIL) & (s.symbol IS SyntaxTree.Procedure) & ~s.symbol(SyntaxTree.Procedure).isInline THEN
  10694. Procedure(s)
  10695. END
  10696. END;
  10697. endPC := section.pc;
  10698. PatchArray(section,sizePC,ComputeSize(startPC, endPC));
  10699. END References;
  10700. (*
  10701. Command* = RECORD
  10702. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  10703. name*: Name; (* name of the procedure *)
  10704. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  10705. entryAdr* : ADDRESS; (* entry address of procedure *)
  10706. END;
  10707. *)
  10708. PROCEDURE CommandArray(source: IntermediateCode.Section);
  10709. VAR
  10710. p: Sections.Section; sizePC, numberCommands: LONGINT;
  10711. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10712. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  10713. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  10714. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  10715. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  10716. BEGIN
  10717. RETURN
  10718. (type = NIL) OR
  10719. (type.resolved IS SyntaxTree.RecordType) OR
  10720. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  10721. (type.resolved IS SyntaxTree.AnyType);
  10722. END TypeAllowed;
  10723. BEGIN
  10724. numberParameters := procedureType.numberParameters;
  10725. RETURN
  10726. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  10727. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  10728. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  10729. END GetProcedureAllowed;
  10730. PROCEDURE WriteType(type : SyntaxTree.Type);
  10731. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  10732. name: Basic.SegmentedName; offset: LONGINT;
  10733. BEGIN
  10734. IF type = NIL THEN
  10735. Address(source,0);
  10736. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  10737. Address(source,1);
  10738. ELSE
  10739. type := type.resolved;
  10740. IF type IS SyntaxTree.PointerType THEN
  10741. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  10742. END;
  10743. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  10744. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  10745. name[0] := typeDeclaration.name; name[1] := -1;
  10746. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10747. ASSERT(section # NIL);
  10748. ELSE
  10749. Global.GetSymbolSegmentedName(typeDeclaration,name);
  10750. (* TODO *)
  10751. section := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  10752. END;
  10753. IF implementationVisitor.backend.cooperative THEN
  10754. offset := 0;
  10755. ELSE
  10756. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  10757. END;
  10758. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  10759. END;
  10760. END WriteType;
  10761. BEGIN
  10762. Info(source, "command array descriptor");
  10763. Array(source,sizePC,"Modules.Command");
  10764. numberCommands := 0;
  10765. Info(source, "command array content");
  10766. FOR i := 0 TO module.allSections.Length() - 1 DO
  10767. p := module.allSections.GetSection(i);
  10768. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  10769. procedure := p.symbol(SyntaxTree.Procedure);
  10770. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10771. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  10772. procedure.GetName(name);
  10773. Name(source,name);
  10774. numberParameters := procedureType.numberParameters;
  10775. (* offset of type of first parameter *)
  10776. IF (numberParameters = 0 ) THEN WriteType(NIL)
  10777. ELSE WriteType(procedureType.firstParameter.type)
  10778. END;
  10779. (* offset of type of return parameter *)
  10780. WriteType(procedureType.returnType);
  10781. (* command name *)
  10782. (* command code offset *)
  10783. Symbol(source,p,0,0);
  10784. INC(numberCommands);
  10785. IF Trace THEN
  10786. D.Ln;
  10787. END;
  10788. END;
  10789. END
  10790. END;
  10791. PatchArray(source,sizePC,numberCommands);
  10792. END CommandArray;
  10793. (* to prevent from double import of different module aliases *)
  10794. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  10795. VAR i: SyntaxTree.Import;
  10796. BEGIN
  10797. i := module.module.moduleScope.firstImport;
  10798. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  10799. i := i.nextImport;
  10800. END;
  10801. RETURN i = import
  10802. END IsFirstDirectOccurence;
  10803. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  10804. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  10805. BEGIN
  10806. Array(source,pc,"");
  10807. Info(source, "import module array data");
  10808. IF implementationVisitor.backend.cooperative THEN
  10809. offset := 0;
  10810. ELSE
  10811. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  10812. END;
  10813. import := module.module.moduleScope.firstImport;
  10814. numberImports := 0;
  10815. WHILE import # NIL DO
  10816. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  10817. Global.GetModuleSegmentedName(import.module,name);
  10818. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  10819. NamedSymbol(source, name, NIL, 0, offset);
  10820. INC(numberImports);
  10821. END;
  10822. import := import.nextImport
  10823. END;
  10824. PatchArray(source,pc,numberImports);
  10825. END ImportsArray;
  10826. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  10827. VAR
  10828. p: Sections.Section; sizePC, size, i: LONGINT;
  10829. BEGIN
  10830. Info(source, "Type info section");
  10831. size := 0;
  10832. Array(source,sizePC,"Modules.TypeDesc");
  10833. FOR i := 0 TO module.allSections.Length() - 1 DO
  10834. p := module.allSections.GetSection(i);
  10835. WITH p: IntermediateCode.Section DO
  10836. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  10837. Symbol(source,p,0,0);
  10838. INC(size);
  10839. END;
  10840. END
  10841. END;
  10842. PatchArray(source,sizePC,size);
  10843. END TypeInfoSection;
  10844. (*
  10845. ProcTableEntry* = RECORD
  10846. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  10847. noPtr*: LONGINT;
  10848. END;
  10849. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  10850. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  10851. *)
  10852. PROCEDURE PointersInProcTables(procArray, pointerArray: IntermediateCode.Section; VAR procArraySize, maxPointers: LONGINT);
  10853. VAR
  10854. destination: Sections.Section;
  10855. pointerArraySizePC, procArraySizePC, pointerArraySize, i: LONGINT;
  10856. PROCEDURE PointerOffsets(destination : IntermediateCode.Section);
  10857. VAR numberPointers: LONGINT; procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10858. variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; string: Basic.SectionName;
  10859. BEGIN
  10860. Info(procArray,"pcFrom");
  10861. Symbol(procArray,destination,0,0);
  10862. Info(procArray,"pcTo");
  10863. Symbol(procArray,destination,destination.pc,0);
  10864. Info(procArray,"pcStatementBegin");
  10865. Symbol(procArray,destination,destination.validPAFEnter,0);
  10866. Info(procArray,"pcStatementEnd");
  10867. Symbol(procArray,destination,destination.validPAFExit,0);
  10868. IF ~implementationVisitor.backend.cooperative THEN
  10869. Basic.SegmentedNameToString(destination.name, string);
  10870. Info(pointerArray,string);
  10871. procedure := destination.symbol(SyntaxTree.Procedure);
  10872. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10873. variable := procedure.procedureScope.firstVariable;
  10874. WHILE(variable # NIL) DO
  10875. IF ~(variable.untraced) THEN
  10876. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, pointerArray, variable.type, numberPointers);
  10877. END;
  10878. variable := variable.nextVariable
  10879. END;
  10880. parameter := procedureType.firstParameter;
  10881. WHILE(parameter # NIL) DO
  10882. IF ~(parameter.untraced) THEN
  10883. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, pointerArray, parameter.type, numberPointers);
  10884. END;
  10885. parameter := parameter.nextParameter;
  10886. END;
  10887. END;
  10888. Info(procArray,"numberPointers");
  10889. Longint(procArray,numberPointers);
  10890. IF numberPointers > maxPointers THEN maxPointers := numberPointers END;
  10891. INC(pointerArraySize, numberPointers);
  10892. END PointerOffsets;
  10893. BEGIN
  10894. maxPointers := 0;
  10895. Info(procArray, "proc array descriptor");
  10896. Address(procArray,0);
  10897. Address(procArray,0);
  10898. Address(procArray,0);
  10899. procArraySizePC := procArray.pc;
  10900. Address(procArray,0);
  10901. procArraySize := 0;
  10902. IF ~implementationVisitor.backend.cooperative THEN
  10903. Info(pointerArray, "pointer array descriptor");
  10904. Address(pointerArray,0);
  10905. Address(pointerArray,0);
  10906. Address(pointerArray,0);
  10907. pointerArraySizePC := pointerArray.pc;
  10908. Address(pointerArray,0);
  10909. pointerArraySize := 0;
  10910. END;
  10911. procArraySize := 0;
  10912. FOR i := 0 TO module.allSections.Length() - 1 DO
  10913. destination := module.allSections.GetSection(i);
  10914. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  10915. PointerOffsets(destination(IntermediateCode.Section));
  10916. INC(procArraySize);
  10917. END
  10918. END;
  10919. PatchLongint(procArray,procArraySizePC,procArraySize);
  10920. IF ~implementationVisitor.backend.cooperative THEN
  10921. PatchLongint(pointerArray,pointerArraySizePC,pointerArraySize);
  10922. END;
  10923. END PointersInProcTables;
  10924. (*
  10925. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  10926. VAR
  10927. next*: Module; (** once a module is published, all fields are read-only *)
  10928. name*: Name;
  10929. init, published: BOOLEAN;
  10930. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  10931. sb*: ADDRESS; <- set to beginning of data section by loader
  10932. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  10933. command*: POINTER TO ARRAY OF Command;
  10934. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  10935. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  10936. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  10937. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  10938. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  10939. data*, code*: Bytes;
  10940. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  10941. export*: ExportDesc;
  10942. term*: TerminationHandler;
  10943. exTable*: ExceptionTable;
  10944. noProcs*: LONGINT;
  10945. firstProc*: ADDRESS; <- done by loader
  10946. maxPtrs*: LONGINT;
  10947. crc*: LONGINT;
  10948. *)
  10949. PROCEDURE BasePointer (section: IntermediateCode.Section);
  10950. BEGIN
  10951. Info(section, "cycle");
  10952. Size(section,0);
  10953. Info(section, "references");
  10954. Size(section,0);
  10955. Info(section, "nextMarked");
  10956. Address(section,0);
  10957. Info(section, "nextWatched");
  10958. Address(section,0);
  10959. END BasePointer;
  10960. PROCEDURE BaseObject (section: IntermediateCode.Section);
  10961. BEGIN
  10962. BasePointer(section);
  10963. Info(section, "action");
  10964. Address(section,0);
  10965. Info(section, "monitor");
  10966. Address(section,0);
  10967. END BaseObject;
  10968. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  10969. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  10970. pooledName: Basic.SegmentedName;
  10971. symbol: SyntaxTree.Symbol;
  10972. BEGIN
  10973. Global.GetModuleName(module.module,name);
  10974. Strings.Append(name,".@Module.@Descriptor");
  10975. Basic.ToSegmentedName(name, pooledName);
  10976. descriptorSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10977. Symbol(section,descriptorSection,0,0);
  10978. Info(descriptorSection, "descriptor");
  10979. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  10980. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  10981. Address(descriptorSection,0);
  10982. Global.GetModuleName(module.module,name);
  10983. Strings.Append(name,".@Trace");
  10984. Basic.ToSegmentedName(name, pooledName);
  10985. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10986. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  10987. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10988. END ModuleDescriptor;
  10989. PROCEDURE ModuleSection(): IntermediateCode.Section;
  10990. VAR name: ARRAY 128 OF CHAR;
  10991. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  10992. symbol: SyntaxTree.Symbol;
  10993. BEGIN
  10994. Global.GetModuleName(module.module,name);
  10995. Strings.Append(name,".@Module");
  10996. Basic.ToSegmentedName(name, pooledName);
  10997. moduleSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10998. moduleSection.SetExported(TRUE);
  10999. IF moduleSection.pc = 0 THEN
  11000. IF implementationVisitor.backend.cooperative THEN
  11001. Info(moduleSection, "descriptor");
  11002. ModuleDescriptor(moduleSection);
  11003. BaseObject(moduleSection);
  11004. implementationVisitor.CreateTraceModuleMethod(module.module);
  11005. ELSE
  11006. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  11007. Info(moduleSection, "HeapBlock");
  11008. Symbol(moduleSection,moduleSection,2,0);
  11009. Info(moduleSection, "TypeDescriptor");
  11010. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11011. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  11012. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  11013. END;
  11014. END;
  11015. RETURN moduleSection;
  11016. END ModuleSection;
  11017. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  11018. VAR
  11019. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  11020. typeInfoSection, procTableSection, ptrTableSection, referenceSection : IntermediateCode.Section;
  11021. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  11022. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, ptrTableSectionOffset, maxPointers, numberProcs,temp,
  11023. referenceSectionOffset : LONGINT;
  11024. BEGIN
  11025. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  11026. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  11027. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  11028. ImportsArray(importSection);
  11029. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  11030. CommandArray(commandsSection);
  11031. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  11032. ExceptionArray(exceptionSection);
  11033. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  11034. TypeInfoSection(typeInfoSection);
  11035. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  11036. References(referenceSection);
  11037. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  11038. IF ~implementationVisitor.backend.cooperative THEN
  11039. ptrTableSection := Block("Heaps","SystemBlockDesc",".@PtrTable",ptrTableSectionOffset);
  11040. ELSE
  11041. ptrTableSection := NIL;
  11042. END;
  11043. PointersInProcTables(procTableSection,ptrTableSection,numberProcs,maxPointers);
  11044. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  11045. Array(emptyArraySection,temp,"");
  11046. moduleSection := ModuleSection();
  11047. Info(moduleSection, "nextRoot*: RootObject");
  11048. Address(moduleSection,0);
  11049. Info(moduleSection, "next*: Module");
  11050. Address(moduleSection,0);
  11051. Info(moduleSection, "name*: Name");
  11052. Name(moduleSection,moduleName);
  11053. Info(moduleSection, "init, published: BOOLEAN");
  11054. Boolean(moduleSection,FALSE);
  11055. Boolean(moduleSection,FALSE);
  11056. Info(moduleSection,"filler"); (*! introduce alignment! *)
  11057. Boolean(moduleSection,FALSE);
  11058. Boolean(moduleSection,FALSE);
  11059. Info(moduleSection, "refcnt*: LONGINT");
  11060. Longint(moduleSection,0);
  11061. Info(moduleSection, "sb*: ADDRESS");
  11062. Address(moduleSection,0);
  11063. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  11064. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11065. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  11066. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  11067. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  11068. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  11069. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  11070. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  11071. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  11072. Symbol(moduleSection,importSection,emptyArraySectionOffset,0);
  11073. Info(moduleSection, "procTable*: ProcTable");
  11074. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  11075. Info(moduleSection, "ptrTable*: PtrTable");
  11076. IF ~implementationVisitor.backend.cooperative THEN
  11077. Symbol(moduleSection,ptrTableSection,ptrTableSectionOffset,0);
  11078. ELSE
  11079. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11080. END;
  11081. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  11082. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11083. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11084. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11085. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  11086. Info(moduleSection, "export*: ExportDesc");
  11087. ExportDesc(moduleSection);
  11088. Info(moduleSection, "term*: TerminationHandler");
  11089. Address(moduleSection,0);
  11090. Info(moduleSection, "exTable*: ExceptionTable");
  11091. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  11092. Info(moduleSection, "noProcs*: LONGINT");
  11093. Longint(moduleSection,numberProcs);
  11094. Info(moduleSection, "firstProc*: ADDRESS");
  11095. Address(moduleSection,0);
  11096. Info(moduleSection, "maxPtrs*: LONGINT");
  11097. Longint(moduleSection,maxPointers);
  11098. Info(moduleSection, "crc*: LONGINT");
  11099. Longint(moduleSection, 0); (*! must be implemented *)
  11100. Info(moduleSection, "body*: ADDRESS");
  11101. Symbol(moduleSection, bodyProc, 0,0);
  11102. IF implementationVisitor.backend.cooperative THEN
  11103. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  11104. Info(moduleSection, "monitor.owner");
  11105. Address(moduleSection,0);
  11106. Info(moduleSection, "monitor.nestingLevel");
  11107. Address(moduleSection,0);
  11108. Info(moduleSection, "monitor.blockedQueue");
  11109. Address(moduleSection,0); Address(moduleSection,0);
  11110. Info(moduleSection, "monitor.waitingQueue");
  11111. Address(moduleSection,0); Address(moduleSection,0);
  11112. Info(moduleSection, "monitor.waitingSentinel");
  11113. Address(moduleSection,0);
  11114. END;
  11115. END Module;
  11116. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  11117. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section;
  11118. BEGIN
  11119. Array(source,pc,"");
  11120. Info(source, "pointer offsets array data");
  11121. IF scope IS SyntaxTree.RecordScope THEN
  11122. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  11123. ELSIF scope IS SyntaxTree.CellScope THEN
  11124. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  11125. ELSIF scope IS SyntaxTree.ModuleScope THEN
  11126. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  11127. WHILE variable # NIL DO
  11128. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  11129. symbol := module.allSections.FindBySymbol(variable);
  11130. ASSERT(symbol # NIL);
  11131. Pointers(0,symbol, source,variable.type,numberPointers);
  11132. END;
  11133. variable := variable.nextVariable;
  11134. END;
  11135. END;
  11136. PatchArray(source,pc,numberPointers);
  11137. END PointerArray;
  11138. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  11139. VAR
  11140. name: Basic.SegmentedName;
  11141. section: IntermediateCode.Section;
  11142. BEGIN
  11143. ASSERT(implementationVisitor.newObjectFile);
  11144. Global.GetSymbolSegmentedName(symbol,name);
  11145. Basic.AppendToSegmentedName(name,suffix);
  11146. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11147. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  11148. Info(section, "HeapBlock");
  11149. Address(section,0); (* empty such that GC does not go on traversing *)
  11150. Info(section, suffix);
  11151. Address(section,0);
  11152. pc := section.pc;
  11153. RETURN section;
  11154. END SymbolSection;
  11155. PROCEDURE ReflectVariables(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11156. VAR type: SyntaxTree.Type; variable: SyntaxTree.Variable; pc: LONGINT; section: IntermediateCode.Section;
  11157. BEGIN
  11158. ASSERT(implementationVisitor.newObjectFile);
  11159. IF ~ReflectionSupport OR simple THEN variable := NIL
  11160. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11161. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11162. IF type IS SyntaxTree.PointerType THEN
  11163. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11164. END;
  11165. IF type IS SyntaxTree.RecordType THEN
  11166. variable := type(SyntaxTree.RecordType).recordScope.firstVariable
  11167. ELSIF type IS SyntaxTree.CellType THEN
  11168. variable := type(SyntaxTree.CellType).cellScope.firstVariable;
  11169. END;
  11170. ELSIF symbol IS SyntaxTree.Procedure THEN
  11171. variable := symbol(SyntaxTree.Procedure).procedureScope.firstVariable;
  11172. END;
  11173. Info(in, "variables");
  11174. IF variable # NIL THEN
  11175. section := SymbolSection(symbol, "@Variables",pc);
  11176. VariableArray(section, variable);
  11177. Symbol(in, section, pc, 0);
  11178. ELSE
  11179. Address(in, 0);
  11180. END;
  11181. END ReflectVariables;
  11182. PROCEDURE ReflectProcedures(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11183. VAR type: SyntaxTree.Type; procedure: SyntaxTree.Procedure; pc: LONGINT; section: IntermediateCode.Section;
  11184. BEGIN
  11185. ASSERT(implementationVisitor.newObjectFile);
  11186. IF ~ReflectionSupport OR simple THEN procedure := NIL
  11187. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11188. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11189. IF type IS SyntaxTree.PointerType THEN
  11190. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11191. END;
  11192. IF type IS SyntaxTree.RecordType THEN
  11193. procedure := type(SyntaxTree.RecordType).recordScope.firstProcedure
  11194. ELSIF type IS SyntaxTree.CellType THEN
  11195. procedure := type(SyntaxTree.CellType).cellScope.firstProcedure;
  11196. END;
  11197. ELSIF symbol IS SyntaxTree.Procedure THEN
  11198. procedure := symbol(SyntaxTree.Procedure).procedureScope.firstProcedure;
  11199. END;
  11200. Info(in, "procedures");
  11201. IF procedure # NIL THEN
  11202. section := SymbolSection(symbol, "@Procedures",pc);
  11203. ProcedureArray(section, procedure);
  11204. Symbol(in, section, pc, 0);
  11205. ELSE
  11206. Address(in, 0);
  11207. END;
  11208. END ReflectProcedures;
  11209. PROCEDURE VariableArray(source: IntermediateCode.Section; variable: SyntaxTree.Variable);
  11210. VAR pc, offset: LONGINT; tir: Sections.Section; size: LONGINT;
  11211. segmentedName: Basic.SegmentedName;
  11212. td: SyntaxTree.TypeDeclaration;
  11213. type: SyntaxTree.Type;
  11214. BEGIN
  11215. Array(source,pc,"Modules.FieldEntry");
  11216. Info(source, "FieldArray");
  11217. size :=0;
  11218. WHILE variable # NIL DO
  11219. Info(source,"name");
  11220. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, variable.name, moduleNamePool), 0); (* reference to dynamic name *)
  11221. type := variable.type.resolved;
  11222. Info(source,"offset");
  11223. Size(source, ToMemoryUnits(module.system,variable.offsetInBits));
  11224. Info(source,"type class");
  11225. IF type IS SyntaxTree.PointerType THEN
  11226. Size(source, 1);
  11227. ELSIF type IS SyntaxTree.RecordType THEN
  11228. Size(source, 2);
  11229. ELSIF type IS SyntaxTree.NumberType THEN
  11230. Size(source, 3);
  11231. ELSE
  11232. Size(source, 0);
  11233. END;
  11234. Info(source, "type desc");
  11235. IF type IS SyntaxTree.RecordType THEN
  11236. td := type(SyntaxTree.RecordType).typeDeclaration;
  11237. Global.GetSymbolSegmentedName(td,segmentedName);
  11238. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11239. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11240. ELSE
  11241. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11242. END;
  11243. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11244. Symbol(source, tir, 0, offset);
  11245. ELSE
  11246. Address(source, 0);
  11247. END;
  11248. Info(source,"flags");
  11249. Set(source, {});
  11250. variable := variable.nextVariable;
  11251. INC(size);
  11252. END;
  11253. PatchArray(source,pc,size);
  11254. END VariableArray;
  11255. PROCEDURE ProcedureArray(source: IntermediateCode.Section; procedure: SyntaxTree.Procedure);
  11256. VAR pc: LONGINT; size: LONGINT;
  11257. segmentedName: Basic.SegmentedName;
  11258. BEGIN
  11259. Array(source,pc,"Modules.ProcedureEntry");
  11260. Info(source, "ProcedureArray");
  11261. size :=0;
  11262. WHILE procedure # NIL DO
  11263. Info(source,"name");
  11264. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, procedure.name, moduleNamePool), 0); (* reference to dynamic name *)
  11265. Global.GetSymbolSegmentedName(procedure, segmentedName);
  11266. NamedSymbol(source, segmentedName, procedure, 0 , 0);
  11267. (* size *)
  11268. Size(source, 0);
  11269. (* parameters *)
  11270. Address(source, 0);
  11271. (* variables *)
  11272. ReflectVariables(source, procedure);
  11273. ReflectProcedures(source, procedure);
  11274. (* return type entry *)
  11275. Address(source, 0);
  11276. Address(source, 0);
  11277. procedure := procedure.nextProcedure;
  11278. INC(size);
  11279. END;
  11280. PatchArray(source,pc,size);
  11281. END ProcedureArray;
  11282. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  11283. VAR recordType: SyntaxTree.RecordType;
  11284. tir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  11285. section: Sections.Section; cellType: SyntaxTree.CellType;
  11286. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): Sections.Section;
  11287. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11288. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11289. sectionName: Basic.SectionName;
  11290. CONST MPO=-40000000H;
  11291. BEGIN
  11292. (*
  11293. TypeDesc* = POINTER TO RECORD
  11294. descSize: LONGINT;
  11295. sentinel: LONGINT; (* = MPO-4 *)
  11296. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11297. flags*: SET;
  11298. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11299. name*: Name;
  11300. END;
  11301. *)
  11302. (* source := module.sections.FindByName(...) *)
  11303. Global.GetSymbolSegmentedName(td,name);
  11304. Basic.AppendToSegmentedName(name,"@Info");
  11305. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11306. Info(source, "type info size"); Address(source, 3*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11307. Address(source,MPO-4);
  11308. Info(source, "type tag pointer");
  11309. Symbol( source, tag, offset, 0);
  11310. Info(source, "type flags");
  11311. flags := {};
  11312. IF isProtected THEN INCL(flags,31) END;
  11313. Set( source, flags);
  11314. Info(source, "pointer to module");
  11315. moduleSection := ModuleSection();
  11316. Symbol( source, moduleSection, moduleSection.pc,0);
  11317. Info(source, "type name");
  11318. i := 0;
  11319. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  11320. (*
  11321. Global.GetSymbolSegmentedName(td,name);
  11322. Basic.SegmentedNameToString(name, sectionName);
  11323. *)
  11324. Name(source,sectionName);
  11325. source.SetReferenced(FALSE);
  11326. Global.GetSymbolSegmentedName(td,name);
  11327. Basic.AppendToSegmentedName(name,"@Fields");
  11328. ReflectVariables(source, td);
  11329. ReflectProcedures(source, td);
  11330. (*
  11331. fieldSection := VariableArray(
  11332. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11333. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11334. Info(fieldSection, "HeapBlock");
  11335. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11336. Info(fieldSection, "TypeDescriptor");
  11337. Address(fieldSection,0);
  11338. Info(source, "FieldArray ref");
  11339. Symbol(source, fieldSection, fieldSection.pc, 0);
  11340. FieldArray(fieldSection);
  11341. Global.GetSymbolSegmentedName(td,name);
  11342. Basic.AppendToSegmentedName(name,"@Procedures");
  11343. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11344. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11345. Info(fieldSection, "HeapBlock");
  11346. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11347. Info(fieldSection, "TypeDescriptor");
  11348. Address(fieldSection,0);
  11349. Info(source, "Procedure Array ref");
  11350. Symbol(source, fieldSection, fieldSection.pc, 0);
  11351. ProcedureArray(fieldSection);
  11352. *)
  11353. RETURN source;
  11354. END NewTypeDescriptorInfo;
  11355. PROCEDURE NewTypeDescriptor;
  11356. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  11357. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  11358. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  11359. numberPointers: LONGINT; padding, i: LONGINT;
  11360. CONST MPO=-40000000H;
  11361. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  11362. VAR i: LONGINT;
  11363. PROCEDURE Td(record: SyntaxTree.RecordType);
  11364. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  11365. BEGIN
  11366. IF record # NIL THEN
  11367. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  11368. baseTD := record.typeDeclaration;
  11369. Global.GetSymbolSegmentedName(baseTD,name);
  11370. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11371. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11372. ELSE
  11373. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11374. END;
  11375. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  11376. Symbol(source, tir, 0, offset);
  11377. IF reverse THEN Td(record.GetBaseRecord()) END;
  11378. END;
  11379. END Td;
  11380. BEGIN
  11381. Info(source, "tag table");
  11382. baseRecord := recordType;
  11383. i := 0;
  11384. WHILE baseRecord # NIL DO
  11385. INC(i);
  11386. baseRecord := baseRecord.GetBaseRecord();
  11387. END;
  11388. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  11389. IF ~reverse THEN Td(recordType) END;
  11390. WHILE i < size DO
  11391. Address(source,0);
  11392. INC(i);
  11393. END;
  11394. IF reverse THEN Td(recordType) END;
  11395. END TdTable;
  11396. PROCEDURE MethodTable(reverse: BOOLEAN);
  11397. VAR i,methods: LONGINT;
  11398. BEGIN
  11399. Info(source, "method table");
  11400. IF recordType # NIL THEN
  11401. methods := recordType.recordScope.numberMethods;
  11402. IF reverse THEN
  11403. FOR i := methods-1 TO 0 BY -1 DO
  11404. procedure := recordType.recordScope.FindMethod(i);
  11405. Global.GetSymbolSegmentedName(procedure, name);
  11406. NamedSymbol(source, name,procedure, 0,0);
  11407. END;
  11408. ELSE
  11409. FOR i := 0 TO methods-1 DO
  11410. procedure := recordType.recordScope.FindMethod(i);
  11411. Global.GetSymbolSegmentedName(procedure, name);
  11412. NamedSymbol(source, name,procedure, 0,0);
  11413. END;
  11414. END;
  11415. END;
  11416. END MethodTable;
  11417. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  11418. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  11419. BEGIN
  11420. Info(source, "method table");
  11421. baseRecord := recordType;
  11422. WHILE baseRecord.baseType # NIL DO
  11423. baseRecord := baseRecord.GetBaseRecord ();
  11424. END;
  11425. GetRecordTypeName (baseRecord, name);
  11426. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  11427. IF name = stackFrame THEN
  11428. start := 0;
  11429. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  11430. baseRecord := recordType;
  11431. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  11432. baseRecord := baseRecord.GetBaseRecord ();
  11433. END;
  11434. IF baseRecord # NIL THEN
  11435. GetRecordTypeName (baseRecord, name);
  11436. IF pointer & ~baseRecord.isObject THEN
  11437. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11438. END;
  11439. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  11440. ELSIF recordType.isObject THEN
  11441. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  11442. ELSIF pointer THEN
  11443. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  11444. ELSE
  11445. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  11446. END;
  11447. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11448. Symbol(source, tir, 0, 0);
  11449. start := 0;
  11450. baseRecord := recordType;
  11451. WHILE (baseRecord # NIL) DO
  11452. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  11453. baseRecord := baseRecord.GetBaseRecord ();
  11454. END;
  11455. ELSE
  11456. (* explicit trace method: *)
  11457. procedure := recordType.recordScope.FindMethod(0);
  11458. IF ~procedure.isFinalizer THEN
  11459. Global.GetSymbolSegmentedName(procedure, name);
  11460. NamedSymbol(source, name,procedure, 0,0);
  11461. END;
  11462. start := 1;
  11463. END;
  11464. IF (name # stackFrame) & recordType.isObject THEN
  11465. baseRecord := recordType;
  11466. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  11467. baseRecord := baseRecord.GetBaseRecord ();
  11468. END;
  11469. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  11470. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  11471. ELSE
  11472. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  11473. END;
  11474. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11475. Symbol(source, tir, 0, 0);
  11476. END;
  11477. methods := recordType.recordScope.numberMethods;
  11478. FOR i := start TO methods-1 DO
  11479. procedure := recordType.recordScope.FindMethod(i);
  11480. IF ~procedure.isFinalizer THEN
  11481. Global.GetSymbolSegmentedName(procedure, name);
  11482. NamedSymbol(source, name,procedure, 0,0);
  11483. END;
  11484. END;
  11485. END CooperativeMethodTable;
  11486. BEGIN
  11487. Global.GetSymbolSegmentedName(td,name);
  11488. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  11489. source.SetExported(IsExported(td));
  11490. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  11491. IF implementationVisitor.backend.cooperative THEN
  11492. base := NIL;
  11493. baseRecord := recordType.GetBaseRecord();
  11494. IF baseRecord # NIL THEN
  11495. baseTD := baseRecord.typeDeclaration;
  11496. END;
  11497. IF ~recordType.isObject THEN
  11498. Info(source, "parent");
  11499. IF baseRecord # NIL THEN
  11500. Global.GetSymbolSegmentedName(baseTD,name);
  11501. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11502. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11503. ELSE
  11504. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11505. END;
  11506. Symbol(source, tir, 0, 0);
  11507. ELSE
  11508. Address(source,0);
  11509. END;
  11510. Info(source, "record size");
  11511. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11512. source.SetReferenced(FALSE);
  11513. CooperativeMethodTable(FALSE);
  11514. base := source;
  11515. Global.GetSymbolSegmentedName(td,name);
  11516. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11517. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11518. source.SetExported(IsExported(td));
  11519. source.SetReferenced(FALSE);
  11520. END;
  11521. Info(source, "parent");
  11522. IF baseRecord # NIL THEN
  11523. Global.GetSymbolSegmentedName(baseTD,name);
  11524. sym := baseTD;
  11525. IF ~recordType.isObject THEN
  11526. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11527. sym := NIL;
  11528. END;
  11529. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11530. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11531. ELSE
  11532. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11533. END;
  11534. Symbol(source, tir, 0, 0);
  11535. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  11536. Address(source,0);
  11537. ELSE
  11538. IF recordType.isObject THEN
  11539. Basic.ToSegmentedName ("BaseTypes.Object",name);
  11540. ELSE
  11541. Basic.ToSegmentedName ("BaseTypes.Record",name);
  11542. END;
  11543. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11544. Symbol(source, tir, 0, 0);
  11545. END;
  11546. Info(source, "base record descriptor");
  11547. Symbol(source, base, 0, 0);
  11548. CooperativeMethodTable(TRUE);
  11549. source.SetReferenced(FALSE);
  11550. IF recordType.hasPointers THEN
  11551. IF ~HasExplicitTraceMethod (recordType) THEN
  11552. implementationVisitor.CreateTraceMethod(recordType);
  11553. END;
  11554. implementationVisitor.CreateResetProcedure(recordType);
  11555. implementationVisitor.CreateAssignProcedure(recordType);
  11556. END;
  11557. ELSIF ~simple THEN
  11558. (*
  11559. MethodEnd = MPO
  11560. ---
  11561. methods (# methods)
  11562. ---
  11563. tags (16)
  11564. ---
  11565. TypeDesc = TypeInfoAdr
  11566. ---
  11567. td adr ---> rec size
  11568. ----
  11569. pointer offsets
  11570. ----
  11571. (padding)
  11572. -----
  11573. empty [2 addresses aligned]
  11574. empty
  11575. empty
  11576. numPtrs
  11577. ---
  11578. pointer offsets
  11579. ---
  11580. *)
  11581. Info(source, "MethodEnd = MPO");
  11582. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  11583. source(IntermediateCode.Section).Emit(Data(-1,op));
  11584. MethodTable(TRUE);
  11585. TdTable(TypeTags, TRUE);
  11586. Info(source, "type descriptor info pointer");
  11587. Symbol(source, NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected()),0,0);
  11588. IF (cellType # NIL) THEN
  11589. IF cellType.sizeInBits < 0 THEN
  11590. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  11591. END;
  11592. Info(source, "cell size");
  11593. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  11594. ELSE
  11595. Info(source, "record size");
  11596. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11597. END;
  11598. Info(source, "pointer offsets pointer");
  11599. padding := 1- source.pc MOD 2;
  11600. Symbol(source, source, source.pc+1+padding,0);
  11601. IF padding >0 THEN
  11602. Info(source, "padding");
  11603. FOR i := 1 TO padding DO Address(source,0) END;
  11604. END;
  11605. IF cellType # NIL THEN
  11606. PointerArray(source, cellType.cellScope, numberPointers);
  11607. ELSE
  11608. PointerArray(source, recordType.recordScope, numberPointers);
  11609. END;
  11610. ELSE
  11611. (*
  11612. simple:
  11613. td adr --> size
  11614. tag(1)
  11615. tag(2)
  11616. tag(3)
  11617. methods ->
  11618. *)
  11619. Info(source, "record size");
  11620. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11621. TdTable(TypeTags, FALSE);
  11622. MethodTable(FALSE);
  11623. source.SetReferenced(FALSE);
  11624. END;
  11625. END NewTypeDescriptor;
  11626. BEGIN
  11627. x := x.resolved;
  11628. IF (x IS SyntaxTree.PointerType) THEN
  11629. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  11630. END;
  11631. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  11632. recordType := x(SyntaxTree.RecordType);
  11633. td := x.typeDeclaration;
  11634. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  11635. ASSERT(td # NIL);
  11636. section := module.allSections.FindBySymbol(td); (* TODO *)
  11637. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11638. IF implementationVisitor.newObjectFile THEN
  11639. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11640. NewTypeDescriptor
  11641. END;
  11642. ELSE
  11643. (* data section in intermediate code *)
  11644. Global.GetSymbolSegmentedName(td,name);
  11645. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  11646. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  11647. tir.Emit(Data(-1,op));
  11648. END;
  11649. END;
  11650. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  11651. cellType := x(SyntaxTree.CellType);
  11652. td := x.typeDeclaration;
  11653. section := module.allSections.FindBySymbol(td); (* TODO *)
  11654. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11655. IF implementationVisitor.newObjectFile THEN
  11656. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11657. NewTypeDescriptor
  11658. END;
  11659. END;
  11660. END;
  11661. END
  11662. END CheckTypeDeclaration
  11663. END MetaDataGenerator;
  11664. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  11665. VAR
  11666. trace-: BOOLEAN;
  11667. traceString-: SyntaxTree.IdentifierString;
  11668. traceModuleName-: SyntaxTree.IdentifierString;
  11669. newObjectFile-: BOOLEAN;
  11670. profile-: BOOLEAN;
  11671. noRuntimeChecks: BOOLEAN;
  11672. simpleMetaData-: BOOLEAN;
  11673. noAsserts: BOOLEAN;
  11674. optimize-: BOOLEAN;
  11675. cooperative-: BOOLEAN;
  11676. preregisterStatic-: BOOLEAN;
  11677. dump-: Basic.Writer;
  11678. cellsAreObjects: BOOLEAN;
  11679. PROCEDURE &InitIntermediateBackend*;
  11680. BEGIN
  11681. simpleMetaData := FALSE;
  11682. newObjectFile := FALSE;
  11683. InitBackend;
  11684. SetRuntimeModuleName(DefaultRuntimeModuleName);
  11685. SetTraceModuleName(DefaultTraceModuleName);
  11686. END InitIntermediateBackend;
  11687. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  11688. VAR
  11689. declarationVisitor: DeclarationVisitor;
  11690. implementationVisitor: ImplementationVisitor;
  11691. module: Sections.Module;
  11692. name, platformName: SyntaxTree.IdentifierString;
  11693. meta: MetaDataGenerator;
  11694. BEGIN
  11695. ResetError;
  11696. Global.GetSymbolName(x,name);
  11697. NEW(module,x,system); (* backend structures *)
  11698. Global.GetModuleName(x, name);
  11699. module.SetModuleName(name);
  11700. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  11701. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  11702. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  11703. declarationVisitor.Module(x,module);
  11704. IF newObjectFile & ~meta.simple THEN
  11705. meta.Module(implementationVisitor.moduleBodySection);
  11706. END;
  11707. GetDescription(platformName);
  11708. module.SetPlatformName(platformName);
  11709. RETURN module
  11710. END GenerateIntermediate;
  11711. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  11712. BEGIN RETURN TRUE
  11713. END SupportedImmediate;
  11714. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  11715. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  11716. END ProcessSyntaxTreeModule;
  11717. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  11718. VAR
  11719. result: Sections.Module;
  11720. traceName: Basic.MessageString;
  11721. BEGIN
  11722. ASSERT(intermediateCodeModule IS Sections.Module);
  11723. result := intermediateCodeModule(Sections.Module);
  11724. IF trace THEN
  11725. traceName := "intermediate code trace: ";
  11726. Strings.Append(traceName,traceString);
  11727. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  11728. IF (traceString="") OR (traceString="*") THEN
  11729. result.Dump(dump);
  11730. dump.Update
  11731. ELSE
  11732. Sections.DumpFiltered(dump, result, traceString);
  11733. END
  11734. END;
  11735. RETURN result
  11736. END ProcessIntermediateCodeModule;
  11737. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  11738. BEGIN instructionSet := "Intermediate";
  11739. END GetDescription;
  11740. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  11741. BEGIN
  11742. SELF.newObjectFile := newObjectFile;
  11743. SELF.simpleMetaData := simpleMetaData;
  11744. END SetNewObjectFile;
  11745. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  11746. BEGIN COPY(name, traceModuleName)
  11747. END SetTraceModuleName;
  11748. PROCEDURE DefineOptions(options: Options.Options);
  11749. BEGIN
  11750. DefineOptions^(options);
  11751. options.Add(0X,"trace",Options.String);
  11752. options.Add(0X,"runtime",Options.String);
  11753. options.Add(0X,"newObjectFile",Options.Flag);
  11754. options.Add(0X,"traceModule",Options.String);
  11755. options.Add(0X,"profile",Options.Flag);
  11756. options.Add(0X,"noRuntimeChecks",Options.Flag);
  11757. options.Add(0X,"noAsserts",Options.Flag);
  11758. options.Add(0X,"metaData",Options.String);
  11759. options.Add('o',"optimize", Options.Flag);
  11760. options.Add(0X,"preregisterStatic", Options.Flag);
  11761. options.Add(0X,"cellsAreObjects", Options.Flag);
  11762. END DefineOptions;
  11763. PROCEDURE GetOptions(options: Options.Options);
  11764. VAR name,string: SyntaxTree.IdentifierString;
  11765. BEGIN
  11766. GetOptions^(options);
  11767. trace := options.GetString("trace",traceString);
  11768. profile := options.GetFlag("profile");
  11769. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  11770. noAsserts := options.GetFlag("noAsserts");
  11771. cooperative := options.GetFlag("cooperative");
  11772. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  11773. IF cooperative THEN
  11774. SetRuntimeModuleName("CPU") END
  11775. END;
  11776. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  11777. simpleMetaData := TRUE
  11778. END;
  11779. IF options.GetString("metaData",string) THEN
  11780. IF string = "simple" THEN simpleMetaData := TRUE
  11781. ELSIF string ="full" THEN simpleMetaData := FALSE
  11782. END;
  11783. END;
  11784. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  11785. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  11786. optimize := options.GetFlag("optimize");
  11787. preregisterStatic := options.GetFlag("preregisterStatic");
  11788. cellsAreObjects := options.GetFlag("cellsAreObjects");
  11789. END GetOptions;
  11790. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  11791. BEGIN RETURN SymbolFileFormat.Get()
  11792. END DefaultSymbolFileFormat;
  11793. END IntermediateBackend;
  11794. (* ----------------------------------- register allocation ------------------------------------- *)
  11795. (* register mapping scheme
  11796. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  11797. spill offset
  11798. part(n) --> ticket <--> physical register
  11799. spill offset
  11800. *)
  11801. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  11802. emptyOperand: IntermediateCode.Operand;
  11803. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  11804. statCoopResetVariables: LONGINT;
  11805. statCoopModifyAssignments: LONGINT;
  11806. modifyAssignmentsPC : LONGINT;
  11807. statCoopNilCheck: LONGINT;
  11808. statCoopSwitch: LONGINT;
  11809. statCoopAssignProcedure: LONGINT;
  11810. statCoopTraceMethod: LONGINT;
  11811. statCoopResetProcedure: LONGINT;
  11812. statCoopTraceModule: LONGINT;
  11813. PROCEDURE ResetStatistics*;
  11814. BEGIN
  11815. statCoopResetVariables := 0;
  11816. statCoopModifyAssignments := 0;
  11817. statCoopNilCheck:= 0;
  11818. statCoopSwitch:= 0;
  11819. statCoopAssignProcedure:= 0;
  11820. statCoopTraceMethod:= 0;
  11821. statCoopResetProcedure:= 0;
  11822. statCoopTraceModule:= 0;
  11823. END ResetStatistics;
  11824. PROCEDURE Statistics*;
  11825. BEGIN
  11826. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  11827. TRACE(statCoopNilCheck, statCoopSwitch);
  11828. TRACE(statCoopAssignProcedure,
  11829. statCoopTraceMethod,
  11830. statCoopResetProcedure,
  11831. statCoopTraceModule)
  11832. END Statistics;
  11833. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  11834. VAR h: LONGINT;
  11835. BEGIN
  11836. WHILE b # 0 DO
  11837. h := a MOD b;
  11838. a := b;
  11839. b := h;
  11840. END;
  11841. RETURN a
  11842. END GCD;
  11843. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  11844. BEGIN
  11845. RETURN a*b DIV GCD(a,b)
  11846. END SCM;
  11847. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  11848. BEGIN
  11849. (*TRACE(a,b);*)
  11850. IF a = 0 THEN RETURN b
  11851. ELSIF b = 0 THEN RETURN a
  11852. ELSE RETURN SCM(a,b)
  11853. END;
  11854. END CommonAlignment;
  11855. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  11856. BEGIN
  11857. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  11858. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11859. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (parameter.ownerType(SyntaxTree.ProcedureType).callingConvention = SyntaxTree.CCallingConvention)
  11860. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  11861. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (parameter.ownerType(SyntaxTree.ProcedureType).callingConvention = SyntaxTree.CCallingConvention)
  11862. END
  11863. END PassBySingleReference;
  11864. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  11865. BEGIN
  11866. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  11867. END PassInRegister;
  11868. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  11869. VAR new: RegisterEntry;
  11870. BEGIN
  11871. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  11872. IF queue = NIL THEN
  11873. queue := new
  11874. ELSE
  11875. new.next := queue;
  11876. IF queue#NIL THEN queue.prev := new END;
  11877. queue := new
  11878. END;
  11879. END AddRegisterEntry;
  11880. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  11881. VAR this: RegisterEntry;
  11882. BEGIN
  11883. this := queue;
  11884. WHILE (this # NIL) & (this.register # register) DO
  11885. this := this.next;
  11886. END;
  11887. IF this = NIL THEN
  11888. RETURN FALSE
  11889. END;
  11890. ASSERT(this # NIL);
  11891. IF this = queue THEN queue := queue.next END;
  11892. IF this.prev # NIL THEN this.prev.next := this.next END;
  11893. IF this.next # NIL THEN this.next.prev := this.prev END;
  11894. RETURN TRUE
  11895. END RemoveRegisterEntry;
  11896. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  11897. BEGIN ASSERT(cond);
  11898. END Assert;
  11899. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  11900. BEGIN
  11901. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  11902. END ReusableRegister;
  11903. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  11904. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  11905. BEGIN
  11906. procedure := moduleScope.bodyProcedure;
  11907. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  11908. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  11909. procedure := SyntaxTree.NewProcedure(-1,Global.ModuleBodyName, procedureScope);
  11910. procedure.SetScope(moduleScope);
  11911. procedure.SetType(SyntaxTree.NewProcedureType(-1,moduleScope));
  11912. procedure.SetAccess(SyntaxTree.Hidden);
  11913. moduleScope.SetBodyProcedure(procedure);
  11914. moduleScope.AddProcedure(procedure);
  11915. procedureScope.SetBody(SyntaxTree.NewBody(-1,procedureScope)); (* empty body *)
  11916. END;
  11917. END EnsureBodyProcedure;
  11918. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  11919. VAR import: SyntaxTree.Import;
  11920. selfName: SyntaxTree.IdentifierString;
  11921. module: SyntaxTree.Module;
  11922. BEGIN
  11923. scope.ownerModule.GetName(selfName);
  11924. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  11925. module := scope.ownerModule
  11926. ELSE
  11927. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  11928. IF import = NIL THEN
  11929. RETURN NIL
  11930. ELSIF import.module = NIL THEN
  11931. RETURN NIL
  11932. ELSE module := import.module
  11933. END;
  11934. END;
  11935. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  11936. END GetSymbol;
  11937. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  11938. BEGIN
  11939. op.mode := mode;
  11940. IntermediateCode.InitOperand(op.op);
  11941. IntermediateCode.InitOperand(op.tag);
  11942. IntermediateCode.InitOperand(op.extra);
  11943. op.dimOffset := 0;
  11944. END InitOperand;
  11945. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  11946. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  11947. BEGIN RETURN IntermediateCode.GetType(system, type)
  11948. END GetType;
  11949. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  11950. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  11951. BEGIN
  11952. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  11953. (*
  11954. UniqueId(name,module,name,adr);
  11955. *)
  11956. constant := SyntaxTree.NewConstant(-1,SyntaxTree.NewIdentifier(name));
  11957. constant.SetValue(value);
  11958. module.moduleScope.AddConstant(constant);
  11959. constant.SetScope(module.moduleScope);
  11960. RETURN constant
  11961. END BuildConstant;
  11962. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11963. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  11964. BEGIN
  11965. variable := scope.firstVariable;
  11966. WHILE variable # NIL DO
  11967. IF variable.NeedsTrace() THEN
  11968. RETURN TRUE;
  11969. END;
  11970. variable := variable.nextVariable;
  11971. END;
  11972. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11973. WHILE parameter # NIL DO
  11974. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  11975. RETURN TRUE;
  11976. END;
  11977. parameter := parameter.nextParameter;
  11978. END;
  11979. RETURN FALSE;
  11980. END HasPointers;
  11981. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  11982. BEGIN RETURN (parameter.kind = SyntaxTree.VarParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ((parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType));
  11983. END IsVariableParameter;
  11984. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11985. VAR parameter: SyntaxTree.Parameter;
  11986. BEGIN
  11987. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11988. WHILE parameter # NIL DO
  11989. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  11990. IF parameter.movable THEN RETURN TRUE END;
  11991. parameter := parameter.nextParameter;
  11992. END;
  11993. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  11994. END HasVariableParameters;
  11995. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  11996. BEGIN
  11997. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  11998. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  11999. END HasExplicitTraceMethod;
  12000. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12001. BEGIN
  12002. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12003. IF (expression IS SyntaxTree.IntegerValue) THEN
  12004. val := expression(SyntaxTree.IntegerValue).value;
  12005. RETURN TRUE
  12006. ELSE
  12007. RETURN FALSE
  12008. END;
  12009. END IsIntegerConstant;
  12010. PROCEDURE PowerOf2(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12011. BEGIN
  12012. IF val <= 0 THEN RETURN FALSE END;
  12013. exp := 0;
  12014. WHILE ~ODD(val) DO
  12015. val := val DIV 2;
  12016. INC(exp)
  12017. END;
  12018. RETURN val = 1
  12019. END PowerOf2;
  12020. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12021. VAR procedure: SyntaxTree.Procedure;
  12022. BEGIN
  12023. procedure := record.recordScope.constructor;
  12024. IF procedure = NIL THEN
  12025. record := record.GetBaseRecord();
  12026. IF record # NIL THEN
  12027. procedure := GetConstructor(record)
  12028. END;
  12029. END;
  12030. RETURN procedure;
  12031. END GetConstructor;
  12032. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12033. BEGIN
  12034. value := SHORT(op.intValue);
  12035. RETURN op.mode = IntermediateCode.ModeImmediate;
  12036. END IsIntegerImmediate;
  12037. (** whether a type strictily is a pointer to record or object type
  12038. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12039. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12040. BEGIN
  12041. IF type = NIL THEN
  12042. RETURN FALSE
  12043. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  12044. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  12045. ELSE
  12046. RETURN FALSE
  12047. END
  12048. END IsStrictlyPointerToRecord;
  12049. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  12050. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  12051. END IsUnsafePointer;
  12052. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  12053. BEGIN type := type.resolved;
  12054. IF type IS SyntaxTree.PointerType THEN
  12055. type := type(SyntaxTree.PointerType).pointerBase;
  12056. type := type.resolved;
  12057. IF type IS SyntaxTree.RecordType THEN
  12058. recordType := type(SyntaxTree.RecordType);
  12059. RETURN TRUE
  12060. ELSE
  12061. RETURN FALSE
  12062. END
  12063. ELSIF type IS SyntaxTree.RecordType THEN
  12064. recordType := type(SyntaxTree.RecordType);
  12065. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  12066. ELSIF type IS SyntaxTree.ObjectType THEN
  12067. RETURN TRUE
  12068. ELSIF type IS SyntaxTree.AnyType THEN
  12069. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  12070. ELSE
  12071. RETURN FALSE
  12072. END;
  12073. END IsPointerToRecord;
  12074. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  12075. BEGIN
  12076. type := type.resolved;
  12077. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  12078. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  12079. END IsArrayOfSystemByte;
  12080. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  12081. BEGIN
  12082. IF type = NIL THEN RETURN FALSE END;
  12083. type := type.resolved;
  12084. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  12085. END IsOpenArray;
  12086. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  12087. BEGIN
  12088. IF type = NIL THEN RETURN FALSE END;
  12089. type := type.resolved;
  12090. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  12091. END IsSemiDynamicArray;
  12092. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  12093. BEGIN
  12094. IF type = NIL THEN RETURN FALSE END;
  12095. type := type.resolved;
  12096. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  12097. END IsStaticArray;
  12098. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12099. VAR size: LONGINT;
  12100. BEGIN
  12101. size := 1;
  12102. WHILE (IsStaticArray(type)) DO
  12103. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  12104. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12105. END;
  12106. RETURN size;
  12107. END StaticArrayNumElements;
  12108. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12109. BEGIN
  12110. WHILE (IsStaticArray(type)) DO
  12111. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12112. END;
  12113. RETURN type;
  12114. END StaticArrayBaseType;
  12115. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12116. BEGIN
  12117. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  12118. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12119. END;
  12120. RETURN type;
  12121. END ArrayBaseType;
  12122. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  12123. BEGIN
  12124. IF type = NIL THEN RETURN FALSE END;
  12125. type := type.resolved;
  12126. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  12127. END IsDelegate;
  12128. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  12129. VAR i: LONGINT;
  12130. BEGIN
  12131. i := 0; type := type.resolved;
  12132. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12133. INC(i);
  12134. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  12135. END;
  12136. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12137. INC(i);
  12138. type := type(SyntaxTree.MathArrayType).arrayBase;
  12139. IF type # NIL THEN type := type.resolved END;
  12140. END;
  12141. RETURN i
  12142. END DynamicDim;
  12143. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  12144. BEGIN
  12145. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12146. type := type(SyntaxTree.ArrayType).arrayBase;
  12147. END;
  12148. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12149. type := type(SyntaxTree.MathArrayType).arrayBase;
  12150. END;
  12151. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  12152. END StaticSize;
  12153. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  12154. BEGIN
  12155. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  12156. END IsImmediate;
  12157. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  12158. BEGIN
  12159. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  12160. END IsAddress;
  12161. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  12162. BEGIN
  12163. RETURN (x.mode = IntermediateCode.ModeRegister);
  12164. END IsRegister;
  12165. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  12166. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  12167. BEGIN
  12168. typeDeclaration := recordType.typeDeclaration;
  12169. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12170. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12171. END GetRecordTypeName;
  12172. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  12173. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  12174. BEGIN
  12175. parSize := 0;
  12176. IF StructuredReturnType(procedureType) THEN
  12177. parameter := procedureType.returnParameter;
  12178. INC(parSize,system.SizeOfParameter(parameter));
  12179. parSize := parSize + (-parSize) MOD system.addressSize;
  12180. END;
  12181. parameter :=procedureType.lastParameter;
  12182. WHILE (parameter # NIL) DO
  12183. INC(parSize,system.SizeOfParameter(parameter));
  12184. parSize := parSize + (-parSize) MOD system.addressSize;
  12185. parameter := parameter.prevParameter;
  12186. END;
  12187. IF procedureType.isDelegate THEN INC(parSize,system.addressSize) END; (* method => self pointer *)
  12188. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  12189. RETURN ToMemoryUnits(system,parSize)
  12190. END ParametersSize;
  12191. PROCEDURE ReturnedAsParameter(type: SyntaxTree.Type): BOOLEAN;
  12192. BEGIN
  12193. IF type = NIL THEN RETURN FALSE
  12194. ELSE
  12195. type := type.resolved;
  12196. RETURN (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR (type IS SyntaxTree.ProcedureType) OR SemanticChecker.IsPointerType(type)
  12197. OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.MathArrayType);
  12198. END
  12199. END ReturnedAsParameter;
  12200. PROCEDURE StructuredReturnType(procedureType: SyntaxTree.ProcedureType): BOOLEAN;
  12201. BEGIN
  12202. RETURN (procedureType # NIL) & (procedureType.callingConvention=SyntaxTree.OberonCallingConvention) & ReturnedAsParameter(procedureType.returnType);
  12203. END StructuredReturnType;
  12204. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  12205. BEGIN
  12206. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  12207. END IsNested;
  12208. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  12209. BEGIN
  12210. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  12211. scope := scope.outerScope;
  12212. END;
  12213. RETURN scope # NIL;
  12214. END InCellScope;
  12215. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  12216. BEGIN
  12217. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  12218. RETURN 0
  12219. ELSE
  12220. *)
  12221. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  12222. (*END;*)
  12223. END ProcedureParametersSize;
  12224. PROCEDURE ToMemoryUnits*(system: Global.System; size: LONGINT): LONGINT;
  12225. VAR dataUnit: LONGINT;
  12226. BEGIN dataUnit := system.dataUnit;
  12227. ASSERT(size MOD system.dataUnit = 0);
  12228. RETURN size DIV system.dataUnit
  12229. END ToMemoryUnits;
  12230. PROCEDURE Get*(): Backend.Backend;
  12231. VAR backend: IntermediateBackend;
  12232. BEGIN NEW(backend); RETURN backend
  12233. END Get;
  12234. PROCEDURE Nop(position: LONGINT):IntermediateCode.Instruction;
  12235. VAR instruction: IntermediateCode.Instruction;
  12236. BEGIN
  12237. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  12238. RETURN instruction
  12239. END Nop;
  12240. PROCEDURE Mov(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12241. VAR instruction: IntermediateCode.Instruction;
  12242. BEGIN
  12243. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  12244. RETURN instruction
  12245. END Mov;
  12246. (* like Mov but ensures that no new register will be allocated for dest *)
  12247. PROCEDURE MovReplace(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12248. VAR instruction: IntermediateCode.Instruction;
  12249. BEGIN
  12250. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  12251. RETURN instruction
  12252. END MovReplace;
  12253. PROCEDURE Conv(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12254. VAR instruction: IntermediateCode.Instruction;
  12255. BEGIN
  12256. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  12257. RETURN instruction
  12258. END Conv;
  12259. PROCEDURE Call*(position: LONGINT;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  12260. VAR instruction: IntermediateCode.Instruction;
  12261. BEGIN
  12262. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  12263. RETURN instruction
  12264. END Call;
  12265. PROCEDURE Exit(position: LONGINT;pcOffset: LONGINT; callingConvention: LONGINT): IntermediateCode.Instruction;
  12266. VAR op1, op2: IntermediateCode.Operand;
  12267. VAR instruction: IntermediateCode.Instruction;
  12268. BEGIN
  12269. IntermediateCode.InitNumber(op1,pcOffset);
  12270. IntermediateCode.InitNumber(op2,callingConvention);
  12271. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,emptyOperand);
  12272. RETURN instruction
  12273. END Exit;
  12274. PROCEDURE Return(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12275. VAR instruction: IntermediateCode.Instruction;
  12276. BEGIN
  12277. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  12278. RETURN instruction
  12279. END Return;
  12280. PROCEDURE Result*(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12281. VAR instruction: IntermediateCode.Instruction;
  12282. BEGIN
  12283. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  12284. RETURN instruction
  12285. END Result;
  12286. PROCEDURE Trap(position: LONGINT;nr: LONGINT): IntermediateCode.Instruction;
  12287. VAR op1: IntermediateCode.Operand;
  12288. VAR instruction: IntermediateCode.Instruction;
  12289. BEGIN
  12290. IntermediateCode.InitNumber(op1,nr);
  12291. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  12292. RETURN instruction
  12293. END Trap;
  12294. PROCEDURE Br(position: LONGINT;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  12295. VAR instruction: IntermediateCode.Instruction;
  12296. BEGIN
  12297. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  12298. RETURN instruction
  12299. END Br;
  12300. PROCEDURE Breq(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12301. VAR instruction: IntermediateCode.Instruction;
  12302. BEGIN
  12303. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  12304. RETURN instruction
  12305. END Breq;
  12306. PROCEDURE Brne(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12307. VAR instruction: IntermediateCode.Instruction;
  12308. BEGIN
  12309. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  12310. RETURN instruction
  12311. END Brne;
  12312. PROCEDURE Brge(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12313. VAR instruction: IntermediateCode.Instruction;
  12314. BEGIN
  12315. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  12316. RETURN instruction
  12317. END Brge;
  12318. PROCEDURE Brlt(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12319. VAR instruction: IntermediateCode.Instruction;
  12320. BEGIN
  12321. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  12322. RETURN instruction
  12323. END Brlt;
  12324. PROCEDURE Pop*(position: LONGINT;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  12325. VAR instruction: IntermediateCode.Instruction;
  12326. BEGIN
  12327. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  12328. RETURN instruction
  12329. END Pop;
  12330. PROCEDURE Push*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12331. VAR instruction: IntermediateCode.Instruction;
  12332. BEGIN
  12333. ASSERT(op.mode # IntermediateCode.Undefined);
  12334. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  12335. RETURN instruction
  12336. END Push;
  12337. PROCEDURE Neg(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12338. VAR instruction: IntermediateCode.Instruction;
  12339. BEGIN
  12340. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  12341. RETURN instruction
  12342. END Neg;
  12343. PROCEDURE Not(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12344. VAR instruction: IntermediateCode.Instruction;
  12345. BEGIN
  12346. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  12347. RETURN instruction
  12348. END Not;
  12349. PROCEDURE Abs(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12350. VAR instruction: IntermediateCode.Instruction;
  12351. BEGIN
  12352. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  12353. RETURN instruction
  12354. END Abs;
  12355. PROCEDURE Mul(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12356. VAR instruction: IntermediateCode.Instruction;
  12357. BEGIN
  12358. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  12359. RETURN instruction
  12360. END Mul;
  12361. PROCEDURE Div(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12362. VAR instruction: IntermediateCode.Instruction;
  12363. BEGIN
  12364. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  12365. RETURN instruction
  12366. END Div;
  12367. PROCEDURE Mod(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12368. VAR instruction: IntermediateCode.Instruction;
  12369. BEGIN
  12370. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  12371. RETURN instruction
  12372. END Mod;
  12373. PROCEDURE Sub(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12374. VAR instruction: IntermediateCode.Instruction;
  12375. BEGIN
  12376. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  12377. RETURN instruction
  12378. END Sub;
  12379. PROCEDURE Add(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12380. VAR instruction: IntermediateCode.Instruction;
  12381. BEGIN
  12382. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  12383. RETURN instruction
  12384. END Add;
  12385. PROCEDURE And(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12386. VAR instruction: IntermediateCode.Instruction;
  12387. BEGIN
  12388. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  12389. RETURN instruction
  12390. END And;
  12391. PROCEDURE Or(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12392. VAR instruction: IntermediateCode.Instruction;
  12393. BEGIN
  12394. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  12395. RETURN instruction
  12396. END Or;
  12397. PROCEDURE Xor(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12398. VAR instruction: IntermediateCode.Instruction;
  12399. BEGIN
  12400. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  12401. RETURN instruction
  12402. END Xor;
  12403. PROCEDURE Shl(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12404. VAR instruction: IntermediateCode.Instruction;
  12405. BEGIN
  12406. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  12407. RETURN instruction
  12408. END Shl;
  12409. PROCEDURE Shr(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12410. VAR instruction: IntermediateCode.Instruction;
  12411. BEGIN
  12412. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  12413. RETURN instruction
  12414. END Shr;
  12415. PROCEDURE Rol(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12416. VAR instruction: IntermediateCode.Instruction;
  12417. BEGIN
  12418. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  12419. RETURN instruction
  12420. END Rol;
  12421. PROCEDURE Ror(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12422. VAR instruction: IntermediateCode.Instruction;
  12423. BEGIN
  12424. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  12425. RETURN instruction
  12426. END Ror;
  12427. PROCEDURE Cas(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12428. VAR instruction: IntermediateCode.Instruction;
  12429. BEGIN
  12430. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  12431. RETURN instruction
  12432. END Cas;
  12433. PROCEDURE Copy(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12434. VAR instruction: IntermediateCode.Instruction;
  12435. BEGIN
  12436. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  12437. RETURN instruction
  12438. END Copy;
  12439. PROCEDURE Fill(position: LONGINT;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  12440. VAR instruction: IntermediateCode.Instruction;
  12441. BEGIN
  12442. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  12443. RETURN instruction
  12444. END Fill;
  12445. PROCEDURE Asm(position: LONGINT;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  12446. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  12447. BEGIN
  12448. string := IntermediateCode.String(s);
  12449. IntermediateCode.SetIntValue(string,position); (* for error reporting *)
  12450. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  12451. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  12452. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  12453. RETURN instruction
  12454. END Asm;
  12455. PROCEDURE Data*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12456. VAR instruction: IntermediateCode.Instruction;
  12457. BEGIN
  12458. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  12459. RETURN instruction
  12460. END Data;
  12461. PROCEDURE SpecialInstruction(position: LONGINT;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  12462. VAR instruction: IntermediateCode.Instruction;
  12463. BEGIN
  12464. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  12465. IntermediateCode.SetSubType(instruction, subtype);
  12466. RETURN instruction
  12467. END SpecialInstruction;
  12468. PROCEDURE Reserve(position: LONGINT;units: LONGINT): IntermediateCode.Instruction;
  12469. VAR op1: IntermediateCode.Operand;
  12470. VAR instruction: IntermediateCode.Instruction;
  12471. BEGIN
  12472. (*! generate a warning if size exceeds a certain limit *)
  12473. (*
  12474. ASSERT(bytes < 1000000); (* sanity check *)
  12475. *)
  12476. ASSERT(0 <= units); (* sanity check *)
  12477. IntermediateCode.InitNumber(op1,units);
  12478. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  12479. RETURN instruction
  12480. END Reserve;
  12481. PROCEDURE LabelInstruction(position: LONGINT): IntermediateCode.Instruction;
  12482. VAR op1: IntermediateCode.Operand;
  12483. VAR instruction: IntermediateCode.Instruction;
  12484. BEGIN
  12485. IntermediateCode.InitNumber(op1,position);
  12486. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  12487. RETURN instruction
  12488. END LabelInstruction;
  12489. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  12490. VAR pc: LONGINT;
  12491. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  12492. BEGIN
  12493. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  12494. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  12495. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  12496. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  12497. IF instr.op1.type.form = IntermediateCode.Float THEN
  12498. RETURN instr.op1.floatValue = op.floatValue
  12499. ELSE
  12500. RETURN instr.op1.intValue = op.intValue
  12501. END;
  12502. END ProvidesValue;
  12503. BEGIN
  12504. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  12505. pc := 0;
  12506. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  12507. INC(pc);
  12508. END;
  12509. IF pc = data.pc THEN
  12510. data.Emit(Data(-1,vop));
  12511. END;
  12512. RETURN pc
  12513. END EnterImmediate;
  12514. PROCEDURE Init;
  12515. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  12516. BEGIN
  12517. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  12518. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  12519. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  12520. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  12521. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  12522. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  12523. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  12524. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  12525. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  12526. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  12527. IntermediateCode.InitOperand(emptyOperand);
  12528. FOR i := 0 TO NumberSystemCalls-1 DO
  12529. name := "@SystemCall";
  12530. Basic.AppendNumber(name,i);
  12531. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  12532. END;
  12533. END Init;
  12534. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  12535. BEGIN
  12536. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  12537. END IsExported;
  12538. BEGIN
  12539. Init;
  12540. END FoxIntermediateBackend.
  12541. Compiler.Compile FoxIntermediateBackend.Mod ~