FoxIntermediateBackend.Mod 542 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200620162026203620462056206620762086209621062116212621362146215621662176218621962206221622262236224622562266227622862296230623162326233623462356236623762386239624062416242624362446245624662476248624962506251625262536254625562566257625862596260626162626263626462656266626762686269627062716272627362746275627662776278627962806281628262836284628562866287628862896290629162926293629462956296629762986299630063016302630363046305630663076308630963106311631263136314631563166317631863196320632163226323632463256326632763286329633063316332633363346335633663376338633963406341634263436344634563466347634863496350635163526353635463556356635763586359636063616362636363646365636663676368636963706371637263736374637563766377637863796380638163826383638463856386638763886389639063916392639363946395639663976398639964006401640264036404640564066407640864096410641164126413641464156416641764186419642064216422642364246425642664276428642964306431643264336434643564366437643864396440644164426443644464456446644764486449645064516452645364546455645664576458645964606461646264636464646564666467646864696470647164726473647464756476647764786479648064816482648364846485648664876488648964906491649264936494649564966497649864996500650165026503650465056506650765086509651065116512651365146515651665176518651965206521652265236524652565266527652865296530653165326533653465356536653765386539654065416542654365446545654665476548654965506551655265536554655565566557655865596560656165626563656465656566656765686569657065716572657365746575657665776578657965806581658265836584658565866587658865896590659165926593659465956596659765986599660066016602660366046605660666076608660966106611661266136614661566166617661866196620662166226623662466256626662766286629663066316632663366346635663666376638663966406641664266436644664566466647664866496650665166526653665466556656665766586659666066616662666366646665666666676668666966706671667266736674667566766677667866796680668166826683668466856686668766886689669066916692669366946695669666976698669967006701670267036704670567066707670867096710671167126713671467156716671767186719672067216722672367246725672667276728672967306731673267336734673567366737673867396740674167426743674467456746674767486749675067516752675367546755675667576758675967606761676267636764676567666767676867696770677167726773677467756776677767786779678067816782678367846785678667876788678967906791679267936794679567966797679867996800680168026803680468056806680768086809681068116812681368146815681668176818681968206821682268236824682568266827682868296830683168326833683468356836683768386839684068416842684368446845684668476848684968506851685268536854685568566857685868596860686168626863686468656866686768686869687068716872687368746875687668776878687968806881688268836884688568866887688868896890689168926893689468956896689768986899690069016902690369046905690669076908690969106911691269136914691569166917691869196920692169226923692469256926692769286929693069316932693369346935693669376938693969406941694269436944694569466947694869496950695169526953695469556956695769586959696069616962696369646965696669676968696969706971697269736974697569766977697869796980698169826983698469856986698769886989699069916992699369946995699669976998699970007001700270037004700570067007700870097010701170127013701470157016701770187019702070217022702370247025702670277028702970307031703270337034703570367037703870397040704170427043704470457046704770487049705070517052705370547055705670577058705970607061706270637064706570667067706870697070707170727073707470757076707770787079708070817082708370847085708670877088708970907091709270937094709570967097709870997100710171027103710471057106710771087109711071117112711371147115711671177118711971207121712271237124712571267127712871297130713171327133713471357136713771387139714071417142714371447145714671477148714971507151715271537154715571567157715871597160716171627163716471657166716771687169717071717172717371747175717671777178717971807181718271837184718571867187718871897190719171927193719471957196719771987199720072017202720372047205720672077208720972107211721272137214721572167217721872197220722172227223722472257226722772287229723072317232723372347235723672377238723972407241724272437244724572467247724872497250725172527253725472557256725772587259726072617262726372647265726672677268726972707271727272737274727572767277727872797280728172827283728472857286728772887289729072917292729372947295729672977298729973007301730273037304730573067307730873097310731173127313731473157316731773187319732073217322732373247325732673277328732973307331733273337334733573367337733873397340734173427343734473457346734773487349735073517352735373547355735673577358735973607361736273637364736573667367736873697370737173727373737473757376737773787379738073817382738373847385738673877388738973907391739273937394739573967397739873997400740174027403740474057406740774087409741074117412741374147415741674177418741974207421742274237424742574267427742874297430743174327433743474357436743774387439744074417442744374447445744674477448744974507451745274537454745574567457745874597460746174627463746474657466746774687469747074717472747374747475747674777478747974807481748274837484748574867487748874897490749174927493749474957496749774987499750075017502750375047505750675077508750975107511751275137514751575167517751875197520752175227523752475257526752775287529753075317532753375347535753675377538753975407541754275437544754575467547754875497550755175527553755475557556755775587559756075617562756375647565756675677568756975707571757275737574757575767577757875797580758175827583758475857586758775887589759075917592759375947595759675977598759976007601760276037604760576067607760876097610761176127613761476157616761776187619762076217622762376247625762676277628762976307631763276337634763576367637763876397640764176427643764476457646764776487649765076517652765376547655765676577658765976607661766276637664766576667667766876697670767176727673767476757676767776787679768076817682768376847685768676877688768976907691769276937694769576967697769876997700770177027703770477057706770777087709771077117712771377147715771677177718771977207721772277237724772577267727772877297730773177327733773477357736773777387739774077417742774377447745774677477748774977507751775277537754775577567757775877597760776177627763776477657766776777687769777077717772777377747775777677777778777977807781778277837784778577867787778877897790779177927793779477957796779777987799780078017802780378047805780678077808780978107811781278137814781578167817781878197820782178227823782478257826782778287829783078317832783378347835783678377838783978407841784278437844784578467847784878497850785178527853785478557856785778587859786078617862786378647865786678677868786978707871787278737874787578767877787878797880788178827883788478857886788778887889789078917892789378947895789678977898789979007901790279037904790579067907790879097910791179127913791479157916791779187919792079217922792379247925792679277928792979307931793279337934793579367937793879397940794179427943794479457946794779487949795079517952795379547955795679577958795979607961796279637964796579667967796879697970797179727973797479757976797779787979798079817982798379847985798679877988798979907991799279937994799579967997799879998000800180028003800480058006800780088009801080118012801380148015801680178018801980208021802280238024802580268027802880298030803180328033803480358036803780388039804080418042804380448045804680478048804980508051805280538054805580568057805880598060806180628063806480658066806780688069807080718072807380748075807680778078807980808081808280838084808580868087808880898090809180928093809480958096809780988099810081018102810381048105810681078108810981108111811281138114811581168117811881198120812181228123812481258126812781288129813081318132813381348135813681378138813981408141814281438144814581468147814881498150815181528153815481558156815781588159816081618162816381648165816681678168816981708171817281738174817581768177817881798180818181828183818481858186818781888189819081918192819381948195819681978198819982008201820282038204820582068207820882098210821182128213821482158216821782188219822082218222822382248225822682278228822982308231823282338234823582368237823882398240824182428243824482458246824782488249825082518252825382548255825682578258825982608261826282638264826582668267826882698270827182728273827482758276827782788279828082818282828382848285828682878288828982908291829282938294829582968297829882998300830183028303830483058306830783088309831083118312831383148315831683178318831983208321832283238324832583268327832883298330833183328333833483358336833783388339834083418342834383448345834683478348834983508351835283538354835583568357835883598360836183628363836483658366836783688369837083718372837383748375837683778378837983808381838283838384838583868387838883898390839183928393839483958396839783988399840084018402840384048405840684078408840984108411841284138414841584168417841884198420842184228423842484258426842784288429843084318432843384348435843684378438843984408441844284438444844584468447844884498450845184528453845484558456845784588459846084618462846384648465846684678468846984708471847284738474847584768477847884798480848184828483848484858486848784888489849084918492849384948495849684978498849985008501850285038504850585068507850885098510851185128513851485158516851785188519852085218522852385248525852685278528852985308531853285338534853585368537853885398540854185428543854485458546854785488549855085518552855385548555855685578558855985608561856285638564856585668567856885698570857185728573857485758576857785788579858085818582858385848585858685878588858985908591859285938594859585968597859885998600860186028603860486058606860786088609861086118612861386148615861686178618861986208621862286238624862586268627862886298630863186328633863486358636863786388639864086418642864386448645864686478648864986508651865286538654865586568657865886598660866186628663866486658666866786688669867086718672867386748675867686778678867986808681868286838684868586868687868886898690869186928693869486958696869786988699870087018702870387048705870687078708870987108711871287138714871587168717871887198720872187228723872487258726872787288729873087318732873387348735873687378738873987408741874287438744874587468747874887498750875187528753875487558756875787588759876087618762876387648765876687678768876987708771877287738774877587768777877887798780878187828783878487858786878787888789879087918792879387948795879687978798879988008801880288038804880588068807880888098810881188128813881488158816881788188819882088218822882388248825882688278828882988308831883288338834883588368837883888398840884188428843884488458846884788488849885088518852885388548855885688578858885988608861886288638864886588668867886888698870887188728873887488758876887788788879888088818882888388848885888688878888888988908891889288938894889588968897889888998900890189028903890489058906890789088909891089118912891389148915891689178918891989208921892289238924892589268927892889298930893189328933893489358936893789388939894089418942894389448945894689478948894989508951895289538954895589568957895889598960896189628963896489658966896789688969897089718972897389748975897689778978897989808981898289838984898589868987898889898990899189928993899489958996899789988999900090019002900390049005900690079008900990109011901290139014901590169017901890199020902190229023902490259026902790289029903090319032903390349035903690379038903990409041904290439044904590469047904890499050905190529053905490559056905790589059906090619062906390649065906690679068906990709071907290739074907590769077907890799080908190829083908490859086908790889089909090919092909390949095909690979098909991009101910291039104910591069107910891099110911191129113911491159116911791189119912091219122912391249125912691279128912991309131913291339134913591369137913891399140914191429143914491459146914791489149915091519152915391549155915691579158915991609161916291639164916591669167916891699170917191729173917491759176917791789179918091819182918391849185918691879188918991909191919291939194919591969197919891999200920192029203920492059206920792089209921092119212921392149215921692179218921992209221922292239224922592269227922892299230923192329233923492359236923792389239924092419242924392449245924692479248924992509251925292539254925592569257925892599260926192629263926492659266926792689269927092719272927392749275927692779278927992809281928292839284928592869287928892899290929192929293929492959296929792989299930093019302930393049305930693079308930993109311931293139314931593169317931893199320932193229323932493259326932793289329933093319332933393349335933693379338933993409341934293439344934593469347934893499350935193529353935493559356935793589359936093619362936393649365936693679368936993709371937293739374937593769377937893799380938193829383938493859386938793889389939093919392939393949395939693979398939994009401940294039404940594069407940894099410941194129413941494159416941794189419942094219422942394249425942694279428942994309431943294339434943594369437943894399440944194429443944494459446944794489449945094519452945394549455945694579458945994609461946294639464946594669467946894699470947194729473947494759476947794789479948094819482948394849485948694879488948994909491949294939494949594969497949894999500950195029503950495059506950795089509951095119512951395149515951695179518951995209521952295239524952595269527952895299530953195329533953495359536953795389539954095419542954395449545954695479548954995509551955295539554955595569557955895599560956195629563956495659566956795689569957095719572957395749575957695779578957995809581958295839584958595869587958895899590959195929593959495959596959795989599960096019602960396049605960696079608960996109611961296139614961596169617961896199620962196229623962496259626962796289629963096319632963396349635963696379638963996409641964296439644964596469647964896499650965196529653965496559656965796589659966096619662966396649665966696679668966996709671967296739674967596769677967896799680968196829683968496859686968796889689969096919692969396949695969696979698969997009701970297039704970597069707970897099710971197129713971497159716971797189719972097219722972397249725972697279728972997309731973297339734973597369737973897399740974197429743974497459746974797489749975097519752975397549755975697579758975997609761976297639764976597669767976897699770977197729773977497759776977797789779978097819782978397849785978697879788978997909791979297939794979597969797979897999800980198029803980498059806980798089809981098119812981398149815981698179818981998209821982298239824982598269827982898299830983198329833983498359836983798389839984098419842984398449845984698479848984998509851985298539854985598569857985898599860986198629863986498659866986798689869987098719872987398749875987698779878987998809881988298839884988598869887988898899890989198929893989498959896989798989899990099019902990399049905990699079908990999109911991299139914991599169917991899199920992199229923992499259926992799289929993099319932993399349935993699379938993999409941994299439944994599469947994899499950995199529953995499559956995799589959996099619962996399649965996699679968996999709971997299739974997599769977997899799980998199829983998499859986998799889989999099919992999399949995999699979998999910000100011000210003100041000510006100071000810009100101001110012100131001410015100161001710018100191002010021100221002310024100251002610027100281002910030100311003210033100341003510036100371003810039100401004110042100431004410045100461004710048100491005010051100521005310054100551005610057100581005910060100611006210063100641006510066100671006810069100701007110072100731007410075100761007710078100791008010081100821008310084100851008610087100881008910090100911009210093100941009510096100971009810099101001010110102101031010410105101061010710108101091011010111101121011310114101151011610117101181011910120101211012210123101241012510126101271012810129101301013110132101331013410135101361013710138101391014010141101421014310144101451014610147101481014910150101511015210153101541015510156101571015810159101601016110162101631016410165101661016710168101691017010171101721017310174101751017610177101781017910180101811018210183101841018510186101871018810189101901019110192101931019410195101961019710198101991020010201102021020310204102051020610207102081020910210102111021210213102141021510216102171021810219102201022110222102231022410225102261022710228102291023010231102321023310234102351023610237102381023910240102411024210243102441024510246102471024810249102501025110252102531025410255102561025710258102591026010261102621026310264102651026610267102681026910270102711027210273102741027510276102771027810279102801028110282102831028410285102861028710288102891029010291102921029310294102951029610297102981029910300103011030210303103041030510306103071030810309103101031110312103131031410315103161031710318103191032010321103221032310324103251032610327103281032910330103311033210333103341033510336103371033810339103401034110342103431034410345103461034710348103491035010351103521035310354103551035610357103581035910360103611036210363103641036510366103671036810369103701037110372103731037410375103761037710378103791038010381103821038310384103851038610387103881038910390103911039210393103941039510396103971039810399104001040110402104031040410405104061040710408104091041010411104121041310414104151041610417104181041910420104211042210423104241042510426104271042810429104301043110432104331043410435104361043710438104391044010441104421044310444104451044610447104481044910450104511045210453104541045510456104571045810459104601046110462104631046410465104661046710468104691047010471104721047310474104751047610477104781047910480104811048210483104841048510486104871048810489104901049110492104931049410495104961049710498104991050010501105021050310504105051050610507105081050910510105111051210513105141051510516105171051810519105201052110522105231052410525105261052710528105291053010531105321053310534105351053610537105381053910540105411054210543105441054510546105471054810549105501055110552105531055410555105561055710558105591056010561105621056310564105651056610567105681056910570105711057210573105741057510576105771057810579105801058110582105831058410585105861058710588105891059010591105921059310594105951059610597105981059910600106011060210603106041060510606106071060810609106101061110612106131061410615106161061710618106191062010621106221062310624106251062610627106281062910630106311063210633106341063510636106371063810639106401064110642106431064410645106461064710648106491065010651106521065310654106551065610657106581065910660106611066210663106641066510666106671066810669106701067110672106731067410675106761067710678106791068010681106821068310684106851068610687106881068910690106911069210693106941069510696106971069810699107001070110702107031070410705107061070710708107091071010711107121071310714107151071610717107181071910720107211072210723107241072510726107271072810729107301073110732107331073410735107361073710738107391074010741107421074310744107451074610747107481074910750107511075210753107541075510756107571075810759107601076110762107631076410765107661076710768107691077010771107721077310774107751077610777107781077910780107811078210783107841078510786107871078810789107901079110792107931079410795107961079710798107991080010801108021080310804108051080610807108081080910810108111081210813108141081510816108171081810819108201082110822108231082410825108261082710828108291083010831108321083310834108351083610837108381083910840108411084210843108441084510846108471084810849108501085110852108531085410855108561085710858108591086010861108621086310864108651086610867108681086910870108711087210873108741087510876108771087810879108801088110882108831088410885108861088710888108891089010891108921089310894108951089610897108981089910900109011090210903109041090510906109071090810909109101091110912109131091410915109161091710918109191092010921109221092310924109251092610927109281092910930109311093210933109341093510936109371093810939109401094110942109431094410945109461094710948109491095010951109521095310954109551095610957109581095910960109611096210963109641096510966109671096810969109701097110972109731097410975109761097710978109791098010981109821098310984109851098610987109881098910990109911099210993109941099510996109971099810999110001100111002110031100411005110061100711008110091101011011110121101311014110151101611017110181101911020110211102211023110241102511026110271102811029110301103111032110331103411035110361103711038110391104011041110421104311044110451104611047110481104911050110511105211053110541105511056110571105811059110601106111062110631106411065110661106711068110691107011071110721107311074110751107611077110781107911080110811108211083110841108511086110871108811089110901109111092110931109411095110961109711098110991110011101111021110311104111051110611107111081110911110111111111211113111141111511116111171111811119111201112111122111231112411125111261112711128111291113011131111321113311134111351113611137111381113911140111411114211143111441114511146111471114811149111501115111152111531115411155111561115711158111591116011161111621116311164111651116611167111681116911170111711117211173111741117511176111771117811179111801118111182111831118411185111861118711188111891119011191111921119311194111951119611197111981119911200112011120211203112041120511206112071120811209112101121111212112131121411215112161121711218112191122011221112221122311224112251122611227112281122911230112311123211233112341123511236112371123811239112401124111242112431124411245112461124711248112491125011251112521125311254112551125611257112581125911260112611126211263112641126511266112671126811269112701127111272112731127411275112761127711278112791128011281112821128311284112851128611287112881128911290112911129211293112941129511296112971129811299113001130111302113031130411305113061130711308113091131011311113121131311314113151131611317113181131911320113211132211323113241132511326113271132811329113301133111332113331133411335113361133711338113391134011341113421134311344113451134611347113481134911350113511135211353113541135511356113571135811359113601136111362113631136411365113661136711368113691137011371113721137311374113751137611377113781137911380113811138211383113841138511386113871138811389113901139111392113931139411395113961139711398113991140011401114021140311404114051140611407114081140911410114111141211413114141141511416114171141811419114201142111422114231142411425114261142711428114291143011431114321143311434114351143611437114381143911440114411144211443114441144511446114471144811449114501145111452114531145411455114561145711458114591146011461114621146311464114651146611467114681146911470114711147211473114741147511476114771147811479114801148111482114831148411485114861148711488114891149011491114921149311494114951149611497114981149911500115011150211503115041150511506115071150811509115101151111512115131151411515115161151711518115191152011521115221152311524115251152611527115281152911530115311153211533115341153511536115371153811539115401154111542115431154411545115461154711548115491155011551115521155311554115551155611557115581155911560115611156211563115641156511566115671156811569115701157111572115731157411575115761157711578115791158011581115821158311584115851158611587115881158911590115911159211593115941159511596115971159811599116001160111602116031160411605116061160711608116091161011611116121161311614116151161611617116181161911620116211162211623116241162511626116271162811629116301163111632116331163411635116361163711638116391164011641116421164311644116451164611647116481164911650116511165211653116541165511656116571165811659116601166111662116631166411665116661166711668116691167011671116721167311674116751167611677116781167911680116811168211683116841168511686116871168811689116901169111692116931169411695116961169711698116991170011701117021170311704117051170611707117081170911710117111171211713117141171511716117171171811719117201172111722117231172411725117261172711728117291173011731117321173311734117351173611737117381173911740117411174211743117441174511746117471174811749117501175111752117531175411755117561175711758117591176011761117621176311764117651176611767117681176911770117711177211773117741177511776117771177811779117801178111782117831178411785117861178711788117891179011791117921179311794117951179611797117981179911800118011180211803118041180511806118071180811809118101181111812118131181411815118161181711818118191182011821118221182311824118251182611827118281182911830118311183211833118341183511836118371183811839118401184111842118431184411845118461184711848118491185011851118521185311854118551185611857118581185911860118611186211863118641186511866118671186811869118701187111872118731187411875118761187711878118791188011881118821188311884118851188611887118881188911890118911189211893118941189511896118971189811899119001190111902119031190411905119061190711908119091191011911119121191311914119151191611917119181191911920119211192211923119241192511926119271192811929119301193111932119331193411935119361193711938119391194011941119421194311944119451194611947119481194911950119511195211953119541195511956119571195811959119601196111962119631196411965119661196711968119691197011971119721197311974119751197611977119781197911980119811198211983119841198511986119871198811989119901199111992119931199411995119961199711998119991200012001120021200312004120051200612007120081200912010120111201212013120141201512016120171201812019120201202112022120231202412025120261202712028120291203012031120321203312034120351203612037120381203912040120411204212043120441204512046120471204812049120501205112052120531205412055120561205712058120591206012061120621206312064120651206612067120681206912070120711207212073120741207512076120771207812079120801208112082120831208412085120861208712088120891209012091120921209312094120951209612097120981209912100121011210212103121041210512106121071210812109121101211112112121131211412115121161211712118121191212012121121221212312124121251212612127121281212912130121311213212133121341213512136121371213812139121401214112142121431214412145121461214712148121491215012151121521215312154121551215612157121581215912160121611216212163121641216512166121671216812169121701217112172121731217412175121761217712178121791218012181121821218312184121851218612187121881218912190121911219212193121941219512196121971219812199122001220112202122031220412205122061220712208122091221012211122121221312214122151221612217122181221912220122211222212223122241222512226122271222812229122301223112232122331223412235122361223712238122391224012241122421224312244122451224612247122481224912250122511225212253122541225512256122571225812259122601226112262122631226412265122661226712268122691227012271122721227312274122751227612277122781227912280122811228212283122841228512286122871228812289122901229112292122931229412295122961229712298122991230012301123021230312304123051230612307123081230912310123111231212313123141231512316123171231812319123201232112322123231232412325123261232712328123291233012331123321233312334123351233612337123381233912340123411234212343123441234512346123471234812349123501235112352123531235412355123561235712358123591236012361123621236312364123651236612367123681236912370123711237212373123741237512376123771237812379123801238112382123831238412385123861238712388123891239012391123921239312394123951239612397123981239912400124011240212403124041240512406124071240812409124101241112412124131241412415124161241712418124191242012421124221242312424124251242612427124281242912430124311243212433124341243512436124371243812439124401244112442124431244412445124461244712448124491245012451124521245312454124551245612457124581245912460124611246212463124641246512466124671246812469124701247112472124731247412475124761247712478124791248012481124821248312484124851248612487124881248912490124911249212493124941249512496124971249812499125001250112502125031250412505125061250712508125091251012511125121251312514125151251612517125181251912520125211252212523125241252512526125271252812529125301253112532125331253412535125361253712538125391254012541125421254312544125451254612547125481254912550125511255212553125541255512556125571255812559125601256112562125631256412565125661256712568125691257012571125721257312574125751257612577125781257912580125811258212583125841258512586125871258812589125901259112592125931259412595125961259712598125991260012601126021260312604126051260612607126081260912610126111261212613126141261512616126171261812619126201262112622126231262412625126261262712628126291263012631126321263312634126351263612637126381263912640126411264212643126441264512646126471264812649126501265112652126531265412655126561265712658126591266012661126621266312664126651266612667126681266912670126711267212673126741267512676126771267812679126801268112682126831268412685126861268712688126891269012691126921269312694126951269612697126981269912700127011270212703127041270512706127071270812709127101271112712127131271412715127161271712718127191272012721127221272312724127251272612727127281272912730127311273212733127341273512736127371273812739127401274112742127431274412745127461274712748127491275012751127521275312754127551275612757127581275912760127611276212763127641276512766127671276812769127701277112772127731277412775127761277712778127791278012781127821278312784127851278612787127881278912790127911279212793127941279512796127971279812799128001280112802128031280412805128061280712808128091281012811128121281312814128151281612817128181281912820128211282212823128241282512826128271282812829128301283112832128331283412835128361283712838128391284012841128421284312844128451284612847128481284912850128511285212853128541285512856128571285812859128601286112862128631286412865128661286712868128691287012871128721287312874128751287612877128781287912880128811288212883128841288512886128871288812889128901289112892128931289412895128961289712898128991290012901129021290312904129051290612907129081290912910129111291212913129141291512916129171291812919129201292112922129231292412925129261292712928129291293012931129321293312934129351293612937129381293912940129411294212943129441294512946129471294812949129501295112952129531295412955129561295712958129591296012961129621296312964129651296612967129681296912970129711297212973129741297512976129771297812979129801298112982129831298412985129861298712988129891299012991129921299312994129951299612997129981299913000130011300213003130041300513006130071300813009130101301113012130131301413015130161301713018130191302013021130221302313024130251302613027130281302913030130311303213033130341303513036130371303813039130401304113042130431304413045130461304713048130491305013051130521305313054130551305613057130581305913060130611306213063130641306513066130671306813069130701307113072130731307413075130761307713078130791308013081130821308313084130851308613087130881308913090130911309213093130941309513096130971309813099131001310113102131031310413105131061310713108131091311013111131121311313114131151311613117131181311913120131211312213123131241312513126131271312813129131301313113132131331313413135131361313713138131391314013141131421314313144131451314613147131481314913150131511315213153131541315513156131571315813159131601316113162131631316413165131661316713168131691317013171131721317313174131751317613177131781317913180131811318213183131841318513186131871318813189131901319113192131931319413195131961319713198131991320013201132021320313204132051320613207132081320913210132111321213213132141321513216132171321813219132201322113222132231322413225132261322713228132291323013231132321323313234132351323613237132381323913240132411324213243132441324513246132471324813249132501325113252132531325413255132561325713258132591326013261132621326313264132651326613267132681326913270132711327213273132741327513276132771327813279132801328113282132831328413285132861328713288132891329013291132921329313294132951329613297132981329913300133011330213303133041330513306133071330813309133101331113312133131331413315133161331713318133191332013321133221332313324133251332613327133281332913330133311333213333133341333513336133371333813339133401334113342133431334413345133461334713348133491335013351133521335313354133551335613357133581335913360133611336213363133641336513366133671336813369133701337113372133731337413375133761337713378133791338013381133821338313384133851338613387133881338913390133911339213393133941339513396133971339813399134001340113402134031340413405134061340713408134091341013411134121341313414134151341613417134181341913420134211342213423134241342513426134271342813429134301343113432134331343413435134361343713438134391344013441134421344313444134451344613447134481344913450134511345213453134541345513456134571345813459134601346113462134631346413465134661346713468134691347013471134721347313474134751347613477134781347913480134811348213483134841348513486134871348813489134901349113492134931349413495134961349713498134991350013501135021350313504135051350613507135081350913510135111351213513135141351513516135171351813519135201352113522135231352413525135261352713528135291353013531135321353313534135351353613537135381353913540135411354213543135441354513546135471354813549135501355113552135531355413555135561355713558135591356013561135621356313564135651356613567135681356913570135711357213573135741357513576135771357813579135801358113582135831358413585135861358713588135891359013591135921359313594135951359613597135981359913600136011360213603136041360513606136071360813609136101361113612136131361413615136161361713618136191362013621136221362313624136251362613627136281362913630136311363213633136341363513636136371363813639136401364113642136431364413645136461364713648136491365013651136521365313654136551365613657136581365913660136611366213663136641366513666136671366813669136701367113672136731367413675136761367713678136791368013681136821368313684136851368613687136881368913690136911369213693136941369513696136971369813699137001370113702137031370413705137061370713708137091371013711137121371313714137151371613717137181371913720137211372213723137241372513726137271372813729137301373113732137331373413735137361373713738137391374013741137421374313744137451374613747137481374913750137511375213753137541375513756137571375813759137601376113762137631376413765137661376713768137691377013771137721377313774137751377613777137781377913780137811378213783137841378513786137871378813789137901379113792137931379413795137961379713798137991380013801138021380313804138051380613807138081380913810138111381213813138141381513816138171381813819138201382113822138231382413825138261382713828138291383013831138321383313834138351383613837138381383913840138411384213843138441384513846138471384813849138501385113852138531385413855138561385713858138591386013861138621386313864138651386613867138681386913870138711387213873138741387513876138771387813879138801388113882138831388413885138861388713888138891389013891138921389313894138951389613897138981389913900139011390213903139041390513906139071390813909139101391113912139131391413915139161391713918139191392013921139221392313924139251392613927139281392913930
  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. registerParameter: Backend.Registers;
  522. registerParameters: LONGINT;
  523. registerClass: IntermediateCode.RegisterClass;
  524. type: IntermediateCode.Type;
  525. formalParameter: SyntaxTree.Parameter;
  526. recordType: SyntaxTree.RecordType;
  527. isModuleBody: BOOLEAN;
  528. PROCEDURE Signature;
  529. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  530. BEGIN
  531. procedureType := x.type(SyntaxTree.ProcedureType);
  532. returnType := procedureType.returnType;
  533. IF returnType # NIL THEN
  534. meta.CheckTypeDeclaration(returnType)
  535. END;
  536. parameter := procedureType.firstParameter;
  537. WHILE parameter # NIL DO
  538. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  539. parameter := parameter.nextParameter;
  540. END;
  541. END Signature;
  542. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  543. VAR result: BOOLEAN;
  544. BEGIN
  545. result := FALSE;
  546. IF x = SyntaxTree.invalidExpression THEN
  547. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  548. result := TRUE;
  549. value := x.resolved(SyntaxTree.IntegerValue).value;
  550. ELSE
  551. Error(x.position,"expression is not an integer constant");
  552. END;
  553. RETURN result;
  554. END CheckIntegerValue;
  555. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  556. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  557. BEGIN
  558. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  559. WHILE (this # NIL) & (this.identifier # id) DO
  560. this := this.nextModifier;
  561. END;
  562. IF this # NIL THEN
  563. IF this.expression = NIL THEN
  564. Error(this.position,"expected expression value");
  565. ELSIF CheckIntegerValue(this.expression,value) THEN
  566. END;
  567. RETURN TRUE
  568. ELSE RETURN FALSE
  569. END;
  570. END HasValue;
  571. CONST DefaultDataMemorySize=512;
  572. BEGIN
  573. IF x.externalName # NIL THEN RETURN END;
  574. (*
  575. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  576. *)
  577. (* code section for this procedure *)
  578. scope := x.procedureScope;
  579. prevScope := currentScope;
  580. currentScope := scope;
  581. procedureType := x.type(SyntaxTree.ProcedureType);
  582. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  583. implementationVisitor.temporaries.Init;
  584. implementationVisitor.usedRegisters := NIL;
  585. implementationVisitor.registerUsageCount.Init;
  586. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  587. IF (scope.body # NIL) & (x.isInline) THEN
  588. inline := TRUE;
  589. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  590. ir.SetExported(IsExported(x));
  591. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  592. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  593. IF backend.cellsAreObjects THEN
  594. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  595. ir.SetExported(IsExported(x));
  596. ELSE
  597. RETURN; (* cellnet cannot be compiled for final static hardware *)
  598. END;
  599. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  600. inline := FALSE;
  601. AddBodyCallStub(x);
  602. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  603. ir.SetExported(IsExported(x));
  604. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  605. inline := FALSE;
  606. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  607. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := DefaultDataMemorySize END;
  608. AddBodyCallStub(x);
  609. AddStackAllocation(x,stackSize);
  610. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  611. ir.SetExported(IsExported(x));
  612. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  613. inline := FALSE;
  614. Parameters(procedureType.firstParameter);
  615. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  616. ir.SetExported(IsExported(x));
  617. ELSE
  618. inline := FALSE;
  619. IF x.isEntry OR x.isExit THEN
  620. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,x,dump);
  621. ir.SetExported(TRUE);
  622. IF x.isEntry THEN ir.SetPriority(EntryPriority) ELSE ir.SetPriority(ExitPriority) END;
  623. ELSE
  624. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  625. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  626. END;
  627. END;
  628. cc := procedureType.callingConvention;
  629. IF scope.body # NIL THEN
  630. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  631. registerNumber := 0;
  632. IF ~inline THEN
  633. IF scope.lastVariable = NIL THEN
  634. stackSize := 0
  635. ELSE
  636. stackSize := scope.lastVariable.offsetInBits;
  637. IF stackSize <0 THEN stackSize := -stackSize END;
  638. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  639. END;
  640. (*
  641. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  642. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  643. *)
  644. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  645. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  646. END;
  647. pc := ir.pc-1;
  648. (*
  649. ir.Emit(Nop(position)); (* placeholder for fill *)
  650. *)
  651. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  652. registerParameter := backend.GetParameterRegisters(procedureType.callingConvention);
  653. IF registerParameter = NIL THEN registerParameters := 0
  654. ELSE registerParameters := LEN(registerParameter)
  655. END;
  656. formalParameter := procedureType.lastParameter;
  657. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  658. IF ~PassInRegister(formalParameter) THEN
  659. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  660. ELSE
  661. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, registerParameter[registerNumber]);
  662. type := GetType(system, formalParameter.type);
  663. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  664. IntermediateCode.InitMemory(dest,GetType(system,formalParameter.type),implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  665. ir.Emit(Mov(-1,dest, src));
  666. implementationVisitor.ReleaseIntermediateOperand(src);
  667. INC(registerNumber);
  668. formalParameter := formalParameter.prevParameter;
  669. END;
  670. END;
  671. END;
  672. ir.EnterValidPAF;
  673. END;
  674. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  675. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  676. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  677. IF scope.lastVariable # NIL THEN
  678. stackSize := scope.lastVariable.offsetInBits;
  679. IF stackSize <0 THEN stackSize := -stackSize END;
  680. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  681. END;
  682. END;
  683. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  684. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  685. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  686. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  687. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  688. ir.EmitAt(pc,Push(size));
  689. implementationVisitor.StaticCallOperand(result,procedure);
  690. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  691. END;
  692. *)
  693. END;
  694. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  695. IF stackSize > 0 THEN
  696. IF (stackSize MOD system.addressSize = 0) THEN
  697. null := IntermediateCode.Immediate(addressType,0);
  698. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  699. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  700. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  701. ELSE
  702. null := IntermediateCode.Immediate(int8,0);
  703. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  704. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  705. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  706. END;
  707. (*! should potentially be called by backend -- enter might initialize
  708. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  709. *)
  710. END;
  711. ir.ExitValidPAF;
  712. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  713. finalizer := FALSE;
  714. IF backend.cooperative & x.isFinalizer THEN
  715. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  716. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  717. GetRecordTypeName(recordType,name);
  718. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  719. END;
  720. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  721. IF backend.cooperative THEN
  722. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  723. IF implementationVisitor.profile & ~isModuleBody THEN
  724. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  725. END;
  726. END;
  727. implementationVisitor.EmitLeave(ir, x.position,cc);
  728. IF finalizer THEN
  729. IF backend.hasLinkRegister THEN
  730. ir.Emit(Pop(-1, implementationVisitor.lr));
  731. END;
  732. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  733. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  734. ir.Emit(Br(x.position,dest));
  735. ELSE
  736. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  737. END;
  738. ELSE
  739. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  740. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  741. END;
  742. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  743. IF backend.cooperative THEN
  744. IF HasPointers (scope) THEN
  745. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  746. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  747. ir.Emit(Result(x.position, res));
  748. ir.Emit(Push(x.position, res));
  749. implementationVisitor.ResetVariables(scope);
  750. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  751. ir.Emit(Pop(x.position, res));
  752. ir.Emit(Return(x.position, res));
  753. ELSE
  754. implementationVisitor.ResetVariables(scope);
  755. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  756. END;
  757. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  758. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  759. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  760. ir.Emit(Result(x.position, res));
  761. ir.Emit(Push(x.position, res));
  762. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  763. ir.Emit(Pop(x.position, res));
  764. ir.Emit(Return(x.position, res));
  765. ELSE
  766. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  767. END;
  768. END;
  769. implementationVisitor.EmitLeave(ir,x.position,cc);
  770. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  771. ELSE
  772. ir.Emit(Nop(x.position));
  773. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  774. implementationVisitor.EmitLeave(ir,x.position,cc);
  775. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  776. END;
  777. END;
  778. END
  779. END;
  780. ELSE (* force body for procedures *)
  781. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  782. ir.EnterValidPAF;
  783. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  784. IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;
  785. ir.ExitValidPAF;
  786. implementationVisitor.EmitLeave(ir,x.position,cc);
  787. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  788. END;
  789. Scope(scope);
  790. Signature;
  791. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  792. currentScope := prevScope;
  793. END Procedure;
  794. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  795. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  796. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  797. BEGIN
  798. ASSERT (bodyProcedure # NIL);
  799. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  800. procedure := SyntaxTree.NewProcedure(-1,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  801. procedure.SetScope(bodyProcedure.scope);
  802. procedure.SetType(SyntaxTree.NewProcedureType(-1,bodyProcedure.scope));
  803. procedure.SetAccess(SyntaxTree.Hidden);
  804. Global.GetSymbolSegmentedName (procedure,name);
  805. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  806. ir.SetExported(TRUE);
  807. ir.SetPriority(InitPriority);
  808. Global.GetSymbolSegmentedName (bodyProcedure,name);
  809. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  810. implementationVisitor.currentScope := module.module.moduleScope;
  811. implementationVisitor.section := ir;
  812. implementationVisitor.PushSelfPointer();
  813. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  814. ELSIF backend.preregisterStatic THEN
  815. implementationVisitor.currentScope := module.module.moduleScope;
  816. implementationVisitor.section := ir;
  817. implementationVisitor.PushSelfPointer();
  818. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  819. ELSE
  820. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  821. ir.Emit(Call(bodyProcedure.position,op, 0));
  822. END;
  823. END AddBodyCallStub;
  824. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  825. VAR name: Basic.SegmentedName;
  826. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  827. BEGIN
  828. Global.GetSymbolSegmentedName (symbol,name);
  829. Basic.RemoveSuffix(name);
  830. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  831. ir := implementationVisitor.NewSection(module.allSections,Sections.InitCodeSection,name,NIL,dump);
  832. ir.SetExported(TRUE);
  833. ir.SetPriority(FirstPriority);
  834. IntermediateCode.InitImmediate(op,addressType,initStack);
  835. ir.Emit(Mov(-1,implementationVisitor.sp,op));
  836. END AddStackAllocation;
  837. (** entry function to visit a complete module *)
  838. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  839. VAR
  840. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  841. hasDynamicOperatorDeclarations: BOOLEAN;
  842. operator: SyntaxTree.Operator;
  843. import: SyntaxTree.Import;
  844. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  845. BEGIN
  846. type := type.resolved;
  847. IF type IS SyntaxTree.RecordType THEN
  848. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  849. ELSIF (type IS SyntaxTree.ArrayType) THEN
  850. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  851. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  852. END;
  853. ELSIF type IS SyntaxTree.MathArrayType THEN
  854. WITH type: SyntaxTree.MathArrayType DO
  855. IF type.form = SyntaxTree.Open THEN
  856. RETURN TRUE
  857. ELSIF type.form = SyntaxTree.Static THEN
  858. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  859. END;
  860. END;
  861. END;
  862. RETURN FALSE
  863. END TypeNeedsInitialization;
  864. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  865. VAR variable: SyntaxTree.Variable;
  866. BEGIN
  867. variable := scope.firstVariable;
  868. WHILE variable # NIL DO
  869. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  870. IF variable.initializer # NIL THEN RETURN TRUE END;
  871. variable := variable.nextVariable;
  872. END;
  873. RETURN FALSE
  874. END ScopeNeedsInitialization;
  875. BEGIN
  876. ASSERT(x # NIL); ASSERT(module # NIL);
  877. SELF.module := module;
  878. (* add import names to the generated Sections.Module *)
  879. import := x.moduleScope.firstImport;
  880. WHILE import # NIL DO
  881. import.module.GetName(idstr);
  882. module.imports.AddName(idstr);
  883. import := import.nextImport
  884. END;
  885. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  886. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  887. moduleSelf := SyntaxTree.NewVariable(0,SyntaxTree.NewIdentifier("@moduleSelf"));
  888. moduleSelf.SetType(system.anyType);
  889. moduleSelf.SetScope(x.moduleScope);
  890. moduleSelf.SetUntraced(TRUE);
  891. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  892. ir.SetExported(TRUE);
  893. IntermediateCode.InitImmediate(op,addressType,0);
  894. ir.Emit(Data(-1,op));
  895. END;
  896. implementationVisitor.module := module;
  897. implementationVisitor.moduleScope := x.moduleScope;
  898. implementationVisitor.moduleSelf := moduleSelf;
  899. implementationVisitor.canBeLoaded := TRUE;
  900. meta.SetModule(module);
  901. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  902. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  903. END;
  904. IF backend.profile THEN
  905. EnsureBodyProcedure(x.moduleScope);
  906. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  907. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  908. implementationVisitor.profileId.Emit(Reserve(-1,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  909. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  910. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  911. implementationVisitor.EmitEnter(implementationVisitor.profileInit,-1,NIL,0,0,0);
  912. Global.GetModuleName(module.module,idstr);
  913. implementationVisitor.ProfilerAddModule(idstr);
  914. implementationVisitor.numberProcedures := 0;
  915. END;
  916. implementationVisitor.profile := backend.profile;
  917. (* check if there is at least one dynamic operator locally defined *)
  918. hasDynamicOperatorDeclarations := FALSE;
  919. operator := x.moduleScope.firstOperator;
  920. WHILE operator # NIL DO
  921. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  922. operator := operator.nextOperator
  923. END;
  924. (* add operator initialization code section *)
  925. IF hasDynamicOperatorDeclarations THEN
  926. EnsureBodyProcedure(x.moduleScope);
  927. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  928. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  929. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,-1,NIL,0,0,0);
  930. END;
  931. Scope(x.moduleScope);
  932. IF hasDynamicOperatorDeclarations THEN
  933. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,-1,0);
  934. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(-1,0,0));
  935. END;
  936. IF backend.profile THEN
  937. implementationVisitor.ProfilerPatchInit;
  938. END;
  939. END Module;
  940. END DeclarationVisitor;
  941. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  942. RegisterUsageCount*=OBJECT
  943. VAR used: UsedArray; count: LONGINT;
  944. PROCEDURE &Init;
  945. VAR i: LONGINT;
  946. BEGIN
  947. count := 0;
  948. IF used = NIL THEN NEW(used,64); END;
  949. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  950. END Init;
  951. PROCEDURE Grow;
  952. VAR new: UsedArray; size,i: LONGINT;
  953. BEGIN
  954. size := LEN(used)*2;
  955. NEW(new,size);
  956. FOR i := 0 TO LEN(used)-1 DO
  957. new[i].count := used[i].count;
  958. new[i].type := used[i].type;
  959. new[i].map := used[i].map
  960. END;
  961. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  962. used := new
  963. END Grow;
  964. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  965. BEGIN
  966. INC(count);
  967. IF count = LEN(used) THEN Grow END;
  968. used[count].type := type;
  969. used[count].class := class;
  970. used[count].map := count;
  971. RETURN count;
  972. END Next;
  973. PROCEDURE IncUse(register: LONGINT);
  974. BEGIN
  975. INC(used[register].count);
  976. (*
  977. IF (register = 1) & (count > 30) THEN
  978. D.TraceBack;
  979. END;
  980. *)
  981. END IncUse;
  982. PROCEDURE DecUse(register: LONGINT);
  983. BEGIN
  984. DEC(used[register].count);
  985. END DecUse;
  986. PROCEDURE Map(register: LONGINT): LONGINT;
  987. VAR map : LONGINT;
  988. BEGIN
  989. IF register > 0 THEN
  990. map := used[register].map;
  991. WHILE register # map DO register := map; map := used[register].map END;
  992. END;
  993. RETURN register
  994. END Map;
  995. PROCEDURE Use(register: LONGINT): LONGINT;
  996. BEGIN
  997. IF register< LEN(used) THEN
  998. RETURN used[register].count
  999. ELSE
  1000. RETURN 0
  1001. END
  1002. END Use;
  1003. END RegisterUsageCount;
  1004. RegisterEntry = POINTER TO RECORD
  1005. prev,next: RegisterEntry;
  1006. register: LONGINT;
  1007. registerClass: IntermediateCode.RegisterClass;
  1008. type: IntermediateCode.Type;
  1009. END;
  1010. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1011. Variables = OBJECT (Basic.List)
  1012. VAR
  1013. inUse: VariableUse;
  1014. registerIndex: LONGINT;
  1015. PROCEDURE & Init;
  1016. VAR i: LONGINT;
  1017. BEGIN
  1018. InitList(16);
  1019. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1020. registerIndex := 1024;
  1021. END Init;
  1022. PROCEDURE GetUsage(VAR use: VariableUse);
  1023. BEGIN
  1024. use := inUse;
  1025. END GetUsage;
  1026. PROCEDURE SetUsage(CONST use: VariableUse);
  1027. BEGIN
  1028. inUse := use;
  1029. END SetUsage;
  1030. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1031. VAR any: ANY;
  1032. BEGIN
  1033. any := Get(i);;
  1034. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1035. END GetVariable;
  1036. PROCEDURE Occupy(pos: LONGINT);
  1037. BEGIN
  1038. INCL(inUse[pos DIV 32], pos MOD 32);
  1039. END Occupy;
  1040. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1041. BEGIN
  1042. Occupy(Length());
  1043. Add(v);
  1044. END AddVariable;
  1045. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; VAR pos: LONGINT): SyntaxTree.Variable;
  1046. VAR var : SyntaxTree.Variable;
  1047. BEGIN
  1048. FOR pos := 0 TO Length()-1 DO
  1049. IF ~((pos MOD 32) IN inUse[pos DIV 32]) THEN
  1050. var := GetVariable(pos);
  1051. IF type.SameType(var.type) THEN
  1052. Occupy(pos); RETURN var
  1053. END;
  1054. END;
  1055. END;
  1056. pos := Length();
  1057. RETURN NIL
  1058. END GetFreeVariable;
  1059. END Variables;
  1060. SymbolMap = POINTER TO RECORD this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap; END;
  1061. SymbolMapper = OBJECT
  1062. VAR
  1063. first: SymbolMap;
  1064. PROCEDURE & Init;
  1065. BEGIN
  1066. first := NIL;
  1067. END Init;
  1068. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression);
  1069. VAR new: SymbolMap;
  1070. BEGIN
  1071. NEW(new); new.this := this; new.to := to; new.tag := tag;
  1072. new.next := first; first := new;
  1073. END Add;
  1074. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1075. VAR s: SymbolMap;
  1076. BEGIN
  1077. s := first;
  1078. WHILE (s # NIL) & (s.this # this) DO
  1079. s := s.next
  1080. END;
  1081. RETURN s
  1082. END Get;
  1083. END SymbolMapper;
  1084. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1085. VAR
  1086. system: Global.System;
  1087. section: IntermediateCode.Section;
  1088. module: Sections.Module;
  1089. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1090. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1091. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1092. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1093. checker: SemanticChecker.Checker;
  1094. backend: IntermediateBackend;
  1095. meta: MetaDataGenerator;
  1096. position: LONGINT;
  1097. moduleSelf: SyntaxTree.Variable;
  1098. (* variables for hand over of variables / temporary state *)
  1099. currentScope: SyntaxTree.Scope;
  1100. constantDeclaration : SyntaxTree.Symbol;
  1101. result: Operand; (* result of the most recent expression / statement *)
  1102. destination: IntermediateCode.Operand;
  1103. arrayDestinationTag: IntermediateCode.Operand;
  1104. arrayDestinationDimension:LONGINT;
  1105. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1106. conditional: BOOLEAN;
  1107. trueLabel, falseLabel, exitLabel: Label;
  1108. locked: BOOLEAN;
  1109. (*
  1110. usedRegisters: Registers;
  1111. *)
  1112. registerUsageCount: RegisterUsageCount;
  1113. usedRegisters: RegisterEntry;
  1114. (* useful operands and types *)
  1115. nil,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1116. bool,addressType,setType, sizeType, byteType: IntermediateCode.Type;
  1117. commentPrintout: Printout.Printer;
  1118. dump: Streams.Writer;
  1119. tagsAvailable : BOOLEAN;
  1120. supportedInstruction: SupportedInstructionProcedure;
  1121. supportedImmediate: SupportedImmediateProcedure;
  1122. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1123. emitLabels: BOOLEAN;
  1124. runtimeModuleName : SyntaxTree.IdentifierString;
  1125. newObjectFile: BOOLEAN;
  1126. indexCounter: LONGINT;
  1127. profile: BOOLEAN;
  1128. profileId, profileInit: IntermediateCode.Section;
  1129. profileInitPatchPosition: LONGINT;
  1130. numberProcedures: LONGINT;
  1131. procedureResultDesignator : SyntaxTree.Designator;
  1132. operatorInitializationCodeSection: IntermediateCode.Section;
  1133. fingerPrinter: FingerPrinter.FingerPrinter;
  1134. temporaries: Variables;
  1135. canBeLoaded : BOOLEAN;
  1136. currentIsInline: BOOLEAN;
  1137. currentMapper: SymbolMapper;
  1138. currentInlineExit: Label;
  1139. moduleBodySection: IntermediateCode.Section;
  1140. NeedDescriptor : BOOLEAN;
  1141. cooperativeSwitches: BOOLEAN;
  1142. lastSwitchPC: LONGINT;
  1143. isUnchecked: BOOLEAN;
  1144. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1145. newObjectFile: BOOLEAN);
  1146. BEGIN
  1147. SELF.system := system;
  1148. SELF.runtimeModuleName := runtime;
  1149. currentScope := NIL;
  1150. hiddenPointerType := NIL;
  1151. delegatePointerType := NIL;
  1152. awaitProcCounter := 0;
  1153. labelId := 0; constId := 0; labelId := 0;
  1154. SELF.checker := checker;
  1155. SELF.backend := backend;
  1156. position := Diagnostics.Invalid;
  1157. conditional := FALSE;
  1158. locked := FALSE;
  1159. InitOperand(result,ModeUndefined);
  1160. addressType := IntermediateCode.GetType(system,system.addressType);
  1161. setType := IntermediateCode.GetType(system,system.setType);
  1162. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1163. byteType := IntermediateCode.GetType(system, system.byteType);
  1164. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1165. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1166. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1167. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1168. nil := IntermediateCode.Immediate(addressType,0);
  1169. IntermediateCode.InitOperand(destination);
  1170. tagsAvailable := TRUE;
  1171. supportedInstruction := supportedInstructionProcedure;
  1172. supportedImmediate := supportedImmediateProcedure;
  1173. inData := FALSE;
  1174. SELF.emitLabels := emitLabels;
  1175. IntermediateCode.InitOperand(arrayDestinationTag);
  1176. bool := IntermediateCode.GetType(system,system.booleanType);
  1177. IntermediateCode.InitImmediate(false,bool,0);
  1178. IntermediateCode.InitImmediate(true,bool,1);
  1179. SELF.newObjectFile := newObjectFile;
  1180. indexCounter := 0;
  1181. NEW(registerUsageCount);
  1182. usedRegisters := NIL;
  1183. procedureResultDesignator := NIL;
  1184. NEW(fingerPrinter, system);
  1185. NEW(temporaries);
  1186. currentIsInline := FALSE;
  1187. NeedDescriptor := FALSE;
  1188. isUnchecked := backend.noRuntimeChecks;
  1189. END Init;
  1190. TYPE Context = RECORD
  1191. section: IntermediateCode.Section;
  1192. registerUsageCount: RegisterUsageCount;
  1193. usedRegisters: RegisterEntry;
  1194. END;
  1195. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1196. VAR context: Context;
  1197. BEGIN
  1198. context.section := section;
  1199. context.registerUsageCount := registerUsageCount;
  1200. context.usedRegisters := usedRegisters;
  1201. section := new;
  1202. NEW(registerUsageCount);
  1203. usedRegisters := NIL;
  1204. RETURN context;
  1205. END SwitchContext;
  1206. PROCEDURE ReturnToContext(context: Context);
  1207. BEGIN
  1208. section := context.section;
  1209. registerUsageCount := context.registerUsageCount;
  1210. usedRegisters := context.usedRegisters;
  1211. END ReturnToContext;
  1212. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1213. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1214. BEGIN
  1215. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1216. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1217. END;
  1218. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1219. section.SetExported(IsExported(syntaxTreeSymbol));
  1220. RETURN section
  1221. END NewSection;
  1222. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1223. VAR new: LONGINT;
  1224. BEGIN
  1225. new := registerUsageCount.Next(type,class);
  1226. UseRegister(new);
  1227. RETURN new
  1228. END AcquireRegister;
  1229. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1230. VAR
  1231. fingerPrint: SyntaxTree.FingerPrint;
  1232. fingerPrintString: ARRAY 32 OF CHAR;
  1233. BEGIN
  1234. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1235. string := "[";
  1236. Strings.IntToHexStr(fingerPrint.shallow, 8, fingerPrintString);
  1237. Strings.Append(string, fingerPrintString);
  1238. Strings.Append(string, "]");
  1239. END GetFingerprintString;
  1240. (** get the name for the code section that represens a certain symbol
  1241. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1242. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1243. VAR string: ARRAY 32 OF CHAR;
  1244. BEGIN
  1245. Global.GetSymbolSegmentedName(symbol, name);
  1246. (* if the symbol is an operator, then append the fingerprint to the name *)
  1247. IF symbol IS SyntaxTree.Operator THEN
  1248. GetFingerprintString(symbol, string);
  1249. Basic.AppendToSegmentedName(name,string);
  1250. END
  1251. END GetCodeSectionNameForSymbol;
  1252. (** get the name for the code section that represens a certain symbol
  1253. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1254. PROCEDURE GetCodeSectionNameForSymbolInScope(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope; VAR name: ARRAY OF CHAR);
  1255. VAR string: ARRAY 32 OF CHAR;
  1256. BEGIN
  1257. Global.GetSymbolNameInScope(symbol, scope, name);
  1258. (* if the symbol is an operator, then append the fingerprint to the name *)
  1259. IF symbol IS SyntaxTree.Operator THEN
  1260. GetFingerprintString(symbol, string);
  1261. Strings.Append(name, string);
  1262. END
  1263. END GetCodeSectionNameForSymbolInScope;
  1264. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1265. BEGIN
  1266. IF dump # NIL THEN
  1267. dump.String("enter "); dump.String(s); dump.Ln;
  1268. END;
  1269. END TraceEnter;
  1270. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1271. BEGIN
  1272. IF dump # NIL THEN
  1273. dump.String("exit "); dump.String(s); dump.Ln;
  1274. END;
  1275. END TraceExit;
  1276. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1277. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1278. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1279. VAR i: LONGINT;
  1280. BEGIN
  1281. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1282. IF op.rule # NIL THEN
  1283. FOR i := 0 TO LEN(op.rule)-1 DO
  1284. CheckRegister(op.rule[i])
  1285. END;
  1286. END;
  1287. END CheckRegister;
  1288. BEGIN
  1289. CheckRegister(instruction.op1);
  1290. CheckRegister(instruction.op2);
  1291. CheckRegister(instruction.op3);
  1292. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1293. ELSE section.Emit(instruction);
  1294. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1295. END;
  1296. END Emit;
  1297. PROCEDURE EmitTrap (position, trapNo: LONGINT);
  1298. BEGIN
  1299. IF backend.cooperative THEN
  1300. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1301. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1302. ELSE
  1303. Emit(Trap(position,trapNo));
  1304. END;
  1305. END EmitTrap;
  1306. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: LONGINT; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1307. VAR name: Basic.SegmentedName;
  1308. VAR op1, op2, reg: IntermediateCode.Operand;
  1309. VAR call, nocall: Label;
  1310. VAR parametersSize: LONGINT;
  1311. VAR prevSection: IntermediateCode.Section;
  1312. VAR prevDump: Streams.Writer;
  1313. VAR body: SyntaxTree.Body;
  1314. BEGIN
  1315. ASSERT((procedure = NIL) OR ~procedure.type(SyntaxTree.ProcedureType).noPAF);
  1316. prevSection := SELF.section;
  1317. SELF.section := section;
  1318. prevDump := dump;
  1319. dump := section.comments;
  1320. IF backend.hasLinkRegister THEN
  1321. Emit(Push(-1, lr));
  1322. END;
  1323. Emit(Push(-1,fp));
  1324. IF backend.cooperative & (callconv = SyntaxTree.OberonCallingConvention) THEN
  1325. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1326. GetCodeSectionNameForSymbol(procedure, name);
  1327. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  1328. ELSE
  1329. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1330. END;
  1331. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1332. Emit(Push(-1,op1));
  1333. Emit(Mov(-1,fp, sp));
  1334. body := procedure.procedureScope.body;
  1335. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1336. NEW(call, section);
  1337. NEW(nocall, section);
  1338. reg := NewRegisterOperand(addressType);
  1339. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1340. Emit(Sub(-1,reg, sp, op1));
  1341. BrltL(call, sp, reg);
  1342. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1343. BrgeL(nocall, sp, op2);
  1344. call.Resolve(section.pc);
  1345. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1346. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1347. Emit(Push(-1, op2));
  1348. Emit(Push(-1, reg));
  1349. ReleaseIntermediateOperand(reg);
  1350. CallThis(position, "Activities","ExpandStack",2);
  1351. Emit(Result(-1, sp));
  1352. nocall.Resolve(section.pc);
  1353. END;
  1354. ELSE
  1355. Emit(Mov(-1, fp, sp));
  1356. END;
  1357. Emit(Enter(-1, callconv, varSize));
  1358. SELF.section := prevSection;
  1359. dump := prevDump;
  1360. END EmitEnter;
  1361. PROCEDURE Enter(position: LONGINT; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1362. VAR op1,op2: IntermediateCode.Operand;
  1363. VAR instruction: IntermediateCode.Instruction;
  1364. BEGIN
  1365. IntermediateCode.InitNumber(op1,callconv);
  1366. IntermediateCode.InitNumber(op2,varSize);
  1367. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1368. RETURN instruction
  1369. END Enter;
  1370. PROCEDURE Leave(position: LONGINT; callconv: LONGINT): IntermediateCode.Instruction;
  1371. VAR op1: IntermediateCode.Operand;
  1372. VAR instruction: IntermediateCode.Instruction;
  1373. BEGIN
  1374. IntermediateCode.InitNumber(op1,callconv);
  1375. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1376. RETURN instruction
  1377. END Leave;
  1378. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: LONGINT; callconv: LONGINT);
  1379. VAR prevSection: IntermediateCode.Section;
  1380. VAR op2: IntermediateCode.Operand;
  1381. BEGIN
  1382. prevSection := SELF.section;
  1383. SELF.section := section;
  1384. Emit(Leave(position, callconv));
  1385. IF backend.cooperative THEN
  1386. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1387. Emit(Add(position, sp, fp, op2));
  1388. ELSE
  1389. Emit(Mov(position, sp, fp));
  1390. END;
  1391. Emit(Pop(position, fp));
  1392. SELF.section := prevSection;
  1393. END EmitLeave;
  1394. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1395. VAR m: SymbolMap;
  1396. BEGIN
  1397. position := x.position;
  1398. IF currentIsInline THEN
  1399. m := currentMapper.Get(x);
  1400. IF m # NIL THEN
  1401. (*
  1402. Printout.Info("mapping from", x);
  1403. Printout.Info("mapping to ", m.to);
  1404. *)
  1405. m.to.Accept(SELF);
  1406. op := result;
  1407. IF m.tag # NIL THEN
  1408. ReleaseIntermediateOperand(result.tag);
  1409. m.tag.Accept(SELF);
  1410. op.tag := result.op;
  1411. ReleaseIntermediateOperand(result.tag);
  1412. END;
  1413. RETURN
  1414. END;
  1415. END;
  1416. x.Accept(SELF);
  1417. op := result;
  1418. END Symbol;
  1419. PROCEDURE Expression(x: SyntaxTree.Expression);
  1420. BEGIN
  1421. position := x.position;
  1422. constantDeclaration := NIL;
  1423. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1424. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1425. END;
  1426. IF x.resolved # NIL THEN
  1427. x.resolved.Accept(SELF)
  1428. ELSE
  1429. x.Accept(SELF)
  1430. END;
  1431. (* check this, was commented out in ActiveCells3 *)
  1432. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1433. Error(x.position, "unsupported modifier");
  1434. END;
  1435. END Expression;
  1436. (*
  1437. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1438. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1439. BEGIN
  1440. temporaries.GetUsage(current);
  1441. FOR i := 0 TO LEN(current)-1 DO
  1442. set := current[i] - previous[i];
  1443. IF set # {} THEN
  1444. FOR j := 0 TO MAX(SET)-1 DO
  1445. IF j IN set THEN
  1446. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1447. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1448. Symbol(variable, op);
  1449. MakeMemory(tmp,op.op,addressType,0);
  1450. ReleaseOperand(op);
  1451. Emit(Mov(position,tmp, nil ) );
  1452. ReleaseIntermediateOperand(tmp);
  1453. END;
  1454. END;
  1455. END;
  1456. END;
  1457. END;
  1458. END ResetUsedTemporaries;
  1459. *)
  1460. PROCEDURE Statement(x: SyntaxTree.Statement);
  1461. VAR use: VariableUse;
  1462. BEGIN
  1463. temporaries.GetUsage(use);
  1464. position := x.position;
  1465. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1466. IF commentPrintout # NIL THEN
  1467. commentPrintout.Statement(x);
  1468. dump.Ln;
  1469. (*dump.Update;*)
  1470. END;
  1471. x.Accept(SELF);
  1472. (*
  1473. CheckRegistersFree();
  1474. *)
  1475. (*ResetUsedTemporaries(use);*)
  1476. temporaries.SetUsage(use);
  1477. END Statement;
  1478. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1479. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1480. *)
  1481. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1482. BEGIN
  1483. IF op.mode = IntermediateCode.ModeMemory THEN
  1484. ReuseCopy(res,op);
  1485. ELSE
  1486. res := op;
  1487. UseIntermediateOperand(res);
  1488. END;
  1489. IntermediateCode.AddOffset(res,offset);
  1490. IntermediateCode.MakeMemory(res,type);
  1491. END MakeMemory;
  1492. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1493. VAR mem: IntermediateCode.Operand;
  1494. BEGIN
  1495. MakeMemory(mem,res,type,offset);
  1496. ReleaseIntermediateOperand(res);
  1497. res := mem;
  1498. END ToMemory;
  1499. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1500. VAR mem: IntermediateCode.Operand;
  1501. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1502. componentType: SyntaxTree.Type;
  1503. BEGIN
  1504. type := type.resolved;
  1505. IF operand.mode = ModeReference THEN
  1506. IF type IS SyntaxTree.RangeType THEN
  1507. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.longintType), 0);
  1508. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1509. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1510. ReleaseOperand(operand);
  1511. operand.op := firstOp;
  1512. operand.tag := lastOp;
  1513. operand.extra := stepOp;
  1514. ELSIF type IS SyntaxTree.ComplexType THEN
  1515. componentType := type(SyntaxTree.ComplexType).componentType;
  1516. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1517. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1518. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1519. ReleaseOperand(operand);
  1520. operand.op := firstOp;
  1521. operand.tag := lastOp
  1522. ELSE
  1523. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1524. ReleaseIntermediateOperand(operand.op);
  1525. operand.op := mem;
  1526. END;
  1527. operand.mode := ModeValue;
  1528. END;
  1529. ASSERT(operand.mode = ModeValue);
  1530. END LoadValue;
  1531. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1532. VAR prevConditional: BOOLEAN;
  1533. BEGIN
  1534. prevConditional := conditional;
  1535. conditional := FALSE;
  1536. InitOperand(result, ModeUndefined);
  1537. Expression(x);
  1538. op := result;
  1539. LoadValue(op,x.type.resolved);
  1540. conditional := prevConditional;
  1541. END Evaluate;
  1542. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1543. VAR prevConditional: BOOLEAN;
  1544. BEGIN
  1545. prevConditional := conditional;
  1546. conditional := FALSE;
  1547. InitOperand(result,ModeUndefined);
  1548. Expression(x);
  1549. op := result;
  1550. (*
  1551. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1552. *)
  1553. conditional := prevConditional;
  1554. END Designate;
  1555. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1556. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1557. BEGIN
  1558. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1559. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1560. conditional := TRUE;
  1561. trueLabel := trueL; falseLabel := falseL;
  1562. Expression(x);
  1563. trueL := trueLabel; falseL := falseLabel;
  1564. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1565. END Condition;
  1566. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1567. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1568. BEGIN
  1569. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1570. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1571. RETURN op
  1572. END NewRegisterOperand;
  1573. PROCEDURE UnuseRegister(register: LONGINT);
  1574. BEGIN
  1575. IF (register > 0) THEN
  1576. register := registerUsageCount.Map(register);
  1577. registerUsageCount.DecUse(register);
  1578. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1579. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1580. END;
  1581. IF registerUsageCount.Use(register)=0 THEN
  1582. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1583. Warning(position, "register cannot be removed");
  1584. END;
  1585. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1586. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1587. END;
  1588. ELSIF registerUsageCount.Use(register)<0 THEN
  1589. Warning(position, "register removed too often");
  1590. IF dump # NIL THEN
  1591. dump.String("register removed too often"); dump.Ln; dump.Update;
  1592. END;
  1593. D.TraceBack;
  1594. END;
  1595. END;
  1596. END UnuseRegister;
  1597. PROCEDURE UseRegister(register: LONGINT);
  1598. BEGIN
  1599. IF (register > 0) THEN
  1600. register := registerUsageCount.Map(register);
  1601. registerUsageCount.IncUse(register);
  1602. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1603. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1604. END;
  1605. IF registerUsageCount.Use(register)=1 THEN
  1606. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1607. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1608. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1609. END;
  1610. END;
  1611. END;
  1612. END UseRegister;
  1613. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1614. BEGIN
  1615. UnuseRegister(op.register)
  1616. END ReleaseIntermediateOperand;
  1617. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1618. BEGIN
  1619. UseRegister(op.register)
  1620. END UseIntermediateOperand;
  1621. PROCEDURE ReleaseOperand(CONST op: Operand);
  1622. BEGIN
  1623. UnuseRegister(op.op.register);
  1624. UnuseRegister(op.tag.register);
  1625. UnuseRegister(op.extra.register);
  1626. END ReleaseOperand;
  1627. (* save registers marked in array "markedRegisters" to the stack
  1628. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1629. *)
  1630. PROCEDURE SaveRegisters();
  1631. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1632. BEGIN
  1633. entry := usedRegisters;
  1634. WHILE entry # NIL DO
  1635. type := registerUsageCount.used[entry.register].type;
  1636. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1637. Emit(Push(position,op));
  1638. entry := entry.next;
  1639. END;
  1640. END SaveRegisters;
  1641. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1642. BEGIN
  1643. saved := usedRegisters;
  1644. usedRegisters := NIL;
  1645. END ReleaseUsedRegisters;
  1646. (** remove parameter registers from used queue *)
  1647. PROCEDURE ReleaseParameterRegisters;
  1648. VAR entry,prev,next: RegisterEntry;
  1649. BEGIN
  1650. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1651. WHILE entry # NIL DO
  1652. next := entry.next;
  1653. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1654. registerUsageCount.DecUse(entry.register);
  1655. ASSERT(registerUsageCount.Use(entry.register)=0);
  1656. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1657. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1658. END;
  1659. ELSIF prev = NIL THEN
  1660. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1661. ELSE
  1662. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1663. END;
  1664. entry := next;
  1665. END;
  1666. END ReleaseParameterRegisters;
  1667. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1668. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1669. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1670. BEGIN
  1671. entry := saved;
  1672. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1673. entry := prev;
  1674. WHILE entry # NIL DO
  1675. prev := entry.prev;
  1676. type := entry.type;
  1677. class := entry.registerClass;
  1678. IntermediateCode.InitRegister(op,type,class,entry.register);
  1679. (*
  1680. new := registerUsageCount.Next(type,class);
  1681. registerUsageCount.Remap(entry.register,new);
  1682. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1683. dump.String("remap register "); dump.Int(entry.register,1);
  1684. dump.String("to "); dump.Int(new,1);
  1685. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1686. END;
  1687. entry.register := new;
  1688. *)
  1689. Emit(Pop(position,op));
  1690. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1691. entry := prev;
  1692. END;
  1693. (*
  1694. usedRegisters := saved;
  1695. *)
  1696. END RestoreRegisters;
  1697. PROCEDURE CheckRegistersFree;
  1698. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1699. BEGIN
  1700. IF usedRegisters # NIL THEN
  1701. r := usedRegisters;
  1702. WHILE r # NIL DO
  1703. warning := "register ";
  1704. Strings.AppendInt(warning, r.register);
  1705. Strings.Append(warning, " not released.");
  1706. Warning(position,warning);
  1707. r := r .next;
  1708. END;
  1709. END;
  1710. FOR i := 0 TO registerUsageCount.count-1 DO
  1711. IF registerUsageCount.used[i].count < 0 THEN
  1712. warning := "register ";
  1713. Strings.AppendInt(warning, i);
  1714. Strings.Append(warning, " unused too often.");
  1715. Warning(position,warning);
  1716. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1717. warning := "register ";
  1718. Strings.AppendInt(warning, i);
  1719. Strings.Append(warning, " not unused often enough.");
  1720. Warning(position,warning);
  1721. END;
  1722. END;
  1723. END CheckRegistersFree;
  1724. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1725. Otherwise allocate a new register.
  1726. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1727. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1728. BEGIN
  1729. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1730. UseIntermediateOperand(result);
  1731. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1732. UseIntermediateOperand(result);
  1733. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1734. END;
  1735. END Reuse2;
  1736. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1737. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1738. If not then allocate a new register.
  1739. Does NOT necessarily keep the content of src1 or src2 in result!
  1740. *)
  1741. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1742. BEGIN
  1743. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1744. UseIntermediateOperand(result);
  1745. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1746. UseIntermediateOperand(result);
  1747. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1748. result := alternative; alternative := emptyOperand;
  1749. UseIntermediateOperand(result);
  1750. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1751. END;
  1752. END Reuse2a;
  1753. (* like reuse2 but only one source *)
  1754. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1755. BEGIN
  1756. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1757. UseIntermediateOperand(result);
  1758. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1759. END;
  1760. END Reuse1;
  1761. (* like reuse2a but only one source *)
  1762. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1763. BEGIN
  1764. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1765. UseIntermediateOperand(result);
  1766. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1767. UseIntermediateOperand(result);
  1768. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1769. END;
  1770. END Reuse1a;
  1771. (* like reuse1 but guarantees that content of src1 is in result *)
  1772. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1773. BEGIN
  1774. IF ReusableRegister(src1) THEN
  1775. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1776. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1777. UseIntermediateOperand(result);
  1778. ELSE
  1779. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1780. Emit(Mov(position,result,src1));
  1781. END
  1782. END ReuseCopy;
  1783. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1784. BEGIN
  1785. IF ReusableRegister(src) THEN
  1786. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1787. ELSE
  1788. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1789. Emit(Mov(position,result,src));
  1790. ReleaseIntermediateOperand(src);
  1791. END
  1792. END TransferToRegister;
  1793. (** labels and branches **)
  1794. PROCEDURE NewLabel(): Label;
  1795. VAR label: Label;
  1796. BEGIN
  1797. NEW(label,section); RETURN label;
  1798. END NewLabel;
  1799. PROCEDURE SetLabel(label: Label);
  1800. BEGIN label.Resolve(section.pc);
  1801. END SetLabel;
  1802. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1803. BEGIN
  1804. ASSERT(label # NIL);
  1805. IF label.pc < 0 THEN (* label not yet set *)
  1806. label.AddFixup(section.pc);
  1807. END;
  1808. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1809. END LabelOperand;
  1810. PROCEDURE BrL(label: Label);
  1811. BEGIN
  1812. Emit(Br(position,LabelOperand(label)));
  1813. END BrL;
  1814. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1815. BEGIN
  1816. Emit(Brge(position,LabelOperand(label),left,right));
  1817. END BrgeL;
  1818. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1819. BEGIN
  1820. Emit(Brlt(position,LabelOperand(label),left,right));
  1821. END BrltL;
  1822. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1823. BEGIN
  1824. Emit(Breq(position,LabelOperand(label),left,right));
  1825. END BreqL;
  1826. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1827. BEGIN
  1828. Emit(Brne(position,LabelOperand(label),left,right));
  1829. END BrneL;
  1830. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1831. VAR new: IntermediateCode.Operand;
  1832. BEGIN
  1833. IF Trace THEN TraceEnter("Convert") END;
  1834. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1835. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1836. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1837. & (operand.offset = 0)
  1838. THEN
  1839. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1840. Emit(Conv(position,new,operand));
  1841. ELSE
  1842. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1843. Emit(Conv(position,new,operand));
  1844. ReleaseIntermediateOperand(operand);
  1845. END;
  1846. operand := new;
  1847. 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
  1848. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1849. ELSE
  1850. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1851. Emit(Conv(position,new,operand));
  1852. ReleaseIntermediateOperand(operand);
  1853. operand := new;
  1854. END;
  1855. IF Trace THEN TraceExit("Convert") END;
  1856. END Convert;
  1857. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1858. VAR exit: Label;
  1859. BEGIN
  1860. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1861. exit := NewLabel();
  1862. br(exit,left,right);
  1863. EmitTrap(position,trapNo);
  1864. SetLabel(exit);
  1865. END TrapC;
  1866. (** expressions *)
  1867. (** emit necessary runtime check for set elements **)
  1868. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1869. VAR max: IntermediateCode.Operand;
  1870. BEGIN
  1871. IF isUnchecked THEN RETURN END;
  1872. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1873. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1874. TrapC(BrgeL, max, o, SetElementTrap);
  1875. END;
  1876. END CheckSetElement;
  1877. (** the set that a range represents **)
  1878. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1879. VAR
  1880. operand: Operand;
  1881. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1882. BEGIN
  1883. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1884. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1885. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1886. one := IntermediateCode.Immediate(setType, 1);
  1887. Evaluate(x, operand);
  1888. Convert(operand.op, setType);
  1889. Convert(operand.tag, setType);
  1890. CheckSetElement(operand.op);
  1891. CheckSetElement(operand.tag);
  1892. (* create mask for lower bound
  1893. i.e. shift 11111111 to the left by the value of the lower bound
  1894. *)
  1895. Reuse1(temp, operand.op);
  1896. Emit(Shl(position,temp, allBits, operand.op));
  1897. ReleaseIntermediateOperand(operand.op);
  1898. operand.op := temp;
  1899. (* create mask for upper bound
  1900. i.e. shift 11111111 to the right by the difference between the
  1901. upper bound and the maximum number of set elements
  1902. *)
  1903. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1904. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1905. Reuse1(temp, operand.tag);
  1906. ELSE
  1907. Reuse1(temp, operand.tag);
  1908. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1909. Emit(Sub(position,temp, size, operand.tag));
  1910. END;
  1911. Emit(Shr(position,temp, allBits, operand.tag));
  1912. ReleaseIntermediateOperand(operand.tag);
  1913. operand.tag := temp;
  1914. Reuse2(resultingSet, operand.op, operand.tag);
  1915. (* intersect the two masks *)
  1916. Emit(And(position,resultingSet, operand.op, operand.tag));
  1917. ReleaseOperand(operand);
  1918. RETURN resultingSet
  1919. END SetFromRange;
  1920. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1921. VAR
  1922. res, operand: Operand;
  1923. temp, one, noBits, dest: IntermediateCode.Operand;
  1924. expression: SyntaxTree.Expression;
  1925. i: LONGINT;
  1926. BEGIN
  1927. IF Trace THEN TraceEnter("VisitSet") END;
  1928. dest := destination;
  1929. destination := emptyOperand;
  1930. noBits := IntermediateCode.Immediate(setType, 0);
  1931. one := IntermediateCode.Immediate(setType, 1);
  1932. (* start off with the empty set *)
  1933. InitOperand(res, ModeValue);
  1934. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1935. Emit(Mov(position,res.op, noBits));
  1936. FOR i := 0 TO x.elements.Length() - 1 DO
  1937. expression := x.elements.GetExpression(i);
  1938. IF expression IS SyntaxTree.RangeExpression THEN
  1939. (* range of set elements *)
  1940. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  1941. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  1942. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1943. ReleaseIntermediateOperand(temp)
  1944. ELSE
  1945. (* singelton element *)
  1946. Evaluate(expression, operand);
  1947. Convert(operand.op, setType);
  1948. CheckSetElement(operand.op);
  1949. (* create subset containing single element *)
  1950. Reuse1(temp, operand.op);
  1951. Emit(Shl(position,temp, one, operand.op));
  1952. ReleaseOperand(operand);
  1953. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1954. ReleaseIntermediateOperand(temp);
  1955. END
  1956. END;
  1957. result := res;
  1958. destination := dest;
  1959. IF Trace THEN TraceExit("VisitSet") END;
  1960. END VisitSet;
  1961. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  1962. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  1963. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  1964. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  1965. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  1966. element: SyntaxTree.IntegerValue;
  1967. BEGIN
  1968. numberElements := x.elements.Length();
  1969. expression := index.parameters.GetExpression(dim);
  1970. element := expression(SyntaxTree.IntegerValue);
  1971. FOR i := 0 TO numberElements-1 DO
  1972. expression := x.elements.GetExpression(i);
  1973. element.SetValue(i);
  1974. IF expression IS SyntaxTree.MathArrayExpression THEN
  1975. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  1976. ELSE
  1977. Assign(index,expression);
  1978. END;
  1979. END;
  1980. END RecursiveAssignment;
  1981. BEGIN
  1982. variable := GetTemporaryVariable(x.type, FALSE);
  1983. designator := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  1984. designator.SetType(variable.type);
  1985. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  1986. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  1987. FOR i := 0 TO dim-1 DO
  1988. element := SyntaxTree.NewIntegerValue(x.position,0);
  1989. element.SetType(system.longintType);
  1990. index.parameters.AddExpression(element);
  1991. END;
  1992. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  1993. RecursiveAssignment(x,0);
  1994. Expression(designator);
  1995. END VisitMathArrayExpression;
  1996. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  1997. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1998. BEGIN
  1999. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2000. dest := destination; destination := emptyOperand;
  2001. IF x.operator = Scanner.Not THEN
  2002. IF conditional THEN
  2003. Condition(x.left,falseLabel,trueLabel)
  2004. ELSE
  2005. Evaluate(x.left,operand);
  2006. InitOperand(result,ModeValue);
  2007. Reuse1a(result.op,operand.op,dest);
  2008. Emit(Xor(position,result.op,operand.op,true));
  2009. ReleaseOperand(operand);
  2010. END;
  2011. ELSIF x.operator = Scanner.Minus THEN
  2012. Evaluate(x.left,operand);
  2013. InitOperand(result,ModeValue);
  2014. Reuse1a(result.op,operand.op,dest);
  2015. type := x.left.type.resolved;
  2016. IF type IS SyntaxTree.SetType THEN
  2017. Emit(Not(position,result.op,operand.op));
  2018. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2019. Reuse1(result.tag,operand.tag);
  2020. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2021. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2022. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2023. Emit(Neg(position,result.op,operand.op));
  2024. ELSE HALT(200)
  2025. END;
  2026. ReleaseOperand(operand);
  2027. ELSIF x.operator = Scanner.Address THEN
  2028. Designate(x.left,operand);
  2029. operand.mode := ModeValue;
  2030. t0 := x.left.type.resolved;
  2031. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2032. ReleaseIntermediateOperand(operand.op);
  2033. operand.op := operand.tag;
  2034. IntermediateCode.InitOperand(operand.tag);
  2035. END;
  2036. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2037. result := operand;
  2038. ELSE HALT(100)
  2039. END;
  2040. destination := dest;
  2041. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2042. END VisitUnaryExpression;
  2043. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2044. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2045. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2046. BEGIN
  2047. type := type.resolved;
  2048. originalType := type;
  2049. IF type IS SyntaxTree.PointerType THEN
  2050. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2051. END;
  2052. IF type IS SyntaxTree.ObjectType THEN
  2053. BrL(trueL);
  2054. ELSE
  2055. ASSERT(type IS SyntaxTree.RecordType);
  2056. (*
  2057. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2058. *)
  2059. ReuseCopy(left,tag);
  2060. right := TypeDescriptorAdr(type);
  2061. IF ~newObjectFile THEN
  2062. IntermediateCode.MakeMemory(right,addressType);
  2063. END;
  2064. IF backend.cooperative THEN
  2065. repeatL := NewLabel();
  2066. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2067. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2068. END;
  2069. SetLabel(repeatL);
  2070. BreqL(trueL,left,right);
  2071. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2072. BrneL(repeatL,left,nil);
  2073. ELSIF meta.simple THEN
  2074. level := type(SyntaxTree.RecordType).Level();
  2075. (* get type desc tag of level relative to base tag *)
  2076. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2077. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2078. IntermediateCode.MakeMemory(left,addressType);
  2079. BreqL(trueL,left,right);
  2080. ELSE
  2081. level := type(SyntaxTree.RecordType).Level();
  2082. (* get type desc tag of level relative to base tag *)
  2083. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2084. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2085. IntermediateCode.MakeMemory(left,addressType);
  2086. BreqL(trueL,left,right);
  2087. END;
  2088. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2089. BrL(falseL);
  2090. END;
  2091. END TypeTest;
  2092. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  2093. BEGIN
  2094. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  2095. IF dump # NIL THEN
  2096. dump.String(s); dump.Ln;
  2097. END;
  2098. END Error;
  2099. PROCEDURE Warning(position: LONGINT; CONST s: ARRAY OF CHAR);
  2100. BEGIN
  2101. backend.diagnostics.Warning(module.module.sourceName,position,Diagnostics.Invalid,s);
  2102. IF dump # NIL THEN
  2103. dump.String(s); dump.Ln; dump.Update;
  2104. END;
  2105. END Warning;
  2106. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2107. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2108. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2109. operand:Operand;
  2110. BEGIN
  2111. previousSection := section;
  2112. Global.GetModuleName(mod,name);
  2113. Strings.Append(name,".@Trace");
  2114. Basic.ToSegmentedName(name, pooledName);
  2115. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2116. IF dump # NIL THEN dump := section.comments END;
  2117. IF backend.hasLinkRegister THEN
  2118. Emit(Push(-1, lr));
  2119. END;
  2120. variable := mod.moduleScope.firstVariable;
  2121. WHILE variable # NIL DO
  2122. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2123. Symbol(variable, operand);
  2124. register := operand.op;
  2125. CallTraceMethod(register, variable.type);
  2126. ReleaseIntermediateOperand(register);
  2127. END;
  2128. variable := variable.nextVariable;
  2129. END;
  2130. IF backend.hasLinkRegister THEN
  2131. Emit(Pop(-1, lr));
  2132. END;
  2133. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2134. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2135. Emit(Br(position,op));
  2136. INC(statCoopTraceModule, section.pc);
  2137. section := previousSection;
  2138. IF dump # NIL THEN dump := section.comments END;
  2139. END CreateTraceModuleMethod;
  2140. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2141. BEGIN
  2142. Emit (Push(position, dst));
  2143. Emit (Push(position, src));
  2144. CallThis(position,"GarbageCollector","Assign", 2);
  2145. END CallAssignPointer;
  2146. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2147. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2148. BEGIN
  2149. IF SemanticChecker.IsPointerType (type) THEN
  2150. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2151. ELSIF type.IsRecordType() THEN
  2152. Emit (Push(position,dst));
  2153. Emit (Push(position,src));
  2154. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2155. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2156. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2157. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2158. ELSIF IsStaticArray(type) THEN
  2159. size := StaticArrayNumElements(type);
  2160. base := StaticArrayBaseType(type);
  2161. IF base.IsRecordType() THEN
  2162. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2163. Emit (Push(position, dst));
  2164. Emit (Push(position, src));
  2165. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2166. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2167. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2168. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2169. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2170. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2171. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2172. Emit (Push(position, dst));
  2173. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2174. Emit (Push(position, src));
  2175. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2176. ELSE
  2177. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2178. Emit (Push(position, dst));
  2179. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2180. Emit (Push(position, src));
  2181. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2182. ASSERT(StaticArrayBaseType(type).IsPointer());
  2183. END;
  2184. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2185. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2186. Emit (Push(position, dst));
  2187. Emit (Push(position, src));
  2188. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2189. ELSE HALT(100); (* missing ? *)
  2190. END;
  2191. END CallAssignMethod;
  2192. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2193. VAR name: Basic.SegmentedName;
  2194. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2195. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2196. context: Context;
  2197. BEGIN
  2198. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2199. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2200. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2201. GetRecordTypeName (recordType,name);
  2202. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2203. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2204. IF dump # NIL THEN dump := section.comments END;
  2205. IF backend.hasLinkRegister THEN
  2206. Emit(Push(-1, lr));
  2207. END;
  2208. variable := recordType.recordScope.firstVariable;
  2209. WHILE variable # NIL DO
  2210. IF variable.NeedsTrace() THEN
  2211. dst := NewRegisterOperand (addressType);
  2212. src := NewRegisterOperand (addressType);
  2213. Emit (Mov(position, dst, parameter1));
  2214. Emit (Mov(position, src, parameter2));
  2215. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2216. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2217. CallAssignMethod(dst, src, variable.type);
  2218. ReleaseIntermediateOperand(src);
  2219. ReleaseIntermediateOperand(dst);
  2220. END;
  2221. variable := variable.nextVariable;
  2222. END;
  2223. recordBase := recordType.GetBaseRecord();
  2224. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2225. IF backend.hasLinkRegister THEN
  2226. Emit(Pop(-1, lr));
  2227. END;
  2228. GetRecordTypeName (recordBase,name);
  2229. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2230. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2231. Emit(Br(position,op));
  2232. ELSE
  2233. Emit(Exit(position,0,0));
  2234. END;
  2235. IF ~recordType.isObject THEN
  2236. GetRecordTypeName (recordType,name);
  2237. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2238. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2239. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2240. NEW(registerUsageCount);
  2241. usedRegisters := NIL;
  2242. dst := NewRegisterOperand (addressType);
  2243. src := NewRegisterOperand (addressType);
  2244. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2245. Emit(Mov(position, dst, parameter1));
  2246. Emit(Mov(position, src, parameter2));
  2247. label := NewLabel();
  2248. SetLabel(label);
  2249. Emit(Push(position, dst));
  2250. Emit(Push(position, src));
  2251. GetRecordTypeName (recordType,name);
  2252. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2253. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2254. Emit(Call(position, op, 0));
  2255. Emit(Pop(position, src));
  2256. Emit(Pop(position, dst));
  2257. Emit(Add(position, dst, dst, ofs));
  2258. Emit(Add(position, src, src, ofs));
  2259. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2260. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2261. Emit(Exit(position,0,0));
  2262. END;
  2263. INC(statCoopAssignProcedure, section.pc);
  2264. ReturnToContext(context);
  2265. IF dump # NIL THEN dump := section.comments END;
  2266. END CreateAssignProcedure;
  2267. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2268. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2269. BEGIN
  2270. IF IsUnsafePointer (type) THEN
  2271. skip := NewLabel();
  2272. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2273. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2274. BreqL (skip, op, nil);
  2275. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2276. SetLabel (skip);
  2277. ELSIF SemanticChecker.IsPointerType (type) THEN
  2278. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2279. CallThis(position,"GarbageCollector","Mark", 1);
  2280. ELSIF type.IsRecordType() THEN
  2281. Emit (Push(position,register));
  2282. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2283. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2284. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2285. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2286. ELSIF IsStaticArray(type) THEN
  2287. size := StaticArrayNumElements(type);
  2288. base := StaticArrayBaseType(type);
  2289. IF base.IsRecordType() THEN
  2290. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2291. Emit (Push(position, register));
  2292. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2293. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2294. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2295. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2296. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2297. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2298. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2299. Emit (Push(position, register));
  2300. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2301. ELSE
  2302. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2303. Emit (Push(position, register));
  2304. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2305. ASSERT(base.IsPointer());
  2306. END;
  2307. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2308. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2309. CallThis(position,"GarbageCollector","Mark", 1);
  2310. ELSE HALT(100); (* missing ? *)
  2311. END;
  2312. END CallTraceMethod;
  2313. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2314. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2315. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2316. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2317. BEGIN
  2318. previousSection := section;
  2319. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2320. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2321. GetRecordTypeName (recordType,name);
  2322. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2323. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2324. IF dump # NIL THEN dump := section.comments END;
  2325. IF backend.hasLinkRegister THEN
  2326. Emit(Push(-1, lr));
  2327. END;
  2328. variable := recordType.recordScope.firstVariable;
  2329. WHILE variable # NIL DO
  2330. IF variable.NeedsTrace() THEN
  2331. register := NewRegisterOperand (addressType);
  2332. Emit (Mov(position,register,parameter1));
  2333. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2334. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2335. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2336. END;
  2337. CallTraceMethod(register, variable.type);
  2338. ReleaseIntermediateOperand(register);
  2339. END;
  2340. variable := variable.nextVariable;
  2341. END;
  2342. recordBase := recordType.GetBaseRecord();
  2343. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2344. recordBase := recordBase.GetBaseRecord();
  2345. END;
  2346. IF recordBase # NIL THEN
  2347. IF backend.hasLinkRegister THEN
  2348. Emit(Pop(-1, lr));
  2349. END;
  2350. GetRecordTypeName (recordBase,name);
  2351. IF HasExplicitTraceMethod (recordBase) THEN
  2352. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2353. ELSE
  2354. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2355. END;
  2356. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2357. Emit(Br(position,op));
  2358. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2359. Emit(Exit(position,0,0));
  2360. ELSE
  2361. IF backend.hasLinkRegister THEN
  2362. Emit(Pop(-1, lr));
  2363. END;
  2364. IF recordType.isObject THEN
  2365. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2366. ELSE
  2367. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2368. END;
  2369. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2370. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2371. Emit(Br(position,op));
  2372. END;
  2373. IF ~recordType.isObject THEN
  2374. GetRecordTypeName (recordType,name);
  2375. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2376. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2377. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2378. NEW(registerUsageCount);
  2379. usedRegisters := NIL;
  2380. IF dump # NIL THEN dump := section.comments END;
  2381. register := NewRegisterOperand (addressType);
  2382. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2383. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2384. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2385. END;
  2386. Emit (Push(position,register));
  2387. GetRecordTypeName (recordType,name);
  2388. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2389. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2390. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2391. ReleaseIntermediateOperand(register);
  2392. Emit(Exit(position,0,0));
  2393. GetRecordTypeName (recordType,name);
  2394. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2395. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2396. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2397. NEW(registerUsageCount);
  2398. usedRegisters := NIL;
  2399. register := NewRegisterOperand (addressType);
  2400. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2401. Emit(Mov(position, register, parameter1));
  2402. label := NewLabel();
  2403. SetLabel(label);
  2404. Emit(Push(position, register));
  2405. GetRecordTypeName (recordType,name);
  2406. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2407. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2408. Emit(Call(position, op, 0));
  2409. Emit(Pop(position, register));
  2410. Emit(Add(position, register, register, ofs));
  2411. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2412. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2413. Emit(Exit(position,0,0));
  2414. END;
  2415. INC(statCoopTraceMethod, section.pc);
  2416. ReturnToContext(context);
  2417. IF dump # NIL THEN dump := section.comments END;
  2418. END CreateTraceMethod;
  2419. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2420. VAR name: Basic.SegmentedName;
  2421. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2422. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2423. context: Context;
  2424. BEGIN
  2425. IF recordType.isObject THEN RETURN END;
  2426. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2427. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2428. GetRecordTypeName (recordType,name);
  2429. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2430. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2431. IF dump # NIL THEN dump := section.comments END;
  2432. IF backend.hasLinkRegister THEN
  2433. Emit(Push(-1, lr));
  2434. END;
  2435. variable := recordType.recordScope.firstVariable;
  2436. WHILE variable # NIL DO
  2437. IF variable.NeedsTrace() THEN
  2438. dst := NewRegisterOperand (addressType);
  2439. Emit (Mov(position, dst, parameter1));
  2440. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2441. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2442. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2443. END;
  2444. CallResetProcedure(dst, nil, variable.type);
  2445. ReleaseIntermediateOperand(dst);
  2446. END;
  2447. variable := variable.nextVariable;
  2448. END;
  2449. recordBase := recordType.GetBaseRecord();
  2450. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2451. IF backend.hasLinkRegister THEN
  2452. Emit(Pop(-1, lr));
  2453. END;
  2454. GetRecordTypeName (recordBase,name);
  2455. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2456. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2457. Emit(Br(position,op));
  2458. ELSE
  2459. Emit(Exit(position,0,0));
  2460. END;
  2461. GetRecordTypeName (recordType,name);
  2462. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2463. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2464. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2465. NEW(registerUsageCount);
  2466. usedRegisters := NIL;
  2467. dst := NewRegisterOperand (addressType);
  2468. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2469. Emit(Mov(position, dst, parameter1));
  2470. label := NewLabel();
  2471. SetLabel(label);
  2472. Emit(Push(position, dst));
  2473. GetRecordTypeName (recordType,name);
  2474. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2475. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2476. Emit(Call(position, op, 0));
  2477. Emit(Pop(position, dst));
  2478. Emit(Add(position, dst, dst, ofs));
  2479. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2480. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2481. Emit(Exit(position,0,0));
  2482. INC(statCoopResetProcedure, section.pc);
  2483. ReturnToContext(context);
  2484. IF dump # NIL THEN dump := section.comments END;
  2485. END CreateResetProcedure;
  2486. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2487. VAR name: Basic.SegmentedName; context: Context;
  2488. BEGIN
  2489. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2490. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2491. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2492. IF dump # NIL THEN dump := section.comments END;
  2493. IF backend.hasLinkRegister THEN
  2494. Emit(Push(-1, lr));
  2495. END;
  2496. Emit(Push(position,fp));
  2497. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2498. ResetVariables(scope);
  2499. Emit(Pop(position,fp));
  2500. Emit(Exit(position,0,0));
  2501. ReturnToContext(context);
  2502. IF dump # NIL THEN dump := section.comments END;
  2503. END CreateResetMethod;
  2504. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2505. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2506. BEGIN
  2507. IF SemanticChecker.IsPointerType (type) THEN
  2508. Emit (Push(position, dest));
  2509. CallThis(position,"GarbageCollector","Reset", 1);
  2510. ELSIF type.IsRecordType() THEN
  2511. Emit (Push(position, dest));
  2512. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2513. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2514. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2515. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2516. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2517. size := GetArrayLength(type, tag);
  2518. base := ArrayBaseType(type);
  2519. IF base.IsRecordType() THEN
  2520. Emit (Push(position, size));
  2521. Emit (Push(position, dest));
  2522. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2523. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2524. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2525. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2526. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2527. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2528. Emit (Push(position, size));
  2529. Emit (Push(position, dest));
  2530. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2531. ELSE
  2532. Emit (Push(position, size));
  2533. Emit (Push(position, dest));
  2534. CallThis(position,"GarbageCollector","ResetArray", 2);
  2535. ASSERT(ArrayBaseType(type).IsPointer());
  2536. END;
  2537. ReleaseIntermediateOperand(size);
  2538. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2539. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2540. Emit (Push(position, dest));
  2541. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2542. ELSE HALT(100); (* missing ? *)
  2543. END;
  2544. END CallResetProcedure;
  2545. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2546. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2547. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2548. VAR operand: Operand;
  2549. BEGIN
  2550. Symbol (symbol, operand);
  2551. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2552. ReleaseOperand(operand);
  2553. END Reset;
  2554. BEGIN
  2555. previousScope := currentScope;
  2556. currentScope := scope;
  2557. pc := section.pc;
  2558. variable := scope.firstVariable;
  2559. WHILE variable # NIL DO
  2560. IF variable.NeedsTrace() THEN
  2561. Reset (variable);
  2562. END;
  2563. variable := variable.nextVariable;
  2564. END;
  2565. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2566. WHILE parameter # NIL DO
  2567. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2568. Reset (parameter);
  2569. END;
  2570. parameter := parameter.nextParameter;
  2571. END;
  2572. INC(statCoopResetVariables, section.pc - pc);
  2573. currentScope := previousScope;
  2574. END ResetVariables;
  2575. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2576. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2577. VAR op: IntermediateCode.Operand; context: Context;
  2578. BEGIN
  2579. previousSection := section;
  2580. GetCodeSectionNameForSymbol(procedure, name);
  2581. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  2582. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE));
  2583. IF dump # NIL THEN dump := section.comments END;
  2584. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2585. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2586. Emit(Data(position,op));
  2587. Emit(Data(position,nil));
  2588. IF HasPointers (procedure.procedureScope) THEN
  2589. GetCodeSectionNameForSymbol(procedure, name);
  2590. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2591. ELSE
  2592. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2593. END;
  2594. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2595. Emit(Data(position,op));
  2596. ReturnToContext(context);
  2597. IF dump # NIL THEN dump := section.comments END;
  2598. END CreateProcedureDescriptor;
  2599. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2600. VAR import: SyntaxTree.Import;
  2601. s: Basic.MessageString;
  2602. selfName: SyntaxTree.IdentifierString;
  2603. BEGIN
  2604. moduleScope.ownerModule.GetName(selfName);
  2605. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2606. module := moduleScope.ownerModule
  2607. ELSE
  2608. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2609. IF import = NIL THEN
  2610. import := SyntaxTree.NewImport(-1,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2611. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2612. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2613. s := "Module ";
  2614. Strings.Append(s,moduleName);
  2615. Strings.Append(s," cannot be imported.");
  2616. IF force THEN
  2617. Error(position,s);
  2618. ELSIF canBeLoaded THEN
  2619. Strings.Append(s, "=> no dynamic linking.");
  2620. Warning(position, s);
  2621. canBeLoaded := FALSE;
  2622. END;
  2623. RETURN FALSE
  2624. ELSE
  2625. SELF.module.imports.AddName(moduleName)
  2626. END;
  2627. ELSIF import.module = NIL THEN (* already tried *)
  2628. RETURN FALSE
  2629. END;
  2630. module := import.module;
  2631. END;
  2632. RETURN TRUE
  2633. END AddImport;
  2634. (* needed for old binary object file format*)
  2635. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2636. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2637. BEGIN
  2638. IF AddImport(moduleName,module,TRUE) THEN
  2639. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2640. IF procedure = NIL THEN
  2641. s := "Instruction not supported on target, emulation procedure ";
  2642. Strings.Append(s,moduleName);
  2643. Strings.Append(s,".");
  2644. Strings.Append(s,procedureName);
  2645. Strings.Append(s," not present");
  2646. Error(position,s);
  2647. ELSE
  2648. StaticCallOperand(r,procedure);
  2649. ReleaseOperand(r);
  2650. fp := GetFingerprint(procedure);
  2651. END;
  2652. END;
  2653. END EnsureSymbol;
  2654. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2655. VAR exit: Label; trueL,falseL: Label;
  2656. BEGIN
  2657. trueL := NewLabel();
  2658. falseL := NewLabel();
  2659. exit := NewLabel();
  2660. Condition(x,trueL,falseL);
  2661. InitOperand(result,ModeValue);
  2662. SetLabel(trueL);
  2663. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2664. Emit(Mov(position,result.op,true));
  2665. BrL(exit);
  2666. SetLabel(falseL);
  2667. Emit(MovReplace(position,result.op,false));
  2668. SetLabel(exit);
  2669. END ConditionToValue;
  2670. PROCEDURE ValueToCondition(VAR op: Operand);
  2671. BEGIN
  2672. LoadValue(op,system.booleanType);
  2673. BrneL(trueLabel,op.op, false);
  2674. ReleaseOperand(op);
  2675. BrL(falseLabel);
  2676. END ValueToCondition;
  2677. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2678. VAR size: LONGINT;
  2679. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2680. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2681. BEGIN
  2682. ASSERT(type.form = SyntaxTree.Open);
  2683. baseType := type.arrayBase.resolved;
  2684. IF IsOpenArray(baseType) THEN
  2685. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2686. ELSE
  2687. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2688. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2689. END;
  2690. len := tag;
  2691. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2692. IntermediateCode.MakeMemory(len,addressType);
  2693. UseIntermediateOperand(len);
  2694. Reuse2(res,sizeOperand,len);
  2695. Emit(Mul(position,res,sizeOperand,len));
  2696. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2697. RETURN res
  2698. END GetArraySize;
  2699. BEGIN
  2700. type := type.resolved;
  2701. IF IsOpenArray(type) THEN
  2702. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2703. RETURN tag
  2704. ELSE
  2705. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2706. END;
  2707. ELSE
  2708. size := ToMemoryUnits(system,system.SizeOf(type));
  2709. RETURN IntermediateCode.Immediate(addressType,size)
  2710. END;
  2711. END GetDynamicSize;
  2712. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2713. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2714. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2715. BEGIN
  2716. ASSERT(type.form = SyntaxTree.Open);
  2717. baseType := type.arrayBase.resolved;
  2718. IF IsOpenArray(baseType) THEN
  2719. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2720. ELSE
  2721. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2722. END;
  2723. len := tag;
  2724. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2725. IntermediateCode.MakeMemory(len,addressType);
  2726. UseIntermediateOperand(len);
  2727. Reuse2(res,sizeOperand,len);
  2728. Emit(Mul(position,res,sizeOperand,len));
  2729. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2730. RETURN res
  2731. END GetLength;
  2732. BEGIN
  2733. type := type.resolved;
  2734. IF IsOpenArray(type) THEN
  2735. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2736. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2737. ELSE
  2738. RETURN IntermediateCode.Immediate(addressType,1)
  2739. END;
  2740. END GetArrayLength;
  2741. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2742. VAR result: IntermediateCode.Operand;
  2743. BEGIN
  2744. IF backend.cooperative THEN
  2745. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2746. ELSE
  2747. MakeMemory(result, tag, addressType, 0);
  2748. END;
  2749. RETURN result
  2750. END GetSizeFromTag;
  2751. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2752. VAR parameter: SyntaxTree.Parameter;
  2753. BEGIN
  2754. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2755. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2756. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2757. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2758. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2759. END;
  2760. RETURN GetDynamicSize(e.type, tag);
  2761. END GetArrayOfBytesSize;
  2762. (*
  2763. to find imported symbol. not needed ?
  2764. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2765. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2766. BEGIN
  2767. IF AddImport(moduleName,importedModule,FALSE) THEN
  2768. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2769. RETURN symbol
  2770. ELSE
  2771. RETURN NIL
  2772. END
  2773. END SymbolByName;
  2774. *)
  2775. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2776. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2777. BEGIN
  2778. IF AddImport(moduleName,runtimeModule,force) THEN
  2779. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2780. IF procedure = NIL THEN
  2781. s := "Procedure ";
  2782. Strings.Append(s,moduleName);
  2783. Strings.Append(s,".");
  2784. Strings.Append(s,procedureName);
  2785. Strings.Append(s," not present");
  2786. Error(position,s);
  2787. RETURN FALSE
  2788. ELSE
  2789. RETURN TRUE
  2790. END;
  2791. ELSE RETURN FALSE
  2792. END;
  2793. END GetRuntimeProcedure;
  2794. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2795. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2796. s: Basic.MessageString;
  2797. BEGIN
  2798. Basic.InitSegmentedName(name);
  2799. name[0] := Basic.MakeString(moduleName);
  2800. name[1] := Basic.MakeString(typeName);
  2801. name[2] := -1;
  2802. IF AddImport(moduleName,importedModule, FALSE) THEN
  2803. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2804. IF symbol = NIL THEN
  2805. s := "type ";
  2806. Strings.Append(s,moduleName);
  2807. Strings.Append(s,".");
  2808. Strings.Append(s,typeName);
  2809. Strings.Append(s," not present");
  2810. Error(position,s);
  2811. END;
  2812. ELSE symbol := NIL;
  2813. END;
  2814. IF importedModule = moduleScope.ownerModule THEN
  2815. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2816. ELSE
  2817. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2818. END;
  2819. RETURN symbol
  2820. END GetTypeDescriptor;
  2821. (* 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. *)
  2822. PROCEDURE CallThisChecked(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2823. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2824. pooledName: Basic.SegmentedName; size: LONGINT;
  2825. BEGIN
  2826. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2827. StaticCallOperand(result,procedure);
  2828. IF numberParameters < 0 THEN
  2829. size := ProcedureParametersSize(system,procedure);
  2830. ELSE
  2831. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2832. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2833. Error(position,"runtime call parameter count mismatch");
  2834. END;
  2835. END;
  2836. Emit(Call(position, result.op, size));
  2837. ReleaseOperand(result);
  2838. ELSE (* only static linking possible *)
  2839. ASSERT(numberParameters >= 0);
  2840. Basic.InitSegmentedName(pooledName);
  2841. pooledName[0] := Basic.MakeString(moduleName);
  2842. pooledName[1] := Basic.MakeString(procedureName);
  2843. pooledName[2] := -1;
  2844. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2845. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2846. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2847. END;
  2848. END CallThisChecked;
  2849. (* 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. *)
  2850. PROCEDURE CallThis(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2851. BEGIN
  2852. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2853. END CallThis;
  2854. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2855. VAR
  2856. left,right: Operand;
  2857. leftSize, rightSize: IntermediateCode.Operand;
  2858. saved: RegisterEntry;
  2859. reg: IntermediateCode.Operand;
  2860. procedureName: SyntaxTree.IdentifierString;
  2861. BEGIN
  2862. procedureName := "CompareString";
  2863. SaveRegisters();ReleaseUsedRegisters(saved);
  2864. Designate(leftExpression,left);
  2865. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2866. Emit(Push(position,leftSize));
  2867. ReleaseIntermediateOperand(leftSize);
  2868. Emit(Push(position,left.op));
  2869. ReleaseOperand(left);
  2870. Designate(rightExpression,right);
  2871. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2872. Emit(Push(position,rightSize));
  2873. ReleaseIntermediateOperand(rightSize);
  2874. Emit(Push(position,right.op));
  2875. ReleaseOperand(right);
  2876. IF backend.cooperative THEN
  2877. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2878. ELSE
  2879. CallThis(position,runtimeModuleName,procedureName, 4);
  2880. END;
  2881. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2882. Emit(Result(position,reg));
  2883. (*
  2884. AcquireThisRegister(int8,IntermediateCode.Result);
  2885. *)
  2886. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2887. (*
  2888. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2889. *)
  2890. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2891. ReleaseIntermediateOperand(reg);
  2892. BrL(falseLabel);
  2893. END CompareString;
  2894. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2895. VAR
  2896. left,right: Operand;
  2897. leftSize, rightSize: IntermediateCode.Operand;
  2898. saved: RegisterEntry;
  2899. procedureName: SyntaxTree.IdentifierString;
  2900. BEGIN
  2901. procedureName := "CopyString";
  2902. SaveRegisters();ReleaseUsedRegisters(saved);
  2903. Designate(leftExpression,left);
  2904. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2905. Emit(Push(position,leftSize));
  2906. ReleaseIntermediateOperand(leftSize);
  2907. Emit(Push(position,left.op));
  2908. ReleaseOperand(left);
  2909. Designate(rightExpression,right);
  2910. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2911. Emit(Push(position,rightSize));
  2912. ReleaseIntermediateOperand(rightSize);
  2913. Emit(Push(position,right.op));
  2914. ReleaseOperand(right);
  2915. IF backend.cooperative THEN
  2916. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2917. ELSE
  2918. CallThis(position,runtimeModuleName,procedureName,4);
  2919. END;
  2920. RestoreRegisters(saved);
  2921. END CopyString;
  2922. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  2923. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2924. leftType,rightType: SyntaxTree.Type;
  2925. leftExpression,rightExpression : SyntaxTree.Expression;
  2926. componentType: IntermediateCode.Type;
  2927. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  2928. size: LONGINT;
  2929. BEGIN
  2930. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2931. dest := destination; destination := emptyOperand;
  2932. leftType := x.left.type.resolved;
  2933. rightType := x.right.type.resolved;
  2934. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  2935. CASE x.operator OF
  2936. Scanner.Or:
  2937. (* shortcut evaluation of left OR right *)
  2938. IF ~conditional THEN ConditionToValue(x);
  2939. ELSE
  2940. next := NewLabel();
  2941. Condition(x.left,trueLabel,next);
  2942. SetLabel(next);
  2943. Condition(x.right,trueLabel,falseLabel);
  2944. END;
  2945. |Scanner.And:
  2946. (* shortcut evaluation of left & right *)
  2947. IF ~conditional THEN ConditionToValue(x);
  2948. ELSE
  2949. next := NewLabel();
  2950. Condition(x.left,next,falseLabel);
  2951. SetLabel(next);
  2952. Condition(x.right,trueLabel,falseLabel);
  2953. END;
  2954. |Scanner.Is:
  2955. IF ~conditional THEN ConditionToValue(x);
  2956. ELSE
  2957. (* get type desc tag *)
  2958. IF IsPointerToRecord(leftType,recordType) THEN
  2959. Evaluate(x.left,left);
  2960. Dereference(left,recordType,IsUnsafePointer(leftType))
  2961. ELSE
  2962. Designate(x.left,left);
  2963. END;
  2964. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  2965. ReleaseOperand(left);
  2966. END;
  2967. |Scanner.Plus:
  2968. Evaluate(x.left,left);
  2969. Evaluate(x.right,right);
  2970. IF leftType IS SyntaxTree.SetType THEN
  2971. InitOperand(result,ModeValue);
  2972. Reuse2a(result.op,left.op,right.op,dest);
  2973. Emit(Or(position,result.op,left.op,right.op));
  2974. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2975. InitOperand(result,ModeValue);
  2976. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2977. Reuse2(result.tag,left.tag,right.tag);
  2978. Emit(Add(position,result.op,left.op,right.op));
  2979. Emit(Add(position,result.tag,left.tag,right.tag))
  2980. ELSE
  2981. InitOperand(result,ModeValue);
  2982. Reuse2a(result.op,left.op,right.op,dest);
  2983. Emit(Add(position,result.op,left.op,right.op));
  2984. END;
  2985. ReleaseOperand(left); ReleaseOperand(right);
  2986. |Scanner.Minus:
  2987. Evaluate(x.left,left);
  2988. Evaluate(x.right,right);
  2989. IF leftType IS SyntaxTree.SetType THEN
  2990. InitOperand(result,ModeValue);
  2991. Reuse1(result.op,right.op);
  2992. Emit(Not(position,result.op,right.op));
  2993. ReleaseOperand(right);
  2994. Emit(And(position,result.op,result.op,left.op));
  2995. ReleaseOperand(left);
  2996. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2997. InitOperand(result,ModeValue);
  2998. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2999. Reuse2(result.tag,left.tag,right.tag);
  3000. Emit(Sub(position,result.op,left.op,right.op));
  3001. Emit(Sub(position,result.tag,left.tag,right.tag));
  3002. ReleaseOperand(left); ReleaseOperand(right)
  3003. ELSE
  3004. InitOperand(result,ModeValue);
  3005. Reuse2a(result.op,left.op,right.op,dest);
  3006. Emit(Sub(position,result.op,left.op,right.op));
  3007. ReleaseOperand(left); ReleaseOperand(right);
  3008. END;
  3009. |Scanner.Times:
  3010. Evaluate(x.left,left);
  3011. Evaluate(x.right,right);
  3012. IF leftType IS SyntaxTree.SetType THEN
  3013. InitOperand(result,ModeValue);
  3014. Reuse2a(result.op,left.op,right.op,dest);
  3015. Emit(And(position,result.op,left.op,right.op));
  3016. ELSIF (x.type.resolved IS SyntaxTree.IntegerType) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  3017. InitOperand(result,ModeValue);
  3018. Reuse1a(result.op,left.op,dest);
  3019. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  3020. Emit(Shl(position,result.op,left.op,right.op));
  3021. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3022. InitOperand(result, ModeValue);
  3023. componentType := left.op.type;
  3024. (* TODO: review this *)
  3025. (*
  3026. result.op = left.op * right.op - left.tag * right.tag
  3027. result.tag = left.tag * right.op + left.op * right.tag
  3028. *)
  3029. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3030. Emit(Mul(position,result.op, left.op, right.op));
  3031. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3032. Emit(Mul(position,tempReg, left.tag, right.tag));
  3033. Emit(Sub(position,result.op, result.op, tempReg));
  3034. Reuse2(result.tag, left.tag, right.op);
  3035. Emit(Mul(position,result.tag, left.tag, right.op));
  3036. Emit(Mul(position,tempReg, left.op, right.tag));
  3037. Emit(Add(position,result.tag, result.tag, tempReg));
  3038. ReleaseIntermediateOperand(tempReg)
  3039. ELSE
  3040. InitOperand(result,ModeValue);
  3041. Reuse2a(result.op,left.op,right.op,dest);
  3042. Emit(Mul(position,result.op,left.op,right.op));
  3043. END;
  3044. ReleaseOperand(left); ReleaseOperand(right);
  3045. |Scanner.Div:
  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. InitOperand(result,ModeValue);
  3050. Reuse1a(result.op,left.op,dest);
  3051. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  3052. Emit(Shr(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(Div(position,result.op,left.op,right.op));
  3066. END;
  3067. ReleaseOperand(left); ReleaseOperand(right);
  3068. |Scanner.Mod:
  3069. Evaluate(x.left,left);
  3070. Evaluate(x.right,right);
  3071. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  3072. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system,x.type),value-1);
  3073. InitOperand(result,ModeValue);
  3074. Reuse1a(result.op,left.op,dest);
  3075. Emit(And(position,result.op,left.op,right.op));
  3076. ELSE
  3077. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3078. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3079. IF ~isUnchecked THEN
  3080. exit := NewLabel();
  3081. BrltL(exit,zero,right.op);
  3082. EmitTrap(position,NegativeDivisorTrap);
  3083. SetLabel(exit);
  3084. END;
  3085. END;
  3086. InitOperand(result,ModeValue);
  3087. Reuse2a(result.op,left.op,right.op,dest);
  3088. Emit(Mod(position,result.op,left.op,right.op));
  3089. END;
  3090. ReleaseOperand(left); ReleaseOperand(right);
  3091. |Scanner.Slash:
  3092. Evaluate(x.left,left);
  3093. Evaluate(x.right,right);
  3094. IF leftType IS SyntaxTree.SetType THEN
  3095. InitOperand(result,ModeValue);
  3096. Reuse2a(result.op,left.op,right.op,dest);
  3097. Emit(Xor(position,result.op,left.op,right.op));
  3098. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3099. InitOperand(result,ModeValue);
  3100. componentType := left.op.type;
  3101. (* review this *)
  3102. (*
  3103. divisor = right.op * right.op + right.tag * right.tag
  3104. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3105. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3106. *)
  3107. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3108. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3109. Emit(Mul(position,tempReg, right.op, right.op));
  3110. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3111. Emit(Add(position,tempReg, tempReg, tempReg2));
  3112. result.op := tempReg2;
  3113. Emit(Mul(position,result.op, left.op, right.op));
  3114. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3115. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3116. Emit(Add(position,result.op, result.op, tempReg2));
  3117. Emit(Div(position,result.op, result.op, tempReg));
  3118. Reuse2(result.tag, left.tag, right.op);
  3119. Emit(Mul(position,result.tag, left.tag, right.op));
  3120. Emit(Mul(position,tempReg2, left.op, right.tag));
  3121. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3122. Emit(Div(position,result.tag, result.tag, tempReg));
  3123. ReleaseIntermediateOperand(tempReg);
  3124. ReleaseIntermediateOperand(tempReg2)
  3125. ELSE
  3126. InitOperand(result,ModeValue);
  3127. Reuse2a(result.op,left.op,right.op,dest);
  3128. Emit(Div(position,result.op,left.op,right.op));
  3129. END;
  3130. ReleaseOperand(left); ReleaseOperand(right);
  3131. |Scanner.Equal:
  3132. IF ~conditional THEN ConditionToValue(x);
  3133. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3134. CompareString(BreqL,x.left,x.right);
  3135. ELSE
  3136. Evaluate(x.left,left);
  3137. Evaluate(x.right,right);
  3138. IF leftType IS SyntaxTree.RangeType THEN
  3139. ASSERT(rightType IS SyntaxTree.RangeType);
  3140. BrneL(falseLabel, left.op, right.op); (* first *)
  3141. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3142. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3143. ReleaseOperand(left); ReleaseOperand(right);
  3144. BrL(trueLabel)
  3145. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3146. BrneL(falseLabel, left.op, right.op); (* first *)
  3147. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3148. ReleaseOperand(left); ReleaseOperand(right);
  3149. BrL(trueLabel)
  3150. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3151. (* TODO: review this *)
  3152. BrneL(falseLabel, left.op, right.op); (* real part *)
  3153. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3154. ReleaseOperand(left); ReleaseOperand(right);
  3155. BrL(trueLabel)
  3156. ELSE
  3157. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3158. ReleaseOperand(left); ReleaseOperand(right);
  3159. BrL(trueLabel);
  3160. END;
  3161. END;
  3162. |Scanner.LessEqual:
  3163. IF ~conditional THEN ConditionToValue(x);
  3164. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3165. CompareString(BrgeL,x.right,x.left);
  3166. ELSE
  3167. Evaluate(x.left,left);
  3168. Evaluate(x.right,right);
  3169. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3170. Reuse1(temp.op,right.op);
  3171. Emit(And(position,temp.op,left.op,right.op));
  3172. ReleaseOperand(right);
  3173. BreqL(trueLabel,temp.op,left.op);
  3174. BrL(falseLabel);
  3175. ReleaseOperand(temp);ReleaseOperand(left);
  3176. ELSE
  3177. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3178. ReleaseOperand(left); ReleaseOperand(right);
  3179. BrL(trueLabel);
  3180. END;
  3181. END;
  3182. |Scanner.Less:
  3183. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3184. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.LessEqual);
  3185. leftExpression.SetType(system.booleanType);
  3186. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3187. rightExpression.SetType(system.booleanType);
  3188. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3189. leftExpression.SetType(system.booleanType);
  3190. Expression(leftExpression);
  3191. ELSIF ~conditional THEN ConditionToValue(x);
  3192. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3193. CompareString(BrltL,x.left,x.right);
  3194. ELSE
  3195. Evaluate(x.left,left);
  3196. Evaluate(x.right,right);
  3197. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3198. ReleaseOperand(left); ReleaseOperand(right);
  3199. BrL(trueLabel);
  3200. END;
  3201. |Scanner.Greater:
  3202. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3203. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.GreaterEqual);
  3204. leftExpression.SetType(system.booleanType);
  3205. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3206. rightExpression.SetType(system.booleanType);
  3207. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3208. leftExpression.SetType(system.booleanType);
  3209. Expression(leftExpression);
  3210. ELSIF ~conditional THEN ConditionToValue(x);
  3211. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3212. CompareString(BrltL,x.right,x.left);
  3213. ELSE
  3214. Evaluate(x.left,left);
  3215. Evaluate(x.right,right);
  3216. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3217. ReleaseOperand(left); ReleaseOperand(right);
  3218. BrL(trueLabel);
  3219. END;
  3220. |Scanner.GreaterEqual:
  3221. IF ~conditional THEN ConditionToValue(x);
  3222. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3223. CompareString(BrgeL,x.left,x.right);
  3224. ELSE
  3225. Evaluate(x.left,left);
  3226. Evaluate(x.right,right);
  3227. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3228. Reuse1(temp.op,left.op);
  3229. Emit(And(position,temp.op,left.op,right.op));
  3230. ReleaseOperand(left);
  3231. BreqL(trueLabel, temp.op,right.op);
  3232. ReleaseOperand(temp); ReleaseOperand(right);
  3233. BrL(falseLabel);
  3234. ELSE
  3235. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3236. ReleaseOperand(left); ReleaseOperand(right);
  3237. BrL(trueLabel);
  3238. END;
  3239. END;
  3240. |Scanner.Unequal:
  3241. IF ~conditional THEN ConditionToValue(x);
  3242. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3243. CompareString(BrneL,x.left,x.right);
  3244. ELSE
  3245. Evaluate(x.left,left);
  3246. Evaluate(x.right,right);
  3247. IF leftType IS SyntaxTree.RangeType THEN
  3248. ASSERT(rightType IS SyntaxTree.RangeType);
  3249. BrneL(trueLabel, left.op, right.op); (* first *)
  3250. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3251. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3252. ReleaseOperand(left); ReleaseOperand(right);
  3253. BrL(falseLabel)
  3254. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3255. BrneL(trueLabel, left.op, right.op); (* first *)
  3256. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3257. ReleaseOperand(left); ReleaseOperand(right);
  3258. BrL(falseLabel)
  3259. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3260. (* TODO: review this *)
  3261. BrneL(trueLabel, left.op, right.op); (* real part *)
  3262. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3263. ReleaseOperand(left); ReleaseOperand(right);
  3264. BrL(falseLabel)
  3265. ELSE
  3266. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3267. ReleaseOperand(left); ReleaseOperand(right);
  3268. BrL(trueLabel);
  3269. END;
  3270. END;
  3271. |Scanner.In:
  3272. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3273. Evaluate(x.left,left);
  3274. Evaluate(x.right,right);
  3275. Convert(left.op,setType);
  3276. ReuseCopy(temp.op,right.op);
  3277. Emit(Shr(position,temp.op,temp.op,left.op));
  3278. ReleaseOperand(right); ReleaseOperand(left);
  3279. IntermediateCode.InitImmediate(one,setType,1);
  3280. Emit(And(position,temp.op,temp.op,one));
  3281. IF conditional THEN
  3282. IntermediateCode.InitImmediate(zero,setType,0);
  3283. BrneL(trueLabel,temp.op,zero);
  3284. ReleaseOperand(temp);
  3285. BrL(falseLabel);
  3286. ELSE
  3287. Convert(temp.op,bool);
  3288. result.mode := ModeValue;
  3289. result.op := temp.op;
  3290. result.tag := nil; (* may be left over from calls to evaluate *)
  3291. END;
  3292. ELSE
  3293. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3294. IF x.operator = Scanner.Questionmarks THEN
  3295. leftExpression := x.left;
  3296. rightExpression := x.right;
  3297. ELSE
  3298. leftExpression := x.right;
  3299. rightExpression := x.left;
  3300. END;
  3301. Evaluate(leftExpression, left);
  3302. Emit(Push(position,left.op));
  3303. ReleaseOperand(left);
  3304. Designate(rightExpression, right);
  3305. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3306. IF ~backend.cellsAreObjects THEN
  3307. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3308. END;
  3309. Emit(Push(position,right.op));
  3310. ReleaseOperand(right);
  3311. IF backend.cellsAreObjects THEN
  3312. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3313. ELSE
  3314. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3315. END;
  3316. InitOperand(result, ModeValue);
  3317. result.op := NewRegisterOperand(bool);
  3318. Emit(Result(position,result.op));
  3319. IF conditional THEN
  3320. IntermediateCode.InitImmediate(zero,setType,0);
  3321. BrneL(trueLabel,result.op,zero);
  3322. ReleaseOperand(result);
  3323. BrL(falseLabel);
  3324. END;
  3325. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3326. leftExpression := x.left;
  3327. rightExpression := x.right;
  3328. Evaluate(leftExpression, left);
  3329. Emit(Push(position,left.op));
  3330. ReleaseOperand(left);
  3331. Evaluate(rightExpression, right);
  3332. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3333. IF ~backend.cellsAreObjects THEN
  3334. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3335. END;
  3336. Emit(Push(position,right.op));
  3337. ReleaseOperand(right);
  3338. IF backend.cellsAreObjects THEN
  3339. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3340. ELSE
  3341. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3342. END;
  3343. InitOperand(result, ModeValue);
  3344. result.op := NewRegisterOperand(bool);
  3345. Emit(Result(position,result.op));
  3346. IF conditional THEN
  3347. IntermediateCode.InitImmediate(zero,setType,0);
  3348. BrneL(trueLabel,result.op,zero);
  3349. ReleaseOperand(result);
  3350. BrL(falseLabel);
  3351. END;
  3352. ELSE
  3353. HALT(100);
  3354. END;
  3355. END;
  3356. destination := dest;
  3357. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3358. END VisitBinaryExpression;
  3359. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3360. VAR localResult, operand: Operand;
  3361. BEGIN
  3362. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3363. InitOperand(localResult, ModeValue);
  3364. ASSERT(x.first # NIL);
  3365. Evaluate(x.first, operand);
  3366. localResult.op := operand.op;
  3367. ReleaseOperand(operand);
  3368. UseIntermediateOperand(localResult.op);
  3369. ASSERT(x.last # NIL);
  3370. Evaluate(x.last, operand);
  3371. localResult.tag := operand.op;
  3372. ReleaseOperand(operand);
  3373. UseIntermediateOperand(localResult.tag);
  3374. IF x.step # NIL THEN
  3375. Evaluate(x.step, operand);
  3376. localResult.extra := operand.op;
  3377. ReleaseOperand(operand);
  3378. UseIntermediateOperand(localResult.extra);
  3379. END;
  3380. result := localResult;
  3381. IF Trace THEN TraceExit("VisitRangeExpression") END
  3382. END VisitRangeExpression;
  3383. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3384. BEGIN
  3385. HALT(100); (* should never be evaluated *)
  3386. END VisitTensorRangeExpression;
  3387. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3388. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3389. BEGIN
  3390. IF Trace THEN TraceEnter("VisitConversion") END;
  3391. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3392. dest := destination; destination := emptyOperand;
  3393. Evaluate(x.expression,old);
  3394. InitOperand(result,ModeValue);
  3395. result.op := old.op;
  3396. ASSERT(result.op.mode # 0);
  3397. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3398. (* convert TO a complex number *)
  3399. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3400. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3401. ASSERT(result.op.mode # 0);
  3402. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3403. (* convert FROM a complex number TO a complex number*)
  3404. result.tag := old.tag;
  3405. ASSERT(result.tag.mode # 0);
  3406. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3407. ASSERT(result.tag.mode # 0)
  3408. ELSE
  3409. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3410. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3411. END
  3412. ELSE
  3413. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3414. ASSERT(result.op.mode # 0);
  3415. result.tag := old.tag; (*! probably never used *)
  3416. END;
  3417. destination := dest;
  3418. IF Trace THEN TraceExit("VisitConversion") END;
  3419. END VisitConversion;
  3420. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3421. BEGIN
  3422. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3423. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3424. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3425. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3426. END VisitTypeDeclaration;
  3427. (** designators (expressions) *)
  3428. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3429. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3430. BEGIN
  3431. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3432. IF x.left # NIL THEN Expression(x.left) END;
  3433. Symbol(x.symbol,result);
  3434. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3435. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3436. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3437. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3438. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3439. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3440. END;
  3441. END;
  3442. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3443. END VisitSymbolDesignator;
  3444. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3445. BEGIN
  3446. IF isUnchecked THEN RETURN END;
  3447. IF tagsAvailable THEN
  3448. TrapC(BrltL,index,length,IndexCheckTrap);
  3449. END;
  3450. END BoundCheck;
  3451. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3452. VAR d: IntermediateCode.Operand;
  3453. BEGIN
  3454. IF isUnchecked THEN RETURN END;
  3455. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3456. TrapC(op,dim,d,ArraySizeTrap);
  3457. ReleaseIntermediateOperand(d);
  3458. END DimensionCheck;
  3459. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3460. VAR
  3461. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3462. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3463. expression: SyntaxTree.Expression;
  3464. resultingType, leftType, baseType: SyntaxTree.Type;
  3465. skipLabel1: Label;
  3466. i, indexListSize, indexDim, rangeCount, indexCount, tensorRangeCount, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3467. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3468. variableOp: Operand;
  3469. variable: SyntaxTree.Variable;
  3470. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList; VAR indexCount: LONGINT; VAR rangeCount: LONGINT; VAR tensorRangeCount: LONGINT);
  3471. VAR expression: SyntaxTree.Expression;
  3472. BEGIN
  3473. (* count the number of indices, ranges and tensorRanges in the index list *)
  3474. indexCount := 0; rangeCount := 0; tensorRangeCount := 0;
  3475. FOR i := 0 TO parameters.Length() - 1 DO
  3476. expression := parameters.GetExpression(i);
  3477. IF expression IS SyntaxTree.TensorRangeExpression THEN INC(tensorRangeCount)
  3478. ELSIF (expression.type # NIL) & (expression.type.resolved IS SyntaxTree.RangeType) THEN INC(indexCount)
  3479. ELSE INC(indexCount)
  3480. END
  3481. END;
  3482. END CountIndices;
  3483. BEGIN
  3484. ASSERT(tagsAvailable);
  3485. resultingType := x.type.resolved; (* resulting type *)
  3486. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3487. InitOperand(localResult, ModeReference);
  3488. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3489. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3490. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3491. (* a globally defined array destination tag is available -> use and invalidate it*)
  3492. localResult.tag := arrayDestinationTag;
  3493. IntermediateCode.InitOperand(arrayDestinationTag)
  3494. ELSE
  3495. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3496. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE);
  3497. Symbol(variable, variableOp);
  3498. ReuseCopy(localResult.tag, variableOp.op);
  3499. ReleaseOperand(variableOp);
  3500. END
  3501. END;
  3502. indexListSize := x.parameters.Length();
  3503. CountIndices(x.parameters, indexCount, rangeCount, tensorRangeCount);
  3504. ASSERT(tensorRangeCount <= 1);
  3505. (* designate the array to be indexed over, perform tensor range check if known *)
  3506. Designate(x.left, array);
  3507. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3508. Dereference(array, leftType,FALSE);
  3509. IF tensorRangeCount=0 THEN
  3510. DimensionCheck(array.tag, IntermediateCode.Immediate(int32, rangeCount+indexCount), BreqL)
  3511. END
  3512. END;
  3513. (* determine source and destination dimension offsets; this depends on if the list starts with a '?' *)
  3514. IF x.parameters.GetExpression(0) IS SyntaxTree.TensorRangeExpression THEN
  3515. srcDimOffset := -indexListSize;
  3516. destDimOffset := -rangeCount
  3517. ELSE
  3518. srcDimOffset := 0;
  3519. destDimOffset := 0
  3520. END;
  3521. indexDim := 0;
  3522. (* use address of source array as basis *)
  3523. (*
  3524. ReuseCopy(localResult.op, array.op);
  3525. *)
  3526. localResult.op := array.op;
  3527. UseIntermediateOperand(localResult.op);
  3528. (* go through the index list *)
  3529. FOR i := 0 TO indexListSize - 1 DO
  3530. expression := x.parameters.GetExpression(i);
  3531. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3532. (* nothing to do *)
  3533. ELSE
  3534. (* determine which dimension of source array is currently looked at *)
  3535. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3536. (* get the memory operand pointing to array descriptor dimension *)
  3537. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3538. (* make a reusable register from it *)
  3539. ReuseCopy(srcDim, tmp);
  3540. ReleaseIntermediateOperand(tmp);
  3541. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3542. ELSE
  3543. srcDim := IntermediateCode.Immediate(int32, i)
  3544. END;
  3545. (* get length and increment of source array for current dimension *)
  3546. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3547. Convert(sourceLength.op, sizeType);
  3548. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3549. Convert(sourceIncrement.op, sizeType);
  3550. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3551. ReleaseIntermediateOperand(srcDim);
  3552. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3553. (* SINGLE INDEX *)
  3554. Evaluate(expression, index);
  3555. ReleaseIntermediateOperand(index.tag);
  3556. index.tag := emptyOperand;
  3557. Convert(index.op, sizeType);
  3558. (* lower bound check *)
  3559. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3560. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3561. ELSIF isUnchecked THEN (* do nothing *)
  3562. ELSE
  3563. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3564. END;
  3565. (* upper bound check *)
  3566. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3567. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3568. ELSIF isUnchecked THEN (* do nothing *)
  3569. ELSE
  3570. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3571. END;
  3572. ReleaseOperand(sourceLength);
  3573. Convert(index.op, addressType);
  3574. summand := index.op;
  3575. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3576. (* RANGE OF INDICES *)
  3577. Evaluate(expression, range);
  3578. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3579. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3580. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3581. ReleaseOperand(range);
  3582. Convert(firstIndex, sizeType);
  3583. Convert(lastIndex, sizeType);
  3584. Convert(stepSize, sizeType);
  3585. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3586. if it is 'MAX(LONGINT)' *)
  3587. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3588. TransferToRegister(lastIndex, lastIndex);
  3589. skipLabel1 := NewLabel();
  3590. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3591. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3592. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3593. SetLabel(skipLabel1)
  3594. END;
  3595. (* check if step size is valid *)
  3596. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3597. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3598. ELSIF isUnchecked THEN (* do nothing *)
  3599. ELSE
  3600. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3601. END;
  3602. (* check lower bound check *)
  3603. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3604. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3605. ELSIF isUnchecked THEN (* do nothing *)
  3606. ELSE
  3607. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3608. END;
  3609. (* check upper bound check *)
  3610. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3611. (* statically open range: nothing to do *)
  3612. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3613. ASSERT(staticLastIndex < staticSourceLength)
  3614. ELSIF isUnchecked THEN (* do nothing *)
  3615. ELSE
  3616. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3617. END;
  3618. (* determine length of target array for current dimension *)
  3619. (* 1. incorporate last index: *)
  3620. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3621. (* last index is static *)
  3622. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3623. targetLength := sourceLength.op
  3624. ELSE
  3625. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3626. END;
  3627. UseIntermediateOperand(targetLength);
  3628. ELSE
  3629. (* targetLength := lastIndex + 1
  3630. Reuse1(targetLength, lastIndex);
  3631. *)
  3632. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3633. END;
  3634. ReleaseOperand(sourceLength);
  3635. ReleaseIntermediateOperand(lastIndex);
  3636. (* 2. incorporate first index: *)
  3637. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3638. (* first index and current target length are static *)
  3639. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3640. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3641. (* first index = 0: nothing to do *)
  3642. ELSE
  3643. (* targetLength := targetLength - firstIndex *)
  3644. TransferToRegister(targetLength, targetLength);
  3645. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3646. END;
  3647. (* clip negative lengths to 0 *)
  3648. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3649. IF staticTargetLength < 0 THEN
  3650. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3651. END
  3652. ELSE
  3653. skipLabel1 := NewLabel();
  3654. TransferToRegister(targetLength, targetLength);
  3655. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3656. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3657. SetLabel(skipLabel1)
  3658. END;
  3659. (* 3. incorporate index step size: *)
  3660. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3661. (*step size and current target length are static *)
  3662. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3663. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3664. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3665. (* step size = 1: nothing to do *)
  3666. ELSE
  3667. (* emit code for this:
  3668. targetLength := (targetLength-1) DIV stepSize +1;
  3669. *)
  3670. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3671. DivInt(targetLength, targetLength, stepSize);
  3672. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3673. END;
  3674. (* determine increment of target array for current dimension *)
  3675. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3676. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3677. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3678. (* step size = 1 *)
  3679. targetIncrement := sourceIncrement.op;
  3680. UseIntermediateOperand(targetIncrement)
  3681. ELSE
  3682. (* targetIncrement := sourceIncrement * stepSize *)
  3683. Reuse1(targetIncrement, stepSize);
  3684. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3685. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3686. END;
  3687. ReleaseIntermediateOperand(stepSize);
  3688. (* write length and increment of target array to descriptor *)
  3689. IF destDimOffset < 0 THEN
  3690. (* determine which dimension of target array is currently looked at *)
  3691. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3692. TransferToRegister(destDim, tmp);
  3693. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, indexDim + destDimOffset));
  3694. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3695. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3696. ReleaseIntermediateOperand(destDim)
  3697. ELSE
  3698. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3699. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim)
  3700. END;
  3701. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3702. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3703. INC(indexDim);
  3704. Convert(firstIndex, addressType);
  3705. TransferToRegister(summand, firstIndex);
  3706. ELSE HALT(100);
  3707. END;
  3708. (*
  3709. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3710. *)
  3711. Convert(sourceIncrement.op, addressType);
  3712. Convert(summand, addressType);
  3713. MulInt(summand, summand, sourceIncrement.op);
  3714. ReleaseIntermediateOperand(sourceIncrement.op);
  3715. AddInt(localResult.op, localResult.op, summand);
  3716. ReleaseIntermediateOperand(summand);
  3717. END
  3718. END;
  3719. result := localResult;
  3720. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3721. ReleaseIntermediateOperand(result.tag);
  3722. result.tag := TypeDescriptorAdr(resultingType);
  3723. IF ~newObjectFile THEN
  3724. IntermediateCode.MakeMemory(result.tag,addressType);
  3725. END;
  3726. ELSIF IsDelegate(resultingType) THEN
  3727. ReleaseIntermediateOperand(result.tag);
  3728. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3729. UseIntermediateOperand(result.tag);
  3730. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3731. ReleaseIntermediateOperand(result.tag);
  3732. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3733. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3734. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3735. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3736. (* finalize target array descriptor *)
  3737. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3738. (* write lengths and increments of target array for remaining dimensions *)
  3739. i := indexListSize;
  3740. WHILE indexDim < targetArrayDimensionality DO
  3741. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3742. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3743. ReleaseOperand(sourceLength);
  3744. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3745. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3746. ReleaseOperand(sourceIncrement);
  3747. INC(i); INC(indexDim);
  3748. END;
  3749. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3750. tmp := nil;
  3751. ELSE
  3752. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3753. END;
  3754. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3755. ReleaseIntermediateOperand(tmp);
  3756. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3757. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3758. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3759. ELSE
  3760. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3761. END;
  3762. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3763. ReleaseIntermediateOperand(tmp);
  3764. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3765. (* write dimensionality *)
  3766. IF targetArrayDimensionality # 0 THEN
  3767. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3768. END;
  3769. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3770. END;
  3771. ReleaseOperand(array);
  3772. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3773. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3774. END;
  3775. END MathIndexDesignator;
  3776. (* TENTATIVE *)
  3777. PROCEDURE DumpOperand(operand: Operand);
  3778. BEGIN
  3779. D.Log.String(" op = ");
  3780. IntermediateCode.DumpOperand(D.Log, operand.op );
  3781. D.Log.Ln;
  3782. D.Log.String(" tag = ");
  3783. IntermediateCode.DumpOperand(D.Log, operand.tag );
  3784. D.Log.Ln;
  3785. D.Log.String(" extra = ");
  3786. IntermediateCode.DumpOperand(D.Log, operand.extra );
  3787. D.Log.Ln;
  3788. D.Log.Update
  3789. END DumpOperand;
  3790. (* get the length of an array , trying to make use of static information *)
  3791. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3792. VAR res: IntermediateCode.Operand; size: LONGINT;
  3793. BEGIN
  3794. type := type.resolved;
  3795. IF type IS SyntaxTree.ArrayType THEN
  3796. WITH type: SyntaxTree.ArrayType DO
  3797. IF type.form = SyntaxTree.Static THEN
  3798. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3799. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3800. Evaluate(type.length, op);
  3801. ReleaseIntermediateOperand(op.tag);
  3802. RETURN op.op;*)
  3803. ELSE
  3804. res := tag;
  3805. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3806. IntermediateCode.MakeMemory(res,addressType);
  3807. UseIntermediateOperand(res);
  3808. RETURN res
  3809. END
  3810. END;
  3811. ELSE
  3812. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3813. RETURN IntermediateCode.Immediate(addressType,size);
  3814. END;
  3815. END ArrayLength;
  3816. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3817. BEGIN
  3818. ReleaseIntermediateOperand(res);
  3819. IF IsImmediate(x) & IsImmediate(y) THEN
  3820. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3821. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3822. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3823. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3824. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3825. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3826. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3827. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3828. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3829. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3830. UseIntermediateOperand(res);
  3831. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3832. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3833. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3834. UseIntermediateOperand(res);
  3835. ELSE
  3836. IF ~ReusableRegister(res) THEN
  3837. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3838. ELSE
  3839. UseIntermediateOperand(res);
  3840. END;
  3841. IF IsImmediate(x) & (x.intValue = 0) THEN
  3842. Emit(Mov(position,res,y))
  3843. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3844. Emit(Mov(position,res,x))
  3845. ELSE
  3846. Emit(Add(position,res, x, y));
  3847. END;
  3848. END;
  3849. END AddInt;
  3850. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3851. BEGIN
  3852. ReleaseIntermediateOperand(res);
  3853. IF IsImmediate(x) & IsImmediate(y) THEN
  3854. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3855. ELSE
  3856. IF ~ReusableRegister(res) THEN
  3857. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3858. ELSE UseIntermediateOperand(res);
  3859. END;
  3860. IF IsImmediate(x) & (x.intValue = 1) THEN
  3861. Emit(Mov(position,res,y))
  3862. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3863. Emit(Mov(position,res,x))
  3864. ELSE
  3865. Emit(Mul(position,res, x, y));
  3866. END;
  3867. END;
  3868. END MulInt;
  3869. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3870. BEGIN
  3871. ReleaseIntermediateOperand(res);
  3872. IF IsImmediate(x) & IsImmediate(y) THEN
  3873. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3874. ELSE
  3875. IF ~ReusableRegister(res) THEN
  3876. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3877. ELSE UseIntermediateOperand(res);
  3878. END;
  3879. IF IsImmediate(x) & (x.intValue = 1) THEN
  3880. Emit(Mov(position,res,y))
  3881. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3882. Emit(Mov(position,res,x))
  3883. ELSE
  3884. Emit(Div(position,res, x, y));
  3885. END;
  3886. END;
  3887. END DivInt;
  3888. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3889. VAR length,res: IntermediateCode.Operand; type: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3890. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3891. BEGIN
  3892. type := x.left.type.resolved;
  3893. IF type IS SyntaxTree.StringType THEN
  3894. atype := SyntaxTree.NewArrayType(-1, NIL, SyntaxTree.Static);
  3895. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3896. atype.SetLength(Global.NewIntegerValue(system,-1, type(SyntaxTree.StringType).length));
  3897. type := atype;
  3898. x.left.SetType(type);
  3899. END;
  3900. IntermediateCode.InitImmediate(res,addressType,0);
  3901. maxDim := x.parameters.Length()-1;
  3902. FOR i := 0 TO maxDim DO
  3903. e := x.parameters.GetExpression(i);
  3904. Evaluate(e,index);
  3905. Convert(index.op,addressType);
  3906. AddInt(res, res, index.op);
  3907. IF i = 0 THEN
  3908. (*
  3909. ReuseCopy(res, index.op);
  3910. *)
  3911. Designate(x.left,array);
  3912. type := x.left.type.resolved;
  3913. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3914. Dereference(array, type, FALSE);
  3915. END;
  3916. (*
  3917. ELSE AddInt(res, res, index.op);
  3918. *)
  3919. END;
  3920. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  3921. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  3922. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  3923. BoundCheck(index.op, length);
  3924. END;
  3925. ReleaseIntermediateOperand(length);
  3926. END;
  3927. ReleaseOperand(index);
  3928. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3929. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  3930. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3931. MulInt(res,res,length);
  3932. END;
  3933. ReleaseIntermediateOperand(length);
  3934. END;
  3935. IF (type IS SyntaxTree.ArrayType) THEN
  3936. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  3937. size := StaticSize(system, type);
  3938. IF size # 1 THEN
  3939. length := IntermediateCode.Immediate(addressType,size);
  3940. MulInt(res,res,length);
  3941. END;
  3942. ELSE
  3943. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  3944. IF size # 1 THEN
  3945. length := IntermediateCode.Immediate(addressType,size);
  3946. MulInt(res,res,length);
  3947. END;
  3948. END;
  3949. END;
  3950. AddInt(res,res,array.op);
  3951. InitOperand(result,ModeReference);
  3952. result.op := res;
  3953. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  3954. ReleaseIntermediateOperand(result.tag);
  3955. result.tag := TypeDescriptorAdr(type);
  3956. IF ~newObjectFile THEN
  3957. IntermediateCode.MakeMemory(result.tag,addressType);
  3958. END
  3959. ELSIF IsDelegate(type) THEN
  3960. ReleaseIntermediateOperand(result.tag);
  3961. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3962. UseIntermediateOperand(result.tag);
  3963. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3964. ReleaseIntermediateOperand(result.tag);
  3965. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  3966. ELSIF (type IS SyntaxTree.ArrayType) THEN
  3967. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  3968. END;
  3969. ReleaseOperand(array);
  3970. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  3971. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3972. END;
  3973. END IndexDesignator;
  3974. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  3975. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  3976. BEGIN
  3977. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  3978. dest := destination; destination := emptyOperand;
  3979. type := x.left.type.resolved;
  3980. IF type IS SyntaxTree.MathArrayType THEN
  3981. MathIndexDesignator(x);
  3982. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  3983. IndexDesignator(x);
  3984. END;
  3985. destination := dest;
  3986. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  3987. END VisitIndexDesignator;
  3988. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  3989. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  3990. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  3991. procedure: SyntaxTree.Procedure;
  3992. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  3993. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  3994. BEGIN
  3995. variable := GetTemporaryVariable(expression.left.type, FALSE);
  3996. parameters := expression.parameters;
  3997. moduleName := "FoxArrayBase";
  3998. procedureName := "CopyDescriptor";
  3999. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4000. SaveRegisters();ReleaseUsedRegisters(saved);
  4001. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4002. IF procedure = NIL THEN
  4003. s := "procedure ";
  4004. Strings.Append(s,moduleName);
  4005. Strings.Append(s,".");
  4006. Strings.Append(s,procedureName);
  4007. Strings.Append(s," not present");
  4008. Error(position,s);
  4009. ELSE
  4010. (* push address of temporary variable *)
  4011. Symbol(variable,destOperand);
  4012. Emit(Push(position,destOperand.op));
  4013. ReleaseOperand(destOperand);
  4014. (* push src *)
  4015. Evaluate(expression.left,srcOperand);
  4016. (*
  4017. Dereference(srcOperand,expression.type.resolved);
  4018. Emit(Push(position,srcOperand.tag));
  4019. *)
  4020. Emit(Push(position,srcOperand.op));
  4021. ReleaseOperand(srcOperand);
  4022. tensorFound := FALSE;
  4023. FOR i := 0 TO parameters.Length()-1 DO
  4024. e := parameters.GetExpression(i);
  4025. IF e IS SyntaxTree.TensorRangeExpression THEN
  4026. tensorFound := TRUE;
  4027. ELSIF e IS SyntaxTree.RangeExpression THEN
  4028. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4029. ELSE
  4030. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4031. END;
  4032. END;
  4033. Emit(Push(position,IntermediateCode.Immediate(int32,prefixIndices)));
  4034. Emit(Push(position,IntermediateCode.Immediate(int32,prefixRanges)));
  4035. Emit(Push(position,IntermediateCode.Immediate(int32,suffixIndices)));
  4036. Emit(Push(position,IntermediateCode.Immediate(int32,suffixRanges)));
  4037. StaticCallOperand(procOp,procedure);
  4038. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  4039. ReleaseOperand(procOp);
  4040. END;
  4041. RestoreRegisters(saved);
  4042. END;
  4043. RETURN variable
  4044. END PrepareTensorDescriptor;
  4045. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4046. VAR
  4047. type, descriptorType, baseType: SyntaxTree.Type;
  4048. operand, tmpOperand, variableOp, variable2Op: Operand;
  4049. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4050. variable, variable2: SyntaxTree.Variable;
  4051. dim, i, size: LONGINT;
  4052. (* TODO: needed? *)
  4053. oldArrayDestinationTag: IntermediateCode.Operand;
  4054. oldArrayDestinationDimension: LONGINT;
  4055. position: LONGINT;
  4056. saved: RegisterEntry;
  4057. arrayFlags: SET;
  4058. m, n: LONGINT;
  4059. PROCEDURE Pass(op: IntermediateCode.Operand);
  4060. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4061. BEGIN
  4062. IF numberRegister >= 0 THEN
  4063. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  4064. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4065. Emit(Mov(position,parameterRegister, op));
  4066. ELSE
  4067. Emit(Push(position,op))
  4068. END
  4069. END Pass;
  4070. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4071. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4072. BEGIN
  4073. formalType := formalType.resolved; actualType := actualType.resolved;
  4074. IF IsOpenArray(formalType)THEN
  4075. IF actualType IS SyntaxTree.StringType THEN
  4076. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4077. RETURN;
  4078. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4079. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4080. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4081. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4082. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4083. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4084. ELSE
  4085. tmp := baseReg;
  4086. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4087. IntermediateCode.MakeMemory(tmp,addressType);
  4088. Pass((tmp));
  4089. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4090. END;
  4091. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4092. END;
  4093. END PushArrayLens;
  4094. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4095. BEGIN
  4096. CASE size OF
  4097. |2: INCL(flags,Size2Flag);
  4098. |3: INCL(flags,Size3Flag);
  4099. |4: INCL(flags,Size4Flag);
  4100. |5: INCL(flags,Size5Flag);
  4101. |6: INCL(flags,Size6Flag);
  4102. |7: INCL(flags,Size7Flag);
  4103. |8: INCL(flags,Size8Flag);
  4104. END;
  4105. END SetSmallArraySizeFlag;
  4106. BEGIN
  4107. IF Trace THEN TraceEnter("PushParameter") END;
  4108. position := expression.position;
  4109. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4110. type := expression.type.resolved;
  4111. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4112. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4113. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4114. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4115. );
  4116. (* TODO: needed? *)
  4117. oldArrayDestinationTag := arrayDestinationTag;
  4118. oldArrayDestinationDimension := arrayDestinationDimension;
  4119. IF IsArrayOfSystemByte(parameter.type) THEN
  4120. Designate(expression,operand);
  4121. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4122. ReleaseIntermediateOperand(operand.tag);
  4123. operand.tag := tmp;
  4124. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4125. Pass((operand.tag));
  4126. END;
  4127. Pass((operand.op));
  4128. ELSIF IsOpenArray(parameter.type) THEN
  4129. Designate(expression,operand);
  4130. baseReg := operand.tag;
  4131. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4132. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4133. END;
  4134. Pass((operand.op)); (* address of the array *)
  4135. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4136. (* case 1 *)
  4137. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4138. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4139. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4140. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4141. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4142. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4143. arrayDestinationTag := sp;
  4144. (* case 1b *)
  4145. IF expression IS SyntaxTree.IndexDesignator THEN
  4146. (*
  4147. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4148. descriptorType := GetMathArrayDescriptorType(dim);
  4149. variable := GetTemporaryVariable(descriptorType,expression.position);
  4150. Symbol(variable,variableOp);
  4151. arrayDestinationTag := variableOp.op;
  4152. *)
  4153. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4154. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4155. arrayDestinationDimension := dim;
  4156. Designate(expression,operand);
  4157. (* case 1a *)
  4158. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4159. Designate(expression,operand);
  4160. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4161. i := 0;
  4162. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4163. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4164. INC(i);
  4165. END;
  4166. type := expression.type.resolved;
  4167. WHILE (i<dim) DO (* remaining static dimensions *)
  4168. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4169. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4170. ReleaseOperand(tmpOperand);
  4171. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4172. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4173. ReleaseOperand(tmpOperand);
  4174. INC(i);
  4175. END;
  4176. dimOp := IntermediateCode.Immediate(addressType,dim);
  4177. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4178. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4179. (* case 1d *)
  4180. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4181. Designate(expression,operand);
  4182. Dereference(operand,type.resolved,FALSE);
  4183. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4184. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4185. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4186. (* case 1f *)
  4187. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4188. Designate(expression,operand);
  4189. FOR i := 0 TO dim-1 DO
  4190. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4191. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4192. ReleaseOperand(tmpOperand);
  4193. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4194. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4195. ReleaseOperand(tmpOperand);
  4196. END;
  4197. (*******
  4198. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4199. *)
  4200. arrayFlags := {StaticFlag};
  4201. IF dim = 1 THEN
  4202. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4203. ReleaseOperand(tmpOperand);
  4204. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4205. m := LONGINT(tmpOperand.op.intValue);
  4206. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4207. ELSIF dim = 2 THEN
  4208. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4209. ReleaseOperand(tmpOperand);
  4210. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4211. m := LONGINT(tmpOperand.op.intValue);
  4212. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4213. ReleaseOperand(tmpOperand);
  4214. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4215. n := LONGINT(tmpOperand.op.intValue);
  4216. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4217. INCL(arrayFlags,SmallMatrixFlag);
  4218. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4219. END;
  4220. END;
  4221. (*******)
  4222. dimOp := IntermediateCode.Immediate(addressType,dim);
  4223. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4224. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4225. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4226. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4227. baseType := SemanticChecker.ArrayBase(type,dim);
  4228. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4229. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4230. ELSE HALT(100);
  4231. END;
  4232. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4233. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4234. (* case 2b *)
  4235. IF expression IS SyntaxTree.IndexDesignator THEN
  4236. descriptorType := GetMathArrayDescriptorType(dim);
  4237. variable := GetTemporaryVariable(descriptorType, FALSE);
  4238. Symbol(variable,variableOp);
  4239. arrayDestinationTag := variableOp.op;
  4240. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4241. arrayDestinationDimension := dim;
  4242. NeedDescriptor := TRUE;
  4243. Designate(expression,operand);
  4244. Pass((operand.tag));
  4245. NeedDescriptor := FALSE;
  4246. (* case 2a *)
  4247. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4248. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4249. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4250. INC(i);
  4251. END;
  4252. IF i = dim THEN
  4253. Designate(expression,operand);
  4254. Pass((operand.tag));
  4255. ELSE (* open-static *)
  4256. type := expression.type.resolved;
  4257. descriptorType := GetMathArrayDescriptorType(dim);
  4258. variable := GetTemporaryVariable(descriptorType, FALSE);
  4259. Symbol(variable,variableOp);
  4260. arrayDestinationTag := variableOp.op;
  4261. Designate(expression,operand);
  4262. FOR i := 0 TO dim-1 DO
  4263. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4264. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4265. ReleaseOperand(tmpOperand);
  4266. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4267. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4268. ReleaseOperand(tmpOperand);
  4269. END;
  4270. dimOp := IntermediateCode.Immediate(addressType,dim);
  4271. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4272. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4273. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4274. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4275. baseType := SemanticChecker.ArrayBase(type,dim);
  4276. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4277. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4278. Pass((arrayDestinationTag));
  4279. END;
  4280. (* case 2d *)
  4281. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4282. Designate(expression,operand);
  4283. Dereference(operand,type.resolved,FALSE);
  4284. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4285. Pass((operand.tag));
  4286. (* case 2f *)
  4287. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4288. descriptorType := GetMathArrayDescriptorType(dim);
  4289. variable := GetTemporaryVariable(descriptorType, FALSE);
  4290. Symbol(variable,variableOp);
  4291. arrayDestinationTag := variableOp.op;
  4292. Designate(expression,operand);
  4293. FOR i := 0 TO dim-1 DO
  4294. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4295. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4296. ReleaseOperand(tmpOperand);
  4297. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4298. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4299. ReleaseOperand(tmpOperand);
  4300. END;
  4301. (*
  4302. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4303. *)
  4304. arrayFlags := {StaticFlag};
  4305. IF dim = 1 THEN
  4306. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4307. ReleaseOperand(tmpOperand);
  4308. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4309. m := LONGINT(tmpOperand.op.intValue);
  4310. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4311. ELSIF dim = 2 THEN
  4312. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4313. ReleaseOperand(tmpOperand);
  4314. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4315. m := LONGINT(tmpOperand.op.intValue);
  4316. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4317. ReleaseOperand(tmpOperand);
  4318. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4319. n := LONGINT(tmpOperand.op.intValue);
  4320. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4321. INCL(arrayFlags,SmallMatrixFlag);
  4322. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4323. END;
  4324. END;
  4325. (*******)
  4326. dimOp := IntermediateCode.Immediate(addressType,dim);
  4327. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4328. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4329. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4330. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4331. baseType := SemanticChecker.ArrayBase(type,dim);
  4332. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4333. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4334. Pass((arrayDestinationTag));
  4335. ELSE HALT(100);
  4336. END;
  4337. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4338. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4339. (* case 3b *)
  4340. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4341. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4342. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4343. Symbol(variable,variableOp);
  4344. LoadValue(variableOp,system.addressType);
  4345. ELSE
  4346. descriptorType := GetMathArrayDescriptorType(dim);
  4347. variable := GetTemporaryVariable(descriptorType, FALSE);
  4348. Symbol(variable,variableOp);
  4349. END;
  4350. arrayDestinationTag := variableOp.op;
  4351. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4352. arrayDestinationDimension := 0;
  4353. Designate(expression,operand);
  4354. Pass((operand.tag));
  4355. (* case 3a *)
  4356. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4357. i := 0;
  4358. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4359. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4360. INC(i);
  4361. END;
  4362. IF i = dim THEN
  4363. Designate(expression,operand);
  4364. Pass((operand.tag));
  4365. ELSE (* open-static *)
  4366. type := expression.type.resolved;
  4367. descriptorType := GetMathArrayDescriptorType(dim);
  4368. variable := GetTemporaryVariable(descriptorType, FALSE);
  4369. Symbol(variable,variableOp);
  4370. arrayDestinationTag := variableOp.op;
  4371. Designate(expression,operand);
  4372. FOR i := 0 TO dim-1 DO
  4373. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4374. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4375. ReleaseOperand(tmpOperand);
  4376. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4377. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4378. ReleaseOperand(tmpOperand);
  4379. END;
  4380. dimOp := IntermediateCode.Immediate(addressType,dim);
  4381. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4382. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4383. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4384. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4385. baseType := SemanticChecker.ArrayBase(type,dim);
  4386. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4387. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4388. Pass((arrayDestinationTag));
  4389. END;
  4390. (* case 3d *)
  4391. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4392. Designate(expression,operand);
  4393. Dereference(operand,type.resolved,FALSE);
  4394. (*
  4395. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4396. *)
  4397. Pass((operand.tag));
  4398. (* case 3f *)
  4399. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4400. descriptorType := GetMathArrayDescriptorType(dim);
  4401. variable := GetTemporaryVariable(descriptorType, FALSE);
  4402. Symbol(variable,variableOp);
  4403. arrayDestinationTag := variableOp.op;
  4404. Designate(expression,operand);
  4405. IF operand.op.type.length >1 THEN (* vector register *)
  4406. variable2 := GetTemporaryVariable(type, FALSE);
  4407. Symbol(variable2, variable2Op);
  4408. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4409. Emit(Mov(position,tmp, operand.op));
  4410. ReleaseOperand(operand);
  4411. Symbol(variable2, operand);
  4412. END;
  4413. FOR i := 0 TO dim-1 DO
  4414. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4415. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4416. ReleaseOperand(tmpOperand);
  4417. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4418. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4419. ReleaseOperand(tmpOperand);
  4420. END;
  4421. dimOp := IntermediateCode.Immediate(addressType,dim);
  4422. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4423. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4424. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4425. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4426. baseType := SemanticChecker.ArrayBase(type,dim);
  4427. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4428. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4429. Pass((arrayDestinationTag));
  4430. ELSE HALT(100);
  4431. END;
  4432. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4433. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4434. (* case 4b *)
  4435. IF (expression IS SyntaxTree.IndexDesignator) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4436. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4437. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4438. Symbol(variable,variableOp);
  4439. LoadValue(variableOp,system.addressType);
  4440. ELSE
  4441. descriptorType := GetMathArrayDescriptorType(dim);
  4442. variable := GetTemporaryVariable(descriptorType, FALSE);
  4443. Symbol(variable,variableOp);
  4444. END;
  4445. arrayDestinationTag := variableOp.op;
  4446. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4447. arrayDestinationDimension := 0;
  4448. Designate(expression,operand);
  4449. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4450. Symbol(variable,variableOp);
  4451. ELSE
  4452. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4453. Symbol(variable,variableOp);
  4454. MakeMemory(tmp,variableOp.op,addressType,0);
  4455. Emit(Mov(position,tmp,operand.tag));
  4456. ReleaseIntermediateOperand(tmp);
  4457. END;
  4458. Pass((variableOp.op));
  4459. ReleaseOperand(variableOp);
  4460. (* case 4a *)
  4461. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4462. i := 0;
  4463. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4464. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4465. INC(i);
  4466. END;
  4467. IF i = dim THEN
  4468. Designate(expression,operand);
  4469. arrayDestinationTag := operand.tag;
  4470. ELSE (* open-static *)
  4471. type := expression.type.resolved;
  4472. descriptorType := GetMathArrayDescriptorType(dim);
  4473. variable := GetTemporaryVariable(descriptorType, FALSE);
  4474. Symbol(variable,variableOp);
  4475. arrayDestinationTag := variableOp.op;
  4476. Designate(expression,operand);
  4477. FOR i := 0 TO dim-1 DO
  4478. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4479. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4480. ReleaseOperand(tmpOperand);
  4481. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4482. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4483. ReleaseOperand(tmpOperand);
  4484. END;
  4485. dimOp := IntermediateCode.Immediate(addressType,dim);
  4486. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4487. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4488. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4489. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4490. baseType := SemanticChecker.ArrayBase(type,dim);
  4491. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4492. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4493. END;
  4494. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4495. Symbol(variable,variableOp);
  4496. MakeMemory(tmp,variableOp.op,addressType,0);
  4497. Emit(Mov(position,tmp,arrayDestinationTag));
  4498. ReleaseIntermediateOperand(tmp);
  4499. Pass((variableOp.op));
  4500. ReleaseOperand(variableOp);
  4501. (* case 4d *)
  4502. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4503. Designate(expression,operand);
  4504. (*
  4505. Dereference(operand,type.resolved,FALSE);
  4506. *)
  4507. (*
  4508. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4509. *)
  4510. Pass((operand.op));
  4511. (* case 4f *)
  4512. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4513. descriptorType := GetMathArrayDescriptorType(dim);
  4514. variable := GetTemporaryVariable(descriptorType, FALSE);
  4515. Symbol(variable,variableOp);
  4516. arrayDestinationTag := variableOp.op;
  4517. Designate(expression,operand);
  4518. FOR i := 0 TO dim-1 DO
  4519. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4520. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4521. ReleaseOperand(tmpOperand);
  4522. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4523. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4524. ReleaseOperand(tmpOperand);
  4525. END;
  4526. dimOp := IntermediateCode.Immediate(addressType,dim);
  4527. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4528. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4529. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4530. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4531. baseType := SemanticChecker.ArrayBase(type,dim);
  4532. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4533. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4534. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4535. Symbol(variable,variableOp);
  4536. MakeMemory(tmp,variableOp.op,addressType,0);
  4537. Emit(Mov(position,tmp,arrayDestinationTag));
  4538. ReleaseIntermediateOperand(tmp);
  4539. Pass((variableOp.op));
  4540. ReleaseOperand(variableOp);
  4541. ELSE HALT(100);
  4542. END;
  4543. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4544. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4545. Designate(expression,operand);
  4546. IF operand.op.type.length > 1 THEN
  4547. Emit(Push(position, operand.op));
  4548. ReleaseOperand(operand);
  4549. ELSE
  4550. size := system.SizeOf(type);
  4551. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4552. size := ToMemoryUnits(system,size);
  4553. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4554. arrayDestinationTag := sp;
  4555. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4556. END;
  4557. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4558. Designate(expression,operand);
  4559. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4560. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4561. Symbol(variable,variableOp);
  4562. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4563. Emit(Mov(position,tmp,operand.op));
  4564. Emit(Push(position,variableOp.op));
  4565. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4566. Pass((operand.op));
  4567. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4568. END;
  4569. ELSE HALT(200)
  4570. END;
  4571. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4572. IF parameter.kind = SyntaxTree.VarParameter THEN
  4573. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4574. Designate(expression, operand);
  4575. Pass((operand.op));
  4576. ELSE
  4577. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4578. Evaluate(expression, operand);
  4579. Pass((operand.extra)); (* step *)
  4580. Pass((operand.tag)); (* last *)
  4581. Pass((operand.op)) (* first *)
  4582. END
  4583. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4584. IF parameter.kind = SyntaxTree.VarParameter THEN
  4585. Designate(expression, operand);
  4586. Pass((operand.op));
  4587. ELSE
  4588. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4589. Evaluate(expression, operand);
  4590. Pass((operand.tag)); (* real part *)
  4591. Pass((operand.op)) (* imaginary part *)
  4592. END
  4593. ELSE
  4594. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4595. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4596. Designate(expression,operand);
  4597. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4598. (* stack allocation *)
  4599. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4600. (*! parameter alignment to be discussed ... *)
  4601. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4602. size := type(SyntaxTree.StringType).length;
  4603. END;
  4604. IF backend.cooperative & parameter.NeedsTrace() THEN
  4605. dst := NewRegisterOperand (addressType);
  4606. Emit(Mov(position,dst, sp));
  4607. IntermediateCode.InitImmediate(null, byteType, 0);
  4608. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4609. ReleaseIntermediateOperand(dst);
  4610. SaveRegisters();ReleaseUsedRegisters(saved);
  4611. (* register dst has been freed before SaveRegisters already *)
  4612. CallAssignMethod(dst, operand.op, parameter.type);
  4613. RestoreRegisters(saved);
  4614. END;
  4615. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4616. ELSIF IsOpenArray(parameter.type) THEN
  4617. Designate(expression,operand);
  4618. baseReg := operand.tag;
  4619. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4620. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4621. END;
  4622. Pass((operand.op)); (* address of the array *)
  4623. ELSIF IsDelegate(parameter.type) THEN
  4624. Evaluate(expression,operand);
  4625. IF backend.cooperative & parameter.NeedsTrace() THEN
  4626. Emit(Push(position, nil));
  4627. dst := NewRegisterOperand (addressType);
  4628. Emit(Mov(position,dst, sp));
  4629. ReleaseIntermediateOperand(dst);
  4630. SaveRegisters();ReleaseUsedRegisters(saved);
  4631. Emit(Push(position, dst));
  4632. (* register dst has been freed before SaveRegisters already *)
  4633. Emit(Push(position, operand.tag));
  4634. CallThis(position,"GarbageCollector","Assign",2);
  4635. RestoreRegisters(saved);
  4636. ELSE
  4637. Pass((operand.tag));
  4638. END;
  4639. Pass((operand.op));
  4640. ELSE
  4641. Evaluate(expression,operand);
  4642. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4643. Emit(Push(position, nil));
  4644. dst := NewRegisterOperand (addressType);
  4645. Emit(Mov(position,dst, sp));
  4646. ReleaseIntermediateOperand(dst);
  4647. SaveRegisters();ReleaseUsedRegisters(saved);
  4648. Emit(Push(position, dst));
  4649. (* register dst has been freed before SaveRegisters already *)
  4650. Emit(Push(position, operand.op));
  4651. CallThis(position,"GarbageCollector","Assign",2);
  4652. RestoreRegisters(saved);
  4653. ELSE
  4654. Pass((operand.op));
  4655. END;
  4656. END;
  4657. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4658. Evaluate(expression,operand);
  4659. Pass((operand.op));
  4660. ELSE (* var parameter *)
  4661. Designate(expression,operand);
  4662. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4663. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4664. Pass((operand.tag));
  4665. END;
  4666. END;
  4667. Pass((operand.op));
  4668. END;
  4669. END;
  4670. (* TODO: needed? *)
  4671. arrayDestinationTag := oldArrayDestinationTag;
  4672. arrayDestinationDimension := oldArrayDestinationDimension;
  4673. IF needsParameterBackup THEN
  4674. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4675. ReuseCopy(parameterBackup, operand.op)
  4676. END;
  4677. ReleaseOperand(operand);
  4678. IF Trace THEN TraceExit("PushParameter") END;
  4679. END PushParameter;
  4680. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4681. VAR prevConditional: BOOLEAN;
  4682. BEGIN
  4683. prevConditional := conditional;
  4684. conditional := FALSE;
  4685. 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
  4686. Expression(x.result); (* use register *)
  4687. END;
  4688. Statement(x.statement);
  4689. conditional := prevConditional;
  4690. IF x.result # NIL THEN Expression(x.result) END;
  4691. 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
  4692. ReleaseIntermediateOperand(result.op);
  4693. END;
  4694. END VisitStatementDesignator;
  4695. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4696. VAR
  4697. procedure: SyntaxTree.Procedure;
  4698. procedureType: SyntaxTree.ProcedureType;
  4699. wasInline: BOOLEAN;
  4700. actualParameters: SyntaxTree.ExpressionList;
  4701. formalParameter: SyntaxTree.Parameter;
  4702. actualParameter: SyntaxTree.Expression;
  4703. i: LONGINT;
  4704. localVariable: SyntaxTree.Variable;
  4705. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4706. src, dest: Operand;
  4707. prevInlineExit : Label;
  4708. prevMapper: SymbolMapper;
  4709. tooComplex: BOOLEAN;
  4710. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4711. BEGIN
  4712. IF e = NIL THEN RETURN TRUE
  4713. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4714. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4715. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4716. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4717. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4718. ELSE RETURN FALSE
  4719. END;
  4720. END SimpleExpression;
  4721. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4722. BEGIN
  4723. RETURN checker.CanPassInRegister(type)
  4724. END FitsInRegister;
  4725. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4726. VAR
  4727. variable: SyntaxTree.Variable;
  4728. variableDesignator: SyntaxTree.Designator;
  4729. BEGIN
  4730. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type));
  4731. variableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4732. variableDesignator.SetType(type);
  4733. RETURN variableDesignator
  4734. END GetTemp;
  4735. BEGIN
  4736. wasInline := currentIsInline;
  4737. prevInlineExit := currentInlineExit;
  4738. prevMapper := currentMapper;
  4739. currentInlineExit := NewLabel();
  4740. tooComplex := FALSE;
  4741. NEW(currentMapper);
  4742. currentIsInline := TRUE;
  4743. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4744. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4745. formalParameter := procedureType.firstParameter;
  4746. actualParameters := x.parameters;
  4747. i := 0;
  4748. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4749. actualParameter := actualParameters.GetExpression(i);
  4750. IF actualParameter.resolved # NIL THEN
  4751. actualParameter := actualParameter.resolved
  4752. END;
  4753. (*
  4754. if expression is simple and can be passed immediately
  4755. or if type fits in register then we can proceed
  4756. otherwise we escape to ordinary procedure call.
  4757. *)
  4758. (* cases where the expression can be mapped identically *)
  4759. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4760. currentMapper.Add(formalParameter, actualParameter, NIL);
  4761. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4762. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4763. (*
  4764. Assign(variableDesignator, actualParameter);
  4765. *)
  4766. Evaluate(actualParameter, src);
  4767. Designate(variableDesignator, dest);
  4768. Emit(Mov(x.position, dest.op, src.op));
  4769. ReleaseOperand(dest);
  4770. ReleaseOperand(src);
  4771. currentMapper.Add(formalParameter, variableDesignator, NIL);
  4772. ELSE tooComplex := TRUE
  4773. END;
  4774. (*
  4775. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4776. currentMapper.Add(formalParameter, actualParameter, NIL);
  4777. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4778. variableDesignator := GetTemp(system.addressType, FALSE);
  4779. Designate(actualParameter, src);
  4780. Designate(variableDesignator, dest);
  4781. IntermediateCode.MakeMemory(dest.op,addressType);
  4782. Emit(Mov(x.position, dest.op, src.op));
  4783. ReleaseOperand(dest);
  4784. IF src.tag.mode # IntermediateCode.Undefined THEN
  4785. tagDesignator := GetTemp(system.addressType, FALSE);
  4786. Designate(tagDesignator, dest);
  4787. IntermediateCode.MakeMemory(dest.op,addressType);
  4788. Emit(Mov(x.position, dest.op, src.op));
  4789. END;
  4790. ReleaseOperand(dest); ReleaseOperand(src);
  4791. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4792. END;
  4793. *)
  4794. formalParameter := formalParameter.nextParameter;
  4795. INC(i);
  4796. END;
  4797. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4798. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4799. currentMapper.Add(NIL, returnDesignator, NIL);
  4800. END;
  4801. localVariable := procedure.procedureScope.firstVariable;
  4802. WHILE ~tooComplex & (localVariable # NIL) DO
  4803. variableDesignator := GetTemp(localVariable.type, FALSE);
  4804. currentMapper.Add(localVariable, variableDesignator, NIL);
  4805. localVariable := localVariable.nextVariable;
  4806. END;
  4807. IF ~tooComplex THEN
  4808. VisitStatementBlock(procedure.procedureScope.body);
  4809. SetLabel(currentInlineExit);
  4810. IF procedureType.returnType # NIL THEN
  4811. Designate(returnDesignator, result);
  4812. IF conditional THEN
  4813. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4814. ValueToCondition(result)
  4815. END;
  4816. END;
  4817. END;
  4818. currentMapper := prevMapper;
  4819. currentInlineExit := prevInlineExit;
  4820. currentIsInline := wasInline;
  4821. RETURN ~tooComplex
  4822. END InlineProcedureCall;
  4823. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4824. VAR
  4825. parameters: SyntaxTree.ExpressionList;
  4826. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4827. designator: SyntaxTree.Designator;
  4828. procedureType: SyntaxTree.ProcedureType;
  4829. formalParameter: SyntaxTree.Parameter;
  4830. operand, returnValue: Operand;
  4831. reg, size, mask, dest: IntermediateCode.Operand;
  4832. saved: RegisterEntry;
  4833. symbol: SyntaxTree.Symbol;
  4834. variable: SyntaxTree.Variable;
  4835. i, parametersSize, returnTypeSize : LONGINT;
  4836. structuredReturnType: BOOLEAN;
  4837. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4838. tempVariableDesignator: SyntaxTree.Designator;
  4839. gap, alignment: LONGINT; (*fld*)
  4840. (* TODO: remove unnecessary backup variables *)
  4841. oldResult: Operand;
  4842. oldCurrentScope: SyntaxTree.Scope;
  4843. oldArrayDestinationTag: IntermediateCode.Operand;
  4844. oldArrayDestinationDimension: LONGINT;
  4845. oldConstantDeclaration: SyntaxTree.Symbol;
  4846. oldDestination: IntermediateCode.Operand;
  4847. oldCurrentLoop: Label;
  4848. oldConditional: BOOLEAN;
  4849. oldTrueLabel, oldFalseLabel: Label;
  4850. oldLocked: BOOLEAN;
  4851. usedRegisters,oldUsedRegisters: RegisterEntry;
  4852. return: IntermediateCode.Operand;
  4853. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  4854. arg: IntermediateCode.Operand;
  4855. dummy: IntermediateCode.Operand;
  4856. recordType: SyntaxTree.RecordType;
  4857. operatorSelectionProcedureOperand: Operand;
  4858. operatorSelectionProcedure: SyntaxTree.Procedure;
  4859. fingerPrint: SyntaxTree.FingerPrint;
  4860. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  4861. identifierNumber: LONGINT;
  4862. parameterRegister: Backend.Registers;
  4863. parameterRegisters: LONGINT;
  4864. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  4865. procedure: SyntaxTree.Procedure;
  4866. PROCEDURE BackupGlobalState;
  4867. BEGIN
  4868. oldResult := result;
  4869. oldCurrentScope := currentScope;
  4870. oldArrayDestinationTag := arrayDestinationTag;
  4871. oldArrayDestinationDimension := arrayDestinationDimension;
  4872. oldConstantDeclaration := constantDeclaration;
  4873. oldDestination := destination;
  4874. oldCurrentLoop := currentLoop;
  4875. oldConditional := conditional;
  4876. oldTrueLabel := trueLabel;
  4877. oldFalseLabel := falseLabel;
  4878. oldLocked := locked;
  4879. oldUsedRegisters := usedRegisters
  4880. END BackupGlobalState;
  4881. PROCEDURE RestoreGlobalState;
  4882. BEGIN
  4883. result := oldResult;
  4884. currentScope := oldCurrentScope;
  4885. arrayDestinationTag := oldArrayDestinationTag;
  4886. arrayDestinationDimension := oldArrayDestinationDimension;
  4887. constantDeclaration := oldConstantDeclaration;
  4888. destination := oldDestination;
  4889. currentLoop := oldCurrentLoop;
  4890. conditional := oldConditional;
  4891. trueLabel := oldTrueLabel;
  4892. falseLabel := oldFalseLabel;
  4893. locked := oldLocked;
  4894. usedRegisters := oldUsedRegisters
  4895. END RestoreGlobalState;
  4896. (** do preparations before parameter push for array-structured object types (ASOTs):
  4897. if ASOT is passed as VAR parameter:
  4898. - allocate temporary variable of math array type
  4899. - copy contents of ASOT to be passed to temporary variable
  4900. - use temporary variable as the actual parameter instead
  4901. - 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)
  4902. **)
  4903. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  4904. VAR
  4905. expression: SyntaxTree.Expression;
  4906. BEGIN
  4907. IF actualParameter IS SyntaxTree.Designator THEN
  4908. designator := actualParameter(SyntaxTree.Designator);
  4909. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  4910. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  4911. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  4912. ASSERT(checker # NIL);
  4913. checker.SetCurrentScope(currentScope);
  4914. (* allocate temporary variable *)
  4915. ASSERT(actualParameter.type # NIL);
  4916. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  4917. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4918. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4919. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4920. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  4921. ASSERT(tempVariableDesignator.type # NIL);
  4922. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  4923. (* copy math array stored in actual parameter to temporary variable *)
  4924. BackupGlobalState;
  4925. AssignMathArray(tempVariableDesignator, actualParameter);
  4926. RestoreGlobalState;
  4927. (* use temporary variable as actual parameter instead of the original one *)
  4928. actualParameter := tempVariableDesignator;
  4929. (* create write-back call and store it in linked list *)
  4930. (* create new list entry *)
  4931. IF firstWriteBackCall = NIL THEN
  4932. NEW(firstWriteBackCall);
  4933. currentWriteBackCall := firstWriteBackCall
  4934. ELSE
  4935. ASSERT(currentWriteBackCall # NIL);
  4936. NEW(currentWriteBackCall.next);
  4937. currentWriteBackCall := currentWriteBackCall.next
  4938. END;
  4939. expression := checker.NewIndexOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4940. ASSERT(expression.type = NIL);
  4941. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4942. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  4943. (* prepare writeback for any other "normal" indexer *)
  4944. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4945. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4946. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4947. Assign(tempVariableDesignator, actualParameter);
  4948. actualParameter := tempVariableDesignator;
  4949. IF firstWriteBackCall = NIL THEN
  4950. NEW(firstWriteBackCall);
  4951. currentWriteBackCall := firstWriteBackCall
  4952. ELSE
  4953. ASSERT(currentWriteBackCall # NIL);
  4954. NEW(currentWriteBackCall.next);
  4955. currentWriteBackCall := currentWriteBackCall.next
  4956. END;
  4957. expression := checker.NewObjectOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4958. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4959. END
  4960. END
  4961. END PrepareParameter;
  4962. BEGIN
  4963. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  4964. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  4965. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4966. IF procedure.isOberonInline & (procedure.scope.ownerModule = module.module) THEN
  4967. IF InlineProcedureCall(x) THEN
  4968. RETURN
  4969. ELSE
  4970. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  4971. END
  4972. END;
  4973. END;
  4974. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4975. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  4976. dest := destination; destination := emptyOperand;
  4977. SaveRegisters();ReleaseUsedRegisters(saved);
  4978. parameters := x.parameters;
  4979. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  4980. (* an operator is called *)
  4981. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4982. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  4983. (* check if a dynamic operator call should be performed *)
  4984. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic
  4985. ELSE
  4986. isCallOfDynamicOperator := FALSE
  4987. END;
  4988. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  4989. Emit(Push(position, ap));
  4990. END;
  4991. alignment := procedureType.stackAlignment;
  4992. IF alignment > 1 THEN
  4993. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4994. Emit(Mov(position,reg, sp));
  4995. gap := ParametersSize(system, procedureType, FALSE) + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  4996. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  4997. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  4998. Emit(And(position,sp, sp, mask));
  4999. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5000. Emit(Push(position,reg));
  5001. (*
  5002. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  5003. Emit(Mov(position,mem,reg));
  5004. *)
  5005. ReleaseIntermediateOperand(reg);
  5006. END;
  5007. IF (procedureType.callingConvention = SyntaxTree.DarwinCCallingConvention) & (system.addressSize = 32) THEN
  5008. (* align stack to 16-byte boundary *)
  5009. IntermediateCode.InitImmediate(mask,addressType,-16);
  5010. Emit(And(position,sp, sp, mask))
  5011. END;
  5012. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5013. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5014. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5015. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5016. ELSE
  5017. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5018. END;
  5019. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5020. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5021. (* push ID *)
  5022. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5023. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5024. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5025. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5026. formalParameter := procedureType.firstParameter;
  5027. FOR i := 0 TO parameters.Length() - 1 DO
  5028. IF formalParameter.access # SyntaxTree.Hidden THEN
  5029. ASSERT(i < 2);
  5030. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5031. (* push pointer *)
  5032. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5033. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5034. (* add dereference *)
  5035. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5036. ReleaseIntermediateOperand(parameterBackups[i]);
  5037. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5038. END;
  5039. Emit(Push(position,parameterBackups[i]));
  5040. ReleaseIntermediateOperand(parameterBackups[i]);
  5041. (* push typetag *)
  5042. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5043. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5044. arg := TypeDescriptorAdr(recordType);
  5045. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5046. Emit(Push(position,arg));
  5047. ELSE
  5048. (* push 'NonPointer' *)
  5049. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5050. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5051. (* push fingerprint *)
  5052. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5053. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5054. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow))) (* TODO: push the type's fingerprint *)
  5055. END
  5056. END;
  5057. formalParameter := formalParameter.nextParameter
  5058. END;
  5059. (* for unary operators: complete the information for the second parameter *)
  5060. IF procedureType.numberParameters < 2 THEN
  5061. (* push 'NonPointer' *)
  5062. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5063. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5064. (* push 'NoType' *)
  5065. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5066. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5067. END;
  5068. (* call operator selection procedure *)
  5069. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5070. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5071. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  5072. ReleaseOperand(operatorSelectionProcedureOperand);
  5073. (* use the address that the operator selection procedure returned as the target address of the call *)
  5074. InitOperand(operand, ModeValue);
  5075. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5076. Emit(Result(position,operand.op))
  5077. END
  5078. ELSE
  5079. Evaluate(x.left, operand)
  5080. END;
  5081. IF symbol IS SyntaxTree.Procedure THEN
  5082. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5083. Emit(Push(position,operand.tag));
  5084. ELSIF (procedureType.isDelegate) THEN
  5085. Emit(Push(position,operand.tag));
  5086. END;
  5087. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5088. IF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5089. Emit(Push(position,operand.tag));
  5090. END;
  5091. ELSE HALT(200);
  5092. END;
  5093. ReleaseIntermediateOperand(operand.tag);
  5094. operand.tag := emptyOperand;
  5095. (* determine if a structured return type is needed *)
  5096. structuredReturnType := StructuredReturnType(procedureType);
  5097. IF structuredReturnType THEN
  5098. IF resultDesignator # NIL THEN
  5099. d := resultDesignator;
  5100. ELSE
  5101. variable := GetTemporaryVariable(procedureType.returnType, FALSE);
  5102. variable.SetUntraced(procedureType.hasUntracedReturn);
  5103. d := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  5104. d.SetType(variable.type);
  5105. END;
  5106. IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5107. Designate(d,returnValue);
  5108. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5109. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5110. Emit(Push(position,size));
  5111. Emit(Push(position,returnValue.op));
  5112. ReleaseOperand(returnValue);
  5113. ELSE
  5114. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  5115. END;
  5116. END;
  5117. firstWriteBackCall := NIL; (* reset write-back call list *)
  5118. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  5119. parameterRegister := backend.GetParameterRegisters(procedureType.callingConvention);
  5120. IF parameterRegister = NIL THEN parameterRegisters := 0
  5121. ELSE parameterRegisters := LEN(parameterRegister)
  5122. END;
  5123. passByRegister := parameterRegisters > 0;
  5124. registerNumber := 0;
  5125. formalParameter := procedureType.lastParameter;
  5126. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5127. actualParameter := parameters.GetExpression(i);
  5128. PrepareParameter(actualParameter, formalParameter);
  5129. IF passByRegister & (i < parameterRegisters) THEN
  5130. IF ~PassInRegister(formalParameter) THEN
  5131. Error(actualParameter.position,"cannot be passed by register")
  5132. ELSE
  5133. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,parameterRegister[i]);
  5134. END;
  5135. INC(registerNumber);
  5136. ELSE
  5137. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5138. END;
  5139. formalParameter := formalParameter.prevParameter;
  5140. END;
  5141. IF passByRegister & (registerNumber > 0) & ~SysvABI(procedureType.callingConvention) THEN
  5142. stackSize := ToMemoryUnits(system,parameterRegisters*addressType.sizeInBits);
  5143. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5144. END;
  5145. ELSE
  5146. hasDynamicOperands := FALSE;
  5147. formalParameter := procedureType.firstParameter;
  5148. FOR i := 0 TO parameters.Length() - 1 DO
  5149. actualParameter := parameters.GetExpression(i);
  5150. IF formalParameter # NIL THEN (* TENTATIVE *)
  5151. PrepareParameter(actualParameter, formalParameter);
  5152. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5153. ASSERT(i < 2);
  5154. hasDynamicOperands := TRUE;
  5155. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  5156. ELSE
  5157. IF passByRegister & (registerNumber > 0) THEN
  5158. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5159. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5160. END;
  5161. passByRegister := FALSE;
  5162. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5163. END;
  5164. formalParameter := formalParameter.nextParameter;
  5165. END;
  5166. END;
  5167. END;
  5168. IF symbol IS SyntaxTree.Procedure THEN
  5169. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5170. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5171. Emit(Push(position,reg));
  5172. ReleaseIntermediateOperand(reg);
  5173. END;
  5174. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5175. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5176. parametersSize := ParametersSize(system,procedureType,FALSE);
  5177. END;
  5178. ReleaseParameterRegisters();
  5179. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR SysvABI(procedureType.callingConvention) THEN
  5180. Emit(Call(position,operand.op,0));
  5181. ELSE
  5182. Emit(Call(position,operand.op,parametersSize));
  5183. END;
  5184. ReleaseOperand(operand);
  5185. IF procedureType.noReturn THEN
  5186. EmitTrap(position,NoReturnTrap);
  5187. END;
  5188. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5189. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5190. Emit(Result(position,return));
  5191. END;
  5192. (* === return parameter space === *)
  5193. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & passByRegister THEN
  5194. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5195. IF parametersSize < 32 THEN
  5196. (* allocated space for all parameter registers *)
  5197. parametersSize := 32
  5198. END;
  5199. size := IntermediateCode.Immediate(addressType,parametersSize);
  5200. Emit(Add(position,sp,sp,size))
  5201. END;
  5202. IF SysvABI(procedureType.callingConvention) THEN
  5203. IF passByRegister THEN
  5204. IF parameters.Length() > parameterRegisters THEN
  5205. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5206. ELSE
  5207. parametersSize := 0
  5208. END;
  5209. ELSE
  5210. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits)
  5211. END;
  5212. IF parametersSize > 0 THEN
  5213. size := IntermediateCode.Immediate(addressType,parametersSize);
  5214. Emit(Add(position,sp,sp,size))
  5215. END;
  5216. END;
  5217. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5218. IF structuredReturnType THEN
  5219. (* stack pointer rewinding done by callee
  5220. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5221. Emit(Add(position,sp,sp,size));
  5222. *)
  5223. RestoreRegisters(saved);
  5224. InitOperand(result,ModeReference);
  5225. Symbol(variable,result);
  5226. ELSE
  5227. RestoreRegisters(saved);
  5228. InitOperand(result,ModeValue);
  5229. result.op := return;
  5230. END;
  5231. END;
  5232. IF alignment > 1 THEN
  5233. Emit(Pop(position,sp));
  5234. END;
  5235. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5236. Emit(Pop(position, ap));
  5237. END;
  5238. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5239. ValueToCondition(result);
  5240. END;
  5241. destination := dest;
  5242. (* perform all write-back calls in the list *)
  5243. BackupGlobalState;
  5244. currentWriteBackCall := firstWriteBackCall;
  5245. WHILE currentWriteBackCall # NIL DO
  5246. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5247. currentWriteBackCall := currentWriteBackCall.next
  5248. END;
  5249. RestoreGlobalState;
  5250. (* TENATIVE *)
  5251. (*
  5252. IF isOperatorCall THEN
  5253. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5254. END;
  5255. *)
  5256. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5257. END VisitProcedureCallDesignator;
  5258. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5259. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5260. td: SyntaxTree.Symbol;
  5261. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5262. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5263. BEGIN
  5264. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5265. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5266. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5267. variable.SetType(system.anyType);
  5268. scope.AddVariable(variable);
  5269. hiddenPointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5270. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5271. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5272. typeDeclaration.SetScope(module.module.moduleScope);
  5273. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5274. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5275. END;
  5276. RETURN hiddenPointerType;
  5277. END GetHiddenPointerType;
  5278. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5279. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5280. BEGIN
  5281. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5282. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5283. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Procedure"));
  5284. variable.SetType(SyntaxTree.NewProcedureType(-1,NIL));
  5285. scope.AddVariable(variable);
  5286. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5287. variable.SetType(system.anyType);
  5288. scope.AddVariable(variable);
  5289. delegatePointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5290. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@Delegate"));
  5291. typeDeclaration.SetDeclaredType(delegatePointerType);
  5292. typeDeclaration.SetScope(module.module.moduleScope);
  5293. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5294. delegatePointerType.SetState(SyntaxTree.Resolved);
  5295. END;
  5296. RETURN delegatePointerType
  5297. END GetDelegateType;
  5298. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5299. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5300. such as in VAR a: RECORD ... END;
  5301. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5302. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5303. *)
  5304. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5305. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5306. BEGIN (* no code emission *)
  5307. source := NIL;
  5308. x := x.resolved;
  5309. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5310. x := GetHiddenPointerType();
  5311. ELSIF IsDelegate(x) THEN
  5312. x := GetDelegateType();
  5313. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5314. ELSE HALT(200);
  5315. END;
  5316. td := x.typeDeclaration;
  5317. IF td = NIL THEN
  5318. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5319. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5320. ASSERT(td # NIL);
  5321. END;
  5322. IF newObjectFile THEN
  5323. GetCodeSectionNameForSymbol(td,name);
  5324. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5325. meta.CheckTypeDeclaration(x);
  5326. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5327. ELSE
  5328. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5329. END;
  5330. IF backend.cooperative OR meta.simple THEN
  5331. offset := 0;
  5332. ELSE
  5333. IF x IS SyntaxTree.CellType THEN
  5334. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5335. IF baseRecord = NIL THEN
  5336. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5337. ELSE
  5338. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5339. END;
  5340. ELSE
  5341. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5342. END;
  5343. END;
  5344. ELSE
  5345. offset := 0;
  5346. source := module.allSections.FindBySymbol(td); (*TODO*)
  5347. IF source = NIL THEN
  5348. null := 0;
  5349. GetCodeSectionNameForSymbol(td,name);
  5350. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  5351. Basic.SuffixSegmentedName (name, module.module.name);
  5352. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5353. IntermediateCode.InitImmediate(op,addressType,0);
  5354. source(IntermediateCode.Section).Emit(Data(position,op));
  5355. source.SetReferenced(FALSE)
  5356. ELSE
  5357. name := source.name;
  5358. END;
  5359. END;
  5360. RETURN td
  5361. END GetBackendType;
  5362. BEGIN
  5363. (*td := t.typeDeclaration;*)
  5364. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5365. (*
  5366. IF t IS SyntaxTree.PointerType THEN
  5367. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5368. ELSE
  5369. source := GetBackendType(t);
  5370. END;
  5371. *)
  5372. IF newObjectFile THEN
  5373. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5374. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5375. IntermediateCode.SetOffset(res,offset);
  5376. ELSE
  5377. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5378. END;
  5379. (*
  5380. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5381. make memory should be used when tag is used, not earlier
  5382. *)
  5383. RETURN res
  5384. END TypeDescriptorAdr;
  5385. (*
  5386. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5387. VAR result: IntermediateCode.Operand;
  5388. BEGIN
  5389. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5390. operand.tag := TypeDescriptorAdr(operand.type);
  5391. IntermediateCode.MakeMemory(operand.tag,addressType);
  5392. UseIntermediateOperand(operand.tag);
  5393. END;
  5394. END MakeTypeTag;
  5395. *)
  5396. PROCEDURE ProfilerInit;
  5397. VAR reg: IntermediateCode.Operand;
  5398. BEGIN
  5399. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5400. Emit(Call(position,reg,0));
  5401. END ProfilerInit;
  5402. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5403. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5404. BEGIN
  5405. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5406. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5407. THEN
  5408. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5409. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5410. Emit(Push(position,reg));
  5411. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5412. Emit(Push(position,reg));
  5413. StaticCallOperand(result,procedure);
  5414. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5415. ReleaseOperand(result);
  5416. END;
  5417. END ProfilerEnterExit;
  5418. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5419. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5420. BEGIN
  5421. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5422. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5423. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5424. profileInit.Emit(Push(position,reg));
  5425. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5426. profileInit.Emit(Push(position,reg));
  5427. NEW(string, LEN(name)); COPY(name, string^);
  5428. sv := SyntaxTree.NewStringValue(-1,string);
  5429. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5430. sv.SetType(type);
  5431. Designate(sv,result);
  5432. profileInit.Emit(Push(position,result.tag));
  5433. profileInit.Emit(Push(position,result.op));
  5434. StaticCallOperand(result,procedure);
  5435. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5436. ReleaseOperand(result);
  5437. END;
  5438. END ProfilerAddProcedure;
  5439. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5440. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5441. BEGIN
  5442. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5443. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5444. profileInit.Emit(Push(position,reg));
  5445. profileInitPatchPosition := profileInit.pc;
  5446. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5447. NEW(string, LEN(name)); COPY(name, string^);
  5448. sv := SyntaxTree.NewStringValue(-1,string);
  5449. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5450. sv.SetType(type);
  5451. Designate(sv,result);
  5452. profileInit.Emit(Push(position,result.tag));
  5453. profileInit.Emit(Push(position,result.op));
  5454. StaticCallOperand(result,procedure);
  5455. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5456. ReleaseOperand(result);
  5457. END;
  5458. END ProfilerAddModule;
  5459. PROCEDURE ProfilerPatchInit;
  5460. VAR reg: IntermediateCode.Operand;
  5461. BEGIN
  5462. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5463. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5464. EmitLeave(profileInit,position,0);
  5465. profileInit.Emit(Exit(position,0,0));
  5466. END ProfilerPatchInit;
  5467. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5468. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5469. VAR
  5470. id: LONGINT;
  5471. leftType, rightType: SyntaxTree.Type;
  5472. procedureType: SyntaxTree.ProcedureType;
  5473. runtimeProcedure: SyntaxTree.Procedure;
  5474. runtimeProcedureOperand, operatorOperand: Operand;
  5475. kind: SET;
  5476. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5477. VAR
  5478. arg: IntermediateCode.Operand;
  5479. recordType: SyntaxTree.RecordType;
  5480. fingerPrint: SyntaxTree.FingerPrint;
  5481. BEGIN
  5482. IF type = NIL THEN
  5483. (* no type: push 'NoType' *)
  5484. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5485. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5486. ELSIF IsStrictlyPointerToRecord(type) THEN
  5487. (* pointer to record type: push typetag *)
  5488. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5489. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5490. arg := TypeDescriptorAdr(recordType);
  5491. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5492. ELSE
  5493. (* non-pointer to record type: push fingerprint *)
  5494. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5495. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5496. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow)
  5497. END;
  5498. operatorInitializationCodeSection.Emit(Push(position,arg))
  5499. END PushTypeInfo;
  5500. BEGIN
  5501. ASSERT(operatorInitializationCodeSection # NIL);
  5502. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5503. procedureType := operator.type(SyntaxTree.ProcedureType);
  5504. (* determine types *)
  5505. leftType := procedureType.firstParameter.type;
  5506. IF procedureType.numberParameters = 2 THEN
  5507. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5508. rightType := procedureType.firstParameter.nextParameter.type;
  5509. ELSE
  5510. rightType := NIL
  5511. END;
  5512. (* determine operator kind *)
  5513. IF IsStrictlyPointerToRecord(leftType) THEN
  5514. kind := {LhsIsPointer}
  5515. ELSE
  5516. kind := {}
  5517. END;
  5518. IF IsStrictlyPointerToRecord(rightType) THEN
  5519. kind := kind + {RhsIsPointer}
  5520. END;
  5521. IF kind # {} THEN (* TODO: to be removed later on *)
  5522. (* at least one of the types is a pointer to record *)
  5523. (* emit a code that registers this specific operator in the runtime *)
  5524. dump := operatorInitializationCodeSection.comments;
  5525. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5526. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5527. (* push ID *)
  5528. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5529. id := Global.GetSymbol(module.module.case, operator.name);
  5530. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5531. (* push kind *)
  5532. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5533. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5534. (* push type infos *)
  5535. PushTypeInfo(leftType);
  5536. PushTypeInfo(rightType);
  5537. (* push operator address *)
  5538. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5539. StaticCallOperand(operatorOperand, operator);
  5540. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5541. ReleaseOperand(operatorOperand);
  5542. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5543. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5544. ReleaseOperand(runtimeProcedureOperand)
  5545. END
  5546. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5547. END
  5548. END RegisterDynamicOperator;
  5549. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: LONGINT);
  5550. VAR
  5551. traceModule: SyntaxTree.Module;
  5552. procedure: SyntaxTree.Procedure;
  5553. procedureVariable: SyntaxTree.Variable;
  5554. s,msg: Basic.MessageString;
  5555. res: Operand;
  5556. i: LONGINT;
  5557. sv: SyntaxTree.StringValue;
  5558. type: SyntaxTree.Type;
  5559. recordType: SyntaxTree.RecordType;
  5560. printout: Printout.Printer;
  5561. stringWriter: Streams.StringWriter;
  5562. expression: SyntaxTree.Expression;
  5563. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5564. BEGIN
  5565. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5566. IF procedure = NIL THEN
  5567. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5568. END;
  5569. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5570. s := "procedure ";
  5571. Strings.Append(s,backend.traceModuleName);
  5572. Strings.Append(s,".");
  5573. Strings.Append(s,procedureName);
  5574. Strings.Append(s," not present");
  5575. Error(position,s);
  5576. RETURN FALSE
  5577. ELSE
  5578. RETURN TRUE
  5579. END;
  5580. END GetProcedure;
  5581. PROCEDURE CallProcedure;
  5582. VAR size: LONGINT;
  5583. BEGIN
  5584. IF procedure # NIL THEN
  5585. StaticCallOperand(result,procedure);
  5586. size := ProcedureParametersSize(system,procedure);
  5587. ELSE
  5588. Symbol(procedureVariable, result);
  5589. LoadValue(result, procedureVariable.type.resolved);
  5590. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5591. END;
  5592. Emit(Call(position,result.op,size));
  5593. END CallProcedure;
  5594. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5595. VAR res: Operand; string: SyntaxTree.String;
  5596. BEGIN
  5597. IF GetProcedure("String") THEN
  5598. NEW(string, LEN(s)); COPY(s, string^);
  5599. sv := SyntaxTree.NewStringValue(-1,string);
  5600. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  5601. sv.SetType(type);
  5602. Designate(sv,res);
  5603. Emit(Push(position,res.tag));
  5604. Emit(Push(position,res.op));
  5605. ReleaseOperand(res);
  5606. CallProcedure;
  5607. END;
  5608. END String;
  5609. PROCEDURE Integer(op: IntermediateCode.Operand);
  5610. BEGIN
  5611. IF GetProcedure("Int") THEN
  5612. Emit(Push(position,op));
  5613. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5614. CallProcedure;
  5615. END;
  5616. END Integer;
  5617. PROCEDURE Float(op: IntermediateCode.Operand);
  5618. BEGIN
  5619. IF GetProcedure("HIntHex") THEN
  5620. Emit(Push(position,op));
  5621. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5622. CallProcedure;
  5623. END;
  5624. END Float;
  5625. PROCEDURE Set(op: IntermediateCode.Operand);
  5626. BEGIN
  5627. IF GetProcedure("Set") THEN
  5628. Emit(Push(position,op));
  5629. (*
  5630. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5631. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5632. *)
  5633. CallProcedure;
  5634. END;
  5635. END Set;
  5636. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5637. BEGIN
  5638. IF GetProcedure("Boolean") THEN
  5639. Emit(Push(position,op));
  5640. CallProcedure;
  5641. END;
  5642. END Boolean;
  5643. PROCEDURE Char(op: IntermediateCode.Operand);
  5644. BEGIN
  5645. IF GetProcedure("Char") THEN
  5646. Emit(Push(position,op));
  5647. CallProcedure;
  5648. END;
  5649. END Char;
  5650. PROCEDURE Address(op: IntermediateCode.Operand);
  5651. BEGIN
  5652. IF GetProcedure("Address") THEN
  5653. Emit(Push(position,op));
  5654. CallProcedure;
  5655. END;
  5656. END Address;
  5657. PROCEDURE StringOperand(op,tag: IntermediateCode.Operand);
  5658. BEGIN
  5659. IF GetProcedure("String") THEN
  5660. Emit(Push(position,tag));
  5661. Emit(Push(position,op));
  5662. CallProcedure;
  5663. END;
  5664. END StringOperand;
  5665. PROCEDURE Ln;
  5666. BEGIN
  5667. IF GetProcedure("Ln") THEN
  5668. CallProcedure;
  5669. END;
  5670. END Ln;
  5671. BEGIN
  5672. IF backend.traceModuleName = "" THEN RETURN END;
  5673. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5674. IF GetProcedure("Enter") THEN
  5675. CallProcedure
  5676. END;
  5677. NEW(stringWriter,LEN(s));
  5678. FOR i := 0 TO x.Length()-1 DO
  5679. msg := "";
  5680. expression := x.GetExpression(i);
  5681. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5682. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5683. ELSE
  5684. Global.GetModuleName(module.module, s);
  5685. END;
  5686. IF i = 0 THEN
  5687. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos,1);
  5688. stringWriter.String(":");
  5689. END;
  5690. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5691. IF ~(expression IS SyntaxTree.StringValue) THEN
  5692. printout.Expression(expression);
  5693. stringWriter.Get(s);
  5694. Strings.Append(msg,s);
  5695. Strings.Append(msg,"= ");
  5696. ELSE stringWriter.Get(s); (* remove from string writer *)
  5697. Strings.Append(msg, s);
  5698. END;
  5699. String(msg);
  5700. IF SemanticChecker.IsStringType(expression.type) THEN
  5701. Designate(expression,res);
  5702. StringOperand(res.op,res.tag);
  5703. ELSE
  5704. Evaluate(expression,res);
  5705. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5706. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5707. Convert(res.op,int64);
  5708. END;
  5709. Integer(res.op);
  5710. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5711. Boolean(res.op);
  5712. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5713. Set(res.op);
  5714. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5715. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5716. Convert(res.op,float64);
  5717. END;
  5718. Float(res.op);
  5719. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5720. Char(res.op);
  5721. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5722. Address(res.op);String("H");
  5723. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5724. Address(res.op);String("H");
  5725. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5726. Address(res.op);String("H");
  5727. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5728. Address(res.op);String("H");
  5729. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5730. String("NIL");
  5731. ELSE HALT(200);
  5732. END;
  5733. END;
  5734. ReleaseOperand(res);
  5735. String("; ");
  5736. END;
  5737. IF GetProcedure("Exit") THEN
  5738. CallProcedure
  5739. ELSE
  5740. Ln;
  5741. END;
  5742. END;
  5743. END SystemTrace;
  5744. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5745. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5746. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5747. BEGIN
  5748. type := type.resolved;
  5749. IF type IS SyntaxTree.RecordType THEN
  5750. WITH type: SyntaxTree.RecordType DO
  5751. baseType := type.baseType;
  5752. IF baseType # NIL THEN
  5753. baseType := baseType.resolved;
  5754. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5755. InitFields(baseType,adr,offset);
  5756. END;
  5757. variable := type.recordScope.firstVariable;
  5758. WHILE variable # NIL DO
  5759. IF variable.initializer # NIL THEN
  5760. Evaluate(variable.initializer,initializerOp);
  5761. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5762. Emit(Mov(position,mem,initializerOp.op));
  5763. ReleaseOperand(initializerOp);
  5764. ReleaseIntermediateOperand(mem);
  5765. END;
  5766. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5767. variable := variable.nextVariable
  5768. END;
  5769. END;
  5770. ELSIF (type IS SyntaxTree.ArrayType) THEN
  5771. WITH type: SyntaxTree.ArrayType DO
  5772. IF type.form = SyntaxTree.Static THEN
  5773. baseType := type.arrayBase;
  5774. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5775. FOR i := 0 TO type.staticLength-1 DO
  5776. InitFields(baseType,adr,offset+i*size);
  5777. END;
  5778. END;
  5779. END;
  5780. ELSIF type IS SyntaxTree.MathArrayType THEN
  5781. WITH type: SyntaxTree.MathArrayType DO
  5782. IF type.form = SyntaxTree.Open THEN
  5783. dim := DynamicDim(type);
  5784. imm := IntermediateCode.Immediate(addressType,dim);
  5785. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  5786. baseType := SemanticChecker.ArrayBase(type,dim);
  5787. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  5788. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  5789. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  5790. ReleaseIntermediateOperand(imm);
  5791. (* flags remain empty (=0) for open array *)
  5792. ELSIF type.form = SyntaxTree.Static THEN
  5793. baseType := type.arrayBase;
  5794. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5795. ASSERT(type.staticLength < 1024*1024*1024);
  5796. FOR i := 0 TO type.staticLength-1 DO
  5797. InitFields(baseType,adr,offset+i*size);
  5798. END;
  5799. END;
  5800. END;
  5801. END;
  5802. END InitFields;
  5803. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable);
  5804. VAR type: SyntaxTree.Type; operand: Operand; tmp: IntermediateCode.Operand; reference: SyntaxTree.Expression;
  5805. BEGIN
  5806. type := variable.type.resolved;
  5807. IF (type IS SyntaxTree.MathArrayType) THEN
  5808. WITH type: SyntaxTree.MathArrayType DO
  5809. IF type.form = SyntaxTree.Open THEN
  5810. Symbol(variable,operand);
  5811. InitFields(type, operand.tag,0);
  5812. ELSIF type.form = SyntaxTree.Tensor THEN
  5813. Symbol(variable, operand);
  5814. MakeMemory(tmp,operand.op,addressType,0);
  5815. ReleaseOperand(operand);
  5816. Emit(Mov(position,tmp, nil ) );
  5817. ReleaseIntermediateOperand(tmp);
  5818. END;
  5819. END;
  5820. ELSE
  5821. Symbol(variable,operand);
  5822. IF variable.initializer # NIL THEN
  5823. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  5824. reference.SetType(variable.type.resolved);
  5825. reference.SetAssignable(TRUE);
  5826. Assign(reference,variable.initializer);
  5827. END;
  5828. InitFields(type, operand.op,0);
  5829. ReleaseOperand(operand);
  5830. END;
  5831. END InitVariable;
  5832. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  5833. VAR end: Label;
  5834. BEGIN
  5835. IF type.form = SyntaxTree.Tensor THEN
  5836. InitOperand(result,ModeValue);
  5837. ReuseCopy(result.op,base);
  5838. end := NewLabel();
  5839. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  5840. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  5841. SetLabel(end);
  5842. Convert(result.op,int32);
  5843. ELSE
  5844. InitOperand(result,ModeValue);
  5845. IntermediateCode.InitImmediate(result.op, int32, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  5846. END
  5847. END MathArrayDim;
  5848. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  5849. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  5850. BEGIN
  5851. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5852. MakeMemory(mem,base,addressType,offset);
  5853. Emit(Mov(position,mem,value));
  5854. ReleaseIntermediateOperand(mem);
  5855. END PutMathArrayField;
  5856. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  5857. VAR mem: IntermediateCode.Operand;
  5858. BEGIN
  5859. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5860. MakeMemory(mem,base,addressType,offset);
  5861. Emit(Mov(position,mem,value));
  5862. ReleaseIntermediateOperand(mem);
  5863. END PutMathArrayFieldOffset;
  5864. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  5865. BEGIN
  5866. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  5867. MakeMemory(value,base,addressType,offset);
  5868. END GetMathArrayField;
  5869. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  5870. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  5871. BEGIN
  5872. IF incr THEN
  5873. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  5874. ELSE
  5875. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  5876. END;
  5877. IF dim.mode=IntermediateCode.ModeImmediate THEN
  5878. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  5879. ELSE
  5880. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5881. Emit(Mov(position,reg,dim));
  5882. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  5883. Emit(Add(position,reg,reg,base));
  5884. MakeMemory(mem, reg, addressType, offset);
  5885. ReleaseIntermediateOperand(reg);
  5886. Emit(Mov(position,mem,value));
  5887. ReleaseIntermediateOperand(mem);
  5888. END;
  5889. END PutMathArrayLenOrIncr;
  5890. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  5891. BEGIN
  5892. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  5893. END PutMathArrayLength;
  5894. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  5895. BEGIN
  5896. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  5897. END PutMathArrayIncrement;
  5898. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5899. BEGIN
  5900. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  5901. END GetMathArrayIncrement;
  5902. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5903. BEGIN
  5904. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  5905. END GetMathArrayLength;
  5906. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5907. VAR dimOp: IntermediateCode.Operand;
  5908. BEGIN
  5909. dimOp := IntermediateCode.Immediate(int32, dim);
  5910. GetMathArrayLength(type, operand, dimOp, check, result);
  5911. END GetMathArrayLengthAt;
  5912. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5913. VAR dimOp: IntermediateCode.Operand;
  5914. BEGIN
  5915. dimOp := IntermediateCode.Immediate(int32, dim);
  5916. GetMathArrayIncrement(type, operand, dimOp, check, result);
  5917. END GetMathArrayIncrementAt;
  5918. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  5919. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5920. offset: LONGINT;
  5921. BEGIN
  5922. IF increment THEN
  5923. offset := MathIncrOffset;
  5924. ELSE
  5925. offset := MathLenOffset;
  5926. END;
  5927. INC(offset,operand.dimOffset*2);
  5928. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  5929. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  5930. END;
  5931. (* static dimension *)
  5932. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5933. IF check & (type.form = SyntaxTree.Tensor) THEN
  5934. DimensionCheck(operand.tag,dim,BrltL);
  5935. END;
  5936. val := SHORT(dim.intValue);
  5937. IF type.form # SyntaxTree.Tensor THEN
  5938. t := SemanticChecker.ArrayBase(type,val);
  5939. type := t.resolved(SyntaxTree.MathArrayType);
  5940. IF type.form = SyntaxTree.Static THEN
  5941. IF increment THEN
  5942. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  5943. ELSE
  5944. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5945. END;
  5946. InitOperand(result,ModeValue);
  5947. result.op := res;
  5948. RETURN;
  5949. END;
  5950. END;
  5951. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  5952. MakeMemory(res,operand.tag,addressType,offset);
  5953. (*
  5954. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5955. *)
  5956. InitOperand(result,ModeValue);
  5957. result.op := res;
  5958. ELSE
  5959. Convert(dim,addressType);
  5960. IF check THEN
  5961. IF type.form = SyntaxTree.Tensor THEN
  5962. DimensionCheck(operand.tag,dim,BrltL);
  5963. ELSIF isUnchecked THEN (* do nothing *)
  5964. ELSE
  5965. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5966. END;
  5967. END;
  5968. end := NewLabel(); next := NIL;
  5969. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5970. Emit(Mov(position,res,dim));
  5971. Convert(res,int32);
  5972. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5973. WHILE t IS SyntaxTree.MathArrayType DO
  5974. type := t(SyntaxTree.MathArrayType);
  5975. IF type.form = SyntaxTree.Static THEN
  5976. imm := IntermediateCode.Immediate(int32,val);
  5977. next := NewLabel();
  5978. BrneL(next,imm,res);
  5979. IF increment THEN
  5980. imm := IntermediateCode.Immediate(int32,ToMemoryUnits(system,type.staticIncrementInBits));
  5981. ELSE
  5982. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5983. END;
  5984. Emit(MovReplace(position,res,imm));
  5985. BrL(end);
  5986. ELSE hasDynamicPart := TRUE;
  5987. END;
  5988. t := type.arrayBase.resolved;
  5989. val := val + 1;
  5990. IF next # NIL THEN SetLabel(next) END;
  5991. END;
  5992. IF hasDynamicPart THEN
  5993. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5994. Emit(Mov(position,res2,dim));
  5995. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  5996. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5997. Emit(Add(position,res2,res2,imm));
  5998. Emit(Add(position,res2,res2,operand.tag));
  5999. IntermediateCode.MakeMemory(res2,int32);
  6000. Emit(MovReplace(position,res,res2));
  6001. ReleaseIntermediateOperand(res2);
  6002. END;
  6003. SetLabel(end);
  6004. Convert(res,int32);
  6005. InitOperand(result,ModeValue);
  6006. result.op := res;
  6007. END;
  6008. END MathArrayLenOrIncr;
  6009. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6010. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6011. offset: LONGINT;
  6012. BEGIN
  6013. offset := operand.dimOffset+DynamicDim(type)-1;
  6014. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6015. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6016. val := SHORT(dim.intValue);
  6017. t := SemanticChecker.ArrayBase(type,val);
  6018. type := t.resolved(SyntaxTree.ArrayType);
  6019. IF type.form = SyntaxTree.Static THEN
  6020. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6021. ELSE
  6022. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6023. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6024. END;
  6025. UseIntermediateOperand(res);
  6026. InitOperand(result,ModeValue);
  6027. result.op := res;
  6028. ELSE
  6029. Convert(dim,addressType);
  6030. IF ~isUnchecked THEN
  6031. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6032. END;
  6033. end := NewLabel(); next := NIL;
  6034. (* ReuseCopy(dim,res); *)
  6035. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6036. Emit(Mov(position,res,dim));
  6037. Convert(res,int32);
  6038. Convert(res,int32);
  6039. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6040. WHILE t IS SyntaxTree.ArrayType DO
  6041. type := t(SyntaxTree.ArrayType);
  6042. IF type.form = SyntaxTree.Static THEN
  6043. imm := IntermediateCode.Immediate(int32,val);
  6044. next := NewLabel();
  6045. BrneL(next,imm,res);
  6046. imm := IntermediateCode.Immediate(int32,type.staticLength);
  6047. Emit(MovReplace(position,res,imm));
  6048. BrL(end);
  6049. ELSE hasDynamicPart := TRUE;
  6050. END;
  6051. t := type.arrayBase.resolved;
  6052. val := val + 1;
  6053. IF next # NIL THEN SetLabel(next) END;
  6054. END;
  6055. IF hasDynamicPart THEN
  6056. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6057. Convert(res2,addressType);
  6058. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6059. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6060. Emit(Sub(position,res2,imm,res2));
  6061. Emit(Add(position,res2,res2,operand.tag));
  6062. IntermediateCode.MakeMemory(res2,int32);
  6063. Emit(MovReplace(position,res,res2));
  6064. ReleaseIntermediateOperand(res2);
  6065. END;
  6066. SetLabel(end);
  6067. Convert(res,int32);
  6068. InitOperand(result,ModeValue);
  6069. result.op := res;
  6070. END;
  6071. END ArrayLen;
  6072. (**
  6073. create a temporary variable in current scope
  6074. **)
  6075. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN): SyntaxTree.Variable;
  6076. VAR name: SyntaxTree.Identifier; string: SyntaxTree.IdentifierString ; variable: SyntaxTree.Variable;
  6077. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6078. BEGIN
  6079. IF ~register THEN
  6080. variable := temporaries.GetFreeVariable(type, index);
  6081. ELSE
  6082. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6083. END;
  6084. scope := currentScope;
  6085. IF variable = NIL THEN
  6086. COPY("@hiddenIRVar",string);
  6087. Basic.AppendNumber(string,index);
  6088. name := SyntaxTree.NewIdentifier(string);
  6089. variable := SyntaxTree.NewVariable(Diagnostics.Invalid,name);
  6090. variable.SetType(type);
  6091. variable.SetAccess(SyntaxTree.Hidden);
  6092. IF ~register THEN
  6093. temporaries.AddVariable(variable);
  6094. IF scope.lastVariable # NIL THEN
  6095. offset := scope.lastVariable.offsetInBits;
  6096. ELSE
  6097. offset := 0;
  6098. END;
  6099. DEC(offset,system.SizeOf(variable.type));
  6100. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6101. variable(SyntaxTree.Variable).SetOffset(offset);
  6102. scope.AddVariable(variable(SyntaxTree.Variable));
  6103. scope.EnterSymbol(variable, duplicate);
  6104. ASSERT(~duplicate);
  6105. InitVariable(variable(SyntaxTree.Variable));
  6106. ELSE
  6107. variable.SetUseRegister(TRUE);
  6108. variable(SyntaxTree.Variable).SetOffset(0);
  6109. END;
  6110. ELSE
  6111. InitVariable(variable(SyntaxTree.Variable));
  6112. (*
  6113. ASSERT(variable.type.resolved = type.resolved)
  6114. *)
  6115. END;
  6116. RETURN variable(SyntaxTree.Variable)
  6117. END GetTemporaryVariable;
  6118. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6119. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6120. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6121. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6122. i: LONGINT; duplicate: BOOLEAN;
  6123. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6124. VAR variable: SyntaxTree.Variable;
  6125. BEGIN
  6126. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier(name));
  6127. variable.SetType(type);
  6128. recordScope.AddVariable(variable);
  6129. END AddVariable;
  6130. BEGIN
  6131. name := "@ArrayDescriptor";
  6132. Basic.AppendNumber(name,dimensions);
  6133. identifier := SyntaxTree.NewIdentifier(name);
  6134. parentScope := module.module.moduleScope;
  6135. symbol := parentScope.FindSymbol(identifier);
  6136. IF symbol # NIL THEN
  6137. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6138. type := typeDeclaration.declaredType;
  6139. ELSE
  6140. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier(name));
  6141. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6142. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6143. recordType := SyntaxTree.NewRecordType( -1, parentScope, recordScope);
  6144. recordType.SetTypeDeclaration(typeDeclaration);
  6145. recordType.SetState(SyntaxTree.Resolved);
  6146. typeDeclaration.SetDeclaredType(recordType);
  6147. AddVariable("@ptr",system.anyType);
  6148. AddVariable("@adr",system.addressType);
  6149. AddVariable("@flags",system.addressType);
  6150. AddVariable("@dim",system.addressType);
  6151. AddVariable("@elementSize",system.addressType);
  6152. FOR i := 0 TO dimensions-1 DO
  6153. name := "@len";
  6154. Basic.AppendNumber(name,i);
  6155. AddVariable(name,system.addressType);
  6156. name := "@incr";
  6157. Basic.AppendNumber(name,i);
  6158. AddVariable(name,system.addressType);
  6159. END;
  6160. parentScope.AddTypeDeclaration(typeDeclaration);
  6161. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6162. ASSERT(~duplicate);
  6163. type := recordType;
  6164. END;
  6165. RETURN type
  6166. END GetMathArrayDescriptorType;
  6167. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6168. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6169. BEGIN
  6170. type := GetMathArrayDescriptorType(dimensions);
  6171. Emit(Push(position,op.op));
  6172. (* push type descriptor *)
  6173. reg := TypeDescriptorAdr(type);
  6174. IF ~newObjectFile THEN
  6175. IntermediateCode.MakeMemory(reg,addressType);
  6176. END;
  6177. Emit(Push(position,reg));
  6178. ReleaseIntermediateOperand(reg);
  6179. (* push realtime flag: false by default *)
  6180. Emit(Push(position,false));
  6181. CallThis(position,"Heaps","NewRec",3);
  6182. END NewMathArrayDescriptor;
  6183. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6184. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6185. BEGIN
  6186. NEW(string, LEN(s)); COPY(s, string^);
  6187. sv := SyntaxTree.NewStringValue(-1,string);
  6188. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  6189. sv.SetType(type);
  6190. Designate(sv,res);
  6191. Emit(Push(position,res.tag));
  6192. Emit(Push(position,res.op));
  6193. ReleaseOperand(res);
  6194. END PushConstString;
  6195. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6196. BEGIN
  6197. IF b THEN
  6198. Emit(Push(-1, true));
  6199. ELSE
  6200. Emit(Push(-1, false));
  6201. END;
  6202. END PushConstBoolean;
  6203. PROCEDURE PushConstSet(v: SET);
  6204. VAR value: SyntaxTree.Value; op: Operand;
  6205. BEGIN
  6206. value := SyntaxTree.NewSetValue(-1, v);
  6207. value.SetType(system.setType);
  6208. Evaluate(value, op);
  6209. Emit(Push(-1, op.op));
  6210. ReleaseOperand(op);
  6211. END PushConstSet;
  6212. PROCEDURE PushConstInteger(v: LONGINT);
  6213. VAR value: SyntaxTree.Value; op: Operand;
  6214. BEGIN
  6215. value := SyntaxTree.NewIntegerValue(-1, v);
  6216. value.SetType(system.longintType);
  6217. Evaluate(value, op);
  6218. Emit(Push(-1, op.op));
  6219. ReleaseOperand(op);
  6220. END PushConstInteger;
  6221. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6222. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6223. section: IntermediateCode.Section;
  6224. BEGIN
  6225. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6226. Global.GetSymbolSegmentedName(symbol, name);
  6227. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6228. procedure := SyntaxTree.NewProcedure(-1, SyntaxTree.NewIdentifier(""), procedureScope);
  6229. procedure.SetScope(moduleScope);
  6230. procedure.SetType(SyntaxTree.NewProcedureType(-1,scope));
  6231. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6232. procedure.SetAccess(SyntaxTree.Hidden);
  6233. currentScope := procedureScope;
  6234. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6235. EmitEnter(section, -1,NIL,0,0,0);
  6236. RETURN section;
  6237. END OpenInitializer;
  6238. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6239. BEGIN
  6240. EmitLeave(section, 0, 0 );
  6241. Emit(Exit(-1,ToMemoryUnits(system,addressType.sizeInBits),0));
  6242. section := prev;
  6243. END CloseInitializer;
  6244. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6245. VAR name: SyntaxTree.IdentifierString;
  6246. variable: SyntaxTree.Variable;
  6247. type: SyntaxTree.Type;
  6248. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6249. BEGIN
  6250. InitOperand(op,ModeReference);
  6251. op.op := fp;
  6252. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6253. Dereference(op, x, FALSE);
  6254. result := op;
  6255. Symbol(symbol, op);
  6256. END Field;
  6257. PROCEDURE Direction(direction: LONGINT): SET;
  6258. BEGIN
  6259. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6260. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6261. ELSE HALT(100);
  6262. END;
  6263. END Direction;
  6264. PROCEDURE AddPortProperty(port: SyntaxTree.Variable; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6265. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6266. BEGIN
  6267. Field(port, op);
  6268. ToMemory(op.op,addressType,0);
  6269. Emit(Push(-1, op.op));
  6270. ReleaseOperand(op);
  6271. Basic.GetString(modifier.identifier, name);
  6272. PushConstString(name);
  6273. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6274. ASSERT(SemanticChecker.IsStringType(value.type));
  6275. Designate(value, op);
  6276. Emit(Push(modifier.position, op.tag));
  6277. Emit(Push(modifier.position, op.op));
  6278. ReleaseOperand(op);
  6279. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6280. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6281. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6282. Evaluate(value, op);
  6283. Emit(Push(modifier.position, op.op));
  6284. ReleaseOperand(op);
  6285. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6286. ELSE
  6287. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6288. END;
  6289. END AddPortProperty;
  6290. PROCEDURE AddPortProperties(variable: SyntaxTree.Variable);
  6291. VAR modifier: SyntaxTree.Modifier;
  6292. BEGIN
  6293. modifier := variable.modifiers;
  6294. WHILE modifier # NIL DO
  6295. AddPortProperty(variable,modifier, modifier.expression);
  6296. modifier := modifier.nextModifier;
  6297. END;
  6298. END AddPortProperties;
  6299. PROCEDURE Variable(name: ARRAY OF CHAR; variable: SyntaxTree.Variable);
  6300. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6301. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6302. PROCEDURE PushLens(type: SyntaxTree.Type);
  6303. BEGIN
  6304. IF IsSemiDynamicArray(type) THEN
  6305. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6306. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6307. Emit(Push(-1, op.op));
  6308. ReleaseOperand(op);
  6309. INC(dim);
  6310. ELSIF IsStaticArray(type) THEN
  6311. len := len * type(SyntaxTree.ArrayType).staticLength;
  6312. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6313. INC(dim);
  6314. ELSE
  6315. baseType := type;
  6316. END;
  6317. END PushLens;
  6318. BEGIN
  6319. (* cell *)
  6320. IF variable.type IS SyntaxTree.ArrayType THEN
  6321. type := variable.type;
  6322. dim := 0;
  6323. len := 1;
  6324. PushLens(type);
  6325. portType := baseType.resolved(SyntaxTree.PortType);
  6326. ELSE
  6327. portType := variable.type(SyntaxTree.PortType);
  6328. END;
  6329. PushSelfPointer();
  6330. (* port / array of ports *)
  6331. IF IsStaticArray(type) THEN
  6332. PushConstInteger(len);
  6333. END;
  6334. Field(variable, op);
  6335. (*left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6336. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(x);
  6337. d := SyntaxTree.NewSymbolDesignator(-1, left, variable); d.SetType(variable.type);
  6338. Designate(d, op);*)
  6339. Emit(Push(-1, op.op));
  6340. ReleaseOperand(op);
  6341. (* name *)
  6342. PushConstString(name);
  6343. (* inout *)
  6344. PushConstSet(Direction(portType.direction));
  6345. (* width *)
  6346. PushConstInteger(portType.sizeInBits);
  6347. IF variable.type IS SyntaxTree.PortType THEN
  6348. CallThis(variable.position,"ActiveCellsRuntime","AddPort",6);
  6349. AddPortProperties(variable);
  6350. ELSIF IsStaticArray(type)THEN
  6351. CallThis(variable.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6352. ELSIF IsSemiDynamicArray(type) THEN
  6353. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6354. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6355. Emit(Add(position,reg, sp, size));
  6356. (* dim *)
  6357. PushConstInteger(dim);
  6358. (* len array *)
  6359. Emit(Push(position, reg));
  6360. ReleaseIntermediateOperand(reg);
  6361. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6362. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6363. Emit(Add(position, sp,sp, size));
  6364. ELSE
  6365. HALT(100);
  6366. END;
  6367. END Variable;
  6368. BEGIN
  6369. IF backend.cellsAreObjects THEN
  6370. variable := x.cellScope.firstVariable;
  6371. WHILE (variable # NIL) DO
  6372. type := variable.type.resolved;
  6373. WHILE (type IS SyntaxTree.ArrayType) DO
  6374. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6375. END;
  6376. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6377. Global.GetSymbolNameInScope(variable,x.cellScope,name);
  6378. Variable(name,variable);
  6379. END;
  6380. variable := variable.nextVariable;
  6381. END;
  6382. ELSE HALT(200)
  6383. END;
  6384. (*prevActiveCellsScope := currentActiveCellsScope;*)
  6385. (*
  6386. x.typeDeclaration.GetName(componentName);
  6387. instanceType := currentActiveCellsScope.NewType(componentName); (*backend.cification.NewType(componentName);*)
  6388. IF HasValue(x.modifiers,Global.StringDataMemorySize,dataMemorySize) THEN
  6389. instanceType.SetDataMemorySize(dataMemorySize);
  6390. END;
  6391. IF HasValue(x.modifiers,Global.StringCodeMemorySize,codeMemorySize) THEN
  6392. instanceType.SetInstructionMemorySize(codeMemorySize)
  6393. END;
  6394. IF HasFlag(x.modifiers, Global.StringVector) THEN
  6395. instanceType.AddCapability(ActiveCells.VectorCapability)
  6396. END;
  6397. IF HasFlag(x.modifiers, Global.StringTRMS) THEN
  6398. instanceType.AddCapability(ActiveCells.TRMSCapability)
  6399. END;
  6400. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN
  6401. instanceType.AddCapability(ActiveCells.FloatingPointCapability)
  6402. END;
  6403. AddDevices(instanceType, x);
  6404. *)
  6405. (*
  6406. IF x.isCellNet THEN
  6407. IF HasValue(x.modifiers,Global.StringFrequencyDivider,value) THEN backend.activeCellsSpecification.SetFrequencyDivider(value) END;
  6408. END;
  6409. *)
  6410. (*currentActiveCellsScope := instanceType;*)
  6411. (*
  6412. parameter := x.firstParameter;
  6413. portIndex := 0;
  6414. WHILE parameter # NIL DO
  6415. parameter.GetName(parameterName);
  6416. parameterType := parameter.type.resolved;
  6417. Parameter(parameterName, parameterType);
  6418. (*
  6419. IF SemanticChecker.IsStaticArray(parameterType,parameterType,len) THEN
  6420. ParameterArray(parameterType);
  6421. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6422. FOR i := 0 TO len-1 DO
  6423. COPY(parameterName,name);
  6424. AppendIndex(name,i);
  6425. port := instanceType.NewPort(name,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6426. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6427. INC(portIndex);
  6428. END;
  6429. ELSE
  6430. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6431. port := instanceType.NewPort(parameterName,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6432. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6433. INC(portIndex);
  6434. END;
  6435. *)
  6436. parameter := parameter.nextParameter;
  6437. END;
  6438. *)
  6439. (*
  6440. Scope(x.cellScope);
  6441. currentActiveCellsScope := prevActiveCellsScope;
  6442. AddModules(instanceType,x.cellScope);
  6443. *)
  6444. END AddPorts;
  6445. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6446. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6447. BEGIN
  6448. Symbol(cell,op);
  6449. ToMemory(op.op,addressType,0);
  6450. Emit(Push(position,op.op));
  6451. ReleaseOperand(op);
  6452. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6453. PushConstString(name);
  6454. IF (value # NIL) THEN
  6455. ASSERT(
  6456. SemanticChecker.IsStringType(property.type)
  6457. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6458. OR (property.type.resolved IS SyntaxTree.FloatType)
  6459. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6460. OR (property.type.resolved IS SyntaxTree.SetType)
  6461. );
  6462. left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6463. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(cellType);
  6464. d := SyntaxTree.NewSymbolDesignator(-1, left, property); d.SetType(property.type);
  6465. Designate(d, op);
  6466. IF SemanticChecker.IsStringType(property.type) THEN
  6467. Emit(Push(-1, op.tag))
  6468. END;
  6469. Emit(Push(-1, op.op));
  6470. ReleaseOperand(op);
  6471. END;
  6472. IF value = NIL THEN
  6473. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6474. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6475. ASSERT(SemanticChecker.IsStringType(value.type));
  6476. Designate(value, op);
  6477. Emit(Push(property.position, op.tag));
  6478. Emit(Push(property.position, op.op));
  6479. ReleaseOperand(op);
  6480. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6481. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6482. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6483. Evaluate(value, op);
  6484. Emit(Push(property.position, op.op));
  6485. ReleaseOperand(op);
  6486. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6487. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6488. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6489. Evaluate(value, op);
  6490. Emit(Push(property.position, op.op));
  6491. ReleaseOperand(op);
  6492. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6493. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6494. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6495. Evaluate(value, op);
  6496. Emit(Push(property.position, op.op));
  6497. ReleaseOperand(op);
  6498. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6499. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6500. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6501. Evaluate(value, op);
  6502. Emit(Push(property.position, op.op));
  6503. ReleaseOperand(op);
  6504. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6505. ELSE
  6506. HALT(200);
  6507. END;
  6508. END AddProperty;
  6509. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6510. VAR symbol: SyntaxTree.Symbol;
  6511. BEGIN
  6512. WHILE modifier # NIL DO
  6513. symbol := cellType.cellScope.FindSymbol(modifier.identifier);
  6514. IF (symbol # NIL) & (symbol IS SyntaxTree.Property) THEN
  6515. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6516. ELSE
  6517. (*! move this check to checker *)
  6518. Error(modifier.position, "undefined property");
  6519. END;
  6520. modifier := modifier.nextModifier;
  6521. END;
  6522. END AddModifiers;
  6523. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6524. VAR last: SyntaxTree.Modifier;
  6525. BEGIN
  6526. IF to = NIL THEN
  6527. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6528. ELSE
  6529. last := to;
  6530. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6531. last := last.nextModifier;
  6532. END;
  6533. IF last.identifier # this.identifier THEN
  6534. ASSERT(last.nextModifier = NIL);
  6535. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6536. END;
  6537. END;
  6538. END AppendModifier;
  6539. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6540. BEGIN
  6541. WHILE this # NIL DO
  6542. AppendModifier(to, this);
  6543. this := this.nextModifier;
  6544. END;
  6545. END AppendModifiers;
  6546. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6547. VAR base: SyntaxTree.Type;
  6548. BEGIN
  6549. AppendModifiers(to, c.modifiers);
  6550. base := c.GetBaseValueType();
  6551. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6552. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6553. END;
  6554. END AppendCellTypeModifiers;
  6555. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6556. VAR op: Operand;
  6557. BEGIN
  6558. Evaluate(p, op);
  6559. Emit(Push(p.position, op.op));
  6560. ReleaseOperand(op);
  6561. (*
  6562. WHILE (p # NIL) & ~(p.type.resolved IS SyntaxTree.CellType) DO
  6563. p := p(SyntaxTree.Designator).left;
  6564. END;
  6565. IF p # NIL THEN
  6566. Evaluate(p, op);
  6567. Emit(Push(p.position, op.op));
  6568. ReleaseOperand(op);
  6569. ELSE
  6570. Emit(Push(-1, nil));
  6571. END;
  6572. *)
  6573. END PushPort;
  6574. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6575. VAR
  6576. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6577. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6578. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6579. tmp:IntermediateCode.Operand;
  6580. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6581. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6582. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6583. dest: IntermediateCode.Operand;
  6584. staticLength: LONGINT; itype: IntermediateCode.Type;
  6585. convert,isTensor: BOOLEAN;
  6586. recordType: SyntaxTree.RecordType;
  6587. baseType: SyntaxTree.Type;
  6588. flags: SET;
  6589. left: SyntaxTree.Expression;
  6590. call: SyntaxTree.Designator;
  6591. procedure: SyntaxTree.Procedure;
  6592. temporaryVariable: SyntaxTree.Variable;
  6593. dummy: IntermediateCode.Operand;
  6594. customBuiltin: SyntaxTree.CustomBuiltin;
  6595. isVarPar: ARRAY 3 OF BOOLEAN;
  6596. callsection: Sections.Section;
  6597. segmentedName: Basic.SegmentedName;
  6598. needsTrace: BOOLEAN;
  6599. n: ARRAY 256 OF CHAR;
  6600. modifier: SyntaxTree.Modifier;
  6601. previous, init: IntermediateCode.Section;
  6602. prevScope: SyntaxTree.Scope;
  6603. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6604. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6605. priority: IntermediateCode.Operand;
  6606. op,callop: Operand;
  6607. BEGIN
  6608. IF type = NIL THEN RETURN END;
  6609. type := type.resolved;
  6610. IF type IS SyntaxTree.PointerType THEN
  6611. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6612. END;
  6613. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6614. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6615. recordScope := type(SyntaxTree.RecordType).recordScope;
  6616. IF recordScope.bodyProcedure # NIL THEN
  6617. procedure := recordScope.bodyProcedure;
  6618. body := procedure.procedureScope.body;
  6619. Emit(Push(position,self));
  6620. IF body.isActive THEN
  6621. StaticCallOperand(callop,procedure);
  6622. Emit(Push(position,callop.op));
  6623. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6624. Convert(priority,sizeType);
  6625. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6626. END;
  6627. Emit(Push(position,priority));
  6628. ReleaseIntermediateOperand(priority);
  6629. IF backend.cooperative THEN
  6630. Emit(Push(position,self));
  6631. CallThis(position,"Activities","Create",3)
  6632. ELSE
  6633. flags := 0;
  6634. IF body.isSafe THEN
  6635. flags := 1;
  6636. END;
  6637. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6638. Emit(Push(position,self));
  6639. CallThis(position,"Objects","CreateProcess",4)
  6640. END;
  6641. ELSE
  6642. Emit(Push(position,self));
  6643. StaticCallOperand(callop,procedure);
  6644. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6645. END;
  6646. Emit(Pop(position,self));
  6647. END;
  6648. END CallBodies;
  6649. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6650. BEGIN
  6651. actualType := actualType.resolved;
  6652. IF actualType IS SyntaxTree.StringType THEN
  6653. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6654. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6655. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6656. ELSE
  6657. tmp := op.tag;
  6658. IntermediateCode.MakeMemory(tmp,addressType);
  6659. Emit(Push(position,tmp));
  6660. END;
  6661. Emit(Push(position,op.op))
  6662. END PushString;
  6663. PROCEDURE PushTD(type: SyntaxTree.Type);
  6664. VAR op: IntermediateCode.Operand;
  6665. BEGIN
  6666. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6667. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6668. ELSE
  6669. IF type.resolved IS SyntaxTree.PointerType THEN
  6670. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6671. END;
  6672. op := TypeDescriptorAdr(type.resolved);
  6673. IF ~newObjectFile THEN
  6674. IntermediateCode.MakeMemory(op,addressType);
  6675. END;
  6676. Emit(Push(position,op));
  6677. END
  6678. END PushTD;
  6679. BEGIN
  6680. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6681. dest := destination; destination := emptyOperand;
  6682. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6683. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6684. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6685. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6686. CASE x.id OF
  6687. (* ---- COPY ----- *)
  6688. |Global.Copy:
  6689. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6690. (* ---- EXCL, INCL----- *)
  6691. |Global.Excl,Global.Incl:
  6692. Evaluate(p0,s0);
  6693. Evaluate(p1,s1);
  6694. Convert(s1.op,setType);
  6695. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6696. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6697. END;
  6698. ReuseCopy(res,s0.op);
  6699. ReleaseOperand(s0);
  6700. Reuse1(tmp,s1.op);
  6701. ReleaseOperand(s1);
  6702. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6703. IF x.id = Global.Excl THEN
  6704. Emit(Not(position,tmp,tmp));
  6705. Emit(And(position,res,res,tmp));
  6706. ELSE
  6707. Emit(Or(position,res,res,tmp));
  6708. END;
  6709. ReleaseIntermediateOperand(tmp);
  6710. Designate(p0,s0);
  6711. ToMemory(s0.op,setType,0);
  6712. Emit(Mov(position,s0.op,res));
  6713. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6714. (* ---- DISPOSE ----- *)
  6715. |Global.Dispose:
  6716. Designate(p0,s0);
  6717. Emit(Push(position,s0.op));
  6718. ReleaseOperand(s0);
  6719. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6720. (* ---- GETPROCEDURE ----- *)
  6721. |Global.GetProcedure:
  6722. Designate(p0,s0);
  6723. PushString(s0,p0.type);
  6724. Designate(p1,s1);
  6725. PushString(s1,p1.type);
  6726. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6727. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6728. ELSE PushTD(procedureType.firstParameter.type)
  6729. END;
  6730. PushTD(procedureType.returnType);
  6731. Designate(p2,s2);
  6732. Emit(Push(position,s2.op));
  6733. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6734. CallThis(position,"Modules","GetProcedure", 7);
  6735. (* ---- ASH, LSH, ROT ----- *)
  6736. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6737. Evaluate(p0,s0);
  6738. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6739. (* make unsigned arguments in order to produced a logical shift *)
  6740. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6741. convert:= TRUE;
  6742. itype := s0.op.type;
  6743. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6744. Convert(s0.op,itype);
  6745. ELSE
  6746. convert := FALSE;
  6747. END;
  6748. END;
  6749. Evaluate(p1,s1);
  6750. IF IsIntegerConstant(p1,hint) THEN
  6751. ReuseCopy(reg,s0.op);
  6752. IF hint > 0 THEN
  6753. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6754. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6755. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6756. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  6757. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  6758. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  6759. END;
  6760. ELSIF hint < 0 THEN
  6761. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  6762. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  6763. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  6764. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  6765. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  6766. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  6767. END;
  6768. END;
  6769. ReleaseOperand(s0); ReleaseOperand(s1);
  6770. ELSE
  6771. exit := NewLabel();
  6772. end := NewLabel();
  6773. ReuseCopy(reg,s0.op);
  6774. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  6775. Reuse1(tmp,s1.op);
  6776. Emit(Neg(position,tmp,s1.op));
  6777. Convert(tmp,s1.op.type);
  6778. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  6779. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  6780. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  6781. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  6782. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  6783. END;
  6784. ReleaseIntermediateOperand(tmp);
  6785. BrL(end);
  6786. SetLabel(exit);
  6787. ReuseCopy(tmp,s1.op);
  6788. Convert(tmp,s1.op.type);
  6789. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  6790. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  6791. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  6792. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  6793. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  6794. END;
  6795. ReleaseIntermediateOperand(tmp);
  6796. SetLabel(end);
  6797. ReleaseOperand(s0); ReleaseOperand(s1);
  6798. END;
  6799. InitOperand(result,ModeValue);
  6800. IF convert THEN
  6801. itype := reg.type;
  6802. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  6803. Convert(reg,itype);
  6804. END;
  6805. result.op := reg;
  6806. (* ---- CAP ----- *)
  6807. |Global.Cap:
  6808. Evaluate(p0,result);
  6809. ReuseCopy(reg,result.op);
  6810. ReleaseIntermediateOperand(result.op);
  6811. ignore := NewLabel();
  6812. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  6813. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  6814. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  6815. SetLabel(ignore);
  6816. result.op := reg;
  6817. (* ---- CHR ----- *)
  6818. |Global.Chr, Global.Chr32:
  6819. Evaluate(p0,result);
  6820. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6821. |Global.Entier, Global.EntierH:
  6822. Evaluate(p0,result);
  6823. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6824. (* ---- MIN and MAX ----- *)
  6825. |Global.Max,Global.Min:
  6826. Evaluate(p0,s0);
  6827. Evaluate(p1,s1);
  6828. Reuse2(res,s0.op,s1.op);
  6829. else := NewLabel();
  6830. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  6831. ELSE BrltL(else,s1.op,s0.op) END;
  6832. Emit(Mov(position,res,s0.op));
  6833. ReleaseOperand(s0);
  6834. end := NewLabel();
  6835. BrL(end);
  6836. SetLabel(else);
  6837. Emit(MovReplace(position,res,s1.op));
  6838. SetLabel(end);
  6839. ReleaseOperand(s1);
  6840. InitOperand(result,ModeValue);
  6841. result.op := res;
  6842. (* ---- ODD ----- *)
  6843. |Global.Odd:
  6844. IF ~conditional THEN
  6845. ConditionToValue(x)
  6846. ELSE
  6847. Evaluate(p0,result);
  6848. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6849. Reuse1(res,result.op);
  6850. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  6851. ReleaseIntermediateOperand(result.op);
  6852. result.op := res;
  6853. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  6854. ReleaseOperand(result);
  6855. BrL(falseLabel);
  6856. END;
  6857. (* ---- ORD ----- *)
  6858. |Global.Ord, Global.Ord32:
  6859. Evaluate(p0,result);
  6860. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6861. (* ---- SHORT, LONG ----- *)
  6862. |Global.Short, Global.Long:
  6863. Evaluate(p0,result);
  6864. IF x.type IS SyntaxTree.ComplexType THEN
  6865. componentType := x.type(SyntaxTree.ComplexType).componentType;
  6866. Convert(result.op, IntermediateCode.GetType(system, componentType));
  6867. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  6868. ELSE
  6869. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6870. END
  6871. (* ---- HALT, SYSTEM.HALT----- *)
  6872. |Global.Halt, Global.systemHalt:
  6873. val := p0.resolved(SyntaxTree.IntegerValue).value;
  6874. EmitTrap (position, val);
  6875. (* ---- ASSERT ----- *)
  6876. |Global.Assert:
  6877. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  6878. trueL := NewLabel();
  6879. falseL := NewLabel();
  6880. Condition(p0,trueL,falseL);
  6881. IF p1 = NIL THEN val := AssertTrap
  6882. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  6883. END;
  6884. SetLabel(falseL);
  6885. EmitTrap(position,val);
  6886. SetLabel(trueL);
  6887. END;
  6888. (*
  6889. Emit(TrapC(result.op,val);
  6890. *)
  6891. (* ---- INC, DEC----- *)
  6892. |Global.Inc,Global.Dec:
  6893. Expression(p0); adr := result.op;
  6894. LoadValue(result,p0.type); l := result;
  6895. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6896. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  6897. END;
  6898. IF x.id = Global.Inc THEN
  6899. Emit(Add(position,l.op,l.op,r.op));
  6900. ELSE
  6901. Emit(Sub(position,l.op,l.op,r.op));
  6902. END;
  6903. ReleaseOperand(l); ReleaseOperand(r);
  6904. (* ---- LEN ----- *)
  6905. |Global.Len: (* dynamic length, static length done by checker *)
  6906. Designate(p0,operand);
  6907. IF p1 = NIL THEN
  6908. InitOperand(l,ModeValue);
  6909. l.op := IntermediateCode.Immediate(int32,0);
  6910. ELSE
  6911. Evaluate(p1,l);
  6912. END;
  6913. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  6914. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  6915. Dereference(operand, p0.type.resolved, FALSE);
  6916. END;
  6917. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  6918. ReleaseOperand(operand); ReleaseOperand(l);
  6919. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  6920. ASSERT(p1 # NIL);
  6921. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  6922. Dereference(operand,p0.type.resolved,FALSE);
  6923. END;
  6924. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  6925. ReleaseOperand(operand); ReleaseOperand(l);
  6926. ELSE HALT(100);
  6927. END;
  6928. Convert(result.op,IntermediateCode.GetType(system, x.type));
  6929. (* ---- FIRST ---- *)
  6930. |Global.First:
  6931. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6932. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  6933. ELSE
  6934. Designate(p0, result)
  6935. END
  6936. (* ---- LAST ---- *)
  6937. |Global.Last:
  6938. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6939. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  6940. ELSE
  6941. Designate(p0, result);
  6942. (* make sure result.op is a register *)
  6943. tmp := result.op;
  6944. ReuseCopy(result.op, result.op);
  6945. ReleaseIntermediateOperand(tmp);
  6946. (* add offset to result.op *)
  6947. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6948. END
  6949. (* ---- STEP ---- *)
  6950. |Global.Step:
  6951. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6952. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  6953. ELSE
  6954. Designate(p0, result);
  6955. (* make sure result.op is a register *)
  6956. tmp := result.op;
  6957. ReuseCopy(result.op, result.op);
  6958. ReleaseIntermediateOperand(tmp);
  6959. (* add offset to result.op *)
  6960. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6961. END
  6962. (* ---- RE ---- *)
  6963. |Global.Re:
  6964. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  6965. Designate(p0, result)
  6966. ELSE
  6967. Evaluate(p0, result)
  6968. END
  6969. (* ---- IM ---- *)
  6970. |Global.Im:
  6971. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  6972. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  6973. Designate(p0, result);
  6974. (* make sure result.op is a register *)
  6975. tmp := result.op;
  6976. ReuseCopy(result.op, result.op);
  6977. ReleaseIntermediateOperand(tmp);
  6978. (* add offset to result.op *)
  6979. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  6980. (* ---- ABS ----- *)
  6981. |Global.Abs:
  6982. Evaluate(p0,operand);
  6983. type := p0.type.resolved;
  6984. InitOperand(result,ModeValue);
  6985. Reuse1a(result.op,operand.op,dest);
  6986. Emit(Abs(position,result.op,operand.op));
  6987. ReleaseOperand(operand);
  6988. (* ---- WAIT ----- *)
  6989. |Global.Wait:
  6990. Evaluate(p0,operand);
  6991. Emit(Push(position,operand.op));
  6992. ReleaseOperand(operand);
  6993. CallThis(position,"Activities","Wait", 1);
  6994. (* ---- NEW ----- *)
  6995. |Global.New:
  6996. (*! the following code is only correct for "standard" Oberon calling convention *)
  6997. type := p0.type.resolved;
  6998. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  6999. THEN
  7000. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7001. IF backend.cooperative THEN
  7002. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7003. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7004. IF recordType.isObject THEN
  7005. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7006. IF recordType.IsActive() THEN
  7007. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7008. END;
  7009. IF recordType.IsProtected() THEN
  7010. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7011. END;
  7012. ELSE
  7013. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7014. END;
  7015. END;
  7016. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7017. CallThis(position,"Runtime","New", 1);
  7018. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7019. Emit(Result(position, pointer));
  7020. exit := NewLabel();
  7021. BreqL(exit,pointer,nil);
  7022. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7023. GetRecordTypeName (recordType,name);
  7024. IF ~recordType.isObject THEN
  7025. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7026. END;
  7027. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7028. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7029. IF recordType.isObject THEN
  7030. IF recordType.IsProtected() THEN
  7031. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7032. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7033. END;
  7034. IF recordType.IsActive() THEN
  7035. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7036. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7037. END;
  7038. END;
  7039. END;
  7040. (* initialize fields *)
  7041. IF type(SyntaxTree.PointerType).isPlain THEN
  7042. size := 0;
  7043. ELSIF recordType.isObject THEN
  7044. size := BaseObjectTypeSize;
  7045. ELSE
  7046. size := BaseRecordTypeSize;
  7047. END;
  7048. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7049. (* call initializer *)
  7050. constructor := GetConstructor(recordType);
  7051. IF constructor # NIL THEN
  7052. (*! should be unified with ProcedureCallDesignator *)
  7053. Emit(Push(position,pointer));
  7054. ReleaseIntermediateOperand(pointer);
  7055. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7056. FOR i := 1 TO x.parameters.Length()-1 DO
  7057. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7058. formalParameter := formalParameter.nextParameter;
  7059. END;
  7060. (* static call of the constructor *)
  7061. GetCodeSectionNameForSymbol(constructor,name);
  7062. ASSERT(~constructor.isInline);
  7063. IF constructor.scope.ownerModule # module.module THEN
  7064. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7065. ELSE
  7066. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7067. END;
  7068. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7069. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7070. Emit(Pop(position,pointer));
  7071. END;
  7072. (* call bodies *)
  7073. CallBodies(pointer,p0.type);
  7074. SetLabel(exit);
  7075. needsTrace := p0.NeedsTrace();
  7076. IF needsTrace THEN ModifyAssignments(true) END;
  7077. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7078. Emit(Push(position, pointer));
  7079. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7080. Emit(Pop(position, pointer));
  7081. END;
  7082. Designate(p0,l);
  7083. IF needsTrace THEN
  7084. CallAssignPointer(l.op, pointer);
  7085. ELSE
  7086. ToMemory(l.op,addressType,0);
  7087. Emit(Mov(position,l.op,pointer));
  7088. END;
  7089. ReleaseIntermediateOperand(pointer);
  7090. ReleaseOperand(l);
  7091. IF needsTrace THEN ModifyAssignments(false) END;
  7092. ELSE
  7093. temporaryVariable := GetTemporaryVariable(type, FALSE);
  7094. IF temporaryVariable # NIL THEN
  7095. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7096. ELSE
  7097. Designate(p0,l);
  7098. END;
  7099. (* l.op contains address of pointer to record *)
  7100. Emit(Push(position,l.op)); (* address for use after syscall *)
  7101. Emit(Push(position,l.op));
  7102. ReleaseOperand(l);
  7103. (* push type descriptor *)
  7104. reg := TypeDescriptorAdr(recordType);
  7105. IF ~newObjectFile THEN
  7106. IntermediateCode.MakeMemory(reg,addressType);
  7107. END;
  7108. Emit(Push(position,reg));
  7109. ReleaseIntermediateOperand(reg);
  7110. (* push realtime flag *)
  7111. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7112. ELSE Emit(Push(position,false));
  7113. END;
  7114. CallThis(position,"Heaps","NewRec", 3);
  7115. (* check allocation success, if not successful then do not call initializers and bodies *)
  7116. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7117. Emit(Pop(position,pointer));
  7118. MakeMemory(reg,pointer,addressType,0);
  7119. ReleaseIntermediateOperand(pointer);
  7120. pointer := reg;
  7121. exit := NewLabel();
  7122. BreqL(exit,pointer,nil);
  7123. Emit(Push(position,pointer));
  7124. (* initialize fields *)
  7125. InitFields(recordType, pointer,0);
  7126. (* call initializer *)
  7127. constructor := GetConstructor(recordType);
  7128. IF constructor # NIL THEN
  7129. (*! should be unified with ProcedureCallDesignator *)
  7130. Emit(Push(position,pointer));
  7131. ReleaseIntermediateOperand(pointer);
  7132. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7133. FOR i := 1 TO x.parameters.Length()-1 DO
  7134. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7135. formalParameter := formalParameter.nextParameter;
  7136. END;
  7137. (* static call of the constructor *)
  7138. GetCodeSectionNameForSymbol(constructor,name);
  7139. ASSERT(~constructor.isInline);
  7140. IF constructor.scope.ownerModule # module.module THEN
  7141. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7142. ELSE
  7143. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7144. END;
  7145. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7146. ELSE
  7147. ReleaseIntermediateOperand(pointer);
  7148. END;
  7149. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7150. Emit(Pop(position,pointer));
  7151. IF temporaryVariable # NIL THEN
  7152. Designate(p0,l);
  7153. ToMemory(l.op,addressType,0);
  7154. Emit(Mov(position,l.op,pointer));
  7155. ReleaseOperand(l);
  7156. result.tag := emptyOperand;
  7157. END;
  7158. (* call bodies *)
  7159. CallBodies(pointer,p0.type);
  7160. ReleaseIntermediateOperand(pointer);
  7161. IF temporaryVariable # NIL THEN
  7162. end := NewLabel();
  7163. BrL(end);
  7164. SetLabel(exit);
  7165. Designate(p0,l);
  7166. ToMemory(l.op,addressType,0);
  7167. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7168. ReleaseOperand(l);
  7169. SetLabel(end);
  7170. ELSE
  7171. SetLabel(exit);
  7172. END;
  7173. END;
  7174. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7175. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7176. dim := 0;
  7177. IF p1 # NIL THEN
  7178. FOR i := 1 TO x.parameters.Length()-1 DO
  7179. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7180. parameter := x.parameters.GetExpression(i);
  7181. Evaluate(parameter,r);
  7182. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7183. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7184. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7185. END;
  7186. Emit(Push(position,r.op));
  7187. IF i=1 THEN
  7188. ReuseCopy(reg,r.op);
  7189. ELSE
  7190. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7191. END;
  7192. ReleaseOperand(r);
  7193. INC(dim);
  7194. END;
  7195. Convert(reg,addressType);
  7196. ELSE
  7197. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7198. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7199. END;
  7200. openDim := dim;
  7201. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7202. IF backend.cooperative THEN
  7203. size := ToMemoryUnits(system,system.SizeOf(type));
  7204. WHILE type IS SyntaxTree.ArrayType DO
  7205. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7206. END;
  7207. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7208. IF (size # 1) THEN
  7209. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7210. END;
  7211. Emit(Push(position,reg));
  7212. size := ToMemoryUnits(system,system.SizeOf(type));
  7213. IF (size # 1) THEN
  7214. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7215. END;
  7216. Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));
  7217. Emit(Push(position,reg));
  7218. ReleaseIntermediateOperand(reg);
  7219. CallThis(position,"Runtime","New", 1);
  7220. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7221. Emit(Result(position, pointer));
  7222. exit := NewLabel();
  7223. else := NewLabel();
  7224. BreqL(else,pointer,nil);
  7225. IF ~type.hasPointers THEN
  7226. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7227. ELSIF type IS SyntaxTree.RecordType THEN
  7228. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7229. ELSIF type IS SyntaxTree.ProcedureType THEN
  7230. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7231. ELSE
  7232. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7233. END;
  7234. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7235. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7236. 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))));
  7237. IF type IS SyntaxTree.RecordType THEN
  7238. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7239. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7240. ELSE
  7241. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7242. END;
  7243. i := openDim;
  7244. WHILE i > 0 DO
  7245. DEC (i);
  7246. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7247. END;
  7248. needsTrace := p0.NeedsTrace();
  7249. IF needsTrace THEN ModifyAssignments(true) END;
  7250. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7251. Emit(Push(position, pointer));
  7252. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7253. Emit(Pop(position, pointer));
  7254. END;
  7255. Designate(p0,l);
  7256. IF needsTrace THEN
  7257. CallAssignPointer(l.op, pointer);
  7258. ModifyAssignments(false);
  7259. ELSE
  7260. ToMemory(l.op,addressType,0);
  7261. Emit(Mov(position,l.op,pointer));
  7262. END;
  7263. ReleaseIntermediateOperand(pointer);
  7264. ReleaseOperand(l);
  7265. BrL(exit);
  7266. SetLabel(else);
  7267. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7268. Designate(p0,l);
  7269. IF needsTrace THEN
  7270. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7271. ELSE
  7272. ToMemory(l.op,addressType,0);
  7273. Emit(Mov(position,l.op,pointer));
  7274. END;
  7275. ReleaseOperand(l);
  7276. SetLabel(exit);
  7277. ELSE
  7278. (*! the following code is only correct for "standard" Oberon calling convention *)
  7279. IF SemanticChecker.ContainsPointer(type) THEN
  7280. IF type IS SyntaxTree.ArrayType THEN
  7281. staticLength := 1;
  7282. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7283. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7284. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7285. END;
  7286. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7287. Emit(Mul(position,reg,reg,tmp));
  7288. END;
  7289. Designate(p0,l);
  7290. IF openDim > 0 THEN
  7291. Emit(Push(position,l.op)); (* address for use after syscall *)
  7292. END;
  7293. Emit(Push(position,l.op)); (* address *)
  7294. ReleaseOperand(l);
  7295. tmp := TypeDescriptorAdr(type);
  7296. IF ~newObjectFile THEN
  7297. IntermediateCode.MakeMemory(tmp,addressType);
  7298. END;
  7299. Emit(Push(position,tmp)); (* type descriptor *)
  7300. ReleaseIntermediateOperand(tmp);
  7301. Emit(Push(position,reg)); (* number Elements *)
  7302. ReleaseIntermediateOperand(reg);
  7303. tmp := IntermediateCode.Immediate(addressType,dim);
  7304. Emit(Push(position,tmp)); (* dimensions *)
  7305. (* push realtime flag *)
  7306. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7307. ELSE Emit(Push(position,false));
  7308. END;
  7309. CallThis(position,"Heaps","NewArr",5)
  7310. ELSE
  7311. size := ToMemoryUnits(system,system.SizeOf(type));
  7312. IF (size # 1) THEN
  7313. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7314. END;
  7315. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7316. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7317. Emit(Add(position,reg,reg,tmp));
  7318. Designate(p0,l);
  7319. IF openDim >0 THEN
  7320. Emit(Push(position,l.op)); (* address for use after syscall *)
  7321. END;
  7322. Emit(Push(position,l.op)); (* address for syscall *)
  7323. ReleaseOperand(l); (* pointer address *)
  7324. Emit(Push(position,reg)); (* size *)
  7325. ReleaseIntermediateOperand(reg);
  7326. (* push realtime flag *)
  7327. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7328. ELSE Emit(Push(position,false));
  7329. END;
  7330. CallThis(position,"Heaps","NewSys", 3)
  7331. END;
  7332. IF openDim > 0 THEN
  7333. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7334. Emit(Pop(position,adr));
  7335. ToMemory(adr,addressType,0);
  7336. ReuseCopy(tmp,adr);
  7337. ReleaseIntermediateOperand(adr);
  7338. adr := tmp;
  7339. else := NewLabel();
  7340. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7341. i := openDim-1;
  7342. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7343. WHILE (i >= 0) DO
  7344. Emit(Pop(position,reg));
  7345. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7346. Emit(Mov(position,res,reg));
  7347. DEC(i);
  7348. END;
  7349. ReleaseIntermediateOperand(adr);
  7350. ReleaseIntermediateOperand(reg);
  7351. exit := NewLabel();
  7352. BrL(exit);
  7353. SetLabel(else);
  7354. (* else part: array could not be allocated *)
  7355. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7356. Emit(Add(position,sp,sp,tmp));
  7357. SetLabel(exit);
  7358. END;
  7359. END;
  7360. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7361. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7362. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7363. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7364. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7365. left.SetType(procedure.type);
  7366. formalParameter := procedureType.firstParameter;
  7367. (* push array to allocate *)
  7368. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7369. formalParameter :=formalParameter.nextParameter;
  7370. (* push length array *)
  7371. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7372. (* push size *)
  7373. type := t0;
  7374. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7375. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7376. END;
  7377. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7378. Emit(Push(position,tmp));
  7379. (* *)
  7380. IF SemanticChecker.ContainsPointer(type) THEN
  7381. tmp := TypeDescriptorAdr(type);
  7382. IF ~newObjectFile THEN
  7383. IntermediateCode.MakeMemory(tmp,addressType);
  7384. END;
  7385. ELSE
  7386. tmp := IntermediateCode.Immediate(addressType, 0);
  7387. END;
  7388. Emit(Push(position,tmp)); (* type descriptor *)
  7389. StaticCallOperand(result,procedure);
  7390. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7391. ReleaseOperand(result);
  7392. END;
  7393. (*
  7394. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7395. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7396. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7397. *)
  7398. ELSE
  7399. dim := 0;
  7400. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7401. (* generate geometry descriptor *)
  7402. Designate(p0,l);
  7403. NewMathArrayDescriptor(l, x.parameters.Length()-1);
  7404. ReleaseOperand(l);
  7405. isTensor := TRUE;
  7406. ELSE
  7407. isTensor := FALSE;
  7408. END;
  7409. FOR i := 1 TO x.parameters.Length()-1 DO
  7410. IF ~isTensor THEN
  7411. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7412. END;
  7413. parameter := x.parameters.GetExpression(i);
  7414. Evaluate(parameter,r);
  7415. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7416. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7417. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7418. END;
  7419. Emit(Push(position,r.op));
  7420. IF i=1 THEN
  7421. ReuseCopy(reg,r.op);
  7422. ELSE
  7423. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7424. END;
  7425. ReleaseOperand(r);
  7426. INC(dim);
  7427. END;
  7428. Convert(reg,addressType);
  7429. openDim := dim;
  7430. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7431. (*! the following code is only correct for "standard" Oberon calling convention *)
  7432. IF SemanticChecker.ContainsPointer(SemanticChecker.ArrayBase(type,MAX(LONGINT))) THEN
  7433. t := type;
  7434. IF ~isTensor & (t IS SyntaxTree.MathArrayType) THEN
  7435. staticLength := 1;
  7436. WHILE (t IS SyntaxTree.MathArrayType) DO (* static array *)
  7437. staticLength := staticLength * t(SyntaxTree.MathArrayType).staticLength;
  7438. t := t(SyntaxTree.MathArrayType).arrayBase.resolved;
  7439. END;
  7440. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7441. Emit(Mul(position,reg,reg,tmp));
  7442. END;
  7443. Designate(p0,l);
  7444. IF isTensor THEN
  7445. Dereference(l,type,FALSE);
  7446. t := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7447. END;
  7448. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7449. Emit(Push(position,l.tag)); (* address *)
  7450. ReleaseOperand(l);
  7451. tmp := TypeDescriptorAdr(t);
  7452. IF ~newObjectFile THEN
  7453. IntermediateCode.MakeMemory(tmp,addressType);
  7454. END;
  7455. Emit(Push(position,tmp)); (* type descriptor *)
  7456. ReleaseIntermediateOperand(tmp);
  7457. Emit(Push(position,reg)); (* number Elements *)
  7458. ReleaseIntermediateOperand(reg);
  7459. tmp := IntermediateCode.Immediate(addressType,0);
  7460. Emit(Push(position,tmp)); (* dimensions = 0, we control dimensions in the geometry descriptor *)
  7461. (* push realtime flag: false by default *)
  7462. Emit(Push(position,false));
  7463. CallThis(position,"Heaps","NewArr",5);
  7464. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7465. Emit(Pop(position,adr));
  7466. GetMathArrayField(tmp,adr,MathPtrOffset);
  7467. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7468. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrDataArrayOffset))));
  7469. PutMathArrayField(adr,reg,MathAdrOffset);
  7470. ReleaseIntermediateOperand(tmp);
  7471. ReleaseIntermediateOperand(reg);
  7472. ELSE
  7473. IF isTensor THEN
  7474. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT))));
  7475. ELSE
  7476. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim)));
  7477. END;
  7478. IF (size # 1) THEN
  7479. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7480. END;
  7481. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset));
  7482. Emit(Add(position,reg,reg,tmp));
  7483. Designate(p0,l);
  7484. IF isTensor THEN
  7485. Dereference(l,type,FALSE);
  7486. END;
  7487. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7488. Emit(Push(position,l.tag)); (* address for syscall *)
  7489. ReleaseOperand(l); (* pointer address *)
  7490. Emit(Push(position,reg)); (* size *)
  7491. ReleaseIntermediateOperand(reg);
  7492. (* push realtime flag: false by default *)
  7493. Emit(Push(position,false));
  7494. CallThis(position,"Heaps","NewSys",3);
  7495. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7496. Emit(Pop(position,adr));
  7497. GetMathArrayField(tmp,adr,MathPtrOffset);
  7498. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7499. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset))));
  7500. PutMathArrayField(adr,reg,MathAdrOffset);
  7501. ReleaseIntermediateOperand(tmp);
  7502. ReleaseIntermediateOperand(reg);
  7503. END;
  7504. flags := {};
  7505. IntermediateCode.InitImmediate(tmp,addressType,SYSTEM.VAL(LONGINT,flags));
  7506. PutMathArrayField(adr,tmp,MathFlagsOffset);
  7507. IntermediateCode.InitImmediate(tmp,addressType,openDim);
  7508. PutMathArrayField(adr,tmp,MathDimOffset);
  7509. else := NewLabel();
  7510. BreqL(else,IntermediateCode.Memory(addressType,adr,0),IntermediateCode.Immediate(addressType,0));
  7511. i := openDim-1;
  7512. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7513. IF isTensor THEN
  7514. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT)))));
  7515. ELSE
  7516. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim))));
  7517. END;
  7518. PutMathArrayField(adr,tmp,MathElementSizeOffset);
  7519. WHILE (i >= 0) DO
  7520. Emit(Pop(position,reg));
  7521. PutMathArrayLength(adr,reg,i);
  7522. PutMathArrayIncrement(adr,tmp,i);
  7523. IF i > 0 THEN
  7524. IF i=openDim-1 THEN
  7525. ReuseCopy(tmp,tmp);
  7526. END;
  7527. Emit(Mul(position,tmp,tmp,reg));
  7528. END;
  7529. DEC(i);
  7530. END;
  7531. ReleaseIntermediateOperand(adr);
  7532. ReleaseIntermediateOperand(reg);
  7533. ReleaseIntermediateOperand(tmp);
  7534. exit := NewLabel();
  7535. BrL(exit);
  7536. SetLabel(else);
  7537. (* else part: array could not be allocated *)
  7538. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7539. Emit(Add(position,sp,sp,tmp));
  7540. SetLabel(exit);
  7541. END;
  7542. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7543. THEN
  7544. IF ~backend.cellsAreObjects THEN RETURN END;
  7545. IF InCellScope(currentScope) THEN
  7546. PushSelfPointer()
  7547. ELSE
  7548. Emit(Push(position, nil));
  7549. END;
  7550. (* push temp address *)
  7551. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7552. temporaryVariable := GetTemporaryVariable(type, FALSE);
  7553. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7554. (* l.op contains address of pointer to record *)
  7555. Emit(Push(position,l.op)); (* address for use after syscall *)
  7556. ReleaseOperand(l);
  7557. (* push type descriptor *)
  7558. reg := TypeDescriptorAdr(baseType);
  7559. IF ~newObjectFile THEN
  7560. IntermediateCode.MakeMemory(reg,addressType);
  7561. END;
  7562. Emit(Push(position,reg));
  7563. ReleaseIntermediateOperand(reg);
  7564. (* push name *)
  7565. (*Global.GetSymbolName(p0, n);*)
  7566. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7567. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7568. ELSE
  7569. Global.GetModuleName(module.module, n);
  7570. END;
  7571. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position);
  7572. (*type.typeDeclaration.GetName(n);*)
  7573. PushConstString(n);
  7574. (* push cellnet boolean *)
  7575. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7576. (* push engine boolean *)
  7577. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7578. (* allocate *)
  7579. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7580. (* add capabilities *)
  7581. modifier := p0(SyntaxTree.Designator).modifiers;
  7582. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7583. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7584. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7585. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7586. END;
  7587. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7588. (*
  7589. modifier := baseType(SyntaxTree.CellType).modifiers;
  7590. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7591. modifier := p0(SyntaxTree.Designator).modifiers;
  7592. *)
  7593. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7594. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7595. (* l.op contains address of pointer to record *)
  7596. ToMemory(l.op,addressType,0);
  7597. (* l.op contains value of pointer to record *)
  7598. Emit(Push(position,l.op)); (* address for use after syscall *)
  7599. ReleaseOperand(l);
  7600. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7601. prevScope := currentScope;
  7602. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7603. previous := section;
  7604. section := init;
  7605. (* add ports *)
  7606. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7607. CloseInitializer(previous);
  7608. currentScope := prevScope;
  7609. Symbol(temporaryVariable,l);
  7610. ToMemory(l.op,addressType,0);
  7611. Emit(Push(position,l.op));
  7612. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7613. (*
  7614. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7615. IF constructor # NIL THEN
  7616. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7617. FOR i := 1 TO x.parameters.Length()-1 DO
  7618. p := x.parameters.GetExpression(i);
  7619. Global.GetSymbolName(parameter,name);
  7620. Evaluate(p, value);
  7621. ASSERT(value.type # NIL);
  7622. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7623. par := instance.AddParameter(name);
  7624. par.SetInteger(value.integer);
  7625. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7626. par := instance.AddParameter(name);
  7627. par.SetBoolean(value.boolean);
  7628. ELSE Error(x.position,NotYetImplemented)
  7629. END;
  7630. parameter := parameter.nextParameter
  7631. END;
  7632. END;
  7633. *)
  7634. (* call initializer *)
  7635. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7636. IF constructor # NIL THEN
  7637. (*! should be unified with ProcedureCallDesignator *)
  7638. IF backend.cellsAreObjects THEN
  7639. Symbol(temporaryVariable,l);
  7640. ToMemory(l.op,addressType,0);
  7641. Emit(Push(position,l.op));
  7642. ReleaseOperand(l);
  7643. END;
  7644. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7645. FOR i := 1 TO x.parameters.Length()-1 DO
  7646. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7647. formalParameter := formalParameter.nextParameter;
  7648. END;
  7649. (* static call of the constructor *)
  7650. Global.GetSymbolSegmentedName(constructor,name);
  7651. ASSERT(~constructor.isInline);
  7652. IF constructor.scope.ownerModule # module.module THEN
  7653. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7654. ELSE
  7655. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7656. END;
  7657. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7658. (*ELSE
  7659. ReleaseIntermediateOperand(pointer);*)
  7660. END;
  7661. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7662. ToMemory(l.op, addressType, 0);
  7663. Designate(p0,s0);
  7664. ToMemory(s0.op,addressType,0);
  7665. Emit(Mov(position,s0.op,l.op));
  7666. ReleaseOperand(l);
  7667. ReleaseOperand(s0);
  7668. result.tag := emptyOperand;
  7669. (* start *)
  7670. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7671. (* push cell *)
  7672. Symbol(temporaryVariable, l);
  7673. ToMemory(l.op,addressType,0);
  7674. Emit(Push(-1,l.op));
  7675. (* push delegate *)
  7676. Emit(Push(-1,l.op));
  7677. ReleaseOperand(l);
  7678. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7679. Emit(Push(position, s1.op));
  7680. ReleaseOperand(s1);
  7681. CallThis(position,"ActiveCellsRuntime","Start",3);
  7682. END;
  7683. (*IF temporaryVariable # NIL THEN
  7684. end := NewLabel();
  7685. BrL(end);
  7686. SetLabel(exit);
  7687. Designate(p0,l);
  7688. ToMemory(l.op,addressType,0);
  7689. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7690. ReleaseOperand(l);
  7691. SetLabel(end);
  7692. ELSE
  7693. SetLabel(exit);
  7694. END;
  7695. *)
  7696. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7697. ELSE (* no pointer to record, no pointer to array *)
  7698. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7699. (* ignore new statement *)
  7700. Warning(p0.position, "cannot run on final hardware");
  7701. ELSE
  7702. HALT(200);
  7703. END;
  7704. END;
  7705. (* ---- ADDRESSOF----- *)
  7706. |Global.systemAdr:
  7707. Designate(p0,s0);
  7708. s0.mode := ModeValue;
  7709. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7710. ReleaseIntermediateOperand(s0.op);
  7711. s0.op := s0.tag;
  7712. IntermediateCode.InitOperand(s0.tag);
  7713. END;
  7714. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7715. result := s0;
  7716. (* ---- BIT ----- *)
  7717. |Global.systemBit:
  7718. Evaluate(p0,s0);
  7719. ToMemory(s0.op,addressType,0);
  7720. ReuseCopy(res,s0.op);
  7721. ReleaseOperand(s0);
  7722. Evaluate(p1,s1);
  7723. Emit(Ror(position,res,res,s1.op));
  7724. ReleaseOperand(s1);
  7725. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7726. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7727. IF ~conditional THEN
  7728. InitOperand(result,ModeValue); result.op := res;
  7729. ELSE
  7730. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7731. BrL(falseLabel);
  7732. ReleaseIntermediateOperand(res);
  7733. END;
  7734. (* --- MSK ----*)
  7735. |Global.systemMsk:
  7736. Evaluate(p0,s0);
  7737. Evaluate(p1,s1);
  7738. ReuseCopy(res,s0.op);
  7739. ReleaseOperand(s0);
  7740. Emit(And(position,res,res,s1.op));
  7741. ReleaseOperand(s1);
  7742. InitOperand(result,ModeValue);
  7743. result.op := res;
  7744. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  7745. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  7746. Evaluate(p0,s0);
  7747. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  7748. ReleaseOperand(s0);
  7749. InitOperand(result,ModeValue);
  7750. result.op := res;
  7751. (* ---- SYSTEM.GetStackPointer ----- *)
  7752. |Global.systemGetStackPointer:
  7753. InitOperand(result,ModeValue);
  7754. result.op := sp;
  7755. (* ---- SYSTEM.GetFramePointer ----- *)
  7756. |Global.systemGetFramePointer:
  7757. InitOperand(result,ModeValue);
  7758. result.op := fp;
  7759. (* ---- SYSTEM.GetActivity ----- *)
  7760. |Global.systemGetActivity:
  7761. ASSERT(backend.cooperative);
  7762. InitOperand(result,ModeValue);
  7763. result.op := ap;
  7764. (* ---- SYSTEM.SetStackPointer ----- *)
  7765. |Global.systemSetStackPointer:
  7766. Evaluate(p0,s0); (* *)
  7767. Emit(Mov(position,sp,s0.op));
  7768. ReleaseOperand(s0);
  7769. (* ---- SYSTEM.SetFramePointer ----- *)
  7770. |Global.systemSetFramePointer:
  7771. Evaluate(p0,s0); (* *)
  7772. Emit(Mov(position,fp,s0.op));
  7773. ReleaseOperand(s0);
  7774. (* ---- SYSTEM.Activity ----- *)
  7775. |Global.systemSetActivity:
  7776. ASSERT(backend.cooperative);
  7777. Evaluate(p0,s0); (* *)
  7778. Emit(Mov(position,ap,s0.op));
  7779. ReleaseOperand(s0);
  7780. (* ---- SYSTEM.VAL ----- *)
  7781. |Global.systemVal:
  7782. Expression(p1);
  7783. s1 := result;
  7784. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7785. IF s1.mode = ModeReference THEN
  7786. (* nothing to be done if not record type, just take over new type *)
  7787. IF (type IS SyntaxTree.RecordType) THEN
  7788. ReleaseIntermediateOperand(s1.tag);
  7789. s1.tag := TypeDescriptorAdr(type);
  7790. IF ~newObjectFile THEN
  7791. IntermediateCode.MakeMemory(s1.tag,addressType);
  7792. END;
  7793. UseIntermediateOperand(s1.tag);
  7794. END;
  7795. result := s1;
  7796. ELSE (* copy over result to different type, may not use convert *)
  7797. itype := IntermediateCode.GetType(system,type);
  7798. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  7799. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  7800. Emit(Mov(position,s0.op,s1.op));
  7801. ReleaseOperand(s1);
  7802. InitOperand(result,ModeValue);
  7803. result.op := s0.op;
  7804. ELSE (* different size, must convert *)
  7805. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  7806. Convert(s1.op, IntermediateCode.GetType(system,type));
  7807. result := s1;
  7808. END;
  7809. END;
  7810. (* ---- SYSTEM.GET ----- *)
  7811. |Global.systemGet:
  7812. Evaluate(p0,s0); (* adr *)
  7813. Designate(p1,s1); (* variable *)
  7814. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  7815. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  7816. Emit(Mov(position,s1.op,s0.op));
  7817. ReleaseOperand(s1);
  7818. ReleaseOperand(s0);
  7819. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  7820. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  7821. Evaluate(p0,s0); (* *)
  7822. Evaluate(p1,s1); (* variable *)
  7823. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  7824. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  7825. (* real part *)
  7826. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  7827. Emit(Mov(position,res, s1.op));
  7828. ReleaseIntermediateOperand(res);
  7829. (* imaginary part *)
  7830. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  7831. Emit(Mov(position,res, s1.tag));
  7832. ReleaseIntermediateOperand(res);
  7833. ReleaseOperand(s1);
  7834. ReleaseOperand(s0);
  7835. ELSE
  7836. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  7837. ReleaseOperand(s0);
  7838. Emit(Mov(position,res,s1.op));
  7839. ReleaseIntermediateOperand(res);
  7840. ReleaseOperand(s1);
  7841. END;
  7842. (* ---- SYSTEM.MOVE ----- *)
  7843. |Global.systemMove:
  7844. Evaluate(p0,s0);
  7845. Evaluate(p1,s1);
  7846. Evaluate(p2,s2);
  7847. Emit(Copy(position,s1.op,s0.op,s2.op));
  7848. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7849. (* ---- SYSTEM.NEW ----- *)
  7850. |Global.systemNew:
  7851. Designate(p0,s0);
  7852. Emit(Push(position,s0.op));
  7853. ReleaseOperand(s0);
  7854. Evaluate(p1,s1);
  7855. Emit(Push(position,s1.op));
  7856. ReleaseOperand(s1);
  7857. (* push realtime flag: false by default *)
  7858. Emit(Push(position,false));
  7859. CallThis(position,"Heaps","NewSys",3);
  7860. (* ---- SYSTEM.CALL ----- *)
  7861. |Global.systemRef:
  7862. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  7863. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  7864. s0.mode := ModeValue;
  7865. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  7866. result := s0
  7867. (* ---- INCR ----- *)
  7868. |Global.Incr:
  7869. Designate(p0,operand);
  7870. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7871. Dereference(operand,p0.type.resolved,FALSE);
  7872. END;
  7873. ASSERT(p1 # NIL);
  7874. Evaluate(p1,l);
  7875. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  7876. ReleaseOperand(operand); ReleaseOperand(l);
  7877. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7878. (* ---- SUM ----- *)
  7879. |Global.Sum: HALT(200);
  7880. (* ---- ALL ----- *)
  7881. |Global.All: HALT(200);
  7882. (* ---- CAS ----- *)
  7883. |Global.Cas:
  7884. needsTrace := p0.NeedsTrace();
  7885. IF needsTrace THEN ModifyAssignments(true) END;
  7886. Designate(p0,s0);
  7887. Evaluate(p1,s1);
  7888. Evaluate(p2,s2);
  7889. IF needsTrace THEN
  7890. Emit(Push(position, s0.op));
  7891. Emit(Push(position, s1.op));
  7892. Emit(Push(position, s2.op));
  7893. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  7894. ELSE
  7895. Emit(Cas(position,s0.op,s1.op,s2.op));
  7896. END;
  7897. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7898. IF needsTrace THEN ModifyAssignments(false) END;
  7899. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7900. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  7901. IF conditional THEN
  7902. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7903. BrL(falseLabel);
  7904. ReleaseIntermediateOperand(res);
  7905. END;
  7906. (* ---- DIM ----- *)
  7907. |Global.Dim:
  7908. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  7909. Designate(p0,s0);
  7910. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7911. Dereference(s0,p0.type.resolved,FALSE);
  7912. END;
  7913. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  7914. ReleaseOperand(s0);
  7915. (* ---- RESHAPE ----- *)
  7916. |Global.Reshape:
  7917. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  7918. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7919. left.SetType(procedure.type);
  7920. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  7921. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  7922. END;
  7923. (* ---- SYSTEM.TYPECODE ----- *)
  7924. |Global.systemTypeCode:
  7925. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7926. IF type.resolved IS SyntaxTree.PointerType THEN
  7927. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7928. END;
  7929. result.op := TypeDescriptorAdr(type);
  7930. IF ~newObjectFile THEN
  7931. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  7932. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  7933. END;
  7934. result.mode := ModeValue;
  7935. (* ---- SYSTEM.TRACE ----- *)
  7936. |Global.systemTrace:
  7937. SystemTrace(x.parameters, x.position);
  7938. (* ----- CONNECT ------*)
  7939. |Global.Connect:
  7940. IF backend.cellsAreObjects THEN
  7941. PushPort(p0);
  7942. PushPort(p1);
  7943. IF p2 # NIL THEN
  7944. Evaluate(p2, s2);
  7945. Emit(Push(p2.position, s2.op));
  7946. ReleaseOperand(s2);
  7947. ELSE
  7948. Emit(Push(-1, IntermediateCode.Immediate(int32, -1)));
  7949. END;
  7950. CallThis(position,"ActiveCellsRuntime","Connect",3);
  7951. ELSE
  7952. Warning(x.position, "cannot run on final hardware");
  7953. END;
  7954. (* ----- DELEGATE ------*)
  7955. |Global.Delegate:
  7956. IF backend.cellsAreObjects THEN
  7957. PushPort(p0);
  7958. PushPort(p1);
  7959. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  7960. ELSE
  7961. Warning(x.position, "cannot run on final hardware");
  7962. END;
  7963. (* ----- SEND ------*)
  7964. |Global.Send:
  7965. Evaluate(p0,s0);
  7966. Evaluate(p1,s1);
  7967. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7968. Emit(Push(position,s0.op));
  7969. Emit(Push(position,s1.op));
  7970. (*
  7971. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7972. *)
  7973. IF ~backend.cellsAreObjects THEN
  7974. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  7975. END;
  7976. ReleaseOperand(s0);
  7977. ReleaseOperand(s1);
  7978. IF backend.cellsAreObjects THEN
  7979. CallThis(position,"ActiveCellsRuntime","Send",2);
  7980. ELSE
  7981. CallThis(position,ChannelModuleName,"Send",2);
  7982. END;
  7983. (* ----- RECEIVE ------*)
  7984. |Global.Receive:
  7985. Evaluate(p0,s0);
  7986. Emit(Push(position,s0.op));
  7987. Designate(p1,s1);
  7988. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7989. Emit(Push(position,s1.op));
  7990. IF p2 # NIL THEN
  7991. Designate(p2,s2);
  7992. Emit(Push(position,s2.op));
  7993. END;
  7994. (*
  7995. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7996. *)
  7997. IF ~backend.cellsAreObjects THEN
  7998. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  7999. END;
  8000. ReleaseOperand(s0);
  8001. ReleaseOperand(s1);
  8002. ReleaseOperand(s2);
  8003. IF backend.cellsAreObjects THEN
  8004. IF p2 = NIL THEN
  8005. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8006. ELSE
  8007. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8008. END;
  8009. ELSE
  8010. IF p2 = NIL THEN
  8011. CallThis(position,ChannelModuleName,"Receive",2)
  8012. ELSE
  8013. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8014. END;
  8015. END;
  8016. | Global.systemSpecial:
  8017. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8018. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8019. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8020. (* determine if parameters are of the VAR kind *)
  8021. ASSERT(x.parameters.Length() <= 3);
  8022. formalParameter := procedureType.firstParameter;
  8023. FOR i := 0 TO x.parameters.Length() - 1 DO
  8024. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8025. formalParameter := formalParameter.nextParameter
  8026. END;
  8027. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8028. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8029. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8030. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8031. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8032. IF procedureType.returnType # NIL THEN
  8033. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8034. Emit(Result(position, res));
  8035. (*InitOperand(result,ModeValue);
  8036. result.op := res;
  8037. *)
  8038. IF ~conditional THEN
  8039. InitOperand(result,ModeValue); result.op := res;
  8040. ELSE
  8041. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8042. BrL(falseLabel);
  8043. ReleaseIntermediateOperand(res);
  8044. END;
  8045. END
  8046. ELSE (* function not yet implemented *)
  8047. Error(position,"not yet implemented");
  8048. END;
  8049. destination := dest;
  8050. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8051. END VisitBuiltinCallDesignator;
  8052. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  8053. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8054. BEGIN
  8055. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8056. dest := destination; destination := emptyOperand;
  8057. Expression(x.left);
  8058. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8059. ELSIF isUnchecked THEN (* no check *)
  8060. ELSE
  8061. trueL := NewLabel();
  8062. falseL := NewLabel();
  8063. IF IsPointerToRecord(x.left.type,recordType) THEN
  8064. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8065. Emit(Mov(position,tag, result.op));
  8066. IF result.mode # ModeValue THEN
  8067. ptr := tag;
  8068. IntermediateCode.MakeMemory(ptr,addressType);
  8069. Emit(Mov(position,tag, ptr));
  8070. END;
  8071. IF ~backend.cooperative THEN
  8072. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8073. END;
  8074. IntermediateCode.MakeMemory(tag,addressType);
  8075. ELSE
  8076. tag := result.tag;
  8077. END;
  8078. TypeTest(tag,x.type,trueL,falseL);
  8079. ReleaseIntermediateOperand(tag);
  8080. SetLabel(falseL);
  8081. EmitTrap(position,TypeCheckTrap);
  8082. SetLabel(trueL);
  8083. END;
  8084. destination := dest;
  8085. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8086. END VisitTypeGuardDesignator;
  8087. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8088. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8089. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8090. VAR label: Label; pc: LONGINT;
  8091. BEGIN
  8092. IF backend.cooperative & ~isUnchecked THEN
  8093. pc := section.pc;
  8094. label := NewLabel();
  8095. BrneL(label, operand.op, nil);
  8096. EmitTrap(position, NilPointerTrap);
  8097. SetLabel(label);
  8098. INC(statCoopNilCheck, section.pc - pc);
  8099. END;
  8100. END NilCheck;
  8101. BEGIN
  8102. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8103. ReuseCopy(dereferenced,operand.op);
  8104. ReleaseOperand(operand);
  8105. operand.mode := ModeReference;
  8106. operand.op := dereferenced;
  8107. operand.tag := dereferenced;
  8108. UseIntermediateOperand(operand.tag);
  8109. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8110. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8111. ReleaseIntermediateOperand(operand.tag);
  8112. operand.tag := TypeDescriptorAdr(type);
  8113. IF ~newObjectFile THEN
  8114. IntermediateCode.MakeMemory(operand.tag,addressType);
  8115. END;
  8116. ELSE
  8117. IF ~backend.cooperative THEN
  8118. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8119. END;
  8120. IntermediateCode.MakeMemory(operand.tag,addressType);
  8121. END;
  8122. NilCheck(operand.op);
  8123. ELSIF type IS SyntaxTree.ArrayType THEN
  8124. IF isUnsafe THEN
  8125. NilCheck(operand.op);
  8126. ReleaseIntermediateOperand(operand.tag);
  8127. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8128. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8129. ELSE
  8130. operand.tag := emptyOperand;
  8131. END;
  8132. ELSE
  8133. NilCheck(operand.op);
  8134. IF backend.cooperative THEN
  8135. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8136. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8137. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8138. ELSE
  8139. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8140. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8141. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8142. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8143. END;
  8144. END;
  8145. ELSIF type IS SyntaxTree.MathArrayType THEN
  8146. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8147. IntermediateCode.MakeMemory(operand.op,addressType);
  8148. ELSE HALT(100);
  8149. END;
  8150. END Dereference;
  8151. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  8152. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8153. BEGIN
  8154. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8155. dest := destination; destination := emptyOperand;
  8156. Evaluate(x.left,d);
  8157. type := x.type.resolved;
  8158. prevIsUnchecked := isUnchecked;
  8159. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8160. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8161. END;
  8162. Dereference(d,type,IsUnsafePointer(x.left.type));
  8163. isUnchecked := prevIsUnchecked;
  8164. result := d;
  8165. 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
  8166. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8167. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8168. END;
  8169. END;
  8170. destination := dest;
  8171. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8172. END VisitDereferenceDesignator;
  8173. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  8174. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8175. BEGIN
  8176. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8177. dest := destination; destination := emptyOperand;
  8178. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8179. tag := result.op;
  8180. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8181. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8182. StaticCallOperand(result,procedure.super);
  8183. ReleaseIntermediateOperand(result.tag);
  8184. UseIntermediateOperand(tag); (* necessary ? *)
  8185. result.tag := tag;
  8186. destination := dest;
  8187. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8188. END VisitSupercallDesignator;
  8189. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  8190. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8191. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8192. name: Basic.SegmentedName;
  8193. BEGIN
  8194. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8195. dest := destination; destination := emptyOperand;
  8196. scope := currentScope;
  8197. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8198. scope := scope.outerScope;
  8199. END;
  8200. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8201. IF newObjectFile THEN
  8202. moduleSection := meta.ModuleSection();
  8203. IF backend.cooperative THEN
  8204. moduleOffset := 0;
  8205. ELSE
  8206. moduleOffset := moduleSection.pc;
  8207. END;
  8208. result.mode := ModeValue;
  8209. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8210. ELSE
  8211. Symbol(moduleSelf,result);
  8212. IntermediateCode.MakeMemory(result.op,addressType);
  8213. END
  8214. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8215. result.mode := ModeValue;
  8216. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8217. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8218. ELSE
  8219. GetBaseRegister(basereg,currentScope,scope);
  8220. InitOperand(result,ModeReference);
  8221. result.op := basereg;
  8222. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  8223. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  8224. IF backend.cooperative THEN
  8225. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8226. END;
  8227. (* tag must be loaded when dereferencing SELF pointer *)
  8228. END;
  8229. destination := dest;
  8230. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8231. END VisitSelfDesignator;
  8232. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  8233. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8234. BEGIN
  8235. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8236. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8237. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8238. parameter := procedureType.returnParameter;
  8239. VisitParameter(parameter);
  8240. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8241. END VisitResultDesignator;
  8242. (** values *)
  8243. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  8244. BEGIN
  8245. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8246. IF conditional THEN
  8247. IF x.value THEN BrL(trueLabel)
  8248. ELSE BrL(falseLabel)
  8249. END;
  8250. ELSE
  8251. InitOperand(result,ModeValue);
  8252. IF x.value THEN result.op := true ELSE result.op := false END;
  8253. END;
  8254. END VisitBooleanValue;
  8255. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8256. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8257. BEGIN
  8258. Global.GetModuleSegmentedName(module.module, name);
  8259. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8260. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE);
  8261. RETURN section
  8262. END GetDataSection;
  8263. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8264. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8265. BEGIN
  8266. type := vop.type;
  8267. data := GetDataSection();
  8268. pc := EnterImmediate(data,vop);
  8269. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8270. IntermediateCode.MakeMemory(vop, type);
  8271. END GetImmediateMem;
  8272. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  8273. BEGIN
  8274. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8275. InitOperand(result,ModeValue);
  8276. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8277. IF ~supportedImmediate(result.op) &~inData THEN
  8278. GetImmediateMem(result.op)
  8279. END;
  8280. END VisitIntegerValue;
  8281. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  8282. BEGIN
  8283. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8284. InitOperand(result,ModeValue);
  8285. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8286. END VisitCharacterValue;
  8287. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  8288. BEGIN
  8289. IF Trace THEN TraceEnter("VisitSetValue") END;
  8290. InitOperand(result,ModeValue);
  8291. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8292. END VisitSetValue;
  8293. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  8294. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8295. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8296. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8297. BEGIN
  8298. numberElements := x.elements.Length();
  8299. FOR i := 0 TO numberElements-1 DO
  8300. expression := x.elements.GetExpression(i);
  8301. IF expression IS SyntaxTree.MathArrayExpression THEN
  8302. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8303. ELSE
  8304. inData := TRUE;
  8305. Evaluate(expression,op);
  8306. irv.Emit(Data(position,op.op));
  8307. inData := FALSE;
  8308. ReleaseOperand(op);
  8309. END;
  8310. END;
  8311. END RecursiveData;
  8312. BEGIN
  8313. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8314. IF ~TryConstantDeclaration() THEN
  8315. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8316. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8317. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8318. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8319. ELSE
  8320. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8321. END;
  8322. RecursiveData(x.array);
  8323. InitOperand(result,ModeReference);
  8324. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8325. END
  8326. END VisitMathArrayValue;
  8327. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8328. VAR constant: Sections.Section;
  8329. BEGIN
  8330. IF constantDeclaration = NIL THEN
  8331. RETURN FALSE
  8332. ELSE
  8333. (* Is a constant in this module: did we generate it already? *)
  8334. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8335. IF constant # NIL THEN
  8336. InitOperand(result,ModeReference);
  8337. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8338. RETURN TRUE;
  8339. END;
  8340. END;
  8341. RETURN FALSE
  8342. END TryConstantDeclaration;
  8343. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  8344. BEGIN
  8345. constantDeclaration := x;
  8346. x.value.resolved.Accept(SELF);
  8347. END VisitConstant;
  8348. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  8349. BEGIN
  8350. IF Trace THEN TraceEnter("VisitRealValue") END;
  8351. InitOperand(result,ModeValue);
  8352. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8353. END VisitRealValue;
  8354. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  8355. VAR
  8356. componentType: SyntaxTree.Type;
  8357. BEGIN
  8358. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8359. ASSERT(x.type IS SyntaxTree.ComplexType);
  8360. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8361. InitOperand(result,ModeValue);
  8362. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8363. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8364. END VisitComplexValue;
  8365. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  8366. VAR i: LONGINT; name: Basic.SegmentedName;
  8367. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8368. BEGIN
  8369. IF Trace THEN TraceEnter("VisitStringValue") END;
  8370. IF ~TryConstantDeclaration() THEN
  8371. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8372. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8373. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8374. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8375. ELSE
  8376. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8377. END;
  8378. FOR i := 0 TO x.length-1 DO
  8379. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8380. irv.Emit(Data(position,op));
  8381. END;
  8382. InitOperand(result,ModeReference);
  8383. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8384. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8385. END
  8386. END VisitStringValue;
  8387. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8388. BEGIN
  8389. IF Trace THEN TraceEnter("VisitNilValue") END;
  8390. InitOperand(result,ModeValue);
  8391. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8392. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8393. END VisitNilValue;
  8394. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8395. BEGIN
  8396. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8397. InitOperand(result,ModeValue);
  8398. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8399. END VisitEnumerationValue;
  8400. (** symbols *)
  8401. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8402. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8403. END VisitImport;
  8404. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8405. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8406. BEGIN
  8407. IF scope # baseScope THEN
  8408. (* left := [fp+8] *)
  8409. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8410. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8411. ReuseCopy(left,right);
  8412. ReleaseIntermediateOperand(right);
  8413. scope := scope.outerScope; DEC(level);
  8414. (* { left := [left+8] } *)
  8415. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8416. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8417. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8418. Emit(Mov(position,left,right));
  8419. scope := scope.outerScope; DEC(level);
  8420. END;
  8421. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8422. result := left;
  8423. ELSE
  8424. result := fp;
  8425. END;
  8426. END GetBaseRegister;
  8427. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8428. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8429. BEGIN
  8430. IF Trace THEN TraceEnter("VisitVariable"); END;
  8431. type := x.type.resolved;
  8432. IF (x.useRegister) THEN
  8433. InitOperand(result, ModeValue);
  8434. IF x.registerNumber < 0 THEN
  8435. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8436. reg := x.registerNumber;
  8437. ELSE
  8438. reg := registerUsageCount.Map(x.registerNumber);
  8439. UseRegister(reg);
  8440. END;
  8441. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8442. ELSIF x.externalName # NIL THEN
  8443. InitOperand(result,ModeReference);
  8444. Basic.ToSegmentedName(x.externalName^, name);
  8445. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8446. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8447. InitOperand(result,ModeReference);
  8448. GetBaseRegister(result.op,currentScope,x.scope);
  8449. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8450. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8451. InitOperand(result,ModeReference);
  8452. GetCodeSectionNameForSymbol(x,name);
  8453. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8454. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8455. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8456. InitOperand(result,ModeReference);
  8457. GetCodeSectionNameForSymbol(x,name);
  8458. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8459. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8460. ELSE (* field, left designator must have been emitted *)
  8461. ASSERT(result.mode = ModeReference);
  8462. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8463. ReuseCopy(temp,result.op);
  8464. ReleaseIntermediateOperand(result.op);
  8465. result.op := temp;
  8466. END;
  8467. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8468. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8469. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8470. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8471. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8472. END;
  8473. END;
  8474. END;
  8475. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8476. ValueToCondition(result);
  8477. ELSIF type IS SyntaxTree.ProcedureType THEN
  8478. ReleaseIntermediateOperand(result.tag);
  8479. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8480. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8481. UseIntermediateOperand(result.tag);
  8482. ELSE
  8483. result.tag := nil; (* nil *)
  8484. END;
  8485. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8486. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8487. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8488. ReleaseIntermediateOperand(result.tag);
  8489. Global.GetSymbolSegmentedName(x,name);
  8490. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8491. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8492. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8493. ELSE
  8494. END;
  8495. ELSE
  8496. ReleaseIntermediateOperand(result.tag);
  8497. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8498. END;
  8499. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8500. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8501. ReleaseIntermediateOperand(result.tag);
  8502. result.tag := result.op;
  8503. UseIntermediateOperand(result.tag);
  8504. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8505. IntermediateCode.MakeMemory(result.op,addressType);
  8506. END;
  8507. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8508. ReleaseIntermediateOperand(result.tag);
  8509. result.tag := TypeDescriptorAdr(type);
  8510. IF ~newObjectFile THEN
  8511. IntermediateCode.MakeMemory(result.tag,addressType);
  8512. END;
  8513. UseIntermediateOperand(result.tag);
  8514. (* tag for pointer type computed not here but during dereferencing *)
  8515. END;
  8516. IF Trace THEN TraceExit("VisitVariable") END;
  8517. END VisitVariable;
  8518. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8519. BEGIN
  8520. VisitVariable(property);
  8521. END VisitProperty;
  8522. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8523. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8524. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT;
  8525. BEGIN
  8526. type := x.type.resolved;
  8527. IF Trace THEN TraceEnter("VisitParameter") END;
  8528. IF x.ownerType IS SyntaxTree.CellType THEN
  8529. ptype := x.type.resolved;
  8530. IF ptype IS SyntaxTree.ArrayType THEN ptype := ptype(SyntaxTree.ArrayType).arrayBase.resolved END;
  8531. IF ~(ptype IS SyntaxTree.PortType) THEN
  8532. InitOperand(result,ModeReference);
  8533. GetCodeSectionNameForSymbol(x,name);
  8534. symbol := NewSection(module.allSections, Sections.ConstSection, name,x,commentPrintout # NIL);
  8535. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol),0);
  8536. RETURN
  8537. ELSE
  8538. InitOperand(result, ModeValue);
  8539. parameter := x.ownerType(SyntaxTree.CellType).firstParameter;
  8540. adr := 0;
  8541. WHILE parameter # x DO
  8542. parameterType := parameter.type;
  8543. inc := 1;
  8544. WHILE SemanticChecker.IsStaticArray(parameterType, parameterType, len) DO inc := inc * len END;
  8545. INC(adr, inc);
  8546. parameter := parameter.nextParameter
  8547. END;
  8548. IntermediateCode.InitImmediate(result.op,addressType,adr);
  8549. RETURN
  8550. END;
  8551. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8552. InitOperand(result,ModeReference);
  8553. GetCodeSectionNameForSymbol(x,name);
  8554. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8555. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8556. RETURN
  8557. ELSE
  8558. GetBaseRegister(basereg,currentScope,x.scope);
  8559. InitOperand(result,ModeReference);
  8560. result.op := basereg;
  8561. END;
  8562. IF IsOpenArray(type) THEN
  8563. result.tag := basereg;
  8564. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8565. IntermediateCode.MakeMemory(result.op,addressType);
  8566. IF Global.IsOberonProcedure(x.ownerType) THEN
  8567. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8568. UseIntermediateOperand(result.tag);
  8569. ELSE
  8570. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8571. END;
  8572. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8573. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8574. ELSIF IsStaticArray(type) THEN
  8575. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8576. IntermediateCode.MakeMemory(result.op,addressType);
  8577. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8578. ELSIF type IS SyntaxTree.MathArrayType THEN
  8579. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8580. WITH type: SyntaxTree.MathArrayType DO
  8581. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8582. IF type.form = SyntaxTree.Tensor THEN
  8583. ELSIF type.form = SyntaxTree.Open THEN
  8584. result.tag := result.op;
  8585. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8586. IntermediateCode.MakeMemory(result.op,addressType);
  8587. UseIntermediateOperand(result.tag);
  8588. ELSIF type.form = SyntaxTree.Static THEN
  8589. IF x.kind = SyntaxTree.ConstParameter THEN
  8590. IntermediateCode.MakeMemory(result.op,addressType);
  8591. END;
  8592. ELSE HALT(100)
  8593. END;
  8594. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8595. IF type.form = SyntaxTree.Tensor THEN
  8596. ToMemory(result.op,addressType,0);
  8597. ELSIF type.form = SyntaxTree.Open THEN
  8598. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8599. ReuseCopy(result.tag, mem);
  8600. ReleaseIntermediateOperand(mem);
  8601. ReleaseIntermediateOperand(result.op);
  8602. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8603. ELSIF type.form = SyntaxTree.Static THEN
  8604. IntermediateCode.MakeMemory(result.op,addressType);
  8605. ELSE HALT(100)
  8606. END;
  8607. ELSE HALT(100)
  8608. END;
  8609. END;
  8610. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8611. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8612. IntermediateCode.MakeMemory(result.op,addressType);
  8613. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8614. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8615. END;
  8616. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8617. ValueToCondition(result);
  8618. ELSIF type IS SyntaxTree.ProcedureType THEN
  8619. ReleaseIntermediateOperand(result.tag);
  8620. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8621. IF x.kind = SyntaxTree.VarParameter THEN
  8622. ReuseCopy(result.tag,result.op);
  8623. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8624. IntermediateCode.MakeMemory(result.tag,addressType);
  8625. ELSE
  8626. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8627. UseIntermediateOperand(result.tag);
  8628. END;
  8629. ELSE
  8630. result.tag := nil;
  8631. END;
  8632. (* tag for pointer type computed not here but during dereferencing *)
  8633. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) THEN
  8634. ReleaseIntermediateOperand(result.tag);
  8635. result.tag := basereg;
  8636. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8637. IntermediateCode.MakeMemory(result.tag,addressType);
  8638. UseIntermediateOperand(result.tag);
  8639. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind = SyntaxTree.ValueParameter) THEN
  8640. ReleaseIntermediateOperand(result.tag);
  8641. result.tag := TypeDescriptorAdr(type);
  8642. IF ~newObjectFile THEN
  8643. IntermediateCode.MakeMemory(result.tag,addressType);
  8644. END;
  8645. UseIntermediateOperand(result.tag);
  8646. END;
  8647. IF Trace THEN TraceExit("VisitParameter") END;
  8648. END VisitParameter;
  8649. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8650. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8651. BEGIN
  8652. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8653. (* left.p: left already emitted *)
  8654. tag := result.op; (* value of pointer to left *)
  8655. (* get type desc *)
  8656. tmp := result.tag;
  8657. IntermediateCode.MakeMemory(tmp,addressType);
  8658. (* get method adr *)
  8659. Reuse1(reg,tmp);
  8660. ReleaseIntermediateOperand(tmp);
  8661. IF backend.cooperative THEN
  8662. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8663. WHILE recordType.baseType # NIL DO
  8664. recordType := recordType.GetBaseRecord ();
  8665. END;
  8666. GetRecordTypeName (recordType,name);
  8667. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8668. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8669. offset := 0;
  8670. ELSE
  8671. offset := 2;
  8672. END;
  8673. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8674. ELSE
  8675. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8676. END;
  8677. InitOperand(operand,ModeReference);
  8678. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8679. operand.op := reg;
  8680. operand.tag := tag;
  8681. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8682. END DynamicCallOperand;
  8683. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8684. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8685. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8686. BEGIN
  8687. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8688. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8689. tag := operand.op;
  8690. ReleaseIntermediateOperand(operand.tag);
  8691. ELSE tag := nil
  8692. END;
  8693. IF x.isInline THEN
  8694. sectionType := Sections.InlineCodeSection;
  8695. ELSE
  8696. sectionType := Sections.CodeSection;
  8697. END;
  8698. IF x.externalName # NIL THEN
  8699. Basic.ToSegmentedName(x.externalName^, name);
  8700. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8701. ELSE
  8702. GetCodeSectionNameForSymbol(x, name);
  8703. IF (x.scope.ownerModule = module.module) THEN
  8704. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8705. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8706. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8707. IF source.pc = 0 THEN (* no code yet *)
  8708. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8709. END;
  8710. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8711. bits := x.procedureScope.body.code.inlineCode;
  8712. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8713. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8714. binary.CopyBits(bits, 0, bits.GetSize());
  8715. source.SetResolved(binary);
  8716. ELSE
  8717. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8718. END;
  8719. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8720. END;
  8721. InitOperand(operand,ModeValue);
  8722. operand.op := reg;
  8723. operand.tag := tag;
  8724. IF Trace THEN TraceExit("StaticCallOperand") END;
  8725. END StaticCallOperand;
  8726. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8727. (* handle expressions of the form designator.procedure or procedure *)
  8728. BEGIN
  8729. IF Trace THEN TraceEnter("VisitProcedure") END;
  8730. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) THEN
  8731. DynamicCallOperand(result,x);
  8732. ELSIF x.isInline THEN
  8733. StaticCallOperand(result,x);
  8734. ELSE
  8735. StaticCallOperand(result,x);
  8736. END;
  8737. IF Trace THEN TraceExit("VisitProcedure") END;
  8738. END VisitProcedure;
  8739. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  8740. BEGIN
  8741. VisitProcedure(x);
  8742. END VisitOperator;
  8743. (** statements *)
  8744. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  8745. BEGIN
  8746. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  8747. Expression(x.call);
  8748. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  8749. ReleaseOperand(result)
  8750. END;
  8751. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  8752. END VisitProcedureCallStatement;
  8753. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  8754. VAR leftType, rightType: SyntaxTree.MathArrayType;
  8755. leftBase, rightBase: SyntaxTree.Type;
  8756. procedureName,s: SyntaxTree.IdentifierString;
  8757. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  8758. size: LONGINT; rightKind: LONGINT;
  8759. dummy: IntermediateCode.Operand;
  8760. CONST moduleName = "FoxArrayBase";
  8761. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  8762. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  8763. BEGIN
  8764. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  8765. IF base IS SyntaxTree.MathArrayType THEN
  8766. base := OpenArray(base(SyntaxTree.MathArrayType));
  8767. END;
  8768. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  8769. result.SetArrayBase(base);
  8770. RETURN result
  8771. END OpenArray;
  8772. BEGIN
  8773. IF AddImport(moduleName,arrayBase,TRUE) THEN
  8774. SaveRegisters();ReleaseUsedRegisters(saved);
  8775. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  8776. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  8777. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  8778. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  8779. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  8780. IF leftType.form = SyntaxTree.Tensor THEN
  8781. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  8782. ELSIF leftType.form = SyntaxTree.Open THEN
  8783. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  8784. ELSIF leftType.form = SyntaxTree.Static THEN
  8785. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  8786. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  8787. END;
  8788. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  8789. IF procedure = NIL THEN
  8790. s := "Instruction not supported on target, emulation procedure ";
  8791. Strings.Append(s,moduleName);
  8792. Strings.Append(s,".");
  8793. Strings.Append(s,procedureName);
  8794. Strings.Append(s," not present");
  8795. Error(position,s);
  8796. ELSE
  8797. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  8798. parameter.SetType(leftType);
  8799. parameter.SetAccess(SyntaxTree.Internal);
  8800. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8801. parameter.SetKind(rightKind);
  8802. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8803. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  8804. Emit(Push(position,IntermediateCode.Immediate(int32,size)));
  8805. StaticCallOperand(result,procedure);
  8806. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  8807. ReleaseOperand(result);
  8808. END;
  8809. RestoreRegisters(saved);
  8810. END;
  8811. END AssignMathArray;
  8812. VAR modifyAssignmentCounter := 0: LONGINT;
  8813. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  8814. VAR processor,mem,dst: IntermediateCode.Operand;
  8815. BEGIN
  8816. IF value.intValue = true.intValue THEN
  8817. INC(modifyAssignmentCounter);
  8818. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  8819. modifyAssignmentsPC := section.pc;
  8820. ELSE
  8821. DEC(modifyAssignmentCounter);
  8822. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  8823. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  8824. END;
  8825. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  8826. dst := NewRegisterOperand (addressType);
  8827. Emit(Mov(position,dst, processor));
  8828. IntermediateCode.InitMemory(mem,bool, dst, 0);
  8829. Emit(Mov(position,mem, value));
  8830. ReleaseIntermediateOperand(dst);
  8831. END ModifyAssignments;
  8832. PROCEDURE CopySize(left: SyntaxTree.Expression): IntermediateCode.Operand;
  8833. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8834. BEGIN
  8835. type := left.type.resolved;
  8836. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  8837. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  8838. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  8839. IF procedureType.returnParameter = parameter THEN
  8840. RETURN IntermediateCode.Memory(addressType, fp, ToMemoryUnits(system, parameter.offsetInBits + system.addressSize));
  8841. END;
  8842. END;
  8843. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  8844. END CopySize;
  8845. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  8846. VAR
  8847. leftO, rightO: Operand;
  8848. mem, sizeOp: IntermediateCode.Operand;
  8849. leftType, rightType, componentType: SyntaxTree.Type;
  8850. size: LONGINT;
  8851. parameters: SyntaxTree.ExpressionList;
  8852. procedure: SyntaxTree.Procedure;
  8853. call: SyntaxTree.ProcedureCallDesignator;
  8854. designator: SyntaxTree.Designator;
  8855. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  8856. VAR procedureType: SyntaxTree.ProcedureType;
  8857. BEGIN
  8858. IF ReturnedAsParameter(right.type) THEN
  8859. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  8860. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  8861. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  8862. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  8863. WITH right: SyntaxTree.BuiltinCallDesignator DO
  8864. IF right.id = Global.Reshape THEN RETURN TRUE
  8865. END;
  8866. END;
  8867. END;
  8868. END;
  8869. RETURN FALSE
  8870. END CanPassAsResultParameter;
  8871. BEGIN
  8872. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  8873. leftType := left.type.resolved; rightType:= right.type.resolved;
  8874. IF backend.cooperative & left.NeedsTrace() THEN
  8875. ModifyAssignments(true);
  8876. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  8877. Designate(right, rightO);
  8878. Designate(left, leftO);
  8879. ASSERT(leftO.mode = ModeReference);
  8880. TransferToRegister(leftO.op, leftO.op);
  8881. TransferToRegister(rightO.op, rightO.op);
  8882. Emit(Push(position, leftO.op));
  8883. Emit(Push(position, rightO.op));
  8884. CallAssignMethod(leftO.op, rightO.op, left.type);
  8885. Emit(Pop(position, rightO.op));
  8886. Emit(Pop(position, leftO.op));
  8887. sizeOp := CopySize(left);
  8888. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8889. ReleaseOperand(leftO);
  8890. ReleaseOperand(rightO);
  8891. ELSE
  8892. Evaluate(right,rightO);
  8893. Designate(left,leftO);
  8894. ASSERT(leftO.mode = ModeReference);
  8895. IF (leftType IS SyntaxTree.ProcedureType) THEN
  8896. (* copy procedure address first *)
  8897. MakeMemory(mem,leftO.op,addressType,0);
  8898. Emit(Mov(position,mem,rightO.op));
  8899. ReleaseIntermediateOperand(mem);
  8900. (* copy pointer address *)
  8901. IntermediateCode.MakeAddress(leftO.tag, addressType);
  8902. CallAssignPointer(leftO.tag, rightO.tag);
  8903. ELSE
  8904. ASSERT(system.SizeOf(left.type) = system.addressSize);
  8905. CallAssignPointer(leftO.op, rightO.op);
  8906. END;
  8907. ReleaseOperand(leftO);
  8908. ReleaseOperand(rightO);
  8909. END;
  8910. ModifyAssignments(false);
  8911. RETURN;
  8912. END;
  8913. IF CanPassAsResultParameter(right) THEN
  8914. procedureResultDesignator := left(SyntaxTree.Designator);
  8915. Expression(right);
  8916. procedureResultDesignator := NIL;
  8917. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  8918. (* left <-- ALIAS OF right: zerocopy *)
  8919. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  8920. designator := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid, NIL, procedure);
  8921. designator.SetType(procedure.type);
  8922. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  8923. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  8924. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8925. END;
  8926. ELSIF leftType IS SyntaxTree.RangeType THEN
  8927. (* LHS is of array range type *)
  8928. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  8929. Evaluate(right, rightO);
  8930. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  8931. (* first *)
  8932. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 0);
  8933. Emit(Mov(position,mem, rightO.op));
  8934. ReleaseIntermediateOperand(mem);
  8935. (* last *)
  8936. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8937. Emit(Mov(position,mem, rightO.tag));
  8938. ReleaseIntermediateOperand(mem);
  8939. (* step *)
  8940. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8941. Emit(Mov(position,mem, rightO.extra));
  8942. ReleaseIntermediateOperand(mem);
  8943. ReleaseOperand(rightO);
  8944. ReleaseOperand(leftO)
  8945. ELSIF leftType IS SyntaxTree.ComplexType THEN
  8946. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  8947. Evaluate(right, rightO);
  8948. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  8949. componentType := leftType(SyntaxTree.ComplexType).componentType;
  8950. (* real part *)
  8951. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  8952. Emit(Mov(position,mem, rightO.op));
  8953. ReleaseIntermediateOperand(mem);
  8954. (* imaginary part *)
  8955. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8956. Emit(Mov(position,mem, rightO.tag));
  8957. ReleaseIntermediateOperand(mem);
  8958. ReleaseOperand(rightO);
  8959. ReleaseOperand(leftO)
  8960. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  8961. OR (leftType IS SyntaxTree.PortType) THEN
  8962. (* rightO := leftO;*)
  8963. Evaluate(right,rightO);
  8964. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  8965. Designate(left,leftO);
  8966. IF leftO.mode = ModeReference THEN
  8967. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  8968. destination := mem;
  8969. ELSE
  8970. destination := leftO.op;
  8971. END;
  8972. ReleaseOperand(leftO);
  8973. IF destination.mode # IntermediateCode.Undefined THEN
  8974. Emit(Mov(position,destination,rightO.op));
  8975. END;
  8976. ReleaseOperand(rightO);
  8977. ReleaseIntermediateOperand(mem);
  8978. IntermediateCode.InitOperand(destination);
  8979. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  8980. Evaluate(right,rightO);
  8981. Designate(left,leftO);
  8982. MakeMemory(mem,leftO.op,addressType,0);
  8983. Emit(Mov(position,mem,rightO.op));
  8984. ReleaseIntermediateOperand(mem);
  8985. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  8986. (* delegate *)
  8987. (*
  8988. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  8989. *)
  8990. Emit(Mov(position,leftO.tag,rightO.tag));
  8991. END;
  8992. ReleaseOperand(leftO);
  8993. ReleaseOperand(rightO);
  8994. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  8995. Designate(right,rightO);
  8996. Designate(left,leftO);
  8997. sizeOp := CopySize(left);
  8998. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8999. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9000. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9001. IF (rightType IS SyntaxTree.StringType) THEN
  9002. CopyString(left,right);
  9003. 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
  9004. Designate(right,rightO);
  9005. Designate(left,leftO);
  9006. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9007. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9008. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9009. ELSE
  9010. HALT(201)
  9011. END;
  9012. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9013. AssignMathArray(left,right);
  9014. ELSE
  9015. HALT(200);
  9016. END;
  9017. END Assign;
  9018. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  9019. BEGIN
  9020. IF Trace THEN TraceEnter("VisitAssignment") END;
  9021. Assign(x.left,x.right);
  9022. IF Trace THEN TraceExit("VisitAssignment") END;
  9023. END VisitAssignment;
  9024. PROCEDURE EmitCooperativeSwitch;
  9025. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9026. BEGIN
  9027. ASSERT (cooperativeSwitches);
  9028. pc := section.pc;
  9029. IF lastSwitchPC = section.pc THEN RETURN END;
  9030. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9031. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9032. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9033. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9034. INC(statCoopSwitch, section.pc - pc);
  9035. END EmitCooperativeSwitch;
  9036. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  9037. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9038. BEGIN
  9039. p0 := communication.left; p1 := communication.right;
  9040. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9041. Evaluate(p0,s0);
  9042. Evaluate(p1,s1);
  9043. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9044. Emit(Push(position,s0.op));
  9045. Emit(Push(position,s1.op));
  9046. (*
  9047. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9048. *)
  9049. IF ~backend.cellsAreObjects THEN
  9050. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9051. END;
  9052. ReleaseOperand(s0);
  9053. ReleaseOperand(s1);
  9054. IF backend.cellsAreObjects THEN
  9055. CallThis(position,"ActiveCellsRuntime","Send",2);
  9056. ELSE
  9057. CallThis(position,ChannelModuleName,"Send",2);
  9058. END;
  9059. (* ----- RECEIVE ------*)
  9060. ELSE
  9061. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9062. tmp := p0; p0 := p1; p1 := tmp;
  9063. END;
  9064. Evaluate(p0,s0);
  9065. Emit(Push(position,s0.op));
  9066. Designate(p1,s1);
  9067. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9068. Emit(Push(position,s1.op));
  9069. (*
  9070. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9071. *)
  9072. IF ~backend.cellsAreObjects THEN
  9073. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9074. END;
  9075. ReleaseOperand(s0);
  9076. ReleaseOperand(s1);
  9077. IF backend.cellsAreObjects THEN
  9078. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9079. ELSE
  9080. CallThis(position,ChannelModuleName,"Receive",2)
  9081. END;
  9082. END;
  9083. END VisitCommunicationStatement;
  9084. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  9085. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9086. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9087. VAR true, false: Label; condition, value: BOOLEAN;
  9088. BEGIN
  9089. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9090. IF condition THEN
  9091. true := NewLabel();
  9092. false := NewLabel();
  9093. Condition(if.condition,true,false);
  9094. SetLabel(true);
  9095. StatementSequence(if.statements);
  9096. BrL(end);
  9097. SetLabel(false);
  9098. ELSE
  9099. IF value THEN (* always true *)
  9100. escape := TRUE;
  9101. StatementSequence(if.statements);
  9102. (* no branch necessary -- rest skipped *)
  9103. END;
  9104. END;
  9105. END IfPart;
  9106. BEGIN
  9107. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9108. end := NewLabel();
  9109. elsifs := x.ElsifParts();
  9110. IfPart(x.ifPart);
  9111. FOR i := 0 TO elsifs-1 DO
  9112. IF ~escape THEN
  9113. elsif := x.GetElsifPart(i);
  9114. IfPart(elsif);
  9115. END;
  9116. END;
  9117. IF (x.elsePart # NIL) & ~escape THEN
  9118. StatementSequence(x.elsePart);
  9119. END;
  9120. SetLabel(end);
  9121. IF Trace THEN TraceExit("VisitIfStatement") END;
  9122. END VisitIfStatement;
  9123. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9124. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9125. BEGIN
  9126. (*IF x.variable.type.resolved = x.type.resolved THEN
  9127. (* always true, do nothing *)
  9128. ELSE*)
  9129. Designate(x.variable,res);
  9130. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9131. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9132. END;
  9133. trueL := NewLabel();
  9134. TypeTest(res.tag,x.type,trueL,falseL);
  9135. ReleaseOperand(res);
  9136. SetLabel(trueL);
  9137. StatementSequence(x.statements);
  9138. BrL(endL);
  9139. END WithPart;
  9140. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  9141. VAR endL,falseL: Label;i: LONGINT;
  9142. BEGIN
  9143. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9144. endL := NewLabel();
  9145. FOR i := 0 TO x.WithParts()-1 DO
  9146. falseL := NewLabel();
  9147. WithPart(x.GetWithPart(i),falseL,endL);
  9148. SetLabel(falseL);
  9149. END;
  9150. IF x.elsePart = NIL THEN
  9151. IF ~isUnchecked THEN
  9152. EmitTrap(position,WithTrap);
  9153. END;
  9154. ELSE
  9155. StatementSequence(x.elsePart)
  9156. END;
  9157. SetLabel(endL);
  9158. IF Trace THEN TraceExit("VisitWithStatement") END;
  9159. END VisitWithStatement;
  9160. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  9161. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9162. out,else: Label; label: Label;
  9163. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9164. symbol: SyntaxTree.Symbol;
  9165. BEGIN
  9166. (*! split case statement into if-elsif statements for large case label lists *)
  9167. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9168. size := x.max-x.min+1;
  9169. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9170. END;
  9171. Evaluate(x.variable,var);
  9172. ReuseCopy(tmp,var.op);
  9173. ReleaseIntermediateOperand(var.op);
  9174. var.op := tmp;
  9175. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9176. Convert(var.op,addressType);
  9177. size := x.max-x.min+1;
  9178. else := NewLabel();
  9179. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9180. (*
  9181. UniqueId(name,module.module,"case",caseId);
  9182. *)
  9183. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9184. Global.GetModuleSegmentedName(module.module, name);
  9185. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9186. symbol := SyntaxTree.NewSymbol(name[1]);
  9187. symbol.SetScope(moduleScope);
  9188. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9189. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9190. section.isCaseTable := TRUE;
  9191. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9192. ReuseCopy(res,var.op);
  9193. ReleaseOperand(var);
  9194. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9195. Emit(Add(position,res,res,jmp));
  9196. IntermediateCode.MakeMemory(res,addressType);
  9197. Emit(Br(position,res));
  9198. ReleaseIntermediateOperand(res);
  9199. out := NewLabel();
  9200. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9201. part := x.GetCasePart(i);
  9202. constant := part.firstConstant;
  9203. label := NewLabel();
  9204. SetLabel(label);
  9205. WHILE(constant # NIL) DO (* case labels for this case part *)
  9206. FOR j := constant.min TO constant.max DO
  9207. fixups[j-x.min] := label;
  9208. END;
  9209. constant := constant.next;
  9210. END;
  9211. StatementSequence(part.statements);
  9212. BrL(out);
  9213. END;
  9214. SetLabel(else);
  9215. FOR i := 0 TO size-1 DO
  9216. IF fixups[i] = NIL THEN
  9217. fixups[i] := else;
  9218. END;
  9219. END;
  9220. IF x.elsePart # NIL THEN
  9221. StatementSequence(x.elsePart);
  9222. ELSIF ~isUnchecked THEN
  9223. EmitTrap(position,CaseTrap);
  9224. END;
  9225. SetLabel(out);
  9226. FOR i := 0 TO size-1 DO
  9227. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9228. section.Emit(Data(position,op));
  9229. END;
  9230. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9231. END VisitCaseStatement;
  9232. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  9233. VAR start: Label; true,false: Label;
  9234. BEGIN
  9235. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9236. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9237. start := NewLabel();
  9238. true := NewLabel();
  9239. false := NewLabel();
  9240. SetLabel(start);
  9241. Condition(x.condition,true,false);
  9242. SetLabel(true);
  9243. StatementSequence(x.statements);
  9244. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9245. BrL(start);
  9246. SetLabel(false);
  9247. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9248. END VisitWhileStatement;
  9249. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  9250. VAR false,true: Label;
  9251. BEGIN
  9252. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9253. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9254. true := NewLabel();
  9255. false := NewLabel();
  9256. SetLabel(false);
  9257. StatementSequence(x.statements);
  9258. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9259. Condition(x.condition,true,false);
  9260. SetLabel(true);
  9261. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9262. END VisitRepeatStatement;
  9263. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  9264. VAR
  9265. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9266. temporaryVariable: SyntaxTree.Variable;
  9267. temporaryVariableDesignator : SyntaxTree.Designator;
  9268. BEGIN
  9269. IF Trace THEN TraceEnter("VisitForStatement") END;
  9270. true := NewLabel();
  9271. false := NewLabel();
  9272. start := NewLabel();
  9273. Assign(x.variable,x.from);
  9274. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE);
  9275. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, temporaryVariable);
  9276. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9277. Assign(temporaryVariableDesignator,x.to);
  9278. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9279. IF by > 0 THEN
  9280. cmp := Scanner.LessEqual
  9281. ELSE
  9282. cmp := Scanner.GreaterEqual
  9283. END;
  9284. binary := SyntaxTree.NewBinaryExpression(0,x.variable,temporaryVariableDesignator,cmp);
  9285. binary.SetType(system.booleanType);
  9286. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9287. SetLabel(start);
  9288. Condition(binary,true,false);
  9289. SetLabel(true);
  9290. StatementSequence(x.statements);
  9291. binary := SyntaxTree.NewBinaryExpression(0,x.variable,x.by,Scanner.Plus);
  9292. binary.SetType(x.variable.type);
  9293. Assign(x.variable,binary);
  9294. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9295. BrL(start);
  9296. SetLabel(false);
  9297. IF Trace THEN TraceExit("VisitForStatement") END;
  9298. END VisitForStatement;
  9299. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  9300. VAR prevLoop: Label;
  9301. BEGIN
  9302. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9303. prevLoop := currentLoop;
  9304. currentLoop := NewLabel();
  9305. StatementSequence(x.statements);
  9306. SetLabel(currentLoop);
  9307. currentLoop := prevLoop;
  9308. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9309. END VisitExitableBlock;
  9310. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  9311. VAR prevLoop,start: Label;
  9312. BEGIN
  9313. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9314. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9315. start := NewLabel();
  9316. prevLoop := currentLoop;
  9317. SetLabel(start);
  9318. currentLoop := NewLabel();
  9319. StatementSequence(x.statements);
  9320. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9321. BrL(start);
  9322. SetLabel(currentLoop);
  9323. currentLoop := prevLoop;
  9324. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9325. END VisitLoopStatement;
  9326. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  9327. VAR outer: SyntaxTree.Statement;
  9328. BEGIN
  9329. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9330. IF locked THEN (* r if we jump out of an exclusive block *)
  9331. outer := x.outer;
  9332. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9333. outer := outer.outer;
  9334. END;
  9335. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9336. Lock(FALSE);
  9337. END;
  9338. END;
  9339. BrL(currentLoop);
  9340. IF Trace THEN TraceExit("VisitExitStatement") END;
  9341. END VisitExitStatement;
  9342. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  9343. VAR
  9344. expression, parameterDesignator: SyntaxTree.Expression;
  9345. type, componentType: SyntaxTree.Type;
  9346. res, right: Operand;
  9347. left, mem, reg: IntermediateCode.Operand;
  9348. parameter: SyntaxTree.Parameter;
  9349. procedure: SyntaxTree.Procedure;
  9350. procedureType: SyntaxTree.ProcedureType;
  9351. returnTypeOffset: LONGINT;
  9352. delegate: BOOLEAN;
  9353. map: SymbolMap;
  9354. BEGIN
  9355. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9356. expression := x.returnValue;
  9357. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9358. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9359. IF currentIsInline THEN
  9360. IF expression # NIL THEN
  9361. map := currentMapper.Get(NIL);
  9362. IF map # NIL THEN
  9363. Assign(map.to, expression);
  9364. END;
  9365. END;
  9366. BrL(currentInlineExit);
  9367. RETURN;
  9368. END;
  9369. IF expression # NIL THEN
  9370. type := expression.type.resolved;
  9371. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9372. IF locked THEN Lock(FALSE) END;
  9373. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9374. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9375. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9376. (* return without structured return parameter *)
  9377. Evaluate(expression,res);
  9378. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9379. IF locked OR profile THEN
  9380. Emit(Push(position,res.op));
  9381. IF delegate THEN HALT(200) END;
  9382. ReleaseOperand(res);
  9383. IF locked THEN Lock(FALSE) END;
  9384. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9385. reg := NewRegisterOperand(res.op.type);
  9386. Emit(Pop(position,reg));
  9387. Emit(Return(position,reg));
  9388. ReleaseIntermediateOperand(reg);
  9389. ELSE
  9390. Emit(Return(position,res.op));
  9391. ReleaseOperand(res);
  9392. END;
  9393. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9394. THEN
  9395. (* return using structured return parameter *)
  9396. 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)
  9397. OR SemanticChecker.IsPointerType(type));
  9398. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9399. parameter :=procedureType.returnParameter;
  9400. ASSERT(parameter # NIL);
  9401. returnTypeOffset := parameter.offsetInBits;
  9402. (*
  9403. IF parameter# NIL THEN
  9404. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9405. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9406. ELSE
  9407. returnTypeOffset := system.offsetFirstParameter
  9408. END;
  9409. *)
  9410. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9411. IF type IS SyntaxTree.RangeType THEN
  9412. (* array range type *)
  9413. Evaluate(expression, right);
  9414. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 0);
  9415. Emit(Mov(position,mem, right.op)); (* first *)
  9416. ReleaseIntermediateOperand(mem);
  9417. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9418. Emit(Mov(position,mem, right.tag)); (* last *)
  9419. ReleaseIntermediateOperand(mem);
  9420. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9421. Emit(Mov(position,mem, right.extra)); (* step *)
  9422. ReleaseIntermediateOperand(mem);
  9423. ReleaseOperand(right);
  9424. ELSIF type IS SyntaxTree.ComplexType THEN
  9425. Evaluate(expression, right);
  9426. componentType := type(SyntaxTree.ComplexType).componentType;
  9427. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9428. Emit(Mov(position,mem, right.op)); (* real part *)
  9429. ReleaseIntermediateOperand(mem);
  9430. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9431. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9432. ReleaseIntermediateOperand(mem);
  9433. ReleaseOperand(right);
  9434. ELSE (* covers cases: pointer / record / array *)
  9435. parameter := procedureType.returnParameter;
  9436. checker.SetCurrentScope(currentScope);
  9437. ASSERT(parameter # NIL);
  9438. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9439. Assign(parameterDesignator,expression);
  9440. END;
  9441. ReleaseIntermediateOperand(left);
  9442. IF locked THEN Lock(FALSE) END;
  9443. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9444. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9445. parameter := procedureType.returnParameter;
  9446. checker.SetCurrentScope(currentScope);
  9447. IF parameter = NIL THEN
  9448. Error(procedure.position, "structured return of parameter of procedure not found");
  9449. ELSE
  9450. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9451. Assign(parameterDesignator,expression);
  9452. END;
  9453. IF locked THEN Lock(FALSE) END;
  9454. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9455. ELSE
  9456. HALT(200);
  9457. END;
  9458. ELSE
  9459. IF locked THEN Lock(FALSE) END;
  9460. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9461. END;
  9462. IF backend.cooperative THEN
  9463. BrL(exitLabel);
  9464. ELSE
  9465. EmitLeave(section, position,procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9466. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention));
  9467. END;
  9468. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9469. END VisitReturnStatement;
  9470. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9471. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9472. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9473. statements: SyntaxTree.StatementSequence;
  9474. name, suffix: SyntaxTree.IdentifierString;
  9475. BEGIN
  9476. Strings.IntToStr(awaitProcCounter,suffix);
  9477. Strings.Concat("@AwaitProcedure",suffix,name);
  9478. identifier := SyntaxTree.NewIdentifier(name);
  9479. INC(awaitProcCounter);
  9480. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9481. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9482. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9483. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9484. procedure.SetAccess(SyntaxTree.Hidden);
  9485. procedure.SetScope(currentScope);
  9486. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9487. procedureType.SetReturnType(system.booleanType);
  9488. procedure.SetType(procedureType);
  9489. body := SyntaxTree.NewBody(x.position,procedureScope);
  9490. procedureScope.SetBody(body);
  9491. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9492. returnStatement.SetReturnValue(x.condition);
  9493. statements := SyntaxTree.NewStatementSequence();
  9494. statements.AddStatement(returnStatement);
  9495. body.SetStatementSequence(statements);
  9496. currentScope.AddProcedure(procedure);
  9497. RETURN procedure
  9498. END MakeAwaitProcedure;
  9499. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9500. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9501. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9502. BEGIN
  9503. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9504. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9505. IF backend.cooperative THEN
  9506. start := NewLabel();
  9507. true := NewLabel();
  9508. false := NewLabel();
  9509. SetLabel(start);
  9510. Condition(x.condition,true,false);
  9511. SetLabel(false);
  9512. PushSelfPointer();
  9513. CallThis(position,"ExclusiveBlocks","Await",1);
  9514. BrL(start);
  9515. SetLabel(true);
  9516. PushSelfPointer();
  9517. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9518. ELSE
  9519. proc := MakeAwaitProcedure(x);
  9520. Emit(Push(position,fp));
  9521. GetCodeSectionNameForSymbol(proc,name);
  9522. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9523. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9524. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9525. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9526. Emit(Result(position,res));
  9527. (*
  9528. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9529. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9530. *)
  9531. InitOperand(result,ModeValue);
  9532. result.op := res;
  9533. label := NewLabel();
  9534. BreqL(label, result.op, SELF.true);
  9535. ReleaseOperand(result);
  9536. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9537. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9538. Emit(Push(position,res));
  9539. Emit(Push(position,fp));
  9540. PushSelfPointer();
  9541. Emit(Push(position,nil));
  9542. CallThis(position,"Objects","Await",4);
  9543. SetLabel(label);
  9544. END;
  9545. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9546. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9547. END VisitAwaitStatement;
  9548. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9549. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9550. BEGIN
  9551. FOR i := 0 TO x.Length() - 1 DO
  9552. statement := x.GetStatement( i );
  9553. Statement(statement);
  9554. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9555. END;
  9556. END StatementSequence;
  9557. PROCEDURE PushSelfPointer;
  9558. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9559. BEGIN
  9560. scope := currentScope;
  9561. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9562. scope := scope.outerScope;
  9563. END;
  9564. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9565. IF ~newObjectFile THEN
  9566. Symbol(moduleSelf,op);
  9567. IntermediateCode.MakeMemory(op.op,addressType);
  9568. ELSE
  9569. moduleSection := meta.ModuleSection();
  9570. IF backend.cooperative THEN
  9571. moduleOffset := 0;
  9572. ELSE
  9573. moduleOffset := moduleSection.pc;
  9574. END;
  9575. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9576. END;
  9577. ELSE
  9578. GetBaseRegister(op.op,currentScope,scope);
  9579. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  9580. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  9581. IF backend.cooperative THEN
  9582. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9583. END;
  9584. IntermediateCode.MakeMemory(op.op,addressType);
  9585. END;
  9586. Emit(Push(position,op.op));
  9587. ReleaseOperand(op);
  9588. END PushSelfPointer;
  9589. PROCEDURE Lock(lock: BOOLEAN);
  9590. BEGIN
  9591. IF Trace THEN TraceEnter("Lock") END;
  9592. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9593. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9594. ASSERT(modifyAssignmentCounter = 0);
  9595. IF dump # NIL THEN
  9596. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9597. dump.Ln;dump.Update;
  9598. END;
  9599. PushSelfPointer;
  9600. IF backend.cooperative THEN
  9601. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9602. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9603. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9604. END;
  9605. ELSE
  9606. Emit(Push(position,true));
  9607. IF lock THEN CallThis(position,"Objects","Lock",2)
  9608. ELSE CallThis(position,"Objects","Unlock",2);
  9609. END;
  9610. END;
  9611. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9612. IF Trace THEN TraceExit("Lock") END;
  9613. END Lock;
  9614. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9615. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9616. BEGIN
  9617. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9618. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9619. previouslyUnchecked := isUnchecked;
  9620. isUnchecked := isUnchecked OR x.isUnchecked;
  9621. previouslyCooperativeSwitches := cooperativeSwitches;
  9622. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9623. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9624. IF x.statements # NIL THEN
  9625. StatementSequence(x.statements);
  9626. END;
  9627. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9628. isUnchecked := previouslyUnchecked;
  9629. cooperativeSwitches := previouslyCooperativeSwitches;
  9630. IF Trace THEN TraceExit("VisitStatementBlock") END;
  9631. END VisitStatementBlock;
  9632. PROCEDURE VisitCode(x: SyntaxTree.Code);
  9633. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  9634. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  9635. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  9636. procedure: SyntaxTree.Procedure;
  9637. map: SymbolMap;
  9638. BEGIN
  9639. scope := currentScope;
  9640. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  9641. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9642. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9643. return := emptyOperand;
  9644. IF Trace THEN TraceEnter("VisitCode") END;
  9645. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  9646. NEW(in, x.inRules.Length());
  9647. FOR i := 0 TO LEN(in)-1 DO
  9648. statement := x.inRules.GetStatement(i);
  9649. WITH statement: SyntaxTree.Assignment DO
  9650. Evaluate(statement.right, operand);
  9651. result := operand.op;
  9652. NEW(str, 64);
  9653. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  9654. in[i] := result; IntermediateCode.SetString(in[i], str);
  9655. ReleaseIntermediateOperand(operand.tag);
  9656. END;
  9657. END;
  9658. ELSE in := NIL
  9659. END;
  9660. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  9661. NEW(out, x.outRules.Length());
  9662. FOR i := 0 TO LEN(out)-1 DO
  9663. statement := x.outRules.GetStatement(i);
  9664. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  9665. WITH statement: SyntaxTree.Assignment DO
  9666. Evaluate(statement.left, operand); (*?? or designate *)
  9667. result := operand.op;
  9668. NEW(str, 64);
  9669. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  9670. out[i] := result; IntermediateCode.SetString(out[i], str);
  9671. ReleaseIntermediateOperand(operand.tag);
  9672. |statement: SyntaxTree.ReturnStatement DO
  9673. NEW(str, 64);
  9674. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  9675. IF currentIsInline THEN
  9676. map := currentMapper.Get(NIL);
  9677. Evaluate(map.to, operand);
  9678. out[i] := operand.op;
  9679. ELSE
  9680. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9681. END;
  9682. IntermediateCode.SetString(out[i], str);
  9683. ReleaseIntermediateOperand(operand.tag);
  9684. return := out[i];
  9685. ELSE
  9686. END;
  9687. END;
  9688. ELSE out := NIL
  9689. END;
  9690. Emit(Asm(x.position,x.sourceCode, in, out));
  9691. IF in # NIL THEN
  9692. FOR i := 0 TO LEN(in)-1 DO
  9693. ReleaseIntermediateOperand(in[i]);
  9694. END;
  9695. END;
  9696. IF out # NIL THEN
  9697. FOR i := 0 TO LEN(out)-1 DO
  9698. WITH statement: SyntaxTree.Assignment DO
  9699. ReleaseIntermediateOperand(out[i]);
  9700. ELSE
  9701. IF currentIsInline THEN
  9702. ReleaseIntermediateOperand(out[i]);
  9703. END;
  9704. END;
  9705. statement := x.outRules.GetStatement(i);
  9706. END;
  9707. END;
  9708. IF return.mode # IntermediateCode.Undefined THEN
  9709. IF currentIsInline THEN
  9710. ELSIF ReturnedAsParameter(procedureType.returnType) THEN
  9711. Symbol(procedureType.returnParameter, par);
  9712. MakeMemory(mem, par.op, return.type, 0);
  9713. ReleaseOperand(par);
  9714. Emit(Mov(position, mem, return));
  9715. ReleaseIntermediateOperand(mem);
  9716. ELSE
  9717. Emit(Return(position,return));
  9718. END;
  9719. IF currentIsInline THEN RETURN END;
  9720. EmitLeave(section, position,procedureType(SyntaxTree.ProcedureType).callingConvention);
  9721. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,procedureType(SyntaxTree.ProcedureType).callingConvention));
  9722. ReleaseIntermediateOperand(return);
  9723. END;
  9724. IF Trace THEN TraceExit("VisitCode") END;
  9725. END VisitCode;
  9726. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  9727. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  9728. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  9729. const, call: IntermediateCode.Operand;
  9730. parameterDesignator: SyntaxTree.Expression;
  9731. saved: RegisterEntry;
  9732. name: Basic.SegmentedName;
  9733. BEGIN
  9734. IF Trace THEN TraceEnter("ParameterCopies") END;
  9735. parameter := x.firstParameter;
  9736. WHILE parameter # NIL DO
  9737. IF parameter.kind = SyntaxTree.ValueParameter THEN
  9738. type := parameter.type.resolved;
  9739. IF IsOpenArray(type) THEN
  9740. VisitParameter(parameter);
  9741. op := result;
  9742. IF backend.cooperative & parameter.NeedsTrace() THEN
  9743. length := GetArrayLength(type, op.tag);
  9744. size := NewRegisterOperand(addressType);
  9745. base := ArrayBaseType(type);
  9746. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  9747. Emit(Mul(position, size, length, const));
  9748. dst := NewRegisterOperand (addressType);
  9749. Emit(Mov(position, dst, size));
  9750. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9751. Emit(Sub(position,dst,sp,dst));
  9752. Emit(And(position,dst,dst,const));
  9753. Emit(Mov(position,sp,dst));
  9754. par := fp;
  9755. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9756. IntermediateCode.InitImmediate(null, byteType, 0);
  9757. Emit(Fill(position, dst, size, null));
  9758. ReleaseIntermediateOperand(dst);
  9759. ReleaseIntermediateOperand(length);
  9760. SaveRegisters();ReleaseUsedRegisters(saved);
  9761. (* register dst has been freed before SaveRegisters already *)
  9762. base := ArrayBaseType(type);
  9763. (* assign method of open array *)
  9764. IF base.IsRecordType() THEN
  9765. Emit (Push(position, length));
  9766. Emit (Push(position, dst));
  9767. Emit (Push(position, op.op));
  9768. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  9769. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  9770. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  9771. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  9772. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  9773. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  9774. Emit (Push(position,length));
  9775. Emit (Push(position, dst));
  9776. Emit (Push(position, length));
  9777. Emit (Push(position, op.op));
  9778. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  9779. ELSE
  9780. Emit (Push(position, length));
  9781. Emit (Push(position, dst));
  9782. Emit (Push(position, length));
  9783. Emit (Push(position, op.op));
  9784. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  9785. ASSERT(ArrayBaseType(type).IsPointer());
  9786. END;
  9787. RestoreRegisters(saved);
  9788. ELSE
  9789. temp := GetDynamicSize(type,op.tag);
  9790. ReuseCopy(size,temp);
  9791. ReleaseIntermediateOperand(temp);
  9792. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9793. Emit(Sub(position,size,sp,size));
  9794. Emit(And(position,size,size,const));
  9795. Emit(Mov(position,sp,size));
  9796. par := fp;
  9797. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9798. ReleaseIntermediateOperand(size);
  9799. size := GetDynamicSize(type,op.tag);
  9800. END;
  9801. Emit(Copy(position,sp,op.op,size));
  9802. ReleaseIntermediateOperand(size);
  9803. ReleaseOperand(op);
  9804. IntermediateCode.MakeMemory(par,addressType);
  9805. Emit(Mov(position,par,sp));
  9806. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  9807. checker.SetCurrentScope(currentScope);
  9808. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  9809. Assign(parameterDesignator,parameterDesignator);
  9810. END;
  9811. END;
  9812. parameter := parameter.nextParameter;
  9813. END;
  9814. IF Trace THEN TraceExit("ParameterCopies") END;
  9815. END ParameterCopies;
  9816. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  9817. VAR x: SyntaxTree.Variable;
  9818. BEGIN
  9819. x := scope.firstVariable;
  9820. WHILE x # NIL DO
  9821. InitVariable(x);
  9822. x := x.nextVariable;
  9823. END;
  9824. END InitVariables;
  9825. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  9826. BEGIN
  9827. IF (symbol # NIL) THEN
  9828. RETURN fingerPrinter.SymbolFP(symbol).shallow
  9829. ELSE
  9830. RETURN 0
  9831. END;
  9832. END GetFingerprint;
  9833. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  9834. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  9835. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  9836. saved: RegisterEntry;
  9837. BEGIN
  9838. IF Trace THEN TraceEnter("Body") END;
  9839. ReleaseUsedRegisters(saved); (* just in case ... *)
  9840. section := ir;
  9841. exitLabel := NewLabel ();
  9842. IF moduleBody THEN moduleBodySection := section END;
  9843. IF ir.comments # NIL THEN
  9844. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  9845. commentPrintout.SingleStatement(TRUE);
  9846. dump := ir.comments;
  9847. ELSE
  9848. commentPrintout := NIL;
  9849. dump := NIL;
  9850. END;
  9851. prevScope := currentScope;
  9852. currentScope := scope;
  9853. lastSwitchPC := 0;
  9854. cooperativeSwitches := backend.cooperative;
  9855. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9856. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9857. IF x # NIL THEN
  9858. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9859. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  9860. IF moduleBody THEN
  9861. ProfilerInit();
  9862. ELSE
  9863. Basic.SegmentedNameToString(ir.name, string);
  9864. ProfilerAddProcedure(numberProcedures,string);
  9865. ProfilerEnterExit(numberProcedures,TRUE);
  9866. END;
  9867. END;
  9868. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  9869. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  9870. END;
  9871. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  9872. IF moduleBody & ~newObjectFile THEN
  9873. InitVariables(moduleScope)
  9874. END;
  9875. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  9876. cellScope := scope.outerScope(SyntaxTree.CellScope);
  9877. IF procedure = cellScope.bodyProcedure THEN
  9878. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  9879. StaticCallOperand(op, cellScope.constructor);
  9880. Emit(Call(position,op.op,0));
  9881. END;
  9882. END;
  9883. END;
  9884. ParameterCopies(procedureType);
  9885. InitVariables(scope);
  9886. IF x.code = NIL THEN
  9887. VisitStatementBlock(x);
  9888. ELSE
  9889. VisitCode(x.code)
  9890. END;
  9891. IF x.finally # NIL THEN (*! mark finally block for object file *)
  9892. ir.SetFinally(ir.pc);
  9893. StatementSequence(x.finally)
  9894. END;
  9895. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  9896. IF ~backend.cooperative THEN
  9897. ProfilerEnterExit(numberProcedures,FALSE);
  9898. END;
  9899. INC(numberProcedures);
  9900. END;
  9901. END;
  9902. IF backend.cooperative THEN
  9903. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  9904. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  9905. ELSIF newObjectFile & moduleBody & ~suppressModuleRegistration & ~meta.simple THEN
  9906. (*! not required any more? check and delete!
  9907. PushSelfPointer();
  9908. CallThis(position,"Modules","SetInitialized",1);
  9909. *)
  9910. (*
  9911. SetLabel(end);
  9912. *)
  9913. END;
  9914. IF x # NIL THEN
  9915. SELF.position := x.position;
  9916. END;
  9917. CheckRegistersFree();
  9918. ASSERT(modifyAssignmentCounter = 0);
  9919. currentScope := prevScope;
  9920. IF Trace THEN TraceExit("Body") END;
  9921. END Body;
  9922. END ImplementationVisitor;
  9923. MetaDataGenerator=OBJECT
  9924. VAR
  9925. implementationVisitor: ImplementationVisitor;
  9926. declarationVisitor: DeclarationVisitor;
  9927. module: Sections.Module;
  9928. moduleName: ARRAY 128 OF CHAR;
  9929. moduleNamePool: Basic.HashTableInt;
  9930. moduleNamePoolSection: IntermediateCode.Section;
  9931. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  9932. MethodTableOffset: LONGINT; (* method table offset from zero *)
  9933. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  9934. TypeTags: LONGINT; (* type extension level support *)
  9935. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  9936. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  9937. BEGIN
  9938. IF implementationVisitor.backend.cooperative THEN
  9939. TypeTags := MAX(LONGINT);
  9940. BaseTypesTableOffset := 0;
  9941. MethodTableOffset := 2;
  9942. TypeRecordBaseOffset := 0;
  9943. ELSIF simple THEN
  9944. TypeTags := 3; (* only 3 extensions allowed *)
  9945. BaseTypesTableOffset := 1;
  9946. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  9947. TypeRecordBaseOffset := 0;
  9948. ELSE
  9949. TypeTags := 16;
  9950. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  9951. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  9952. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  9953. END;
  9954. SELF.simple := simple;
  9955. SELF.implementationVisitor := implementationVisitor;
  9956. SELF.declarationVisitor := declarationVisitor;
  9957. implementationVisitor.meta := SELF;
  9958. declarationVisitor.meta := SELF;
  9959. END InitMetaDataGenerator;
  9960. PROCEDURE SetModule(module: Sections.Module);
  9961. VAR namePoolOffset: LONGINT;
  9962. BEGIN
  9963. SELF.module := module;
  9964. Global.GetModuleName(module.module,moduleName);
  9965. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple THEN
  9966. NEW(moduleNamePool, 32);
  9967. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  9968. END;
  9969. END SetModule;
  9970. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  9971. BEGIN
  9972. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  9973. END GetTypeRecordBaseOffset;
  9974. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9975. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  9976. BEGIN
  9977. INC(dataAdrOffset,6);
  9978. Info(section,"headerAdr");
  9979. Address(section,0);
  9980. Info(section,"typeDesc");
  9981. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  9982. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  9983. NamedSymbol(section, name, symbol, 0, offset);
  9984. Info(section,"mark: LONGINT;");
  9985. Longint(section,-1);
  9986. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0);END;
  9987. Info(section,"dataAdr-: ADDRESS");
  9988. Symbol(section,section, dataAdrOffset,0);
  9989. Info(section,"size-: SIZE");
  9990. Address(section,0);
  9991. Info(section,"nextRealtime: HeapBlock;");
  9992. Address(section,0);
  9993. END HeapBlock;
  9994. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9995. VAR i: LONGINT;
  9996. BEGIN
  9997. INC(dataAdrOffset,14);
  9998. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  9999. Info(section,"count*: LONGINT");
  10000. Longint(section,0);
  10001. Info(section,"locked*: BOOLEAN");
  10002. Longint(section,0);
  10003. Info(section,"awaitingLock*: ProcessQueue");
  10004. Address(section,0);
  10005. Address(section,0);
  10006. Info(section,"awaitingCond*: ProcessQueue");
  10007. Address(section,0);
  10008. Address(section,0);
  10009. Info(section,"lockedBy*: ANY");
  10010. Address(section,0);
  10011. Info(section,"lock*: ANY");
  10012. Address(section,0);
  10013. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10014. Longint(section,1);
  10015. FOR i := 2 TO 6 DO
  10016. Longint(section,0);
  10017. END;
  10018. END ProtectedHeapBlock;
  10019. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10020. BEGIN
  10021. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10022. END Info;
  10023. PROCEDURE Address(section: IntermediateCode.Section; value: LONGINT);
  10024. VAR op: IntermediateCode.Operand;
  10025. BEGIN
  10026. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10027. section.Emit(Data(-11,op));
  10028. END Address;
  10029. PROCEDURE Size(section: IntermediateCode.Section; value: LONGINT);
  10030. VAR op: IntermediateCode.Operand;
  10031. BEGIN
  10032. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10033. section.Emit(Data(-12,op));
  10034. END Size;
  10035. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  10036. VAR op: IntermediateCode.Operand;
  10037. BEGIN
  10038. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  10039. section.Emit(Data(-1,op));
  10040. END Set;
  10041. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10042. VAR op: IntermediateCode.Operand;
  10043. BEGIN
  10044. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10045. section.Emit(Data(-1,op));
  10046. END Longint;
  10047. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10048. VAR op,noOperand: IntermediateCode.Operand;
  10049. BEGIN
  10050. IntermediateCode.InitOperand(noOperand);
  10051. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10052. section.PatchOperands(pc,op,noOperand,noOperand);
  10053. END PatchAddress;
  10054. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10055. VAR op,noOperand: IntermediateCode.Operand;
  10056. BEGIN
  10057. IntermediateCode.InitOperand(noOperand);
  10058. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10059. section.PatchOperands(pc,op,noOperand,noOperand);
  10060. END PatchSize;
  10061. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10062. VAR op,noOperand: IntermediateCode.Operand;
  10063. BEGIN
  10064. IntermediateCode.InitOperand(noOperand);
  10065. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10066. section.PatchOperands(pc,op,noOperand,noOperand);
  10067. END PatchLongint;
  10068. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10069. VAR op, noOperand: IntermediateCode.Operand;
  10070. BEGIN
  10071. IntermediateCode.InitOperand(noOperand);
  10072. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10073. section.PatchOperands(pc,op,noOperand,noOperand);
  10074. END PatchSymbol;
  10075. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10076. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10077. BEGIN
  10078. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10079. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10080. section.Emit(Data(-1,op));
  10081. END Boolean;
  10082. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10083. VAR op: IntermediateCode.Operand;
  10084. BEGIN
  10085. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10086. section.Emit(Data(-1,op));
  10087. END Char;
  10088. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10089. VAR i: LONGINT;
  10090. BEGIN
  10091. Info(section,str);
  10092. i := 0;
  10093. WHILE(str[i] # 0X) DO
  10094. Char(section,str[i]);
  10095. INC(i);
  10096. END;
  10097. Char(section,0X);
  10098. END String;
  10099. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10100. VAR op: IntermediateCode.Operand;
  10101. BEGIN
  10102. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10103. IntermediateCode.SetOffset(op,realOffset);
  10104. section.Emit(Data(-1,op));
  10105. END NamedSymbol;
  10106. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10107. BEGIN
  10108. IF symbol= NIL THEN
  10109. Address( section, realOffset);
  10110. ASSERT(virtualOffset = 0);
  10111. ELSE
  10112. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10113. END;
  10114. END Symbol;
  10115. (* OutPointers delivers
  10116. {pointerOffset}
  10117. *)
  10118. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10119. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type;
  10120. BEGIN
  10121. type := type.resolved;
  10122. IF type IS SyntaxTree.AnyType THEN
  10123. Symbol(section, symbol, 0, (offset ));
  10124. INC(numberPointers);
  10125. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10126. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10127. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10128. ELSIF type IS SyntaxTree.PointerType THEN
  10129. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10130. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10131. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10132. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10133. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10134. ELSIF (type IS SyntaxTree.RecordType) THEN
  10135. (* never treat a record like a pointer, even if the pointer field is set! *)
  10136. WITH type: SyntaxTree.RecordType DO
  10137. base := type.GetBaseRecord();
  10138. IF base # NIL THEN
  10139. Pointers(offset,symbol,section, base,numberPointers);
  10140. END;
  10141. variable := type.recordScope.firstVariable;
  10142. WHILE(variable # NIL) DO
  10143. IF ~(variable.untraced) THEN
  10144. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10145. END;
  10146. variable := variable.nextVariable;
  10147. END;
  10148. END;
  10149. ELSIF (type IS SyntaxTree.CellType) THEN
  10150. WITH type: SyntaxTree.CellType DO
  10151. base := type.GetBaseRecord();
  10152. IF base # NIL THEN
  10153. Pointers(offset,symbol,section, base,numberPointers);
  10154. END;
  10155. variable := type.cellScope.firstVariable;
  10156. WHILE(variable # NIL) DO
  10157. IF ~(variable.untraced) THEN
  10158. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10159. END;
  10160. variable := variable.nextVariable;
  10161. END;
  10162. END;
  10163. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10164. WITH type: SyntaxTree.ArrayType DO
  10165. IF type.form= SyntaxTree.Static THEN
  10166. n := type.staticLength;
  10167. base := type.arrayBase.resolved;
  10168. WHILE(base IS SyntaxTree.ArrayType) DO
  10169. type := base(SyntaxTree.ArrayType);
  10170. n := n* type.staticLength;
  10171. base := type.arrayBase.resolved;
  10172. END;
  10173. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10174. IF SemanticChecker.ContainsPointer(base) THEN
  10175. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10176. FOR i := 0 TO n-1 DO
  10177. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10178. END;
  10179. END;
  10180. ELSE
  10181. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10182. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10183. END;
  10184. END;
  10185. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10186. WITH type: SyntaxTree.MathArrayType DO
  10187. IF type.form = SyntaxTree.Static THEN
  10188. n := type.staticLength;
  10189. base := type.arrayBase.resolved;
  10190. WHILE(base IS SyntaxTree.MathArrayType) DO
  10191. type := base(SyntaxTree.MathArrayType);
  10192. n := n* type.staticLength;
  10193. base := type.arrayBase.resolved;
  10194. END;
  10195. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10196. IF SemanticChecker.ContainsPointer(base) THEN
  10197. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10198. FOR i := 0 TO n-1 DO
  10199. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10200. END;
  10201. END;
  10202. ELSE
  10203. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10204. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10205. END
  10206. END;
  10207. (* ELSE no pointers in type *)
  10208. END;
  10209. END Pointers;
  10210. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10211. VAR position,i: LONGINT; ch: CHAR;
  10212. BEGIN
  10213. IF pool.Has(index) THEN
  10214. RETURN pool.GetInt(index)
  10215. ELSE
  10216. position := source.pc;
  10217. pool.PutInt(index, position);
  10218. Info(source, name);
  10219. i := 0;
  10220. REPEAT
  10221. ch := name[i]; INC(i);
  10222. Char( source, ch);
  10223. UNTIL ch = 0X;
  10224. END;
  10225. RETURN position;
  10226. END EnterDynamicName;
  10227. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10228. VAR name: Basic.SectionName; position: LONGINT;
  10229. BEGIN
  10230. IF pool.Has(index) THEN
  10231. RETURN pool.GetInt(index)
  10232. ELSE
  10233. StringPool.GetString(index, name);
  10234. position := EnterDynamicName(source,name,index, pool);
  10235. END;
  10236. RETURN position;
  10237. END DynamicName;
  10238. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10239. VAR name: ARRAY 128 OF CHAR; section: IntermediateCode.Section; pooledName: Basic.SegmentedName;
  10240. BEGIN
  10241. COPY(moduleName,name);
  10242. Strings.Append(name,suffix);
  10243. Basic.ToSegmentedName(name, pooledName);
  10244. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName, NIL,TRUE);
  10245. IF implementationVisitor.backend.cooperative THEN
  10246. Info(section, "TypeDescriptor");
  10247. Basic.ToSegmentedName("BaseTypes.Array", pooledName);
  10248. NamedSymbol(section, pooledName,NIL, 0, 0);
  10249. BasePointer(section);
  10250. offset := 0;
  10251. ELSE
  10252. HeapBlock(mName,typeName,section,2);
  10253. Info(section, "HeapBlock");
  10254. (*
  10255. Symbol(section,section,2,0);
  10256. *)
  10257. Address(section,0); (* empty such that GC does not go on traversing *)
  10258. Info(section, "TypeDescriptor");
  10259. Address(section,0);
  10260. offset := section.pc;
  10261. END;
  10262. RETURN section
  10263. END Block;
  10264. PROCEDURE Array(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR);
  10265. VAR name: Basic.SegmentedName;
  10266. BEGIN
  10267. Info(source,"ArrayHeader");
  10268. IF implementationVisitor.backend.cooperative THEN
  10269. sizePC := source.pc;
  10270. Address(source,0);
  10271. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10272. IF baseType # "" THEN
  10273. Basic.ToSegmentedName(baseType, name);
  10274. NamedSymbol(source, name,NIL, 0, 0);
  10275. ELSE
  10276. Address(source,0);
  10277. END;
  10278. Address(source,0);
  10279. ELSE
  10280. Address(source,0);
  10281. Address(source,0);
  10282. Address(source,0);
  10283. sizePC := source.pc;
  10284. Address(source,0);
  10285. Info(source,"array data");
  10286. END;
  10287. END Array;
  10288. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10289. BEGIN
  10290. IF implementationVisitor.backend.cooperative THEN
  10291. PatchSize(section, pc, size);
  10292. PatchSize(section, pc + 3, size);
  10293. ELSE
  10294. PatchSize(section, pc, size);
  10295. END;
  10296. END PatchArray;
  10297. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10298. VAR
  10299. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10300. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10301. poolMap: Basic.HashTableInt;
  10302. namePool: IntermediateCode.Section;
  10303. namePoolOffset: LONGINT;
  10304. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10305. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10306. BEGIN
  10307. Basic.SegmentedNameToString(s1.name,n1);
  10308. Basic.SegmentedNameToString(s2.name,n2);
  10309. index := 0;
  10310. ch1 := n1[index];
  10311. ch2 := n2[index];
  10312. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10313. INC(index);
  10314. ch1 := n1[index];
  10315. ch2 := n2[index];
  10316. END;
  10317. RETURN ch1 < ch2;
  10318. END Compare;
  10319. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10320. VAR
  10321. i, j: LONGINT;
  10322. x, t: Sections.Section;
  10323. BEGIN
  10324. IF lo < hi THEN
  10325. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10326. WHILE i <= j DO
  10327. WHILE Compare(list[i], x) DO INC(i) END;
  10328. WHILE Compare(x, list[j]) DO DEC(j) END;
  10329. IF i <= j THEN
  10330. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10331. INC(i); DEC(j)
  10332. END
  10333. END;
  10334. IF lo < j THEN QuickSort(list, lo, j) END;
  10335. IF i < hi THEN QuickSort(list, i, hi) END
  10336. END;
  10337. END QuickSort;
  10338. (*
  10339. ExportDesc* = RECORD
  10340. fp*: ADDRESS;
  10341. name* {UNTRACED}: DynamicName;
  10342. adr*: ADDRESS;
  10343. exports*: LONGINT;
  10344. dsc* {UNTRACED}: ExportArray
  10345. END;
  10346. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10347. *)
  10348. PROCEDURE ExportDesc2(
  10349. source: IntermediateCode.Section;
  10350. namePool: IntermediateCode.Section;
  10351. fingerPrinter: FingerPrinter.FingerPrinter;
  10352. symbol: Sections.Section;
  10353. name: StringPool.Index;
  10354. VAR patchAdr: LONGINT
  10355. ): BOOLEAN;
  10356. VAR fingerPrint: SyntaxTree.FingerPrint;
  10357. BEGIN
  10358. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10359. & (symbol.type # Sections.InlineCodeSection)
  10360. THEN
  10361. *)
  10362. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10363. & (symbol.type # Sections.InlineCodeSection))
  10364. THEN
  10365. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10366. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10367. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10368. Longint(source,fingerPrint.shallow);
  10369. ELSE
  10370. Longint(source, 0);
  10371. END;
  10372. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  10373. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10374. Symbol(source, symbol,0,0);
  10375. patchAdr := source.pc;
  10376. Longint(source, 0);
  10377. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  10378. Address(source,0);
  10379. END;
  10380. RETURN TRUE
  10381. ELSE
  10382. RETURN FALSE
  10383. END;
  10384. END ExportDesc2;
  10385. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10386. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10387. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10388. sym: Sections.Section; ignore: LONGINT; symbol: Sections.Section;
  10389. nextPatch: LONGINT;
  10390. TYPE
  10391. Scope = RECORD
  10392. elements: LONGINT;
  10393. gelements: LONGINT;
  10394. section: IntermediateCode.Section;
  10395. patchAdr: LONGINT;
  10396. arraySizePC: LONGINT;
  10397. beginPC: LONGINT; (* current scope start pc *)
  10398. END;
  10399. BEGIN
  10400. Basic.InitSegmentedName(prev);
  10401. olevel := -1;
  10402. scopes[0].section := source;
  10403. scopes[0].arraySizePC := MIN(LONGINT);
  10404. FOR s := 0 TO LEN(sections)-1 DO
  10405. symbol := sections[s];
  10406. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10407. this := sections[s].name;
  10408. level := 0;
  10409. WHILE (this[level] > 0) DO
  10410. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10411. INC(level);
  10412. END;
  10413. WHILE level < olevel DO
  10414. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10415. IF olevel > 0 THEN
  10416. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10417. nextPatch := scopes[olevel-1].patchAdr+1;
  10418. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10419. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10420. END;
  10421. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10422. DEC(olevel);
  10423. END;
  10424. IF (this[level] > 0) THEN
  10425. IF level > olevel THEN
  10426. (*TRACE("opening",level); *)
  10427. IF scopes[level].section = NIL THEN
  10428. arrayName := ".@ExportArray";
  10429. Strings.AppendInt(arrayName, level);
  10430. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,ignore);
  10431. Array(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc");
  10432. END;
  10433. scopes[level].beginPC := scopes[level].section.pc;
  10434. olevel := level;
  10435. scopes[olevel].elements := 0;
  10436. END;
  10437. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10438. sym := sections[s];
  10439. ELSE
  10440. sym := NIL;
  10441. END;
  10442. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10443. THEN
  10444. INC(scopes[olevel].elements);
  10445. END;
  10446. (*StringPool.GetString(this[level], name);*)
  10447. (*TRACE(level, name);*)
  10448. (* enter string in scope *)
  10449. INC(level);
  10450. END;
  10451. END;
  10452. Basic.SegmentedNameToString(this, name);
  10453. (*TRACE(level, "enter", name);*)
  10454. prev := this;
  10455. END;
  10456. END;
  10457. WHILE 0 <= olevel DO
  10458. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10459. IF olevel > 0 THEN
  10460. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10461. nextPatch := scopes[olevel-1].patchAdr+1;
  10462. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10463. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10464. END;
  10465. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10466. DEC(olevel);
  10467. END;
  10468. level := 0;
  10469. WHILE (level < LEN(scopes)) DO
  10470. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  10471. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10472. END;
  10473. INC(level);
  10474. END;
  10475. END Export;
  10476. BEGIN
  10477. NEW(fingerPrinter, module.system);
  10478. NEW(poolMap, 64);
  10479. (* 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 *)
  10480. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10481. NEW(sectionArray, module.allSections.Length());
  10482. FOR i := 0 TO module.allSections.Length() - 1 DO
  10483. section := module.allSections.GetSection(i);
  10484. sectionArray[i] := section;
  10485. END;
  10486. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10487. Export(sectionArray^);
  10488. END ExportDesc;
  10489. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10490. VAR
  10491. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10492. BEGIN
  10493. Info(source, "exception table offsets array descriptor");
  10494. size := 0;
  10495. Array(source,sizePC,"Modules.ExceptionTableEntry");
  10496. Info(source, "exception table content");
  10497. FOR i := 0 TO module.allSections.Length() - 1 DO
  10498. p := module.allSections.GetSection(i);
  10499. IF p.type = Sections.CodeSection THEN
  10500. finallyPC := p(IntermediateCode.Section).finally;
  10501. IF finallyPC>=0 THEN
  10502. Symbol( source, p, 0,0);
  10503. Symbol( source, p, finallyPC, 0);
  10504. Symbol( source, p, finallyPC,0);
  10505. INC(size);
  10506. END;
  10507. END
  10508. END;
  10509. PatchArray(source,sizePC,size);
  10510. END ExceptionArray;
  10511. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10512. VAR i: LONGINT; ch: CHAR;
  10513. BEGIN
  10514. i := 0;
  10515. REPEAT
  10516. ch := name[i]; INC(i);
  10517. Char( section, ch);
  10518. UNTIL ch = 0X;
  10519. WHILE i < 32 DO
  10520. Char( section, 0X); INC(i);
  10521. END;
  10522. END Name;
  10523. PROCEDURE References(section: IntermediateCode.Section);
  10524. CONST
  10525. rfDirect = 1X; rfIndirect = 3X;
  10526. rfStaticArray= 12X; rfDynamicArray=14X; rfOpenArray=15X;
  10527. rfByte = 1X; rfBoolean = 2X; rfChar8=3X; rfShortint=04X; rfInteger = 05X; rfLongint = 06X;
  10528. rfReal = 07X; rfLongreal = 08X; rfSet = 09X; rfDelegate = 0EX; rfString = 0FH; rfPointer = 0DX; rfHugeint = 10X;
  10529. rfChar16=11X; rfChar32=12X; rfAll=13X; rfSame=14X; rfRange=15X; rfRecord=16X; rfComplex = 17X; rfLongcomplex = 18X;
  10530. rfPort = 19X;
  10531. rfRecordPointer=1DX;
  10532. rfArrayFlag = 80X;
  10533. VAR
  10534. s: Sections.Section; sizePC, i, startPC, endPC: LONGINT;
  10535. PROCEDURE BaseType(type: SyntaxTree.Type): CHAR;
  10536. VAR char: CHAR;
  10537. BEGIN
  10538. IF type = NIL THEN char := rfLongint
  10539. ELSIF type IS SyntaxTree.ByteType THEN char := rfByte
  10540. ELSIF type IS SyntaxTree.BooleanType THEN char := rfBoolean
  10541. ELSIF type IS SyntaxTree.CharacterType THEN
  10542. IF type.sizeInBits = 8 THEN char := rfChar8
  10543. ELSIF type.sizeInBits = 16 THEN char := rfChar16
  10544. ELSIF type.sizeInBits = 32 THEN char := rfChar32
  10545. END;
  10546. ELSIF (type IS SyntaxTree.IntegerType) OR (type IS SyntaxTree.AddressType) OR (type IS SyntaxTree.SizeType) THEN
  10547. IF type.sizeInBits = 8 THEN char := rfShortint
  10548. ELSIF type.sizeInBits = 16 THEN char := rfInteger
  10549. ELSIF type.sizeInBits = 32 THEN char := rfLongint
  10550. ELSIF type.sizeInBits = 64 THEN char := rfHugeint
  10551. END;
  10552. ELSIF type IS SyntaxTree.SizeType THEN char := rfLongint
  10553. ELSIF type IS SyntaxTree.FloatType THEN
  10554. IF type.sizeInBits = 32 THEN char := rfReal
  10555. ELSIF type.sizeInBits = 64 THEN char := rfLongreal
  10556. END;
  10557. ELSIF type IS SyntaxTree.ComplexType THEN
  10558. IF type.sizeInBits = 64 THEN char := rfComplex
  10559. ELSIF type.sizeInBits = 128 THEN char := rfLongcomplex
  10560. END;
  10561. ELSIF type IS SyntaxTree.SetType THEN char := rfSet
  10562. ELSIF type IS SyntaxTree.AnyType THEN char := rfPointer
  10563. ELSIF type IS SyntaxTree.ObjectType THEN char := rfPointer
  10564. ELSIF type IS SyntaxTree.PointerType THEN char := rfPointer
  10565. ELSIF type IS SyntaxTree.ProcedureType THEN char := rfDelegate
  10566. ELSIF type IS SyntaxTree.RangeType THEN char := rfRange
  10567. ELSIF type IS SyntaxTree.PortType THEN char := rfPort
  10568. ELSE (*ASSERT(arrayOf);*) char := rfPointer; (*RETURN (* ARRAY OF unknown (record): do not write anything *)*)
  10569. END;
  10570. RETURN char
  10571. END BaseType;
  10572. PROCEDURE RecordType(type: SyntaxTree.RecordType);
  10573. VAR destination: Sections.Section;
  10574. BEGIN
  10575. destination := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10576. IF type.pointerType # NIL THEN
  10577. Char(section,rfRecordPointer)
  10578. ELSE
  10579. Char(section,rfRecord);
  10580. END;
  10581. IF destination = NIL THEN
  10582. Longint(section,0);
  10583. ELSE
  10584. Longint(section,destination.offset); (* used for ? *)
  10585. END;
  10586. END RecordType;
  10587. PROCEDURE StaticArrayLength(type: SyntaxTree.ArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10588. BEGIN
  10589. baseType := type.arrayBase.resolved;
  10590. IF type.form = SyntaxTree.Static THEN
  10591. IF baseType IS SyntaxTree.ArrayType THEN
  10592. RETURN type.staticLength * StaticArrayLength(baseType(SyntaxTree.ArrayType),baseType)
  10593. ELSE
  10594. RETURN type.staticLength
  10595. END
  10596. ELSE
  10597. RETURN 0
  10598. END;
  10599. END StaticArrayLength;
  10600. PROCEDURE ArrayType(type: SyntaxTree.ArrayType);
  10601. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10602. BEGIN
  10603. length := StaticArrayLength(type, baseType);
  10604. char := BaseType(baseType);
  10605. IF type.form # SyntaxTree.Open THEN
  10606. Char(section,CHR(ORD(char)+ORD(rfArrayFlag)));
  10607. Longint(section, length)
  10608. ELSE
  10609. length :=0;
  10610. (*length := 1+SemanticChecker.Dimension(type,{SyntaxTree.Open});*)
  10611. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10612. Longint(section, length)
  10613. END;
  10614. END ArrayType;
  10615. PROCEDURE StaticMathArrayLength(type: SyntaxTree.MathArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10616. BEGIN
  10617. baseType := type.arrayBase;
  10618. IF baseType # NIL THEN
  10619. baseType := baseType.resolved;
  10620. END;
  10621. IF type.form = SyntaxTree.Static THEN
  10622. IF (baseType # NIL) & (baseType IS SyntaxTree.MathArrayType) THEN
  10623. RETURN type.staticLength * StaticMathArrayLength(baseType(SyntaxTree.MathArrayType),baseType)
  10624. ELSE
  10625. RETURN type.staticLength
  10626. END
  10627. ELSE
  10628. RETURN 0
  10629. END;
  10630. END StaticMathArrayLength;
  10631. PROCEDURE MathArrayType(type: SyntaxTree.MathArrayType);
  10632. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10633. BEGIN
  10634. length := StaticMathArrayLength(type, baseType);
  10635. char := BaseType(baseType);
  10636. IF type.form = SyntaxTree.Open THEN
  10637. char := BaseType(module.system.addressType);
  10638. length := 5+2*SemanticChecker.Dimension(type,{SyntaxTree.Open});
  10639. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10640. Longint(section, length)
  10641. ELSIF type.form=SyntaxTree.Tensor THEN
  10642. char := BaseType(module.system.addressType);
  10643. Char(section, CHR(ORD(char)));
  10644. ELSE
  10645. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10646. Longint(section, length)
  10647. END;
  10648. END MathArrayType;
  10649. PROCEDURE Type(type: SyntaxTree.Type);
  10650. BEGIN
  10651. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10652. IF type IS SyntaxTree.BasicType THEN
  10653. Char(section, BaseType(type));
  10654. ELSIF type IS SyntaxTree.RecordType THEN
  10655. RecordType(type(SyntaxTree.RecordType));
  10656. ELSIF type IS SyntaxTree.ArrayType THEN
  10657. ArrayType(type(SyntaxTree.ArrayType))
  10658. ELSIF type IS SyntaxTree.EnumerationType THEN
  10659. Char(section, BaseType(module.system.longintType))
  10660. ELSIF type IS SyntaxTree.PointerType THEN
  10661. IF type(SyntaxTree.PointerType).pointerBase IS SyntaxTree.RecordType THEN
  10662. RecordType(type(SyntaxTree.PointerType).pointerBase(SyntaxTree.RecordType));
  10663. ELSE
  10664. Char(section, BaseType(type))
  10665. END;
  10666. ELSIF type IS SyntaxTree.ProcedureType THEN
  10667. Char(section, BaseType(type));
  10668. ELSIF type IS SyntaxTree.MathArrayType THEN
  10669. MathArrayType(type(SyntaxTree.MathArrayType));
  10670. ELSIF type IS SyntaxTree.CellType THEN
  10671. Char(section, BaseType(module.system.anyType));
  10672. ELSIF type IS SyntaxTree.PortType THEN
  10673. Char(section, rfPort);
  10674. ELSE HALT(200)
  10675. END;
  10676. END Type;
  10677. PROCEDURE WriteVariable(variable: SyntaxTree.Variable; indirect: BOOLEAN);
  10678. VAR name: ARRAY 256 OF CHAR;
  10679. BEGIN
  10680. IF variable.externalName # NIL THEN RETURN END;
  10681. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10682. variable.GetName(name);
  10683. Type(variable.type);
  10684. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10685. String(section,name);
  10686. END WriteVariable;
  10687. PROCEDURE WriteParameter(variable: SyntaxTree.Parameter; indirect: BOOLEAN);
  10688. VAR name: ARRAY 256 OF CHAR;
  10689. BEGIN
  10690. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10691. variable.GetName(name);
  10692. Type(variable.type);
  10693. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10694. variable.GetName(name);
  10695. String(section,name);
  10696. END WriteParameter;
  10697. PROCEDURE ReturnType(type: SyntaxTree.Type);
  10698. BEGIN
  10699. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10700. IF type IS SyntaxTree.ArrayType THEN
  10701. WITH type: SyntaxTree.ArrayType DO
  10702. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10703. ELSE Char(section,rfOpenArray)
  10704. END;
  10705. END
  10706. ELSIF type IS SyntaxTree.MathArrayType THEN
  10707. WITH type: SyntaxTree.MathArrayType DO
  10708. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10709. ELSE Char(section,rfOpenArray)
  10710. END;
  10711. END
  10712. ELSIF type IS SyntaxTree.RecordType THEN
  10713. Char(section,rfRecord);
  10714. ELSE
  10715. Char(section, BaseType(type));
  10716. END;
  10717. END ReturnType;
  10718. PROCEDURE Procedure(s: Sections.Section);
  10719. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10720. parameter: SyntaxTree.Parameter; variable: SyntaxTree.Variable;
  10721. segmentedName: Basic.SegmentedName;
  10722. name: ARRAY 256 OF CHAR;
  10723. BEGIN
  10724. procedure := s.symbol(SyntaxTree.Procedure); (*! check for variable or type symbol for object body *)
  10725. (*procedure.name,name);*)
  10726. implementationVisitor.GetCodeSectionNameForSymbolInScope(procedure,module.module.moduleScope, name);
  10727. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10728. Char(section,0F9X);
  10729. Symbol(section,s,0,0);
  10730. Symbol(section,s,s(IntermediateCode.Section).pc,0);
  10731. Longint(section,procedureType.numberParameters);
  10732. ReturnType(procedureType.returnType);
  10733. Longint(section,0); (*! level *)
  10734. Longint(section,0);
  10735. (*
  10736. IF procedure.scope IS SyntaxTree.RecordScope THEN (* add object name *)
  10737. record := procedure.scope(SyntaxTree.RecordScope).ownerRecord;
  10738. recordName := "";
  10739. IF record.pointerType # NIL THEN
  10740. DeclarationName(record.pointerType.typeDeclaration,recordName);
  10741. ELSE
  10742. DeclarationName(record.typeDeclaration,recordName);
  10743. END;
  10744. i := 0;
  10745. Info(section,recordName);
  10746. WHILE recordName[i] # 0X DO
  10747. Char(section,recordName[i]); INC(i);
  10748. INC(size);
  10749. END;
  10750. Char(section,".");
  10751. INC(size);
  10752. END;
  10753. *)
  10754. String(section,name);
  10755. parameter := procedureType.firstParameter;
  10756. WHILE(parameter # NIL) DO
  10757. WriteParameter(parameter,parameter.kind # SyntaxTree.ValueParameter); (*!treat exceptions !*)
  10758. parameter := parameter.nextParameter;
  10759. END;
  10760. variable := procedure.procedureScope.firstVariable;
  10761. WHILE(variable # NIL) DO
  10762. WriteVariable(variable,FALSE);
  10763. variable := variable.nextVariable;
  10764. END;
  10765. END Procedure;
  10766. PROCEDURE Scope(s: Sections.Section);
  10767. BEGIN
  10768. Char(section,0F8X);
  10769. Symbol(section,s,0,0); (* start *)
  10770. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  10771. String(section,"$$");
  10772. (* removed variables -- wrongly interpreted by Reflection
  10773. variable := module.module.moduleScope.firstVariable;
  10774. WHILE(variable # NIL) DO
  10775. WriteVariable(variable,FALSE);
  10776. variable := variable.nextVariable;
  10777. END;
  10778. *)
  10779. END Scope;
  10780. PROCEDURE ComputeSize(startPC, endPC: LONGINT): SIZE;
  10781. VAR result, i: LONGINT;
  10782. BEGIN
  10783. FOR i := startPC TO endPC -1 DO
  10784. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  10785. INC(result, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  10786. END;
  10787. RETURN result;
  10788. END ComputeSize;
  10789. BEGIN
  10790. Array(section,sizePC,"");
  10791. startPC := section.pc;
  10792. Char(section,0FFX); (* sign for trap writer *)
  10793. FOR i := 0 TO module.allSections.Length() - 1 DO
  10794. s := module.allSections.GetSection(i);
  10795. IF (s.type # Sections.InitCodeSection) & (s.symbol = module.module.moduleScope.bodyProcedure) THEN
  10796. Scope(s) (*! must be first procedure in ref section *)
  10797. END
  10798. END;
  10799. FOR i := 0 TO module.allSections.Length() - 1 DO
  10800. s := module.allSections.GetSection(i);
  10801. IF (s.symbol = module.module.moduleScope.bodyProcedure) THEN (* already done, see above *)
  10802. ELSIF (s.type # Sections.InitCodeSection) & (s.symbol # NIL) & (s.symbol IS SyntaxTree.Procedure) & ~s.symbol(SyntaxTree.Procedure).isInline THEN
  10803. Procedure(s)
  10804. END
  10805. END;
  10806. endPC := section.pc;
  10807. PatchArray(section,sizePC,ComputeSize(startPC, endPC));
  10808. END References;
  10809. (*
  10810. Command* = RECORD
  10811. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  10812. name*: Name; (* name of the procedure *)
  10813. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  10814. entryAdr* : ADDRESS; (* entry address of procedure *)
  10815. END;
  10816. *)
  10817. PROCEDURE CommandArray(source: IntermediateCode.Section);
  10818. VAR
  10819. p: Sections.Section; sizePC, numberCommands: LONGINT;
  10820. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10821. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  10822. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  10823. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  10824. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  10825. BEGIN
  10826. RETURN
  10827. (type = NIL) OR
  10828. (type.resolved IS SyntaxTree.RecordType) OR
  10829. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  10830. (type.resolved IS SyntaxTree.AnyType);
  10831. END TypeAllowed;
  10832. BEGIN
  10833. numberParameters := procedureType.numberParameters;
  10834. RETURN
  10835. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  10836. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  10837. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  10838. END GetProcedureAllowed;
  10839. PROCEDURE WriteType(type : SyntaxTree.Type);
  10840. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  10841. name: Basic.SegmentedName; offset: LONGINT;
  10842. BEGIN
  10843. IF type = NIL THEN
  10844. Address(source,0);
  10845. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  10846. Address(source,1);
  10847. ELSE
  10848. type := type.resolved;
  10849. IF type IS SyntaxTree.PointerType THEN
  10850. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  10851. END;
  10852. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  10853. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  10854. name[0] := typeDeclaration.name; name[1] := -1;
  10855. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10856. ASSERT(section # NIL);
  10857. ELSE
  10858. Global.GetSymbolSegmentedName(typeDeclaration,name);
  10859. (* TODO *)
  10860. section := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  10861. END;
  10862. IF implementationVisitor.backend.cooperative THEN
  10863. offset := 0;
  10864. ELSE
  10865. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  10866. END;
  10867. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  10868. END;
  10869. END WriteType;
  10870. BEGIN
  10871. Info(source, "command array descriptor");
  10872. Array(source,sizePC,"Modules.Command");
  10873. numberCommands := 0;
  10874. Info(source, "command array content");
  10875. FOR i := 0 TO module.allSections.Length() - 1 DO
  10876. p := module.allSections.GetSection(i);
  10877. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  10878. procedure := p.symbol(SyntaxTree.Procedure);
  10879. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10880. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  10881. procedure.GetName(name);
  10882. Name(source,name);
  10883. numberParameters := procedureType.numberParameters;
  10884. (* offset of type of first parameter *)
  10885. IF (numberParameters = 0 ) THEN WriteType(NIL)
  10886. ELSE WriteType(procedureType.firstParameter.type)
  10887. END;
  10888. (* offset of type of return parameter *)
  10889. WriteType(procedureType.returnType);
  10890. (* command name *)
  10891. (* command code offset *)
  10892. Symbol(source,p,0,0);
  10893. INC(numberCommands);
  10894. IF Trace THEN
  10895. D.Ln;
  10896. END;
  10897. END;
  10898. END
  10899. END;
  10900. PatchArray(source,sizePC,numberCommands);
  10901. END CommandArray;
  10902. (* to prevent from double import of different module aliases *)
  10903. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  10904. VAR i: SyntaxTree.Import;
  10905. BEGIN
  10906. i := module.module.moduleScope.firstImport;
  10907. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  10908. i := i.nextImport;
  10909. END;
  10910. RETURN i = import
  10911. END IsFirstDirectOccurence;
  10912. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  10913. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  10914. BEGIN
  10915. Array(source,pc,"");
  10916. Info(source, "import module array data");
  10917. IF implementationVisitor.backend.cooperative THEN
  10918. offset := 0;
  10919. ELSE
  10920. IF module.system.addressType.sizeInBits = 64 THEN
  10921. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  10922. ELSE
  10923. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  10924. END;
  10925. END;
  10926. import := module.module.moduleScope.firstImport;
  10927. numberImports := 0;
  10928. WHILE import # NIL DO
  10929. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  10930. Global.GetModuleSegmentedName(import.module,name);
  10931. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  10932. NamedSymbol(source, name, NIL, 0, offset);
  10933. INC(numberImports);
  10934. END;
  10935. import := import.nextImport
  10936. END;
  10937. PatchArray(source,pc,numberImports);
  10938. END ImportsArray;
  10939. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  10940. VAR
  10941. p: Sections.Section; sizePC, size, i: LONGINT;
  10942. BEGIN
  10943. Info(source, "Type info section");
  10944. size := 0;
  10945. Array(source,sizePC,"Modules.TypeDesc");
  10946. FOR i := 0 TO module.allSections.Length() - 1 DO
  10947. p := module.allSections.GetSection(i);
  10948. WITH p: IntermediateCode.Section DO
  10949. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  10950. Symbol(source,p,0,0);
  10951. INC(size);
  10952. END;
  10953. END
  10954. END;
  10955. PatchArray(source,sizePC,size);
  10956. END TypeInfoSection;
  10957. (*
  10958. ProcTableEntry* = RECORD
  10959. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  10960. noPtr*: LONGINT;
  10961. END;
  10962. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  10963. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  10964. *)
  10965. PROCEDURE PointersInProcTables(procArray, pointerArray: IntermediateCode.Section; VAR procArraySize, maxPointers: LONGINT);
  10966. VAR
  10967. destination: Sections.Section;
  10968. pointerArraySizePC, procArraySizePC, pointerArraySize, i: LONGINT;
  10969. PROCEDURE PointerOffsets(destination : IntermediateCode.Section);
  10970. VAR numberPointers: LONGINT; procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10971. variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; string: Basic.SectionName;
  10972. BEGIN
  10973. Info(procArray,"pcFrom");
  10974. Symbol(procArray,destination,0,0);
  10975. Info(procArray,"pcTo");
  10976. Symbol(procArray,destination,destination.pc,0);
  10977. Info(procArray,"pcStatementBegin");
  10978. Symbol(procArray,destination,destination.validPAFEnter,0);
  10979. Info(procArray,"pcStatementEnd");
  10980. Symbol(procArray,destination,destination.validPAFExit,0);
  10981. IF ~implementationVisitor.backend.cooperative THEN
  10982. Basic.SegmentedNameToString(destination.name, string);
  10983. Info(pointerArray,string);
  10984. procedure := destination.symbol(SyntaxTree.Procedure);
  10985. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10986. variable := procedure.procedureScope.firstVariable;
  10987. WHILE(variable # NIL) DO
  10988. IF ~(variable.untraced) THEN
  10989. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, pointerArray, variable.type, numberPointers);
  10990. END;
  10991. variable := variable.nextVariable
  10992. END;
  10993. parameter := procedureType.firstParameter;
  10994. WHILE(parameter # NIL) DO
  10995. IF ~(parameter.untraced) THEN
  10996. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, pointerArray, parameter.type, numberPointers);
  10997. END;
  10998. parameter := parameter.nextParameter;
  10999. END;
  11000. END;
  11001. Info(procArray,"numberPointers");
  11002. Longint(procArray,numberPointers);
  11003. IF numberPointers > maxPointers THEN maxPointers := numberPointers END;
  11004. INC(pointerArraySize, numberPointers);
  11005. END PointerOffsets;
  11006. BEGIN
  11007. maxPointers := 0;
  11008. Info(procArray, "proc array descriptor");
  11009. Address(procArray,0);
  11010. Address(procArray,0);
  11011. Address(procArray,0);
  11012. procArraySizePC := procArray.pc;
  11013. Address(procArray,0);
  11014. procArraySize := 0;
  11015. IF ~implementationVisitor.backend.cooperative THEN
  11016. Info(pointerArray, "pointer array descriptor");
  11017. Address(pointerArray,0);
  11018. Address(pointerArray,0);
  11019. Address(pointerArray,0);
  11020. pointerArraySizePC := pointerArray.pc;
  11021. Address(pointerArray,0);
  11022. pointerArraySize := 0;
  11023. END;
  11024. procArraySize := 0;
  11025. FOR i := 0 TO module.allSections.Length() - 1 DO
  11026. destination := module.allSections.GetSection(i);
  11027. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11028. PointerOffsets(destination(IntermediateCode.Section));
  11029. INC(procArraySize);
  11030. END
  11031. END;
  11032. PatchLongint(procArray,procArraySizePC,procArraySize);
  11033. IF ~implementationVisitor.backend.cooperative THEN
  11034. PatchLongint(pointerArray,pointerArraySizePC,pointerArraySize);
  11035. END;
  11036. END PointersInProcTables;
  11037. (*
  11038. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11039. VAR
  11040. next*: Module; (** once a module is published, all fields are read-only *)
  11041. name*: Name;
  11042. init, published: BOOLEAN;
  11043. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11044. sb*: ADDRESS; <- set to beginning of data section by loader
  11045. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11046. command*: POINTER TO ARRAY OF Command;
  11047. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11048. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11049. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11050. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11051. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11052. data*, code*: Bytes;
  11053. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11054. export*: ExportDesc;
  11055. term*: TerminationHandler;
  11056. exTable*: ExceptionTable;
  11057. noProcs*: LONGINT;
  11058. firstProc*: ADDRESS; <- done by loader
  11059. maxPtrs*: LONGINT;
  11060. crc*: LONGINT;
  11061. *)
  11062. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11063. BEGIN
  11064. Info(section, "cycle");
  11065. Size(section,0);
  11066. Info(section, "references");
  11067. Size(section,0);
  11068. Info(section, "nextMarked");
  11069. Address(section,0);
  11070. Info(section, "nextWatched");
  11071. Address(section,0);
  11072. END BasePointer;
  11073. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11074. BEGIN
  11075. BasePointer(section);
  11076. Info(section, "action");
  11077. Address(section,0);
  11078. Info(section, "monitor");
  11079. Address(section,0);
  11080. END BaseObject;
  11081. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  11082. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  11083. pooledName: Basic.SegmentedName;
  11084. symbol: SyntaxTree.Symbol;
  11085. BEGIN
  11086. Global.GetModuleName(module.module,name);
  11087. Strings.Append(name,".@Module.@Descriptor");
  11088. Basic.ToSegmentedName(name, pooledName);
  11089. descriptorSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  11090. Symbol(section,descriptorSection,0,0);
  11091. Info(descriptorSection, "descriptor");
  11092. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11093. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  11094. Address(descriptorSection,0);
  11095. Global.GetModuleName(module.module,name);
  11096. Strings.Append(name,".@Trace");
  11097. Basic.ToSegmentedName(name, pooledName);
  11098. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11099. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  11100. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11101. END ModuleDescriptor;
  11102. PROCEDURE ModuleSection(): IntermediateCode.Section;
  11103. VAR name: ARRAY 128 OF CHAR;
  11104. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  11105. symbol: SyntaxTree.Symbol;
  11106. BEGIN
  11107. Global.GetModuleName(module.module,name);
  11108. Strings.Append(name,".@Module");
  11109. Basic.ToSegmentedName(name, pooledName);
  11110. moduleSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  11111. moduleSection.SetExported(TRUE);
  11112. IF moduleSection.pc = 0 THEN
  11113. IF implementationVisitor.backend.cooperative THEN
  11114. Info(moduleSection, "descriptor");
  11115. ModuleDescriptor(moduleSection);
  11116. BaseObject(moduleSection);
  11117. implementationVisitor.CreateTraceModuleMethod(module.module);
  11118. ELSE
  11119. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  11120. Info(moduleSection, "HeapBlock");
  11121. Symbol(moduleSection,moduleSection,2,0);
  11122. Info(moduleSection, "TypeDescriptor");
  11123. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11124. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  11125. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  11126. END;
  11127. END;
  11128. RETURN moduleSection;
  11129. END ModuleSection;
  11130. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  11131. VAR
  11132. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  11133. typeInfoSection, procTableSection, ptrTableSection, referenceSection : IntermediateCode.Section;
  11134. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  11135. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, ptrTableSectionOffset, maxPointers, numberProcs,temp,
  11136. referenceSectionOffset : LONGINT;
  11137. BEGIN
  11138. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  11139. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  11140. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  11141. ImportsArray(importSection);
  11142. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  11143. CommandArray(commandsSection);
  11144. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  11145. ExceptionArray(exceptionSection);
  11146. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  11147. TypeInfoSection(typeInfoSection);
  11148. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  11149. References(referenceSection);
  11150. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  11151. IF ~implementationVisitor.backend.cooperative THEN
  11152. ptrTableSection := Block("Heaps","SystemBlockDesc",".@PtrTable",ptrTableSectionOffset);
  11153. ELSE
  11154. ptrTableSection := NIL;
  11155. END;
  11156. PointersInProcTables(procTableSection,ptrTableSection,numberProcs,maxPointers);
  11157. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  11158. Array(emptyArraySection,temp,"");
  11159. moduleSection := ModuleSection();
  11160. Info(moduleSection, "nextRoot*: RootObject");
  11161. Address(moduleSection,0);
  11162. Info(moduleSection, "next*: Module");
  11163. Address(moduleSection,0);
  11164. Info(moduleSection, "name*: Name");
  11165. Name(moduleSection,moduleName);
  11166. Info(moduleSection, "init, published: BOOLEAN");
  11167. Boolean(moduleSection,FALSE);
  11168. Boolean(moduleSection,FALSE);
  11169. Info(moduleSection,"filler"); (*! introduce alignment! *)
  11170. Boolean(moduleSection,FALSE);
  11171. Boolean(moduleSection,FALSE);
  11172. Info(moduleSection, "refcnt*: LONGINT");
  11173. Longint(moduleSection,0);
  11174. Info(moduleSection, "sb*: ADDRESS");
  11175. Address(moduleSection,0);
  11176. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  11177. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11178. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  11179. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  11180. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  11181. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  11182. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  11183. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  11184. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  11185. Symbol(moduleSection,importSection,emptyArraySectionOffset,0);
  11186. Info(moduleSection, "procTable*: ProcTable");
  11187. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  11188. Info(moduleSection, "ptrTable*: PtrTable");
  11189. IF ~implementationVisitor.backend.cooperative THEN
  11190. Symbol(moduleSection,ptrTableSection,ptrTableSectionOffset,0);
  11191. ELSE
  11192. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11193. END;
  11194. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  11195. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11196. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11197. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11198. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  11199. Info(moduleSection, "export*: ExportDesc");
  11200. ExportDesc(moduleSection);
  11201. Info(moduleSection, "term*: TerminationHandler");
  11202. Address(moduleSection,0);
  11203. Info(moduleSection, "exTable*: ExceptionTable");
  11204. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  11205. Info(moduleSection, "noProcs*: LONGINT");
  11206. Longint(moduleSection,numberProcs);
  11207. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END;
  11208. Info(moduleSection, "firstProc*: ADDRESS");
  11209. Address(moduleSection,0);
  11210. Info(moduleSection, "maxPtrs*: LONGINT");
  11211. Longint(moduleSection,maxPointers);
  11212. Info(moduleSection, "crc*: LONGINT");
  11213. Longint(moduleSection, 0); (*! must be implemented *)
  11214. Info(moduleSection, "body*: ADDRESS");
  11215. Symbol(moduleSection, bodyProc, 0,0);
  11216. IF implementationVisitor.backend.cooperative THEN
  11217. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  11218. Info(moduleSection, "monitor.owner");
  11219. Address(moduleSection,0);
  11220. Info(moduleSection, "monitor.nestingLevel");
  11221. Address(moduleSection,0);
  11222. Info(moduleSection, "monitor.blockedQueue");
  11223. Address(moduleSection,0); Address(moduleSection,0);
  11224. Info(moduleSection, "monitor.waitingQueue");
  11225. Address(moduleSection,0); Address(moduleSection,0);
  11226. Info(moduleSection, "monitor.waitingSentinel");
  11227. Address(moduleSection,0);
  11228. END;
  11229. END Module;
  11230. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  11231. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section;
  11232. BEGIN
  11233. Array(source,pc,"");
  11234. Info(source, "pointer offsets array data");
  11235. IF scope IS SyntaxTree.RecordScope THEN
  11236. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  11237. ELSIF scope IS SyntaxTree.CellScope THEN
  11238. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  11239. ELSIF scope IS SyntaxTree.ModuleScope THEN
  11240. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  11241. WHILE variable # NIL DO
  11242. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  11243. symbol := module.allSections.FindBySymbol(variable);
  11244. ASSERT(symbol # NIL);
  11245. Pointers(0,symbol, source,variable.type,numberPointers);
  11246. END;
  11247. variable := variable.nextVariable;
  11248. END;
  11249. END;
  11250. PatchArray(source,pc,numberPointers);
  11251. END PointerArray;
  11252. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  11253. VAR
  11254. name: Basic.SegmentedName;
  11255. section: IntermediateCode.Section;
  11256. BEGIN
  11257. ASSERT(implementationVisitor.newObjectFile);
  11258. Global.GetSymbolSegmentedName(symbol,name);
  11259. Basic.AppendToSegmentedName(name,suffix);
  11260. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11261. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  11262. Info(section, "HeapBlock");
  11263. Address(section,0); (* empty such that GC does not go on traversing *)
  11264. Info(section, suffix);
  11265. Address(section,0);
  11266. pc := section.pc;
  11267. RETURN section;
  11268. END SymbolSection;
  11269. PROCEDURE ReflectVariables(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11270. VAR type: SyntaxTree.Type; variable: SyntaxTree.Variable; pc: LONGINT; section: IntermediateCode.Section;
  11271. BEGIN
  11272. ASSERT(implementationVisitor.newObjectFile);
  11273. IF ~ReflectionSupport OR simple THEN variable := NIL
  11274. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11275. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11276. IF type IS SyntaxTree.PointerType THEN
  11277. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11278. END;
  11279. IF type IS SyntaxTree.RecordType THEN
  11280. variable := type(SyntaxTree.RecordType).recordScope.firstVariable
  11281. ELSIF type IS SyntaxTree.CellType THEN
  11282. variable := type(SyntaxTree.CellType).cellScope.firstVariable;
  11283. END;
  11284. ELSIF symbol IS SyntaxTree.Procedure THEN
  11285. variable := symbol(SyntaxTree.Procedure).procedureScope.firstVariable;
  11286. END;
  11287. Info(in, "variables");
  11288. IF variable # NIL THEN
  11289. section := SymbolSection(symbol, "@Variables",pc);
  11290. VariableArray(section, variable);
  11291. Symbol(in, section, pc, 0);
  11292. ELSE
  11293. Address(in, 0);
  11294. END;
  11295. END ReflectVariables;
  11296. PROCEDURE ReflectProcedures(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11297. VAR type: SyntaxTree.Type; procedure: SyntaxTree.Procedure; pc: LONGINT; section: IntermediateCode.Section;
  11298. BEGIN
  11299. ASSERT(implementationVisitor.newObjectFile);
  11300. IF ~ReflectionSupport OR simple THEN procedure := NIL
  11301. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11302. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11303. IF type IS SyntaxTree.PointerType THEN
  11304. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11305. END;
  11306. IF type IS SyntaxTree.RecordType THEN
  11307. procedure := type(SyntaxTree.RecordType).recordScope.firstProcedure
  11308. ELSIF type IS SyntaxTree.CellType THEN
  11309. procedure := type(SyntaxTree.CellType).cellScope.firstProcedure;
  11310. END;
  11311. ELSIF symbol IS SyntaxTree.Procedure THEN
  11312. procedure := symbol(SyntaxTree.Procedure).procedureScope.firstProcedure;
  11313. END;
  11314. Info(in, "procedures");
  11315. IF procedure # NIL THEN
  11316. section := SymbolSection(symbol, "@Procedures",pc);
  11317. ProcedureArray(section, procedure);
  11318. Symbol(in, section, pc, 0);
  11319. ELSE
  11320. Address(in, 0);
  11321. END;
  11322. END ReflectProcedures;
  11323. PROCEDURE VariableArray(source: IntermediateCode.Section; variable: SyntaxTree.Variable);
  11324. VAR pc, offset: LONGINT; tir: Sections.Section; size: LONGINT;
  11325. segmentedName: Basic.SegmentedName;
  11326. td: SyntaxTree.TypeDeclaration;
  11327. type: SyntaxTree.Type;
  11328. BEGIN
  11329. Array(source,pc,"Modules.FieldEntry");
  11330. Info(source, "FieldArray");
  11331. size :=0;
  11332. WHILE variable # NIL DO
  11333. Info(source,"name");
  11334. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, variable.name, moduleNamePool), 0); (* reference to dynamic name *)
  11335. type := variable.type.resolved;
  11336. Info(source,"offset");
  11337. Size(source, ToMemoryUnits(module.system,variable.offsetInBits));
  11338. Info(source,"type class");
  11339. IF type IS SyntaxTree.PointerType THEN
  11340. Size(source, 1);
  11341. ELSIF type IS SyntaxTree.RecordType THEN
  11342. Size(source, 2);
  11343. ELSIF type IS SyntaxTree.NumberType THEN
  11344. Size(source, 3);
  11345. ELSE
  11346. Size(source, 0);
  11347. END;
  11348. Info(source, "type desc");
  11349. IF type IS SyntaxTree.RecordType THEN
  11350. td := type(SyntaxTree.RecordType).typeDeclaration;
  11351. Global.GetSymbolSegmentedName(td,segmentedName);
  11352. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11353. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11354. ELSE
  11355. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11356. END;
  11357. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11358. Symbol(source, tir, 0, offset);
  11359. ELSE
  11360. Address(source, 0);
  11361. END;
  11362. Info(source,"flags");
  11363. Set(source, {});
  11364. variable := variable.nextVariable;
  11365. INC(size);
  11366. END;
  11367. PatchArray(source,pc,size);
  11368. END VariableArray;
  11369. PROCEDURE ProcedureArray(source: IntermediateCode.Section; procedure: SyntaxTree.Procedure);
  11370. VAR pc: LONGINT; size: LONGINT;
  11371. segmentedName: Basic.SegmentedName;
  11372. BEGIN
  11373. Array(source,pc,"Modules.ProcedureEntry");
  11374. Info(source, "ProcedureArray");
  11375. size :=0;
  11376. WHILE procedure # NIL DO
  11377. Info(source,"name");
  11378. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, procedure.name, moduleNamePool), 0); (* reference to dynamic name *)
  11379. implementationVisitor.GetCodeSectionNameForSymbol(procedure, segmentedName);
  11380. NamedSymbol(source, segmentedName, procedure, 0 , 0);
  11381. (* size *)
  11382. Size(source, 0);
  11383. (* parameters *)
  11384. Address(source, 0);
  11385. (* variables *)
  11386. ReflectVariables(source, procedure);
  11387. ReflectProcedures(source, procedure);
  11388. (* return type entry *)
  11389. Address(source, 0);
  11390. Address(source, 0);
  11391. procedure := procedure.nextProcedure;
  11392. INC(size);
  11393. END;
  11394. PatchArray(source,pc,size);
  11395. END ProcedureArray;
  11396. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  11397. VAR recordType: SyntaxTree.RecordType;
  11398. tir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  11399. section: Sections.Section; cellType: SyntaxTree.CellType;
  11400. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): Sections.Section;
  11401. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11402. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11403. sectionName: Basic.SectionName;
  11404. CONST MPO=-40000000H;
  11405. BEGIN
  11406. (*
  11407. TypeDesc* = POINTER TO RECORD
  11408. descSize: LONGINT;
  11409. sentinel: LONGINT; (* = MPO-4 *)
  11410. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11411. flags*: SET;
  11412. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11413. name*: Name;
  11414. END;
  11415. *)
  11416. (* source := module.sections.FindByName(...) *)
  11417. Global.GetSymbolSegmentedName(td,name);
  11418. Basic.AppendToSegmentedName(name,"@Info");
  11419. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11420. Info(source, "type info size"); Address(source, 3*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11421. Address(source,MPO-4);
  11422. Info(source, "type tag pointer");
  11423. Symbol( source, tag, offset, 0);
  11424. Info(source, "type flags");
  11425. flags := {};
  11426. IF isProtected THEN INCL(flags,31) END;
  11427. Set( source, flags);
  11428. Info(source, "pointer to module");
  11429. moduleSection := ModuleSection();
  11430. Symbol( source, moduleSection, moduleSection.pc,0);
  11431. Info(source, "type name");
  11432. i := 0;
  11433. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  11434. (*
  11435. Global.GetSymbolSegmentedName(td,name);
  11436. Basic.SegmentedNameToString(name, sectionName);
  11437. *)
  11438. Name(source,sectionName);
  11439. source.SetReferenced(FALSE);
  11440. Global.GetSymbolSegmentedName(td,name);
  11441. Basic.AppendToSegmentedName(name,"@Fields");
  11442. ReflectVariables(source, td);
  11443. ReflectProcedures(source, td);
  11444. (*
  11445. fieldSection := VariableArray(
  11446. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11447. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11448. Info(fieldSection, "HeapBlock");
  11449. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11450. Info(fieldSection, "TypeDescriptor");
  11451. Address(fieldSection,0);
  11452. Info(source, "FieldArray ref");
  11453. Symbol(source, fieldSection, fieldSection.pc, 0);
  11454. FieldArray(fieldSection);
  11455. Global.GetSymbolSegmentedName(td,name);
  11456. Basic.AppendToSegmentedName(name,"@Procedures");
  11457. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11458. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11459. Info(fieldSection, "HeapBlock");
  11460. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11461. Info(fieldSection, "TypeDescriptor");
  11462. Address(fieldSection,0);
  11463. Info(source, "Procedure Array ref");
  11464. Symbol(source, fieldSection, fieldSection.pc, 0);
  11465. ProcedureArray(fieldSection);
  11466. *)
  11467. RETURN source;
  11468. END NewTypeDescriptorInfo;
  11469. PROCEDURE NewTypeDescriptor;
  11470. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  11471. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  11472. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  11473. numberPointers: LONGINT; padding, i: LONGINT;
  11474. CONST MPO=-40000000H;
  11475. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  11476. VAR i: LONGINT;
  11477. PROCEDURE Td(record: SyntaxTree.RecordType);
  11478. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  11479. BEGIN
  11480. IF record # NIL THEN
  11481. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  11482. baseTD := record.typeDeclaration;
  11483. Global.GetSymbolSegmentedName(baseTD,name);
  11484. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11485. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11486. ELSE
  11487. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11488. END;
  11489. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  11490. Symbol(source, tir, 0, offset);
  11491. IF reverse THEN Td(record.GetBaseRecord()) END;
  11492. END;
  11493. END Td;
  11494. BEGIN
  11495. Info(source, "tag table");
  11496. baseRecord := recordType;
  11497. i := 0;
  11498. WHILE baseRecord # NIL DO
  11499. INC(i);
  11500. baseRecord := baseRecord.GetBaseRecord();
  11501. END;
  11502. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  11503. IF ~reverse THEN Td(recordType) END;
  11504. WHILE i < size DO
  11505. Address(source,0);
  11506. INC(i);
  11507. END;
  11508. IF reverse THEN Td(recordType) END;
  11509. END TdTable;
  11510. PROCEDURE MethodTable(reverse: BOOLEAN);
  11511. VAR i,methods: LONGINT;
  11512. BEGIN
  11513. Info(source, "method table");
  11514. IF recordType # NIL THEN
  11515. methods := recordType.recordScope.numberMethods;
  11516. IF reverse THEN
  11517. FOR i := methods-1 TO 0 BY -1 DO
  11518. procedure := recordType.recordScope.FindMethod(i);
  11519. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  11520. NamedSymbol(source, name,procedure, 0,0);
  11521. END;
  11522. ELSE
  11523. FOR i := 0 TO methods-1 DO
  11524. procedure := recordType.recordScope.FindMethod(i);
  11525. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  11526. NamedSymbol(source, name,procedure, 0,0);
  11527. END;
  11528. END;
  11529. END;
  11530. END MethodTable;
  11531. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  11532. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  11533. BEGIN
  11534. Info(source, "method table");
  11535. baseRecord := recordType;
  11536. WHILE baseRecord.baseType # NIL DO
  11537. baseRecord := baseRecord.GetBaseRecord ();
  11538. END;
  11539. GetRecordTypeName (baseRecord, name);
  11540. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  11541. IF name = stackFrame THEN
  11542. start := 0;
  11543. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  11544. baseRecord := recordType;
  11545. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  11546. baseRecord := baseRecord.GetBaseRecord ();
  11547. END;
  11548. IF baseRecord # NIL THEN
  11549. GetRecordTypeName (baseRecord, name);
  11550. IF pointer & ~baseRecord.isObject THEN
  11551. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11552. END;
  11553. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  11554. ELSIF recordType.isObject THEN
  11555. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  11556. ELSIF pointer THEN
  11557. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  11558. ELSE
  11559. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  11560. END;
  11561. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11562. Symbol(source, tir, 0, 0);
  11563. start := 0;
  11564. baseRecord := recordType;
  11565. WHILE (baseRecord # NIL) DO
  11566. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  11567. baseRecord := baseRecord.GetBaseRecord ();
  11568. END;
  11569. ELSE
  11570. (* explicit trace method: *)
  11571. procedure := recordType.recordScope.FindMethod(0);
  11572. IF ~procedure.isFinalizer THEN
  11573. Global.GetSymbolSegmentedName(procedure, name);
  11574. NamedSymbol(source, name,procedure, 0,0);
  11575. END;
  11576. start := 1;
  11577. END;
  11578. IF (name # stackFrame) & recordType.isObject THEN
  11579. baseRecord := recordType;
  11580. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  11581. baseRecord := baseRecord.GetBaseRecord ();
  11582. END;
  11583. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  11584. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  11585. ELSE
  11586. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  11587. END;
  11588. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11589. Symbol(source, tir, 0, 0);
  11590. END;
  11591. methods := recordType.recordScope.numberMethods;
  11592. FOR i := start TO methods-1 DO
  11593. procedure := recordType.recordScope.FindMethod(i);
  11594. IF ~procedure.isFinalizer THEN
  11595. Global.GetSymbolSegmentedName(procedure, name);
  11596. NamedSymbol(source, name,procedure, 0,0);
  11597. END;
  11598. END;
  11599. END CooperativeMethodTable;
  11600. BEGIN
  11601. Global.GetSymbolSegmentedName(td,name);
  11602. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  11603. source.SetExported(IsExported(td));
  11604. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  11605. IF implementationVisitor.backend.cooperative THEN
  11606. base := NIL;
  11607. baseRecord := recordType.GetBaseRecord();
  11608. IF baseRecord # NIL THEN
  11609. baseTD := baseRecord.typeDeclaration;
  11610. END;
  11611. IF ~recordType.isObject THEN
  11612. Info(source, "parent");
  11613. IF baseRecord # NIL THEN
  11614. Global.GetSymbolSegmentedName(baseTD,name);
  11615. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11616. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11617. ELSE
  11618. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11619. END;
  11620. Symbol(source, tir, 0, 0);
  11621. ELSE
  11622. Address(source,0);
  11623. END;
  11624. Info(source, "record size");
  11625. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11626. source.SetReferenced(FALSE);
  11627. CooperativeMethodTable(FALSE);
  11628. base := source;
  11629. Global.GetSymbolSegmentedName(td,name);
  11630. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11631. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11632. source.SetExported(IsExported(td));
  11633. source.SetReferenced(FALSE);
  11634. END;
  11635. Info(source, "parent");
  11636. IF baseRecord # NIL THEN
  11637. Global.GetSymbolSegmentedName(baseTD,name);
  11638. sym := baseTD;
  11639. IF ~recordType.isObject THEN
  11640. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11641. sym := NIL;
  11642. END;
  11643. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11644. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11645. ELSE
  11646. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11647. END;
  11648. Symbol(source, tir, 0, 0);
  11649. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  11650. Address(source,0);
  11651. ELSE
  11652. IF recordType.isObject THEN
  11653. Basic.ToSegmentedName ("BaseTypes.Object",name);
  11654. ELSE
  11655. Basic.ToSegmentedName ("BaseTypes.Record",name);
  11656. END;
  11657. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11658. Symbol(source, tir, 0, 0);
  11659. END;
  11660. Info(source, "base record descriptor");
  11661. Symbol(source, base, 0, 0);
  11662. CooperativeMethodTable(TRUE);
  11663. source.SetReferenced(FALSE);
  11664. IF recordType.hasPointers THEN
  11665. IF ~HasExplicitTraceMethod (recordType) THEN
  11666. implementationVisitor.CreateTraceMethod(recordType);
  11667. END;
  11668. implementationVisitor.CreateResetProcedure(recordType);
  11669. implementationVisitor.CreateAssignProcedure(recordType);
  11670. END;
  11671. ELSIF ~simple THEN
  11672. (*
  11673. MethodEnd = MPO
  11674. ---
  11675. methods (# methods)
  11676. ---
  11677. tags (16)
  11678. ---
  11679. TypeDesc = TypeInfoAdr
  11680. ---
  11681. td adr ---> rec size
  11682. ----
  11683. pointer offsets
  11684. ----
  11685. (padding)
  11686. -----
  11687. empty [2 addresses aligned]
  11688. empty
  11689. empty
  11690. numPtrs
  11691. ---
  11692. pointer offsets
  11693. ---
  11694. *)
  11695. Info(source, "MethodEnd = MPO");
  11696. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  11697. source(IntermediateCode.Section).Emit(Data(-1,op));
  11698. MethodTable(TRUE);
  11699. TdTable(TypeTags, TRUE);
  11700. Info(source, "type descriptor info pointer");
  11701. Symbol(source, NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected()),0,0);
  11702. IF (cellType # NIL) THEN
  11703. IF cellType.sizeInBits < 0 THEN
  11704. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  11705. END;
  11706. Info(source, "cell size");
  11707. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  11708. ELSE
  11709. Info(source, "record size");
  11710. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11711. END;
  11712. Info(source, "pointer offsets pointer");
  11713. padding := 1- source.pc MOD 2;
  11714. Symbol(source, source, source.pc+1+padding,0);
  11715. IF padding >0 THEN
  11716. Info(source, "padding");
  11717. FOR i := 1 TO padding DO Address(source,0) END;
  11718. END;
  11719. IF cellType # NIL THEN
  11720. PointerArray(source, cellType.cellScope, numberPointers);
  11721. ELSE
  11722. PointerArray(source, recordType.recordScope, numberPointers);
  11723. END;
  11724. ELSE
  11725. (*
  11726. simple:
  11727. td adr --> size
  11728. tag(1)
  11729. tag(2)
  11730. tag(3)
  11731. methods ->
  11732. *)
  11733. Info(source, "record size");
  11734. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11735. TdTable(TypeTags, FALSE);
  11736. MethodTable(FALSE);
  11737. source.SetReferenced(FALSE);
  11738. END;
  11739. END NewTypeDescriptor;
  11740. BEGIN
  11741. x := x.resolved;
  11742. IF (x IS SyntaxTree.PointerType) THEN
  11743. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  11744. END;
  11745. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  11746. recordType := x(SyntaxTree.RecordType);
  11747. td := x.typeDeclaration;
  11748. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  11749. ASSERT(td # NIL);
  11750. section := module.allSections.FindBySymbol(td); (* TODO *)
  11751. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11752. IF implementationVisitor.newObjectFile THEN
  11753. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11754. NewTypeDescriptor
  11755. END;
  11756. ELSE
  11757. (* data section in intermediate code *)
  11758. Global.GetSymbolSegmentedName(td,name);
  11759. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  11760. Basic.SuffixSegmentedName (name, module.module.name);
  11761. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  11762. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  11763. tir.Emit(Data(-1,op));
  11764. END;
  11765. END;
  11766. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  11767. cellType := x(SyntaxTree.CellType);
  11768. td := x.typeDeclaration;
  11769. section := module.allSections.FindBySymbol(td); (* TODO *)
  11770. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11771. IF implementationVisitor.newObjectFile THEN
  11772. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11773. NewTypeDescriptor
  11774. END;
  11775. END;
  11776. END;
  11777. END
  11778. END CheckTypeDeclaration
  11779. END MetaDataGenerator;
  11780. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  11781. VAR
  11782. trace-: BOOLEAN;
  11783. traceString-: SyntaxTree.IdentifierString;
  11784. traceModuleName-: SyntaxTree.IdentifierString;
  11785. newObjectFile-: BOOLEAN;
  11786. profile-: BOOLEAN;
  11787. noRuntimeChecks: BOOLEAN;
  11788. simpleMetaData-: BOOLEAN;
  11789. noAsserts: BOOLEAN;
  11790. optimize-: BOOLEAN;
  11791. cooperative-: BOOLEAN;
  11792. preregisterStatic-: BOOLEAN;
  11793. dump-: Basic.Writer;
  11794. cellsAreObjects: BOOLEAN;
  11795. PROCEDURE &InitIntermediateBackend*;
  11796. BEGIN
  11797. simpleMetaData := FALSE;
  11798. newObjectFile := FALSE;
  11799. InitBackend;
  11800. SetRuntimeModuleName(DefaultRuntimeModuleName);
  11801. SetTraceModuleName(DefaultTraceModuleName);
  11802. END InitIntermediateBackend;
  11803. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  11804. VAR
  11805. declarationVisitor: DeclarationVisitor;
  11806. implementationVisitor: ImplementationVisitor;
  11807. module: Sections.Module;
  11808. name, platformName: SyntaxTree.IdentifierString;
  11809. meta: MetaDataGenerator;
  11810. BEGIN
  11811. ResetError;
  11812. Global.GetSymbolName(x,name);
  11813. NEW(module,x,system); (* backend structures *)
  11814. Global.GetModuleName(x, name);
  11815. module.SetModuleName(name);
  11816. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  11817. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  11818. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  11819. declarationVisitor.Module(x,module);
  11820. IF newObjectFile & ~meta.simple THEN
  11821. meta.Module(implementationVisitor.moduleBodySection);
  11822. END;
  11823. GetDescription(platformName);
  11824. module.SetPlatformName(platformName);
  11825. RETURN module
  11826. END GenerateIntermediate;
  11827. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  11828. BEGIN RETURN TRUE
  11829. END SupportedImmediate;
  11830. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  11831. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  11832. END ProcessSyntaxTreeModule;
  11833. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  11834. VAR
  11835. result: Sections.Module;
  11836. traceName: Basic.MessageString;
  11837. BEGIN
  11838. ASSERT(intermediateCodeModule IS Sections.Module);
  11839. result := intermediateCodeModule(Sections.Module);
  11840. IF trace THEN
  11841. traceName := "intermediate code trace: ";
  11842. Strings.Append(traceName,traceString);
  11843. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  11844. IF (traceString="") OR (traceString="*") THEN
  11845. result.Dump(dump);
  11846. dump.Update
  11847. ELSE
  11848. Sections.DumpFiltered(dump, result, traceString);
  11849. END
  11850. END;
  11851. RETURN result
  11852. END ProcessIntermediateCodeModule;
  11853. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  11854. BEGIN instructionSet := "Intermediate";
  11855. END GetDescription;
  11856. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  11857. BEGIN
  11858. SELF.newObjectFile := newObjectFile;
  11859. SELF.simpleMetaData := simpleMetaData;
  11860. END SetNewObjectFile;
  11861. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  11862. BEGIN COPY(name, traceModuleName)
  11863. END SetTraceModuleName;
  11864. PROCEDURE DefineOptions(options: Options.Options);
  11865. BEGIN
  11866. DefineOptions^(options);
  11867. options.Add(0X,"trace",Options.String);
  11868. options.Add(0X,"runtime",Options.String);
  11869. options.Add(0X,"newObjectFile",Options.Flag);
  11870. options.Add(0X,"traceModule",Options.String);
  11871. options.Add(0X,"profile",Options.Flag);
  11872. options.Add(0X,"noRuntimeChecks",Options.Flag);
  11873. options.Add(0X,"noAsserts",Options.Flag);
  11874. options.Add(0X,"metaData",Options.String);
  11875. options.Add('o',"optimize", Options.Flag);
  11876. options.Add(0X,"preregisterStatic", Options.Flag);
  11877. options.Add(0X,"cellsAreObjects", Options.Flag);
  11878. END DefineOptions;
  11879. PROCEDURE GetOptions(options: Options.Options);
  11880. VAR name,string: SyntaxTree.IdentifierString;
  11881. BEGIN
  11882. GetOptions^(options);
  11883. trace := options.GetString("trace",traceString);
  11884. profile := options.GetFlag("profile");
  11885. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  11886. noAsserts := options.GetFlag("noAsserts");
  11887. cooperative := options.GetFlag("cooperative");
  11888. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  11889. IF cooperative THEN
  11890. SetRuntimeModuleName("CPU") END
  11891. END;
  11892. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  11893. simpleMetaData := TRUE
  11894. END;
  11895. IF options.GetString("metaData",string) THEN
  11896. IF string = "simple" THEN simpleMetaData := TRUE
  11897. ELSIF string ="full" THEN simpleMetaData := FALSE
  11898. END;
  11899. END;
  11900. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  11901. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  11902. optimize := options.GetFlag("optimize");
  11903. preregisterStatic := options.GetFlag("preregisterStatic");
  11904. cellsAreObjects := options.GetFlag("cellsAreObjects");
  11905. END GetOptions;
  11906. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  11907. BEGIN RETURN SymbolFileFormat.Get()
  11908. END DefaultSymbolFileFormat;
  11909. END IntermediateBackend;
  11910. (* ----------------------------------- register allocation ------------------------------------- *)
  11911. (* register mapping scheme
  11912. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  11913. spill offset
  11914. part(n) --> ticket <--> physical register
  11915. spill offset
  11916. *)
  11917. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  11918. emptyOperand: IntermediateCode.Operand;
  11919. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  11920. statCoopResetVariables: LONGINT;
  11921. statCoopModifyAssignments: LONGINT;
  11922. modifyAssignmentsPC : LONGINT;
  11923. statCoopNilCheck: LONGINT;
  11924. statCoopSwitch: LONGINT;
  11925. statCoopAssignProcedure: LONGINT;
  11926. statCoopTraceMethod: LONGINT;
  11927. statCoopResetProcedure: LONGINT;
  11928. statCoopTraceModule: LONGINT;
  11929. PROCEDURE ResetStatistics*;
  11930. BEGIN
  11931. statCoopResetVariables := 0;
  11932. statCoopModifyAssignments := 0;
  11933. statCoopNilCheck:= 0;
  11934. statCoopSwitch:= 0;
  11935. statCoopAssignProcedure:= 0;
  11936. statCoopTraceMethod:= 0;
  11937. statCoopResetProcedure:= 0;
  11938. statCoopTraceModule:= 0;
  11939. END ResetStatistics;
  11940. PROCEDURE Statistics*;
  11941. BEGIN
  11942. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  11943. TRACE(statCoopNilCheck, statCoopSwitch);
  11944. TRACE(statCoopAssignProcedure,
  11945. statCoopTraceMethod,
  11946. statCoopResetProcedure,
  11947. statCoopTraceModule)
  11948. END Statistics;
  11949. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  11950. VAR h: LONGINT;
  11951. BEGIN
  11952. WHILE b # 0 DO
  11953. h := a MOD b;
  11954. a := b;
  11955. b := h;
  11956. END;
  11957. RETURN a
  11958. END GCD;
  11959. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  11960. BEGIN
  11961. RETURN a*b DIV GCD(a,b)
  11962. END SCM;
  11963. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  11964. BEGIN
  11965. (*TRACE(a,b);*)
  11966. IF a = 0 THEN RETURN b
  11967. ELSIF b = 0 THEN RETURN a
  11968. ELSE RETURN SCM(a,b)
  11969. END;
  11970. END CommonAlignment;
  11971. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  11972. BEGIN
  11973. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  11974. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11975. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  11976. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  11977. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  11978. END
  11979. END PassBySingleReference;
  11980. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  11981. BEGIN
  11982. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  11983. END PassInRegister;
  11984. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  11985. VAR new: RegisterEntry;
  11986. BEGIN
  11987. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  11988. IF queue = NIL THEN
  11989. queue := new
  11990. ELSE
  11991. new.next := queue;
  11992. IF queue#NIL THEN queue.prev := new END;
  11993. queue := new
  11994. END;
  11995. END AddRegisterEntry;
  11996. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  11997. VAR this: RegisterEntry;
  11998. BEGIN
  11999. this := queue;
  12000. WHILE (this # NIL) & (this.register # register) DO
  12001. this := this.next;
  12002. END;
  12003. IF this = NIL THEN
  12004. RETURN FALSE
  12005. END;
  12006. ASSERT(this # NIL);
  12007. IF this = queue THEN queue := queue.next END;
  12008. IF this.prev # NIL THEN this.prev.next := this.next END;
  12009. IF this.next # NIL THEN this.next.prev := this.prev END;
  12010. RETURN TRUE
  12011. END RemoveRegisterEntry;
  12012. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12013. BEGIN ASSERT(cond);
  12014. END Assert;
  12015. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12016. BEGIN
  12017. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12018. END ReusableRegister;
  12019. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12020. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12021. BEGIN
  12022. procedure := moduleScope.bodyProcedure;
  12023. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12024. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12025. procedure := SyntaxTree.NewProcedure(-1,Global.ModuleBodyName, procedureScope);
  12026. procedure.SetScope(moduleScope);
  12027. procedure.SetType(SyntaxTree.NewProcedureType(-1,moduleScope));
  12028. procedure.SetAccess(SyntaxTree.Hidden);
  12029. moduleScope.SetBodyProcedure(procedure);
  12030. moduleScope.AddProcedure(procedure);
  12031. procedureScope.SetBody(SyntaxTree.NewBody(-1,procedureScope)); (* empty body *)
  12032. END;
  12033. END EnsureBodyProcedure;
  12034. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12035. VAR import: SyntaxTree.Import;
  12036. selfName: SyntaxTree.IdentifierString;
  12037. module: SyntaxTree.Module;
  12038. BEGIN
  12039. scope.ownerModule.GetName(selfName);
  12040. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12041. module := scope.ownerModule
  12042. ELSE
  12043. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12044. IF import = NIL THEN
  12045. RETURN NIL
  12046. ELSIF import.module = NIL THEN
  12047. RETURN NIL
  12048. ELSE module := import.module
  12049. END;
  12050. END;
  12051. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12052. END GetSymbol;
  12053. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12054. BEGIN
  12055. op.mode := mode;
  12056. IntermediateCode.InitOperand(op.op);
  12057. IntermediateCode.InitOperand(op.tag);
  12058. IntermediateCode.InitOperand(op.extra);
  12059. op.dimOffset := 0;
  12060. END InitOperand;
  12061. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12062. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12063. BEGIN RETURN IntermediateCode.GetType(system, type)
  12064. END GetType;
  12065. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12066. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12067. BEGIN
  12068. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12069. (*
  12070. UniqueId(name,module,name,adr);
  12071. *)
  12072. constant := SyntaxTree.NewConstant(-1,SyntaxTree.NewIdentifier(name));
  12073. constant.SetValue(value);
  12074. constant.SetAccess(SyntaxTree.Hidden);
  12075. module.moduleScope.AddConstant(constant);
  12076. constant.SetScope(module.moduleScope);
  12077. RETURN constant
  12078. END BuildConstant;
  12079. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12080. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12081. BEGIN
  12082. variable := scope.firstVariable;
  12083. WHILE variable # NIL DO
  12084. IF variable.NeedsTrace() THEN
  12085. RETURN TRUE;
  12086. END;
  12087. variable := variable.nextVariable;
  12088. END;
  12089. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12090. WHILE parameter # NIL DO
  12091. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12092. RETURN TRUE;
  12093. END;
  12094. parameter := parameter.nextParameter;
  12095. END;
  12096. RETURN FALSE;
  12097. END HasPointers;
  12098. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12099. BEGIN RETURN (parameter.kind = SyntaxTree.VarParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ((parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType));
  12100. END IsVariableParameter;
  12101. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12102. VAR parameter: SyntaxTree.Parameter;
  12103. BEGIN
  12104. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12105. WHILE parameter # NIL DO
  12106. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12107. IF parameter.movable THEN RETURN TRUE END;
  12108. parameter := parameter.nextParameter;
  12109. END;
  12110. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12111. END HasVariableParameters;
  12112. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12113. BEGIN
  12114. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12115. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12116. END HasExplicitTraceMethod;
  12117. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12118. BEGIN
  12119. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12120. IF (expression IS SyntaxTree.IntegerValue) THEN
  12121. val := expression(SyntaxTree.IntegerValue).value;
  12122. RETURN TRUE
  12123. ELSE
  12124. RETURN FALSE
  12125. END;
  12126. END IsIntegerConstant;
  12127. PROCEDURE PowerOf2(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12128. BEGIN
  12129. IF val <= 0 THEN RETURN FALSE END;
  12130. exp := 0;
  12131. WHILE ~ODD(val) DO
  12132. val := val DIV 2;
  12133. INC(exp)
  12134. END;
  12135. RETURN val = 1
  12136. END PowerOf2;
  12137. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12138. VAR procedure: SyntaxTree.Procedure;
  12139. BEGIN
  12140. procedure := record.recordScope.constructor;
  12141. IF procedure = NIL THEN
  12142. record := record.GetBaseRecord();
  12143. IF record # NIL THEN
  12144. procedure := GetConstructor(record)
  12145. END;
  12146. END;
  12147. RETURN procedure;
  12148. END GetConstructor;
  12149. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12150. BEGIN
  12151. value := SHORT(op.intValue);
  12152. RETURN op.mode = IntermediateCode.ModeImmediate;
  12153. END IsIntegerImmediate;
  12154. (** whether a type strictily is a pointer to record or object type
  12155. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12156. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12157. BEGIN
  12158. IF type = NIL THEN
  12159. RETURN FALSE
  12160. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  12161. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  12162. ELSE
  12163. RETURN FALSE
  12164. END
  12165. END IsStrictlyPointerToRecord;
  12166. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  12167. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  12168. END IsUnsafePointer;
  12169. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  12170. BEGIN type := type.resolved;
  12171. IF type IS SyntaxTree.PointerType THEN
  12172. type := type(SyntaxTree.PointerType).pointerBase;
  12173. type := type.resolved;
  12174. IF type IS SyntaxTree.RecordType THEN
  12175. recordType := type(SyntaxTree.RecordType);
  12176. RETURN TRUE
  12177. ELSE
  12178. RETURN FALSE
  12179. END
  12180. ELSIF type IS SyntaxTree.RecordType THEN
  12181. recordType := type(SyntaxTree.RecordType);
  12182. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  12183. ELSIF type IS SyntaxTree.ObjectType THEN
  12184. RETURN TRUE
  12185. ELSIF type IS SyntaxTree.AnyType THEN
  12186. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  12187. ELSE
  12188. RETURN FALSE
  12189. END;
  12190. END IsPointerToRecord;
  12191. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  12192. BEGIN
  12193. type := type.resolved;
  12194. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  12195. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  12196. END IsArrayOfSystemByte;
  12197. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  12198. BEGIN
  12199. IF type = NIL THEN RETURN FALSE END;
  12200. type := type.resolved;
  12201. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  12202. END IsOpenArray;
  12203. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  12204. BEGIN
  12205. IF type = NIL THEN RETURN FALSE END;
  12206. type := type.resolved;
  12207. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  12208. END IsSemiDynamicArray;
  12209. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  12210. BEGIN
  12211. IF type = NIL THEN RETURN FALSE END;
  12212. type := type.resolved;
  12213. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  12214. END IsStaticArray;
  12215. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12216. VAR size: LONGINT;
  12217. BEGIN
  12218. size := 1;
  12219. WHILE (IsStaticArray(type)) DO
  12220. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  12221. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12222. END;
  12223. RETURN size;
  12224. END StaticArrayNumElements;
  12225. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12226. BEGIN
  12227. WHILE (IsStaticArray(type)) DO
  12228. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12229. END;
  12230. RETURN type;
  12231. END StaticArrayBaseType;
  12232. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12233. BEGIN
  12234. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  12235. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12236. END;
  12237. RETURN type;
  12238. END ArrayBaseType;
  12239. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  12240. BEGIN
  12241. IF type = NIL THEN RETURN FALSE END;
  12242. type := type.resolved;
  12243. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  12244. END IsDelegate;
  12245. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  12246. VAR i: LONGINT;
  12247. BEGIN
  12248. i := 0; type := type.resolved;
  12249. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12250. INC(i);
  12251. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  12252. END;
  12253. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12254. INC(i);
  12255. type := type(SyntaxTree.MathArrayType).arrayBase;
  12256. IF type # NIL THEN type := type.resolved END;
  12257. END;
  12258. RETURN i
  12259. END DynamicDim;
  12260. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  12261. BEGIN
  12262. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12263. type := type(SyntaxTree.ArrayType).arrayBase;
  12264. END;
  12265. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12266. type := type(SyntaxTree.MathArrayType).arrayBase;
  12267. END;
  12268. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  12269. END StaticSize;
  12270. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  12271. BEGIN
  12272. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  12273. END IsImmediate;
  12274. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  12275. BEGIN
  12276. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  12277. END IsAddress;
  12278. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  12279. BEGIN
  12280. RETURN (x.mode = IntermediateCode.ModeRegister);
  12281. END IsRegister;
  12282. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  12283. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  12284. BEGIN
  12285. typeDeclaration := recordType.typeDeclaration;
  12286. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12287. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12288. END GetRecordTypeName;
  12289. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  12290. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  12291. BEGIN
  12292. parSize := 0;
  12293. IF StructuredReturnType(procedureType) THEN
  12294. parameter := procedureType.returnParameter;
  12295. INC(parSize,system.SizeOfParameter(parameter));
  12296. parSize := parSize + (-parSize) MOD system.addressSize;
  12297. END;
  12298. parameter :=procedureType.lastParameter;
  12299. WHILE (parameter # NIL) DO
  12300. INC(parSize,system.SizeOfParameter(parameter));
  12301. parSize := parSize + (-parSize) MOD system.addressSize;
  12302. parameter := parameter.prevParameter;
  12303. END;
  12304. IF procedureType.isDelegate THEN INC(parSize,system.addressSize) END; (* method => self pointer *)
  12305. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  12306. RETURN ToMemoryUnits(system,parSize)
  12307. END ParametersSize;
  12308. PROCEDURE ReturnedAsParameter(type: SyntaxTree.Type): BOOLEAN;
  12309. BEGIN
  12310. IF type = NIL THEN RETURN FALSE
  12311. ELSE
  12312. type := type.resolved;
  12313. RETURN (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR (type IS SyntaxTree.ProcedureType) OR SemanticChecker.IsPointerType(type)
  12314. OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.MathArrayType);
  12315. END
  12316. END ReturnedAsParameter;
  12317. PROCEDURE StructuredReturnType(procedureType: SyntaxTree.ProcedureType): BOOLEAN;
  12318. BEGIN
  12319. RETURN (procedureType # NIL) & (procedureType.callingConvention=SyntaxTree.OberonCallingConvention) & ReturnedAsParameter(procedureType.returnType);
  12320. END StructuredReturnType;
  12321. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  12322. BEGIN
  12323. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  12324. END IsNested;
  12325. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  12326. BEGIN
  12327. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  12328. scope := scope.outerScope;
  12329. END;
  12330. RETURN scope # NIL;
  12331. END InCellScope;
  12332. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  12333. BEGIN
  12334. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  12335. RETURN 0
  12336. ELSE
  12337. *)
  12338. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  12339. (*END;*)
  12340. END ProcedureParametersSize;
  12341. PROCEDURE ToMemoryUnits*(system: Global.System; size: LONGINT): LONGINT;
  12342. VAR dataUnit: LONGINT;
  12343. BEGIN dataUnit := system.dataUnit;
  12344. ASSERT(size MOD system.dataUnit = 0);
  12345. RETURN size DIV system.dataUnit
  12346. END ToMemoryUnits;
  12347. PROCEDURE Get*(): Backend.Backend;
  12348. VAR backend: IntermediateBackend;
  12349. BEGIN NEW(backend); RETURN backend
  12350. END Get;
  12351. PROCEDURE Nop(position: LONGINT):IntermediateCode.Instruction;
  12352. VAR instruction: IntermediateCode.Instruction;
  12353. BEGIN
  12354. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  12355. RETURN instruction
  12356. END Nop;
  12357. PROCEDURE Mov(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12358. VAR instruction: IntermediateCode.Instruction;
  12359. BEGIN
  12360. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  12361. RETURN instruction
  12362. END Mov;
  12363. (* like Mov but ensures that no new register will be allocated for dest *)
  12364. PROCEDURE MovReplace(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12365. VAR instruction: IntermediateCode.Instruction;
  12366. BEGIN
  12367. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  12368. RETURN instruction
  12369. END MovReplace;
  12370. PROCEDURE Conv(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12371. VAR instruction: IntermediateCode.Instruction;
  12372. BEGIN
  12373. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  12374. RETURN instruction
  12375. END Conv;
  12376. PROCEDURE SysvABI( cc: LONGINT ): BOOLEAN;
  12377. BEGIN
  12378. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention})
  12379. END SysvABI;
  12380. PROCEDURE SysvABIorWINAPI( cc: LONGINT ): BOOLEAN;
  12381. BEGIN
  12382. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention, SyntaxTree.WinAPICallingConvention})
  12383. END SysvABIorWINAPI;
  12384. PROCEDURE Call*(position: LONGINT;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  12385. VAR instruction: IntermediateCode.Instruction;
  12386. BEGIN
  12387. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  12388. RETURN instruction
  12389. END Call;
  12390. PROCEDURE Exit(position: LONGINT;pcOffset: LONGINT; callingConvention: LONGINT): IntermediateCode.Instruction;
  12391. VAR op1, op2: IntermediateCode.Operand;
  12392. VAR instruction: IntermediateCode.Instruction;
  12393. BEGIN
  12394. IntermediateCode.InitNumber(op1,pcOffset);
  12395. IntermediateCode.InitNumber(op2,callingConvention);
  12396. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,emptyOperand);
  12397. RETURN instruction
  12398. END Exit;
  12399. PROCEDURE Return(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12400. VAR instruction: IntermediateCode.Instruction;
  12401. BEGIN
  12402. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  12403. RETURN instruction
  12404. END Return;
  12405. PROCEDURE Result*(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12406. VAR instruction: IntermediateCode.Instruction;
  12407. BEGIN
  12408. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  12409. RETURN instruction
  12410. END Result;
  12411. PROCEDURE Trap(position: LONGINT;nr: LONGINT): IntermediateCode.Instruction;
  12412. VAR op1: IntermediateCode.Operand;
  12413. VAR instruction: IntermediateCode.Instruction;
  12414. BEGIN
  12415. IntermediateCode.InitNumber(op1,nr);
  12416. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  12417. RETURN instruction
  12418. END Trap;
  12419. PROCEDURE Br(position: LONGINT;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  12420. VAR instruction: IntermediateCode.Instruction;
  12421. BEGIN
  12422. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  12423. RETURN instruction
  12424. END Br;
  12425. PROCEDURE Breq(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12426. VAR instruction: IntermediateCode.Instruction;
  12427. BEGIN
  12428. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  12429. RETURN instruction
  12430. END Breq;
  12431. PROCEDURE Brne(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12432. VAR instruction: IntermediateCode.Instruction;
  12433. BEGIN
  12434. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  12435. RETURN instruction
  12436. END Brne;
  12437. PROCEDURE Brge(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12438. VAR instruction: IntermediateCode.Instruction;
  12439. BEGIN
  12440. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  12441. RETURN instruction
  12442. END Brge;
  12443. PROCEDURE Brlt(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12444. VAR instruction: IntermediateCode.Instruction;
  12445. BEGIN
  12446. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  12447. RETURN instruction
  12448. END Brlt;
  12449. PROCEDURE Pop*(position: LONGINT;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  12450. VAR instruction: IntermediateCode.Instruction;
  12451. BEGIN
  12452. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  12453. RETURN instruction
  12454. END Pop;
  12455. PROCEDURE Push*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12456. VAR instruction: IntermediateCode.Instruction;
  12457. BEGIN
  12458. ASSERT(op.mode # IntermediateCode.Undefined);
  12459. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  12460. RETURN instruction
  12461. END Push;
  12462. PROCEDURE Neg(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12463. VAR instruction: IntermediateCode.Instruction;
  12464. BEGIN
  12465. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  12466. RETURN instruction
  12467. END Neg;
  12468. PROCEDURE Not(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12469. VAR instruction: IntermediateCode.Instruction;
  12470. BEGIN
  12471. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  12472. RETURN instruction
  12473. END Not;
  12474. PROCEDURE Abs(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12475. VAR instruction: IntermediateCode.Instruction;
  12476. BEGIN
  12477. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  12478. RETURN instruction
  12479. END Abs;
  12480. PROCEDURE Mul(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12481. VAR instruction: IntermediateCode.Instruction;
  12482. BEGIN
  12483. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  12484. RETURN instruction
  12485. END Mul;
  12486. PROCEDURE Div(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12487. VAR instruction: IntermediateCode.Instruction;
  12488. BEGIN
  12489. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  12490. RETURN instruction
  12491. END Div;
  12492. PROCEDURE Mod(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12493. VAR instruction: IntermediateCode.Instruction;
  12494. BEGIN
  12495. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  12496. RETURN instruction
  12497. END Mod;
  12498. PROCEDURE Sub(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12499. VAR instruction: IntermediateCode.Instruction;
  12500. BEGIN
  12501. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  12502. RETURN instruction
  12503. END Sub;
  12504. PROCEDURE Add(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12505. VAR instruction: IntermediateCode.Instruction;
  12506. BEGIN
  12507. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  12508. RETURN instruction
  12509. END Add;
  12510. PROCEDURE And(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12511. VAR instruction: IntermediateCode.Instruction;
  12512. BEGIN
  12513. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  12514. RETURN instruction
  12515. END And;
  12516. PROCEDURE Or(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12517. VAR instruction: IntermediateCode.Instruction;
  12518. BEGIN
  12519. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  12520. RETURN instruction
  12521. END Or;
  12522. PROCEDURE Xor(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12523. VAR instruction: IntermediateCode.Instruction;
  12524. BEGIN
  12525. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  12526. RETURN instruction
  12527. END Xor;
  12528. PROCEDURE Shl(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12529. VAR instruction: IntermediateCode.Instruction;
  12530. BEGIN
  12531. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  12532. RETURN instruction
  12533. END Shl;
  12534. PROCEDURE Shr(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12535. VAR instruction: IntermediateCode.Instruction;
  12536. BEGIN
  12537. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  12538. RETURN instruction
  12539. END Shr;
  12540. PROCEDURE Rol(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12541. VAR instruction: IntermediateCode.Instruction;
  12542. BEGIN
  12543. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  12544. RETURN instruction
  12545. END Rol;
  12546. PROCEDURE Ror(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12547. VAR instruction: IntermediateCode.Instruction;
  12548. BEGIN
  12549. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  12550. RETURN instruction
  12551. END Ror;
  12552. PROCEDURE Cas(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12553. VAR instruction: IntermediateCode.Instruction;
  12554. BEGIN
  12555. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  12556. RETURN instruction
  12557. END Cas;
  12558. PROCEDURE Copy(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12559. VAR instruction: IntermediateCode.Instruction;
  12560. BEGIN
  12561. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  12562. RETURN instruction
  12563. END Copy;
  12564. PROCEDURE Fill(position: LONGINT;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  12565. VAR instruction: IntermediateCode.Instruction;
  12566. BEGIN
  12567. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  12568. RETURN instruction
  12569. END Fill;
  12570. PROCEDURE Asm(position: LONGINT;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  12571. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  12572. BEGIN
  12573. string := IntermediateCode.String(s);
  12574. IntermediateCode.SetIntValue(string,position); (* for error reporting *)
  12575. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  12576. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  12577. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  12578. RETURN instruction
  12579. END Asm;
  12580. PROCEDURE Data*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12581. VAR instruction: IntermediateCode.Instruction;
  12582. BEGIN
  12583. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  12584. RETURN instruction
  12585. END Data;
  12586. PROCEDURE SpecialInstruction(position: LONGINT;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  12587. VAR instruction: IntermediateCode.Instruction;
  12588. BEGIN
  12589. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  12590. IntermediateCode.SetSubType(instruction, subtype);
  12591. RETURN instruction
  12592. END SpecialInstruction;
  12593. PROCEDURE Reserve(position: LONGINT;units: LONGINT): IntermediateCode.Instruction;
  12594. VAR op1: IntermediateCode.Operand;
  12595. VAR instruction: IntermediateCode.Instruction;
  12596. BEGIN
  12597. (*! generate a warning if size exceeds a certain limit *)
  12598. (*
  12599. ASSERT(bytes < 1000000); (* sanity check *)
  12600. *)
  12601. ASSERT(0 <= units); (* sanity check *)
  12602. IntermediateCode.InitNumber(op1,units);
  12603. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  12604. RETURN instruction
  12605. END Reserve;
  12606. PROCEDURE LabelInstruction(position: LONGINT): IntermediateCode.Instruction;
  12607. VAR op1: IntermediateCode.Operand;
  12608. VAR instruction: IntermediateCode.Instruction;
  12609. BEGIN
  12610. IntermediateCode.InitNumber(op1,position);
  12611. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  12612. RETURN instruction
  12613. END LabelInstruction;
  12614. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  12615. VAR pc: LONGINT;
  12616. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  12617. BEGIN
  12618. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  12619. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  12620. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  12621. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  12622. IF instr.op1.type.form = IntermediateCode.Float THEN
  12623. RETURN instr.op1.floatValue = op.floatValue
  12624. ELSE
  12625. RETURN instr.op1.intValue = op.intValue
  12626. END;
  12627. END ProvidesValue;
  12628. BEGIN
  12629. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  12630. pc := 0;
  12631. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  12632. INC(pc);
  12633. END;
  12634. IF pc = data.pc THEN
  12635. data.Emit(Data(-1,vop));
  12636. END;
  12637. RETURN pc
  12638. END EnterImmediate;
  12639. PROCEDURE Init;
  12640. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  12641. BEGIN
  12642. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  12643. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  12644. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  12645. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  12646. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  12647. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  12648. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  12649. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  12650. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  12651. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  12652. IntermediateCode.InitOperand(emptyOperand);
  12653. FOR i := 0 TO NumberSystemCalls-1 DO
  12654. name := "@SystemCall";
  12655. Basic.AppendNumber(name,i);
  12656. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  12657. END;
  12658. END Init;
  12659. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  12660. BEGIN
  12661. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  12662. END IsExported;
  12663. BEGIN
  12664. Init;
  12665. END FoxIntermediateBackend.
  12666. Compiler.Compile FoxIntermediateBackend.Mod ~