FoxIntermediateBackend.Mod 541 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200620162026203620462056206620762086209621062116212621362146215621662176218621962206221622262236224622562266227622862296230623162326233623462356236623762386239624062416242624362446245624662476248624962506251625262536254625562566257625862596260626162626263626462656266626762686269627062716272627362746275627662776278627962806281628262836284628562866287628862896290629162926293629462956296629762986299630063016302630363046305630663076308630963106311631263136314631563166317631863196320632163226323632463256326632763286329633063316332633363346335633663376338633963406341634263436344634563466347634863496350635163526353635463556356635763586359636063616362636363646365636663676368636963706371637263736374637563766377637863796380638163826383638463856386638763886389639063916392639363946395639663976398639964006401640264036404640564066407640864096410641164126413641464156416641764186419642064216422642364246425642664276428642964306431643264336434643564366437643864396440644164426443644464456446644764486449645064516452645364546455645664576458645964606461646264636464646564666467646864696470647164726473647464756476647764786479648064816482648364846485648664876488648964906491649264936494649564966497649864996500650165026503650465056506650765086509651065116512651365146515651665176518651965206521652265236524652565266527652865296530653165326533653465356536653765386539654065416542654365446545654665476548654965506551655265536554655565566557655865596560656165626563656465656566656765686569657065716572657365746575657665776578657965806581658265836584658565866587658865896590659165926593659465956596659765986599660066016602660366046605660666076608660966106611661266136614661566166617661866196620662166226623662466256626662766286629663066316632663366346635663666376638663966406641664266436644664566466647664866496650665166526653665466556656665766586659666066616662666366646665666666676668666966706671667266736674667566766677667866796680668166826683668466856686668766886689669066916692669366946695669666976698669967006701670267036704670567066707670867096710671167126713671467156716671767186719672067216722672367246725672667276728672967306731673267336734673567366737673867396740674167426743674467456746674767486749675067516752675367546755675667576758675967606761676267636764676567666767676867696770677167726773677467756776677767786779678067816782678367846785678667876788678967906791679267936794679567966797679867996800680168026803680468056806680768086809681068116812681368146815681668176818681968206821682268236824682568266827682868296830683168326833683468356836683768386839684068416842684368446845684668476848684968506851685268536854685568566857685868596860686168626863686468656866686768686869687068716872687368746875687668776878687968806881688268836884688568866887688868896890689168926893689468956896689768986899690069016902690369046905690669076908690969106911691269136914691569166917691869196920692169226923692469256926692769286929693069316932693369346935693669376938693969406941694269436944694569466947694869496950695169526953695469556956695769586959696069616962696369646965696669676968696969706971697269736974697569766977697869796980698169826983698469856986698769886989699069916992699369946995699669976998699970007001700270037004700570067007700870097010701170127013701470157016701770187019702070217022702370247025702670277028702970307031703270337034703570367037703870397040704170427043704470457046704770487049705070517052705370547055705670577058705970607061706270637064706570667067706870697070707170727073707470757076707770787079708070817082708370847085708670877088708970907091709270937094709570967097709870997100710171027103710471057106710771087109711071117112711371147115711671177118711971207121712271237124712571267127712871297130713171327133713471357136713771387139714071417142714371447145714671477148714971507151715271537154715571567157715871597160716171627163716471657166716771687169717071717172717371747175717671777178717971807181718271837184718571867187718871897190719171927193719471957196719771987199720072017202720372047205720672077208720972107211721272137214721572167217721872197220722172227223722472257226722772287229723072317232723372347235723672377238723972407241724272437244724572467247724872497250725172527253725472557256725772587259726072617262726372647265726672677268726972707271727272737274727572767277727872797280728172827283728472857286728772887289729072917292729372947295729672977298729973007301730273037304730573067307730873097310731173127313731473157316731773187319732073217322732373247325732673277328732973307331733273337334733573367337733873397340734173427343734473457346734773487349735073517352735373547355735673577358735973607361736273637364736573667367736873697370737173727373737473757376737773787379738073817382738373847385738673877388738973907391739273937394739573967397739873997400740174027403740474057406740774087409741074117412741374147415741674177418741974207421742274237424742574267427742874297430743174327433743474357436743774387439744074417442744374447445744674477448744974507451745274537454745574567457745874597460746174627463746474657466746774687469747074717472747374747475747674777478747974807481748274837484748574867487748874897490749174927493749474957496749774987499750075017502750375047505750675077508750975107511751275137514751575167517751875197520752175227523752475257526752775287529753075317532753375347535753675377538753975407541754275437544754575467547754875497550755175527553755475557556755775587559756075617562756375647565756675677568756975707571757275737574757575767577757875797580758175827583758475857586758775887589759075917592759375947595759675977598759976007601760276037604760576067607760876097610761176127613761476157616761776187619762076217622762376247625762676277628762976307631763276337634763576367637763876397640764176427643764476457646764776487649765076517652765376547655765676577658765976607661766276637664766576667667766876697670767176727673767476757676767776787679768076817682768376847685768676877688768976907691769276937694769576967697769876997700770177027703770477057706770777087709771077117712771377147715771677177718771977207721772277237724772577267727772877297730773177327733773477357736773777387739774077417742774377447745774677477748774977507751775277537754775577567757775877597760776177627763776477657766776777687769777077717772777377747775777677777778777977807781778277837784778577867787778877897790779177927793779477957796779777987799780078017802780378047805780678077808780978107811781278137814781578167817781878197820782178227823782478257826782778287829783078317832783378347835783678377838783978407841784278437844784578467847784878497850785178527853785478557856785778587859786078617862786378647865786678677868786978707871787278737874787578767877787878797880788178827883788478857886788778887889789078917892789378947895789678977898789979007901790279037904790579067907790879097910791179127913791479157916791779187919792079217922792379247925792679277928792979307931793279337934793579367937793879397940794179427943794479457946794779487949795079517952795379547955795679577958795979607961796279637964796579667967796879697970797179727973797479757976797779787979798079817982798379847985798679877988798979907991799279937994799579967997799879998000800180028003800480058006800780088009801080118012801380148015801680178018801980208021802280238024802580268027802880298030803180328033803480358036803780388039804080418042804380448045804680478048804980508051805280538054805580568057805880598060806180628063806480658066806780688069807080718072807380748075807680778078807980808081808280838084808580868087808880898090809180928093809480958096809780988099810081018102810381048105810681078108810981108111811281138114811581168117811881198120812181228123812481258126812781288129813081318132813381348135813681378138813981408141814281438144814581468147814881498150815181528153815481558156815781588159816081618162816381648165816681678168816981708171817281738174817581768177817881798180818181828183818481858186818781888189819081918192819381948195819681978198819982008201820282038204820582068207820882098210821182128213821482158216821782188219822082218222822382248225822682278228822982308231823282338234823582368237823882398240824182428243824482458246824782488249825082518252825382548255825682578258825982608261826282638264826582668267826882698270827182728273827482758276827782788279828082818282828382848285828682878288828982908291829282938294829582968297829882998300830183028303830483058306830783088309831083118312831383148315831683178318831983208321832283238324832583268327832883298330833183328333833483358336833783388339834083418342834383448345834683478348834983508351835283538354835583568357835883598360836183628363836483658366836783688369837083718372837383748375837683778378837983808381838283838384838583868387838883898390839183928393839483958396839783988399840084018402840384048405840684078408840984108411841284138414841584168417841884198420842184228423842484258426842784288429843084318432843384348435843684378438843984408441844284438444844584468447844884498450845184528453845484558456845784588459846084618462846384648465846684678468846984708471847284738474847584768477847884798480848184828483848484858486848784888489849084918492849384948495849684978498849985008501850285038504850585068507850885098510851185128513851485158516851785188519852085218522852385248525852685278528852985308531853285338534853585368537853885398540854185428543854485458546854785488549855085518552855385548555855685578558855985608561856285638564856585668567856885698570857185728573857485758576857785788579858085818582858385848585858685878588858985908591859285938594859585968597859885998600860186028603860486058606860786088609861086118612861386148615861686178618861986208621862286238624862586268627862886298630863186328633863486358636863786388639864086418642864386448645864686478648864986508651865286538654865586568657865886598660866186628663866486658666866786688669867086718672867386748675867686778678867986808681868286838684868586868687868886898690869186928693869486958696869786988699870087018702870387048705870687078708870987108711871287138714871587168717871887198720872187228723872487258726872787288729873087318732873387348735873687378738873987408741874287438744874587468747874887498750875187528753875487558756875787588759876087618762876387648765876687678768876987708771877287738774877587768777877887798780878187828783878487858786878787888789879087918792879387948795879687978798879988008801880288038804880588068807880888098810881188128813881488158816881788188819882088218822882388248825882688278828882988308831883288338834883588368837883888398840884188428843884488458846884788488849885088518852885388548855885688578858885988608861886288638864886588668867886888698870887188728873887488758876887788788879888088818882888388848885888688878888888988908891889288938894889588968897889888998900890189028903890489058906890789088909891089118912891389148915891689178918891989208921892289238924892589268927892889298930893189328933893489358936893789388939894089418942894389448945894689478948894989508951895289538954895589568957895889598960896189628963896489658966896789688969897089718972897389748975897689778978897989808981898289838984898589868987898889898990899189928993899489958996899789988999900090019002900390049005900690079008900990109011901290139014901590169017901890199020902190229023902490259026902790289029903090319032903390349035903690379038903990409041904290439044904590469047904890499050905190529053905490559056905790589059906090619062906390649065906690679068906990709071907290739074907590769077907890799080908190829083908490859086908790889089909090919092909390949095909690979098909991009101910291039104910591069107910891099110911191129113911491159116911791189119912091219122912391249125912691279128912991309131913291339134913591369137913891399140914191429143914491459146914791489149915091519152915391549155915691579158915991609161916291639164916591669167916891699170917191729173917491759176917791789179918091819182918391849185918691879188918991909191919291939194919591969197919891999200920192029203920492059206920792089209921092119212921392149215921692179218921992209221922292239224922592269227922892299230923192329233923492359236923792389239924092419242924392449245924692479248924992509251925292539254925592569257925892599260926192629263926492659266926792689269927092719272927392749275927692779278927992809281928292839284928592869287928892899290929192929293929492959296929792989299930093019302930393049305930693079308930993109311931293139314931593169317931893199320932193229323932493259326932793289329933093319332933393349335933693379338933993409341934293439344934593469347934893499350935193529353935493559356935793589359936093619362936393649365936693679368936993709371937293739374937593769377937893799380938193829383938493859386938793889389939093919392939393949395939693979398939994009401940294039404940594069407940894099410941194129413941494159416941794189419942094219422942394249425942694279428942994309431943294339434943594369437943894399440944194429443944494459446944794489449945094519452945394549455945694579458945994609461946294639464946594669467946894699470947194729473947494759476947794789479948094819482948394849485948694879488948994909491949294939494949594969497949894999500950195029503950495059506950795089509951095119512951395149515951695179518951995209521952295239524952595269527952895299530953195329533953495359536953795389539954095419542954395449545954695479548954995509551955295539554955595569557955895599560956195629563956495659566956795689569957095719572957395749575957695779578957995809581958295839584958595869587958895899590959195929593959495959596959795989599960096019602960396049605960696079608960996109611961296139614961596169617961896199620962196229623962496259626962796289629963096319632963396349635963696379638963996409641964296439644964596469647964896499650965196529653965496559656965796589659966096619662966396649665966696679668966996709671967296739674967596769677967896799680968196829683968496859686968796889689969096919692969396949695969696979698969997009701970297039704970597069707970897099710971197129713971497159716971797189719972097219722972397249725972697279728972997309731973297339734973597369737973897399740974197429743974497459746974797489749975097519752975397549755975697579758975997609761976297639764976597669767976897699770977197729773977497759776977797789779978097819782978397849785978697879788978997909791979297939794979597969797979897999800980198029803980498059806980798089809981098119812981398149815981698179818981998209821982298239824982598269827982898299830983198329833983498359836983798389839984098419842984398449845984698479848984998509851985298539854985598569857985898599860986198629863986498659866986798689869987098719872987398749875987698779878987998809881988298839884988598869887988898899890989198929893989498959896989798989899990099019902990399049905990699079908990999109911991299139914991599169917991899199920992199229923992499259926992799289929993099319932993399349935993699379938993999409941994299439944994599469947994899499950995199529953995499559956995799589959996099619962996399649965996699679968996999709971997299739974997599769977997899799980998199829983998499859986998799889989999099919992999399949995999699979998999910000100011000210003100041000510006100071000810009100101001110012100131001410015100161001710018100191002010021100221002310024100251002610027100281002910030100311003210033100341003510036100371003810039100401004110042100431004410045100461004710048100491005010051100521005310054100551005610057100581005910060100611006210063100641006510066100671006810069100701007110072100731007410075100761007710078100791008010081100821008310084100851008610087100881008910090100911009210093100941009510096100971009810099101001010110102101031010410105101061010710108101091011010111101121011310114101151011610117101181011910120101211012210123101241012510126101271012810129101301013110132101331013410135101361013710138101391014010141101421014310144101451014610147101481014910150101511015210153101541015510156101571015810159101601016110162101631016410165101661016710168101691017010171101721017310174101751017610177101781017910180101811018210183101841018510186101871018810189101901019110192101931019410195101961019710198101991020010201102021020310204102051020610207102081020910210102111021210213102141021510216102171021810219102201022110222102231022410225102261022710228102291023010231102321023310234102351023610237102381023910240102411024210243102441024510246102471024810249102501025110252102531025410255102561025710258102591026010261102621026310264102651026610267102681026910270102711027210273102741027510276102771027810279102801028110282102831028410285102861028710288102891029010291102921029310294102951029610297102981029910300103011030210303103041030510306103071030810309103101031110312103131031410315103161031710318103191032010321103221032310324103251032610327103281032910330103311033210333103341033510336103371033810339103401034110342103431034410345103461034710348103491035010351103521035310354103551035610357103581035910360103611036210363103641036510366103671036810369103701037110372103731037410375103761037710378103791038010381103821038310384103851038610387103881038910390103911039210393103941039510396103971039810399104001040110402104031040410405104061040710408104091041010411104121041310414104151041610417104181041910420104211042210423104241042510426104271042810429104301043110432104331043410435104361043710438104391044010441104421044310444104451044610447104481044910450104511045210453104541045510456104571045810459104601046110462104631046410465104661046710468104691047010471104721047310474104751047610477104781047910480104811048210483104841048510486104871048810489104901049110492104931049410495104961049710498104991050010501105021050310504105051050610507105081050910510105111051210513105141051510516105171051810519105201052110522105231052410525105261052710528105291053010531105321053310534105351053610537105381053910540105411054210543105441054510546105471054810549105501055110552105531055410555105561055710558105591056010561105621056310564105651056610567105681056910570105711057210573105741057510576105771057810579105801058110582105831058410585105861058710588105891059010591105921059310594105951059610597105981059910600106011060210603106041060510606106071060810609106101061110612106131061410615106161061710618106191062010621106221062310624106251062610627106281062910630106311063210633106341063510636106371063810639106401064110642106431064410645106461064710648106491065010651106521065310654106551065610657106581065910660106611066210663106641066510666106671066810669106701067110672106731067410675106761067710678106791068010681106821068310684106851068610687106881068910690106911069210693106941069510696106971069810699107001070110702107031070410705107061070710708107091071010711107121071310714107151071610717107181071910720107211072210723107241072510726107271072810729107301073110732107331073410735107361073710738107391074010741107421074310744107451074610747107481074910750107511075210753107541075510756107571075810759107601076110762107631076410765107661076710768107691077010771107721077310774107751077610777107781077910780107811078210783107841078510786107871078810789107901079110792107931079410795107961079710798107991080010801108021080310804108051080610807108081080910810108111081210813108141081510816108171081810819108201082110822108231082410825108261082710828108291083010831108321083310834108351083610837108381083910840108411084210843108441084510846108471084810849108501085110852108531085410855108561085710858108591086010861108621086310864108651086610867108681086910870108711087210873108741087510876108771087810879108801088110882108831088410885108861088710888108891089010891108921089310894108951089610897108981089910900109011090210903109041090510906109071090810909109101091110912109131091410915109161091710918109191092010921109221092310924109251092610927109281092910930109311093210933109341093510936109371093810939109401094110942109431094410945109461094710948109491095010951109521095310954109551095610957109581095910960109611096210963109641096510966109671096810969109701097110972109731097410975109761097710978109791098010981109821098310984109851098610987109881098910990109911099210993109941099510996109971099810999110001100111002110031100411005110061100711008110091101011011110121101311014110151101611017110181101911020110211102211023110241102511026110271102811029110301103111032110331103411035110361103711038110391104011041110421104311044110451104611047110481104911050110511105211053110541105511056110571105811059110601106111062110631106411065110661106711068110691107011071110721107311074110751107611077110781107911080110811108211083110841108511086110871108811089110901109111092110931109411095110961109711098110991110011101111021110311104111051110611107111081110911110111111111211113111141111511116111171111811119111201112111122111231112411125111261112711128111291113011131111321113311134111351113611137111381113911140111411114211143111441114511146111471114811149111501115111152111531115411155111561115711158111591116011161111621116311164111651116611167111681116911170111711117211173111741117511176111771117811179111801118111182111831118411185111861118711188111891119011191111921119311194111951119611197111981119911200112011120211203112041120511206112071120811209112101121111212112131121411215112161121711218112191122011221112221122311224112251122611227112281122911230112311123211233112341123511236112371123811239112401124111242112431124411245112461124711248112491125011251112521125311254112551125611257112581125911260112611126211263112641126511266112671126811269112701127111272112731127411275112761127711278112791128011281112821128311284112851128611287112881128911290112911129211293112941129511296112971129811299113001130111302113031130411305113061130711308113091131011311113121131311314113151131611317113181131911320113211132211323113241132511326113271132811329113301133111332113331133411335113361133711338113391134011341113421134311344113451134611347113481134911350113511135211353113541135511356113571135811359113601136111362113631136411365113661136711368113691137011371113721137311374113751137611377113781137911380113811138211383113841138511386113871138811389113901139111392113931139411395113961139711398113991140011401114021140311404114051140611407114081140911410114111141211413114141141511416114171141811419114201142111422114231142411425114261142711428114291143011431114321143311434114351143611437114381143911440114411144211443114441144511446114471144811449114501145111452114531145411455114561145711458114591146011461114621146311464114651146611467114681146911470114711147211473114741147511476114771147811479114801148111482114831148411485114861148711488114891149011491114921149311494114951149611497114981149911500115011150211503115041150511506115071150811509115101151111512115131151411515115161151711518115191152011521115221152311524115251152611527115281152911530115311153211533115341153511536115371153811539115401154111542115431154411545115461154711548115491155011551115521155311554115551155611557115581155911560115611156211563115641156511566115671156811569115701157111572115731157411575115761157711578115791158011581115821158311584115851158611587115881158911590115911159211593115941159511596115971159811599116001160111602116031160411605116061160711608116091161011611116121161311614116151161611617116181161911620116211162211623116241162511626116271162811629116301163111632116331163411635116361163711638116391164011641116421164311644116451164611647116481164911650116511165211653116541165511656116571165811659116601166111662116631166411665116661166711668116691167011671116721167311674116751167611677116781167911680116811168211683116841168511686116871168811689116901169111692116931169411695116961169711698116991170011701117021170311704117051170611707117081170911710117111171211713117141171511716117171171811719117201172111722117231172411725117261172711728117291173011731117321173311734117351173611737117381173911740117411174211743117441174511746117471174811749117501175111752117531175411755117561175711758117591176011761117621176311764117651176611767117681176911770117711177211773117741177511776117771177811779117801178111782117831178411785117861178711788117891179011791117921179311794117951179611797117981179911800118011180211803118041180511806118071180811809118101181111812118131181411815118161181711818118191182011821118221182311824118251182611827118281182911830118311183211833118341183511836118371183811839118401184111842118431184411845118461184711848118491185011851118521185311854118551185611857118581185911860118611186211863118641186511866118671186811869118701187111872118731187411875118761187711878118791188011881118821188311884118851188611887118881188911890118911189211893118941189511896118971189811899119001190111902119031190411905119061190711908119091191011911119121191311914119151191611917119181191911920119211192211923119241192511926119271192811929119301193111932119331193411935119361193711938119391194011941119421194311944119451194611947119481194911950119511195211953119541195511956119571195811959119601196111962119631196411965119661196711968119691197011971119721197311974119751197611977119781197911980119811198211983119841198511986119871198811989119901199111992119931199411995119961199711998119991200012001120021200312004120051200612007120081200912010120111201212013120141201512016120171201812019120201202112022120231202412025120261202712028120291203012031120321203312034120351203612037120381203912040120411204212043120441204512046120471204812049120501205112052120531205412055120561205712058120591206012061120621206312064120651206612067120681206912070120711207212073120741207512076120771207812079120801208112082120831208412085120861208712088120891209012091120921209312094120951209612097120981209912100121011210212103121041210512106121071210812109121101211112112121131211412115121161211712118121191212012121121221212312124121251212612127121281212912130121311213212133121341213512136121371213812139121401214112142121431214412145121461214712148121491215012151121521215312154121551215612157121581215912160121611216212163121641216512166121671216812169121701217112172121731217412175121761217712178121791218012181121821218312184121851218612187121881218912190121911219212193121941219512196121971219812199122001220112202122031220412205122061220712208122091221012211122121221312214122151221612217122181221912220122211222212223122241222512226122271222812229122301223112232122331223412235122361223712238122391224012241122421224312244122451224612247122481224912250122511225212253122541225512256122571225812259122601226112262122631226412265122661226712268122691227012271122721227312274122751227612277122781227912280122811228212283122841228512286122871228812289122901229112292122931229412295122961229712298122991230012301123021230312304123051230612307123081230912310123111231212313123141231512316123171231812319123201232112322123231232412325123261232712328123291233012331123321233312334123351233612337123381233912340123411234212343123441234512346123471234812349123501235112352123531235412355123561235712358123591236012361123621236312364123651236612367123681236912370123711237212373123741237512376123771237812379123801238112382123831238412385123861238712388123891239012391123921239312394123951239612397123981239912400124011240212403124041240512406124071240812409124101241112412124131241412415124161241712418124191242012421124221242312424124251242612427124281242912430124311243212433124341243512436124371243812439124401244112442124431244412445124461244712448124491245012451124521245312454124551245612457124581245912460124611246212463124641246512466124671246812469124701247112472124731247412475124761247712478124791248012481124821248312484124851248612487124881248912490124911249212493124941249512496124971249812499125001250112502125031250412505125061250712508125091251012511125121251312514125151251612517125181251912520125211252212523125241252512526125271252812529125301253112532125331253412535125361253712538125391254012541125421254312544125451254612547125481254912550125511255212553125541255512556125571255812559125601256112562125631256412565125661256712568125691257012571125721257312574125751257612577125781257912580125811258212583125841258512586125871258812589125901259112592125931259412595125961259712598125991260012601126021260312604126051260612607126081260912610126111261212613126141261512616126171261812619126201262112622126231262412625126261262712628126291263012631126321263312634126351263612637126381263912640126411264212643126441264512646126471264812649126501265112652126531265412655126561265712658126591266012661126621266312664126651266612667126681266912670126711267212673126741267512676126771267812679126801268112682126831268412685126861268712688126891269012691126921269312694126951269612697126981269912700127011270212703127041270512706127071270812709127101271112712127131271412715127161271712718127191272012721127221272312724127251272612727127281272912730127311273212733127341273512736127371273812739127401274112742127431274412745127461274712748127491275012751127521275312754127551275612757127581275912760127611276212763127641276512766127671276812769127701277112772127731277412775127761277712778127791278012781127821278312784127851278612787127881278912790127911279212793127941279512796127971279812799128001280112802128031280412805128061280712808128091281012811128121281312814128151281612817128181281912820128211282212823128241282512826128271282812829128301283112832128331283412835128361283712838128391284012841128421284312844128451284612847128481284912850128511285212853128541285512856128571285812859128601286112862128631286412865128661286712868128691287012871128721287312874128751287612877128781287912880128811288212883128841288512886128871288812889128901289112892128931289412895128961289712898128991290012901129021290312904129051290612907129081290912910129111291212913129141291512916129171291812919129201292112922129231292412925129261292712928129291293012931129321293312934129351293612937129381293912940129411294212943129441294512946129471294812949129501295112952129531295412955129561295712958129591296012961129621296312964129651296612967129681296912970129711297212973129741297512976129771297812979129801298112982129831298412985129861298712988129891299012991129921299312994129951299612997129981299913000130011300213003130041300513006130071300813009130101301113012130131301413015130161301713018130191302013021130221302313024130251302613027130281302913030130311303213033130341303513036130371303813039130401304113042130431304413045130461304713048130491305013051130521305313054130551305613057130581305913060130611306213063130641306513066130671306813069130701307113072130731307413075130761307713078130791308013081130821308313084130851308613087130881308913090130911309213093130941309513096130971309813099131001310113102131031310413105131061310713108131091311013111131121311313114131151311613117131181311913120131211312213123131241312513126131271312813129131301313113132131331313413135131361313713138131391314013141131421314313144131451314613147131481314913150131511315213153131541315513156131571315813159131601316113162131631316413165131661316713168131691317013171131721317313174131751317613177131781317913180131811318213183131841318513186131871318813189131901319113192131931319413195131961319713198131991320013201132021320313204132051320613207132081320913210132111321213213132141321513216132171321813219132201322113222132231322413225132261322713228132291323013231132321323313234132351323613237132381323913240132411324213243132441324513246132471324813249132501325113252132531325413255132561325713258132591326013261132621326313264132651326613267132681326913270132711327213273132741327513276132771327813279132801328113282132831328413285132861328713288132891329013291132921329313294132951329613297132981329913300133011330213303133041330513306133071330813309133101331113312133131331413315133161331713318133191332013321133221332313324133251332613327133281332913330133311333213333133341333513336133371333813339133401334113342133431334413345133461334713348133491335013351133521335313354133551335613357133581335913360133611336213363133641336513366133671336813369133701337113372133731337413375133761337713378133791338013381133821338313384133851338613387133881338913390133911339213393133941339513396133971339813399134001340113402134031340413405134061340713408134091341013411134121341313414134151341613417134181341913420134211342213423134241342513426134271342813429134301343113432134331343413435134361343713438134391344013441134421344313444134451344613447134481344913450134511345213453134541345513456134571345813459134601346113462134631346413465134661346713468134691347013471134721347313474134751347613477134781347913480134811348213483134841348513486134871348813489134901349113492134931349413495134961349713498134991350013501135021350313504135051350613507135081350913510135111351213513135141351513516135171351813519135201352113522135231352413525135261352713528135291353013531135321353313534135351353613537135381353913540135411354213543135441354513546135471354813549135501355113552135531355413555135561355713558135591356013561135621356313564135651356613567135681356913570135711357213573135741357513576135771357813579135801358113582135831358413585135861358713588135891359013591135921359313594135951359613597135981359913600136011360213603136041360513606136071360813609136101361113612136131361413615136161361713618136191362013621136221362313624136251362613627136281362913630136311363213633136341363513636136371363813639136401364113642136431364413645136461364713648136491365013651136521365313654136551365613657136581365913660136611366213663136641366513666136671366813669136701367113672136731367413675136761367713678136791368013681136821368313684136851368613687136881368913690136911369213693136941369513696136971369813699137001370113702137031370413705137061370713708137091371013711137121371313714137151371613717137181371913720137211372213723137241372513726137271372813729137301373113732137331373413735137361373713738137391374013741137421374313744137451374613747137481374913750137511375213753137541375513756137571375813759137601376113762137631376413765137661376713768137691377013771137721377313774137751377613777137781377913780137811378213783137841378513786137871378813789137901379113792137931379413795137961379713798137991380013801138021380313804138051380613807138081380913810138111381213813138141381513816138171381813819138201382113822138231382413825138261382713828138291383013831138321383313834138351383613837138381383913840138411384213843138441384513846138471384813849138501385113852138531385413855138561385713858138591386013861138621386313864138651386613867138681386913870138711387213873138741387513876138771387813879138801388113882138831388413885138861388713888138891389013891138921389313894138951389613897138981389913900139011390213903139041390513906
  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. (** get the name for the code section that represens a certain symbol
  1230. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1231. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1232. VAR
  1233. operatorFingerPrint: SyntaxTree.FingerPrint;
  1234. operatorFingerPrintString,string: ARRAY 32 OF CHAR;
  1235. BEGIN
  1236. Global.GetSymbolSegmentedName(symbol, name);
  1237. (* if the symbol is an operator, then append the fingerprint to the name *)
  1238. IF symbol IS SyntaxTree.Operator THEN
  1239. operatorFingerPrint := fingerPrinter.SymbolFP(symbol);
  1240. string := "[";
  1241. Strings.IntToHexStr(operatorFingerPrint.shallow, 8, operatorFingerPrintString);
  1242. Strings.Append(string, operatorFingerPrintString);
  1243. Strings.Append(string, "]");
  1244. Basic.AppendToSegmentedName(name,string);
  1245. END
  1246. END GetCodeSectionNameForSymbol;
  1247. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1248. BEGIN
  1249. IF dump # NIL THEN
  1250. dump.String("enter "); dump.String(s); dump.Ln;
  1251. END;
  1252. END TraceEnter;
  1253. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1254. BEGIN
  1255. IF dump # NIL THEN
  1256. dump.String("exit "); dump.String(s); dump.Ln;
  1257. END;
  1258. END TraceExit;
  1259. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1260. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1261. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1262. VAR i: LONGINT;
  1263. BEGIN
  1264. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1265. IF op.rule # NIL THEN
  1266. FOR i := 0 TO LEN(op.rule)-1 DO
  1267. CheckRegister(op.rule[i])
  1268. END;
  1269. END;
  1270. END CheckRegister;
  1271. BEGIN
  1272. CheckRegister(instruction.op1);
  1273. CheckRegister(instruction.op2);
  1274. CheckRegister(instruction.op3);
  1275. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1276. ELSE section.Emit(instruction);
  1277. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1278. END;
  1279. END Emit;
  1280. PROCEDURE EmitTrap (position, trapNo: LONGINT);
  1281. BEGIN
  1282. IF backend.cooperative THEN
  1283. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1284. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1285. ELSE
  1286. Emit(Trap(position,trapNo));
  1287. END;
  1288. END EmitTrap;
  1289. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: LONGINT; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1290. VAR name: Basic.SegmentedName;
  1291. VAR op1, op2, reg: IntermediateCode.Operand;
  1292. VAR call, nocall: Label;
  1293. VAR parametersSize: LONGINT;
  1294. VAR prevSection: IntermediateCode.Section;
  1295. VAR prevDump: Streams.Writer;
  1296. VAR body: SyntaxTree.Body;
  1297. BEGIN
  1298. ASSERT((procedure = NIL) OR ~procedure.type(SyntaxTree.ProcedureType).noPAF);
  1299. prevSection := SELF.section;
  1300. SELF.section := section;
  1301. prevDump := dump;
  1302. dump := section.comments;
  1303. IF backend.hasLinkRegister THEN
  1304. Emit(Push(-1, lr));
  1305. END;
  1306. Emit(Push(-1,fp));
  1307. IF backend.cooperative & (callconv = SyntaxTree.OberonCallingConvention) THEN
  1308. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1309. GetCodeSectionNameForSymbol(procedure, name);
  1310. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  1311. ELSE
  1312. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1313. END;
  1314. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1315. Emit(Push(-1,op1));
  1316. Emit(Mov(-1,fp, sp));
  1317. body := procedure.procedureScope.body;
  1318. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1319. NEW(call, section);
  1320. NEW(nocall, section);
  1321. reg := NewRegisterOperand(addressType);
  1322. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1323. Emit(Sub(-1,reg, sp, op1));
  1324. BrltL(call, sp, reg);
  1325. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1326. BrgeL(nocall, sp, op2);
  1327. call.Resolve(section.pc);
  1328. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1329. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1330. Emit(Push(-1, op2));
  1331. Emit(Push(-1, reg));
  1332. ReleaseIntermediateOperand(reg);
  1333. CallThis(position, "Activities","ExpandStack",2);
  1334. Emit(Result(-1, sp));
  1335. nocall.Resolve(section.pc);
  1336. END;
  1337. ELSE
  1338. Emit(Mov(-1, fp, sp));
  1339. END;
  1340. Emit(Enter(-1, callconv, varSize));
  1341. SELF.section := prevSection;
  1342. dump := prevDump;
  1343. END EmitEnter;
  1344. PROCEDURE Enter(position: LONGINT; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1345. VAR op1,op2: IntermediateCode.Operand;
  1346. VAR instruction: IntermediateCode.Instruction;
  1347. BEGIN
  1348. IntermediateCode.InitNumber(op1,callconv);
  1349. IntermediateCode.InitNumber(op2,varSize);
  1350. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1351. RETURN instruction
  1352. END Enter;
  1353. PROCEDURE Leave(position: LONGINT; callconv: LONGINT): IntermediateCode.Instruction;
  1354. VAR op1: IntermediateCode.Operand;
  1355. VAR instruction: IntermediateCode.Instruction;
  1356. BEGIN
  1357. IntermediateCode.InitNumber(op1,callconv);
  1358. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1359. RETURN instruction
  1360. END Leave;
  1361. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: LONGINT; callconv: LONGINT);
  1362. VAR prevSection: IntermediateCode.Section;
  1363. VAR op2: IntermediateCode.Operand;
  1364. BEGIN
  1365. prevSection := SELF.section;
  1366. SELF.section := section;
  1367. Emit(Leave(position, callconv));
  1368. IF backend.cooperative THEN
  1369. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1370. Emit(Add(position, sp, fp, op2));
  1371. ELSE
  1372. Emit(Mov(position, sp, fp));
  1373. END;
  1374. Emit(Pop(position, fp));
  1375. SELF.section := prevSection;
  1376. END EmitLeave;
  1377. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1378. VAR m: SymbolMap;
  1379. BEGIN
  1380. position := x.position;
  1381. IF currentIsInline THEN
  1382. m := currentMapper.Get(x);
  1383. IF m # NIL THEN
  1384. (*
  1385. Printout.Info("mapping from", x);
  1386. Printout.Info("mapping to ", m.to);
  1387. *)
  1388. m.to.Accept(SELF);
  1389. op := result;
  1390. IF m.tag # NIL THEN
  1391. ReleaseIntermediateOperand(result.tag);
  1392. m.tag.Accept(SELF);
  1393. op.tag := result.op;
  1394. ReleaseIntermediateOperand(result.tag);
  1395. END;
  1396. RETURN
  1397. END;
  1398. END;
  1399. x.Accept(SELF);
  1400. op := result;
  1401. END Symbol;
  1402. PROCEDURE Expression(x: SyntaxTree.Expression);
  1403. BEGIN
  1404. position := x.position;
  1405. constantDeclaration := NIL;
  1406. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1407. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1408. END;
  1409. IF x.resolved # NIL THEN
  1410. x.resolved.Accept(SELF)
  1411. ELSE
  1412. x.Accept(SELF)
  1413. END;
  1414. (* check this, was commented out in ActiveCells3 *)
  1415. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1416. Error(x.position, "unsupported modifier");
  1417. END;
  1418. END Expression;
  1419. (*
  1420. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1421. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1422. BEGIN
  1423. temporaries.GetUsage(current);
  1424. FOR i := 0 TO LEN(current)-1 DO
  1425. set := current[i] - previous[i];
  1426. IF set # {} THEN
  1427. FOR j := 0 TO MAX(SET)-1 DO
  1428. IF j IN set THEN
  1429. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1430. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1431. Symbol(variable, op);
  1432. MakeMemory(tmp,op.op,addressType,0);
  1433. ReleaseOperand(op);
  1434. Emit(Mov(position,tmp, nil ) );
  1435. ReleaseIntermediateOperand(tmp);
  1436. END;
  1437. END;
  1438. END;
  1439. END;
  1440. END;
  1441. END ResetUsedTemporaries;
  1442. *)
  1443. PROCEDURE Statement(x: SyntaxTree.Statement);
  1444. VAR use: VariableUse;
  1445. BEGIN
  1446. temporaries.GetUsage(use);
  1447. position := x.position;
  1448. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1449. IF commentPrintout # NIL THEN
  1450. commentPrintout.Statement(x);
  1451. dump.Ln;
  1452. (*dump.Update;*)
  1453. END;
  1454. x.Accept(SELF);
  1455. (*
  1456. CheckRegistersFree();
  1457. *)
  1458. (*ResetUsedTemporaries(use);*)
  1459. temporaries.SetUsage(use);
  1460. END Statement;
  1461. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1462. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1463. *)
  1464. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1465. BEGIN
  1466. IF op.mode = IntermediateCode.ModeMemory THEN
  1467. ReuseCopy(res,op);
  1468. ELSE
  1469. res := op;
  1470. UseIntermediateOperand(res);
  1471. END;
  1472. IntermediateCode.AddOffset(res,offset);
  1473. IntermediateCode.MakeMemory(res,type);
  1474. END MakeMemory;
  1475. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1476. VAR mem: IntermediateCode.Operand;
  1477. BEGIN
  1478. MakeMemory(mem,res,type,offset);
  1479. ReleaseIntermediateOperand(res);
  1480. res := mem;
  1481. END ToMemory;
  1482. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1483. VAR mem: IntermediateCode.Operand;
  1484. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1485. componentType: SyntaxTree.Type;
  1486. BEGIN
  1487. type := type.resolved;
  1488. IF operand.mode = ModeReference THEN
  1489. IF type IS SyntaxTree.RangeType THEN
  1490. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.longintType), 0);
  1491. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1492. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1493. ReleaseOperand(operand);
  1494. operand.op := firstOp;
  1495. operand.tag := lastOp;
  1496. operand.extra := stepOp;
  1497. ELSIF type IS SyntaxTree.ComplexType THEN
  1498. componentType := type(SyntaxTree.ComplexType).componentType;
  1499. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1500. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1501. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1502. ReleaseOperand(operand);
  1503. operand.op := firstOp;
  1504. operand.tag := lastOp
  1505. ELSE
  1506. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1507. ReleaseIntermediateOperand(operand.op);
  1508. operand.op := mem;
  1509. END;
  1510. operand.mode := ModeValue;
  1511. END;
  1512. ASSERT(operand.mode = ModeValue);
  1513. END LoadValue;
  1514. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1515. VAR prevConditional: BOOLEAN;
  1516. BEGIN
  1517. prevConditional := conditional;
  1518. conditional := FALSE;
  1519. InitOperand(result, ModeUndefined);
  1520. Expression(x);
  1521. op := result;
  1522. LoadValue(op,x.type.resolved);
  1523. conditional := prevConditional;
  1524. END Evaluate;
  1525. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1526. VAR prevConditional: BOOLEAN;
  1527. BEGIN
  1528. prevConditional := conditional;
  1529. conditional := FALSE;
  1530. InitOperand(result,ModeUndefined);
  1531. Expression(x);
  1532. op := result;
  1533. (*
  1534. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1535. *)
  1536. conditional := prevConditional;
  1537. END Designate;
  1538. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1539. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1540. BEGIN
  1541. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1542. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1543. conditional := TRUE;
  1544. trueLabel := trueL; falseLabel := falseL;
  1545. Expression(x);
  1546. trueL := trueLabel; falseL := falseLabel;
  1547. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1548. END Condition;
  1549. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1550. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1551. BEGIN
  1552. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1553. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1554. RETURN op
  1555. END NewRegisterOperand;
  1556. PROCEDURE UnuseRegister(register: LONGINT);
  1557. BEGIN
  1558. IF (register > 0) THEN
  1559. register := registerUsageCount.Map(register);
  1560. registerUsageCount.DecUse(register);
  1561. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1562. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1563. END;
  1564. IF registerUsageCount.Use(register)=0 THEN
  1565. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1566. Warning(position, "register cannot be removed");
  1567. END;
  1568. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1569. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1570. END;
  1571. ELSIF registerUsageCount.Use(register)<0 THEN
  1572. Warning(position, "register removed too often");
  1573. IF dump # NIL THEN
  1574. dump.String("register removed too often"); dump.Ln; dump.Update;
  1575. END;
  1576. D.TraceBack;
  1577. END;
  1578. END;
  1579. END UnuseRegister;
  1580. PROCEDURE UseRegister(register: LONGINT);
  1581. BEGIN
  1582. IF (register > 0) THEN
  1583. register := registerUsageCount.Map(register);
  1584. registerUsageCount.IncUse(register);
  1585. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1586. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1587. END;
  1588. IF registerUsageCount.Use(register)=1 THEN
  1589. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1590. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1591. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1592. END;
  1593. END;
  1594. END;
  1595. END UseRegister;
  1596. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1597. BEGIN
  1598. UnuseRegister(op.register)
  1599. END ReleaseIntermediateOperand;
  1600. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1601. BEGIN
  1602. UseRegister(op.register)
  1603. END UseIntermediateOperand;
  1604. PROCEDURE ReleaseOperand(CONST op: Operand);
  1605. BEGIN
  1606. UnuseRegister(op.op.register);
  1607. UnuseRegister(op.tag.register);
  1608. UnuseRegister(op.extra.register);
  1609. END ReleaseOperand;
  1610. (* save registers marked in array "markedRegisters" to the stack
  1611. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1612. *)
  1613. PROCEDURE SaveRegisters();
  1614. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1615. BEGIN
  1616. entry := usedRegisters;
  1617. WHILE entry # NIL DO
  1618. type := registerUsageCount.used[entry.register].type;
  1619. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1620. Emit(Push(position,op));
  1621. entry := entry.next;
  1622. END;
  1623. END SaveRegisters;
  1624. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1625. BEGIN
  1626. saved := usedRegisters;
  1627. usedRegisters := NIL;
  1628. END ReleaseUsedRegisters;
  1629. (** remove parameter registers from used queue *)
  1630. PROCEDURE ReleaseParameterRegisters;
  1631. VAR entry,prev,next: RegisterEntry;
  1632. BEGIN
  1633. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1634. WHILE entry # NIL DO
  1635. next := entry.next;
  1636. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1637. registerUsageCount.DecUse(entry.register);
  1638. ASSERT(registerUsageCount.Use(entry.register)=0);
  1639. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1640. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1641. END;
  1642. ELSIF prev = NIL THEN
  1643. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1644. ELSE
  1645. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1646. END;
  1647. entry := next;
  1648. END;
  1649. END ReleaseParameterRegisters;
  1650. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1651. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1652. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1653. BEGIN
  1654. entry := saved;
  1655. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1656. entry := prev;
  1657. WHILE entry # NIL DO
  1658. prev := entry.prev;
  1659. type := entry.type;
  1660. class := entry.registerClass;
  1661. IntermediateCode.InitRegister(op,type,class,entry.register);
  1662. (*
  1663. new := registerUsageCount.Next(type,class);
  1664. registerUsageCount.Remap(entry.register,new);
  1665. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1666. dump.String("remap register "); dump.Int(entry.register,1);
  1667. dump.String("to "); dump.Int(new,1);
  1668. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1669. END;
  1670. entry.register := new;
  1671. *)
  1672. Emit(Pop(position,op));
  1673. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1674. entry := prev;
  1675. END;
  1676. (*
  1677. usedRegisters := saved;
  1678. *)
  1679. END RestoreRegisters;
  1680. PROCEDURE CheckRegistersFree;
  1681. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1682. BEGIN
  1683. IF usedRegisters # NIL THEN
  1684. r := usedRegisters;
  1685. WHILE r # NIL DO
  1686. warning := "register ";
  1687. Strings.AppendInt(warning, r.register);
  1688. Strings.Append(warning, " not released.");
  1689. Warning(position,warning);
  1690. r := r .next;
  1691. END;
  1692. END;
  1693. FOR i := 0 TO registerUsageCount.count-1 DO
  1694. IF registerUsageCount.used[i].count < 0 THEN
  1695. warning := "register ";
  1696. Strings.AppendInt(warning, i);
  1697. Strings.Append(warning, " unused too often.");
  1698. Warning(position,warning);
  1699. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1700. warning := "register ";
  1701. Strings.AppendInt(warning, i);
  1702. Strings.Append(warning, " not unused often enough.");
  1703. Warning(position,warning);
  1704. END;
  1705. END;
  1706. END CheckRegistersFree;
  1707. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1708. Otherwise allocate a new register.
  1709. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1710. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1711. BEGIN
  1712. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1713. UseIntermediateOperand(result);
  1714. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1715. UseIntermediateOperand(result);
  1716. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1717. END;
  1718. END Reuse2;
  1719. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1720. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1721. If not then allocate a new register.
  1722. Does NOT necessarily keep the content of src1 or src2 in result!
  1723. *)
  1724. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1725. BEGIN
  1726. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1727. UseIntermediateOperand(result);
  1728. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1729. UseIntermediateOperand(result);
  1730. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1731. result := alternative; alternative := emptyOperand;
  1732. UseIntermediateOperand(result);
  1733. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1734. END;
  1735. END Reuse2a;
  1736. (* like reuse2 but only one source *)
  1737. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1738. BEGIN
  1739. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1740. UseIntermediateOperand(result);
  1741. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1742. END;
  1743. END Reuse1;
  1744. (* like reuse2a but only one source *)
  1745. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1746. BEGIN
  1747. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1748. UseIntermediateOperand(result);
  1749. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1750. UseIntermediateOperand(result);
  1751. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1752. END;
  1753. END Reuse1a;
  1754. (* like reuse1 but guarantees that content of src1 is in result *)
  1755. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1756. BEGIN
  1757. IF ReusableRegister(src1) THEN
  1758. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1759. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1760. UseIntermediateOperand(result);
  1761. ELSE
  1762. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1763. Emit(Mov(position,result,src1));
  1764. END
  1765. END ReuseCopy;
  1766. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1767. BEGIN
  1768. IF ReusableRegister(src) THEN
  1769. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1770. ELSE
  1771. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1772. Emit(Mov(position,result,src));
  1773. ReleaseIntermediateOperand(src);
  1774. END
  1775. END TransferToRegister;
  1776. (** labels and branches **)
  1777. PROCEDURE NewLabel(): Label;
  1778. VAR label: Label;
  1779. BEGIN
  1780. NEW(label,section); RETURN label;
  1781. END NewLabel;
  1782. PROCEDURE SetLabel(label: Label);
  1783. BEGIN label.Resolve(section.pc);
  1784. END SetLabel;
  1785. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1786. BEGIN
  1787. ASSERT(label # NIL);
  1788. IF label.pc < 0 THEN (* label not yet set *)
  1789. label.AddFixup(section.pc);
  1790. END;
  1791. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1792. END LabelOperand;
  1793. PROCEDURE BrL(label: Label);
  1794. BEGIN
  1795. Emit(Br(position,LabelOperand(label)));
  1796. END BrL;
  1797. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1798. BEGIN
  1799. Emit(Brge(position,LabelOperand(label),left,right));
  1800. END BrgeL;
  1801. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1802. BEGIN
  1803. Emit(Brlt(position,LabelOperand(label),left,right));
  1804. END BrltL;
  1805. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1806. BEGIN
  1807. Emit(Breq(position,LabelOperand(label),left,right));
  1808. END BreqL;
  1809. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1810. BEGIN
  1811. Emit(Brne(position,LabelOperand(label),left,right));
  1812. END BrneL;
  1813. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1814. VAR new: IntermediateCode.Operand;
  1815. BEGIN
  1816. IF Trace THEN TraceEnter("Convert") END;
  1817. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1818. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1819. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1820. & (operand.offset = 0)
  1821. THEN
  1822. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1823. Emit(Conv(position,new,operand));
  1824. ELSE
  1825. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1826. Emit(Conv(position,new,operand));
  1827. ReleaseIntermediateOperand(operand);
  1828. END;
  1829. operand := new;
  1830. 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
  1831. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1832. ELSE
  1833. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1834. Emit(Conv(position,new,operand));
  1835. ReleaseIntermediateOperand(operand);
  1836. operand := new;
  1837. END;
  1838. IF Trace THEN TraceExit("Convert") END;
  1839. END Convert;
  1840. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1841. VAR exit: Label;
  1842. BEGIN
  1843. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1844. exit := NewLabel();
  1845. br(exit,left,right);
  1846. EmitTrap(position,trapNo);
  1847. SetLabel(exit);
  1848. END TrapC;
  1849. (** expressions *)
  1850. (** emit necessary runtime check for set elements **)
  1851. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1852. VAR max: IntermediateCode.Operand;
  1853. BEGIN
  1854. IF isUnchecked THEN RETURN END;
  1855. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1856. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1857. TrapC(BrgeL, max, o, SetElementTrap);
  1858. END;
  1859. END CheckSetElement;
  1860. (** the set that a range represents **)
  1861. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1862. VAR
  1863. operand: Operand;
  1864. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1865. BEGIN
  1866. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1867. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1868. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1869. one := IntermediateCode.Immediate(setType, 1);
  1870. Evaluate(x, operand);
  1871. Convert(operand.op, setType);
  1872. Convert(operand.tag, setType);
  1873. CheckSetElement(operand.op);
  1874. CheckSetElement(operand.tag);
  1875. (* create mask for lower bound
  1876. i.e. shift 11111111 to the left by the value of the lower bound
  1877. *)
  1878. Reuse1(temp, operand.op);
  1879. Emit(Shl(position,temp, allBits, operand.op));
  1880. ReleaseIntermediateOperand(operand.op);
  1881. operand.op := temp;
  1882. (* create mask for upper bound
  1883. i.e. shift 11111111 to the right by the difference between the
  1884. upper bound and the maximum number of set elements
  1885. *)
  1886. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1887. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1888. Reuse1(temp, operand.tag);
  1889. ELSE
  1890. Reuse1(temp, operand.tag);
  1891. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1892. Emit(Sub(position,temp, size, operand.tag));
  1893. END;
  1894. Emit(Shr(position,temp, allBits, operand.tag));
  1895. ReleaseIntermediateOperand(operand.tag);
  1896. operand.tag := temp;
  1897. Reuse2(resultingSet, operand.op, operand.tag);
  1898. (* intersect the two masks *)
  1899. Emit(And(position,resultingSet, operand.op, operand.tag));
  1900. ReleaseOperand(operand);
  1901. RETURN resultingSet
  1902. END SetFromRange;
  1903. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1904. VAR
  1905. res, operand: Operand;
  1906. temp, one, noBits, dest: IntermediateCode.Operand;
  1907. expression: SyntaxTree.Expression;
  1908. i: LONGINT;
  1909. BEGIN
  1910. IF Trace THEN TraceEnter("VisitSet") END;
  1911. dest := destination;
  1912. destination := emptyOperand;
  1913. noBits := IntermediateCode.Immediate(setType, 0);
  1914. one := IntermediateCode.Immediate(setType, 1);
  1915. (* start off with the empty set *)
  1916. InitOperand(res, ModeValue);
  1917. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1918. Emit(Mov(position,res.op, noBits));
  1919. FOR i := 0 TO x.elements.Length() - 1 DO
  1920. expression := x.elements.GetExpression(i);
  1921. IF expression IS SyntaxTree.RangeExpression THEN
  1922. (* range of set elements *)
  1923. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  1924. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  1925. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1926. ReleaseIntermediateOperand(temp)
  1927. ELSE
  1928. (* singelton element *)
  1929. Evaluate(expression, operand);
  1930. Convert(operand.op, setType);
  1931. CheckSetElement(operand.op);
  1932. (* create subset containing single element *)
  1933. Reuse1(temp, operand.op);
  1934. Emit(Shl(position,temp, one, operand.op));
  1935. ReleaseOperand(operand);
  1936. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1937. ReleaseIntermediateOperand(temp);
  1938. END
  1939. END;
  1940. result := res;
  1941. destination := dest;
  1942. IF Trace THEN TraceExit("VisitSet") END;
  1943. END VisitSet;
  1944. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  1945. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  1946. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  1947. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  1948. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  1949. element: SyntaxTree.IntegerValue;
  1950. BEGIN
  1951. numberElements := x.elements.Length();
  1952. expression := index.parameters.GetExpression(dim);
  1953. element := expression(SyntaxTree.IntegerValue);
  1954. FOR i := 0 TO numberElements-1 DO
  1955. expression := x.elements.GetExpression(i);
  1956. element.SetValue(i);
  1957. IF expression IS SyntaxTree.MathArrayExpression THEN
  1958. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  1959. ELSE
  1960. Assign(index,expression);
  1961. END;
  1962. END;
  1963. END RecursiveAssignment;
  1964. BEGIN
  1965. variable := GetTemporaryVariable(x.type, FALSE);
  1966. designator := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  1967. designator.SetType(variable.type);
  1968. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  1969. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  1970. FOR i := 0 TO dim-1 DO
  1971. element := SyntaxTree.NewIntegerValue(x.position,0);
  1972. element.SetType(system.longintType);
  1973. index.parameters.AddExpression(element);
  1974. END;
  1975. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  1976. RecursiveAssignment(x,0);
  1977. Expression(designator);
  1978. END VisitMathArrayExpression;
  1979. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  1980. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1981. BEGIN
  1982. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  1983. dest := destination; destination := emptyOperand;
  1984. IF x.operator = Scanner.Not THEN
  1985. IF conditional THEN
  1986. Condition(x.left,falseLabel,trueLabel)
  1987. ELSE
  1988. Evaluate(x.left,operand);
  1989. InitOperand(result,ModeValue);
  1990. Reuse1a(result.op,operand.op,dest);
  1991. Emit(Xor(position,result.op,operand.op,true));
  1992. ReleaseOperand(operand);
  1993. END;
  1994. ELSIF x.operator = Scanner.Minus THEN
  1995. Evaluate(x.left,operand);
  1996. InitOperand(result,ModeValue);
  1997. Reuse1a(result.op,operand.op,dest);
  1998. type := x.left.type.resolved;
  1999. IF type IS SyntaxTree.SetType THEN
  2000. Emit(Not(position,result.op,operand.op));
  2001. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2002. Reuse1(result.tag,operand.tag);
  2003. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2004. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2005. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2006. Emit(Neg(position,result.op,operand.op));
  2007. ELSE HALT(200)
  2008. END;
  2009. ReleaseOperand(operand);
  2010. ELSIF x.operator = Scanner.Address THEN
  2011. Designate(x.left,operand);
  2012. operand.mode := ModeValue;
  2013. t0 := x.left.type.resolved;
  2014. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2015. ReleaseIntermediateOperand(operand.op);
  2016. operand.op := operand.tag;
  2017. IntermediateCode.InitOperand(operand.tag);
  2018. END;
  2019. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2020. result := operand;
  2021. ELSE HALT(100)
  2022. END;
  2023. destination := dest;
  2024. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2025. END VisitUnaryExpression;
  2026. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2027. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2028. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2029. BEGIN
  2030. type := type.resolved;
  2031. originalType := type;
  2032. IF type IS SyntaxTree.PointerType THEN
  2033. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2034. END;
  2035. IF type IS SyntaxTree.ObjectType THEN
  2036. BrL(trueL);
  2037. ELSE
  2038. ASSERT(type IS SyntaxTree.RecordType);
  2039. (*
  2040. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2041. *)
  2042. ReuseCopy(left,tag);
  2043. right := TypeDescriptorAdr(type);
  2044. IF ~newObjectFile THEN
  2045. IntermediateCode.MakeMemory(right,addressType);
  2046. END;
  2047. IF backend.cooperative THEN
  2048. repeatL := NewLabel();
  2049. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2050. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2051. END;
  2052. SetLabel(repeatL);
  2053. BreqL(trueL,left,right);
  2054. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2055. BrneL(repeatL,left,nil);
  2056. ELSIF meta.simple THEN
  2057. level := type(SyntaxTree.RecordType).Level();
  2058. (* get type desc tag of level relative to base tag *)
  2059. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2060. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2061. IntermediateCode.MakeMemory(left,addressType);
  2062. BreqL(trueL,left,right);
  2063. ELSE
  2064. level := type(SyntaxTree.RecordType).Level();
  2065. (* get type desc tag of level relative to base tag *)
  2066. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2067. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2068. IntermediateCode.MakeMemory(left,addressType);
  2069. BreqL(trueL,left,right);
  2070. END;
  2071. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2072. BrL(falseL);
  2073. END;
  2074. END TypeTest;
  2075. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  2076. BEGIN
  2077. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  2078. IF dump # NIL THEN
  2079. dump.String(s); dump.Ln;
  2080. END;
  2081. END Error;
  2082. PROCEDURE Warning(position: LONGINT; CONST s: ARRAY OF CHAR);
  2083. BEGIN
  2084. backend.diagnostics.Warning(module.module.sourceName,position,Diagnostics.Invalid,s);
  2085. IF dump # NIL THEN
  2086. dump.String(s); dump.Ln; dump.Update;
  2087. END;
  2088. END Warning;
  2089. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2090. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2091. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2092. operand:Operand;
  2093. BEGIN
  2094. previousSection := section;
  2095. Global.GetModuleName(mod,name);
  2096. Strings.Append(name,".@Trace");
  2097. Basic.ToSegmentedName(name, pooledName);
  2098. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2099. IF dump # NIL THEN dump := section.comments END;
  2100. IF backend.hasLinkRegister THEN
  2101. Emit(Push(-1, lr));
  2102. END;
  2103. variable := mod.moduleScope.firstVariable;
  2104. WHILE variable # NIL DO
  2105. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2106. Symbol(variable, operand);
  2107. register := operand.op;
  2108. CallTraceMethod(register, variable.type);
  2109. ReleaseIntermediateOperand(register);
  2110. END;
  2111. variable := variable.nextVariable;
  2112. END;
  2113. IF backend.hasLinkRegister THEN
  2114. Emit(Pop(-1, lr));
  2115. END;
  2116. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2117. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2118. Emit(Br(position,op));
  2119. INC(statCoopTraceModule, section.pc);
  2120. section := previousSection;
  2121. IF dump # NIL THEN dump := section.comments END;
  2122. END CreateTraceModuleMethod;
  2123. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2124. BEGIN
  2125. Emit (Push(position, dst));
  2126. Emit (Push(position, src));
  2127. CallThis(position,"GarbageCollector","Assign", 2);
  2128. END CallAssignPointer;
  2129. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2130. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2131. BEGIN
  2132. IF SemanticChecker.IsPointerType (type) THEN
  2133. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2134. ELSIF type.IsRecordType() THEN
  2135. Emit (Push(position,dst));
  2136. Emit (Push(position,src));
  2137. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2138. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2139. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2140. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2141. ELSIF IsStaticArray(type) THEN
  2142. size := StaticArrayNumElements(type);
  2143. base := StaticArrayBaseType(type);
  2144. IF base.IsRecordType() THEN
  2145. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2146. Emit (Push(position, dst));
  2147. Emit (Push(position, src));
  2148. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2149. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2150. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2151. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2152. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2153. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2154. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2155. Emit (Push(position, dst));
  2156. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2157. Emit (Push(position, src));
  2158. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2159. ELSE
  2160. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2161. Emit (Push(position, dst));
  2162. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2163. Emit (Push(position, src));
  2164. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2165. ASSERT(StaticArrayBaseType(type).IsPointer());
  2166. END;
  2167. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2168. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2169. Emit (Push(position, dst));
  2170. Emit (Push(position, src));
  2171. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2172. ELSE HALT(100); (* missing ? *)
  2173. END;
  2174. END CallAssignMethod;
  2175. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2176. VAR name: Basic.SegmentedName;
  2177. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2178. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2179. context: Context;
  2180. BEGIN
  2181. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2182. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2183. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2184. GetRecordTypeName (recordType,name);
  2185. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2186. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2187. IF dump # NIL THEN dump := section.comments END;
  2188. IF backend.hasLinkRegister THEN
  2189. Emit(Push(-1, lr));
  2190. END;
  2191. variable := recordType.recordScope.firstVariable;
  2192. WHILE variable # NIL DO
  2193. IF variable.NeedsTrace() THEN
  2194. dst := NewRegisterOperand (addressType);
  2195. src := NewRegisterOperand (addressType);
  2196. Emit (Mov(position, dst, parameter1));
  2197. Emit (Mov(position, src, parameter2));
  2198. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2199. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2200. CallAssignMethod(dst, src, variable.type);
  2201. ReleaseIntermediateOperand(src);
  2202. ReleaseIntermediateOperand(dst);
  2203. END;
  2204. variable := variable.nextVariable;
  2205. END;
  2206. recordBase := recordType.GetBaseRecord();
  2207. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2208. IF backend.hasLinkRegister THEN
  2209. Emit(Pop(-1, lr));
  2210. END;
  2211. GetRecordTypeName (recordBase,name);
  2212. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2213. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2214. Emit(Br(position,op));
  2215. ELSE
  2216. Emit(Exit(position,0,0));
  2217. END;
  2218. IF ~recordType.isObject THEN
  2219. GetRecordTypeName (recordType,name);
  2220. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2221. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2222. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2223. NEW(registerUsageCount);
  2224. usedRegisters := NIL;
  2225. dst := NewRegisterOperand (addressType);
  2226. src := NewRegisterOperand (addressType);
  2227. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2228. Emit(Mov(position, dst, parameter1));
  2229. Emit(Mov(position, src, parameter2));
  2230. label := NewLabel();
  2231. SetLabel(label);
  2232. Emit(Push(position, dst));
  2233. Emit(Push(position, src));
  2234. GetRecordTypeName (recordType,name);
  2235. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2236. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2237. Emit(Call(position, op, 0));
  2238. Emit(Pop(position, src));
  2239. Emit(Pop(position, dst));
  2240. Emit(Add(position, dst, dst, ofs));
  2241. Emit(Add(position, src, src, ofs));
  2242. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2243. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2244. Emit(Exit(position,0,0));
  2245. END;
  2246. INC(statCoopAssignProcedure, section.pc);
  2247. ReturnToContext(context);
  2248. IF dump # NIL THEN dump := section.comments END;
  2249. END CreateAssignProcedure;
  2250. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2251. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2252. BEGIN
  2253. IF IsUnsafePointer (type) THEN
  2254. skip := NewLabel();
  2255. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2256. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2257. BreqL (skip, op, nil);
  2258. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2259. SetLabel (skip);
  2260. ELSIF SemanticChecker.IsPointerType (type) THEN
  2261. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2262. CallThis(position,"GarbageCollector","Mark", 1);
  2263. ELSIF type.IsRecordType() THEN
  2264. Emit (Push(position,register));
  2265. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2266. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2267. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2268. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2269. ELSIF IsStaticArray(type) THEN
  2270. size := StaticArrayNumElements(type);
  2271. base := StaticArrayBaseType(type);
  2272. IF base.IsRecordType() THEN
  2273. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2274. Emit (Push(position, register));
  2275. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2276. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2277. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2278. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2279. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2280. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2281. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2282. Emit (Push(position, register));
  2283. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2284. ELSE
  2285. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2286. Emit (Push(position, register));
  2287. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2288. ASSERT(base.IsPointer());
  2289. END;
  2290. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2291. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2292. CallThis(position,"GarbageCollector","Mark", 1);
  2293. ELSE HALT(100); (* missing ? *)
  2294. END;
  2295. END CallTraceMethod;
  2296. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2297. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2298. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2299. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2300. BEGIN
  2301. previousSection := section;
  2302. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2303. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2304. GetRecordTypeName (recordType,name);
  2305. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2306. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2307. IF dump # NIL THEN dump := section.comments END;
  2308. IF backend.hasLinkRegister THEN
  2309. Emit(Push(-1, lr));
  2310. END;
  2311. variable := recordType.recordScope.firstVariable;
  2312. WHILE variable # NIL DO
  2313. IF variable.NeedsTrace() THEN
  2314. register := NewRegisterOperand (addressType);
  2315. Emit (Mov(position,register,parameter1));
  2316. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2317. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2318. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2319. END;
  2320. CallTraceMethod(register, variable.type);
  2321. ReleaseIntermediateOperand(register);
  2322. END;
  2323. variable := variable.nextVariable;
  2324. END;
  2325. recordBase := recordType.GetBaseRecord();
  2326. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2327. recordBase := recordBase.GetBaseRecord();
  2328. END;
  2329. IF recordBase # NIL THEN
  2330. IF backend.hasLinkRegister THEN
  2331. Emit(Pop(-1, lr));
  2332. END;
  2333. GetRecordTypeName (recordBase,name);
  2334. IF HasExplicitTraceMethod (recordBase) THEN
  2335. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2336. ELSE
  2337. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2338. END;
  2339. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2340. Emit(Br(position,op));
  2341. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2342. Emit(Exit(position,0,0));
  2343. ELSE
  2344. IF backend.hasLinkRegister THEN
  2345. Emit(Pop(-1, lr));
  2346. END;
  2347. IF recordType.isObject THEN
  2348. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2349. ELSE
  2350. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2351. END;
  2352. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2353. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2354. Emit(Br(position,op));
  2355. END;
  2356. IF ~recordType.isObject THEN
  2357. GetRecordTypeName (recordType,name);
  2358. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2359. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2360. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2361. NEW(registerUsageCount);
  2362. usedRegisters := NIL;
  2363. IF dump # NIL THEN dump := section.comments END;
  2364. register := NewRegisterOperand (addressType);
  2365. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2366. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2367. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2368. END;
  2369. Emit (Push(position,register));
  2370. GetRecordTypeName (recordType,name);
  2371. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2372. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2373. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2374. ReleaseIntermediateOperand(register);
  2375. Emit(Exit(position,0,0));
  2376. GetRecordTypeName (recordType,name);
  2377. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2378. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2379. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2380. NEW(registerUsageCount);
  2381. usedRegisters := NIL;
  2382. register := NewRegisterOperand (addressType);
  2383. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2384. Emit(Mov(position, register, parameter1));
  2385. label := NewLabel();
  2386. SetLabel(label);
  2387. Emit(Push(position, register));
  2388. GetRecordTypeName (recordType,name);
  2389. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2390. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2391. Emit(Call(position, op, 0));
  2392. Emit(Pop(position, register));
  2393. Emit(Add(position, register, register, ofs));
  2394. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2395. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2396. Emit(Exit(position,0,0));
  2397. END;
  2398. INC(statCoopTraceMethod, section.pc);
  2399. ReturnToContext(context);
  2400. IF dump # NIL THEN dump := section.comments END;
  2401. END CreateTraceMethod;
  2402. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2403. VAR name: Basic.SegmentedName;
  2404. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2405. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2406. context: Context;
  2407. BEGIN
  2408. IF recordType.isObject THEN RETURN END;
  2409. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2410. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2411. GetRecordTypeName (recordType,name);
  2412. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2413. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2414. IF dump # NIL THEN dump := section.comments END;
  2415. IF backend.hasLinkRegister THEN
  2416. Emit(Push(-1, lr));
  2417. END;
  2418. variable := recordType.recordScope.firstVariable;
  2419. WHILE variable # NIL DO
  2420. IF variable.NeedsTrace() THEN
  2421. dst := NewRegisterOperand (addressType);
  2422. Emit (Mov(position, dst, parameter1));
  2423. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2424. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2425. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2426. END;
  2427. CallResetProcedure(dst, nil, variable.type);
  2428. ReleaseIntermediateOperand(dst);
  2429. END;
  2430. variable := variable.nextVariable;
  2431. END;
  2432. recordBase := recordType.GetBaseRecord();
  2433. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2434. IF backend.hasLinkRegister THEN
  2435. Emit(Pop(-1, lr));
  2436. END;
  2437. GetRecordTypeName (recordBase,name);
  2438. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2439. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2440. Emit(Br(position,op));
  2441. ELSE
  2442. Emit(Exit(position,0,0));
  2443. END;
  2444. GetRecordTypeName (recordType,name);
  2445. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2446. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2447. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2448. NEW(registerUsageCount);
  2449. usedRegisters := NIL;
  2450. dst := NewRegisterOperand (addressType);
  2451. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2452. Emit(Mov(position, dst, parameter1));
  2453. label := NewLabel();
  2454. SetLabel(label);
  2455. Emit(Push(position, dst));
  2456. GetRecordTypeName (recordType,name);
  2457. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2458. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2459. Emit(Call(position, op, 0));
  2460. Emit(Pop(position, dst));
  2461. Emit(Add(position, dst, dst, ofs));
  2462. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2463. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2464. Emit(Exit(position,0,0));
  2465. INC(statCoopResetProcedure, section.pc);
  2466. ReturnToContext(context);
  2467. IF dump # NIL THEN dump := section.comments END;
  2468. END CreateResetProcedure;
  2469. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2470. VAR name: Basic.SegmentedName; context: Context;
  2471. BEGIN
  2472. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2473. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2474. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2475. IF dump # NIL THEN dump := section.comments END;
  2476. IF backend.hasLinkRegister THEN
  2477. Emit(Push(-1, lr));
  2478. END;
  2479. Emit(Push(position,fp));
  2480. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2481. ResetVariables(scope);
  2482. Emit(Pop(position,fp));
  2483. Emit(Exit(position,0,0));
  2484. ReturnToContext(context);
  2485. IF dump # NIL THEN dump := section.comments END;
  2486. END CreateResetMethod;
  2487. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2488. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2489. BEGIN
  2490. IF SemanticChecker.IsPointerType (type) THEN
  2491. Emit (Push(position, dest));
  2492. CallThis(position,"GarbageCollector","Reset", 1);
  2493. ELSIF type.IsRecordType() THEN
  2494. Emit (Push(position, dest));
  2495. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2496. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2497. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2498. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2499. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2500. size := GetArrayLength(type, tag);
  2501. base := ArrayBaseType(type);
  2502. IF base.IsRecordType() THEN
  2503. Emit (Push(position, size));
  2504. Emit (Push(position, dest));
  2505. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2506. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2507. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2508. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2509. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2510. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2511. Emit (Push(position, size));
  2512. Emit (Push(position, dest));
  2513. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2514. ELSE
  2515. Emit (Push(position, size));
  2516. Emit (Push(position, dest));
  2517. CallThis(position,"GarbageCollector","ResetArray", 2);
  2518. ASSERT(ArrayBaseType(type).IsPointer());
  2519. END;
  2520. ReleaseIntermediateOperand(size);
  2521. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2522. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2523. Emit (Push(position, dest));
  2524. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2525. ELSE HALT(100); (* missing ? *)
  2526. END;
  2527. END CallResetProcedure;
  2528. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2529. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2530. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2531. VAR operand: Operand;
  2532. BEGIN
  2533. Symbol (symbol, operand);
  2534. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2535. ReleaseOperand(operand);
  2536. END Reset;
  2537. BEGIN
  2538. previousScope := currentScope;
  2539. currentScope := scope;
  2540. pc := section.pc;
  2541. variable := scope.firstVariable;
  2542. WHILE variable # NIL DO
  2543. IF variable.NeedsTrace() THEN
  2544. Reset (variable);
  2545. END;
  2546. variable := variable.nextVariable;
  2547. END;
  2548. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2549. WHILE parameter # NIL DO
  2550. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2551. Reset (parameter);
  2552. END;
  2553. parameter := parameter.nextParameter;
  2554. END;
  2555. INC(statCoopResetVariables, section.pc - pc);
  2556. currentScope := previousScope;
  2557. END ResetVariables;
  2558. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2559. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2560. VAR op: IntermediateCode.Operand; context: Context;
  2561. BEGIN
  2562. previousSection := section;
  2563. GetCodeSectionNameForSymbol(procedure, name);
  2564. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  2565. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE));
  2566. IF dump # NIL THEN dump := section.comments END;
  2567. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2568. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2569. Emit(Data(position,op));
  2570. Emit(Data(position,nil));
  2571. IF HasPointers (procedure.procedureScope) THEN
  2572. GetCodeSectionNameForSymbol(procedure, name);
  2573. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2574. ELSE
  2575. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2576. END;
  2577. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2578. Emit(Data(position,op));
  2579. ReturnToContext(context);
  2580. IF dump # NIL THEN dump := section.comments END;
  2581. END CreateProcedureDescriptor;
  2582. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2583. VAR import: SyntaxTree.Import;
  2584. s: Basic.MessageString;
  2585. selfName: SyntaxTree.IdentifierString;
  2586. BEGIN
  2587. moduleScope.ownerModule.GetName(selfName);
  2588. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2589. module := moduleScope.ownerModule
  2590. ELSE
  2591. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2592. IF import = NIL THEN
  2593. import := SyntaxTree.NewImport(-1,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2594. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2595. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2596. s := "Module ";
  2597. Strings.Append(s,moduleName);
  2598. Strings.Append(s," cannot be imported.");
  2599. IF force THEN
  2600. Error(position,s);
  2601. ELSIF canBeLoaded THEN
  2602. Strings.Append(s, "=> no dynamic linking.");
  2603. Warning(position, s);
  2604. canBeLoaded := FALSE;
  2605. END;
  2606. RETURN FALSE
  2607. ELSE
  2608. SELF.module.imports.AddName(moduleName)
  2609. END;
  2610. ELSIF import.module = NIL THEN (* already tried *)
  2611. RETURN FALSE
  2612. END;
  2613. module := import.module;
  2614. END;
  2615. RETURN TRUE
  2616. END AddImport;
  2617. (* needed for old binary object file format*)
  2618. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2619. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2620. BEGIN
  2621. IF AddImport(moduleName,module,TRUE) THEN
  2622. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2623. IF procedure = NIL THEN
  2624. s := "Instruction not supported on target, emulation procedure ";
  2625. Strings.Append(s,moduleName);
  2626. Strings.Append(s,".");
  2627. Strings.Append(s,procedureName);
  2628. Strings.Append(s," not present");
  2629. Error(position,s);
  2630. ELSE
  2631. StaticCallOperand(r,procedure);
  2632. ReleaseOperand(r);
  2633. fp := GetFingerprint(procedure);
  2634. END;
  2635. END;
  2636. END EnsureSymbol;
  2637. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2638. VAR exit: Label; trueL,falseL: Label;
  2639. BEGIN
  2640. trueL := NewLabel();
  2641. falseL := NewLabel();
  2642. exit := NewLabel();
  2643. Condition(x,trueL,falseL);
  2644. InitOperand(result,ModeValue);
  2645. SetLabel(trueL);
  2646. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2647. Emit(Mov(position,result.op,true));
  2648. BrL(exit);
  2649. SetLabel(falseL);
  2650. Emit(MovReplace(position,result.op,false));
  2651. SetLabel(exit);
  2652. END ConditionToValue;
  2653. PROCEDURE ValueToCondition(VAR op: Operand);
  2654. BEGIN
  2655. LoadValue(op,system.booleanType);
  2656. BrneL(trueLabel,op.op, false);
  2657. ReleaseOperand(op);
  2658. BrL(falseLabel);
  2659. END ValueToCondition;
  2660. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2661. VAR size: LONGINT;
  2662. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2663. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2664. BEGIN
  2665. ASSERT(type.form = SyntaxTree.Open);
  2666. baseType := type.arrayBase.resolved;
  2667. IF IsOpenArray(baseType) THEN
  2668. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2669. ELSE
  2670. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2671. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2672. END;
  2673. len := tag;
  2674. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2675. IntermediateCode.MakeMemory(len,addressType);
  2676. UseIntermediateOperand(len);
  2677. Reuse2(res,sizeOperand,len);
  2678. Emit(Mul(position,res,sizeOperand,len));
  2679. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2680. RETURN res
  2681. END GetArraySize;
  2682. BEGIN
  2683. type := type.resolved;
  2684. IF IsOpenArray(type) THEN
  2685. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2686. RETURN tag
  2687. ELSE
  2688. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2689. END;
  2690. ELSE
  2691. size := ToMemoryUnits(system,system.SizeOf(type));
  2692. RETURN IntermediateCode.Immediate(addressType,size)
  2693. END;
  2694. END GetDynamicSize;
  2695. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2696. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2697. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2698. BEGIN
  2699. ASSERT(type.form = SyntaxTree.Open);
  2700. baseType := type.arrayBase.resolved;
  2701. IF IsOpenArray(baseType) THEN
  2702. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2703. ELSE
  2704. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2705. END;
  2706. len := tag;
  2707. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2708. IntermediateCode.MakeMemory(len,addressType);
  2709. UseIntermediateOperand(len);
  2710. Reuse2(res,sizeOperand,len);
  2711. Emit(Mul(position,res,sizeOperand,len));
  2712. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2713. RETURN res
  2714. END GetLength;
  2715. BEGIN
  2716. type := type.resolved;
  2717. IF IsOpenArray(type) THEN
  2718. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2719. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2720. ELSE
  2721. RETURN IntermediateCode.Immediate(addressType,1)
  2722. END;
  2723. END GetArrayLength;
  2724. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2725. VAR result: IntermediateCode.Operand;
  2726. BEGIN
  2727. IF backend.cooperative THEN
  2728. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2729. ELSE
  2730. MakeMemory(result, tag, addressType, 0);
  2731. END;
  2732. RETURN result
  2733. END GetSizeFromTag;
  2734. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2735. VAR parameter: SyntaxTree.Parameter;
  2736. BEGIN
  2737. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2738. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2739. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2740. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2741. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2742. END;
  2743. RETURN GetDynamicSize(e.type, tag);
  2744. END GetArrayOfBytesSize;
  2745. (*
  2746. to find imported symbol. not needed ?
  2747. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2748. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2749. BEGIN
  2750. IF AddImport(moduleName,importedModule,FALSE) THEN
  2751. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2752. RETURN symbol
  2753. ELSE
  2754. RETURN NIL
  2755. END
  2756. END SymbolByName;
  2757. *)
  2758. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2759. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2760. BEGIN
  2761. IF AddImport(moduleName,runtimeModule,force) THEN
  2762. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2763. IF procedure = NIL THEN
  2764. s := "Procedure ";
  2765. Strings.Append(s,moduleName);
  2766. Strings.Append(s,".");
  2767. Strings.Append(s,procedureName);
  2768. Strings.Append(s," not present");
  2769. Error(position,s);
  2770. RETURN FALSE
  2771. ELSE
  2772. RETURN TRUE
  2773. END;
  2774. ELSE RETURN FALSE
  2775. END;
  2776. END GetRuntimeProcedure;
  2777. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2778. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2779. s: Basic.MessageString;
  2780. BEGIN
  2781. Basic.InitSegmentedName(name);
  2782. name[0] := Basic.MakeString(moduleName);
  2783. name[1] := Basic.MakeString(typeName);
  2784. name[2] := -1;
  2785. IF AddImport(moduleName,importedModule, FALSE) THEN
  2786. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2787. IF symbol = NIL THEN
  2788. s := "type ";
  2789. Strings.Append(s,moduleName);
  2790. Strings.Append(s,".");
  2791. Strings.Append(s,typeName);
  2792. Strings.Append(s," not present");
  2793. Error(position,s);
  2794. END;
  2795. ELSE symbol := NIL;
  2796. END;
  2797. IF importedModule = moduleScope.ownerModule THEN
  2798. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2799. ELSE
  2800. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2801. END;
  2802. RETURN symbol
  2803. END GetTypeDescriptor;
  2804. (* 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. *)
  2805. PROCEDURE CallThisChecked(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2806. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2807. pooledName: Basic.SegmentedName; size: LONGINT;
  2808. BEGIN
  2809. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2810. StaticCallOperand(result,procedure);
  2811. IF numberParameters < 0 THEN
  2812. size := ProcedureParametersSize(system,procedure);
  2813. ELSE
  2814. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2815. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2816. Error(position,"runtime call parameter count mismatch");
  2817. END;
  2818. END;
  2819. Emit(Call(position, result.op, size));
  2820. ReleaseOperand(result);
  2821. ELSE (* only static linking possible *)
  2822. ASSERT(numberParameters >= 0);
  2823. Basic.InitSegmentedName(pooledName);
  2824. pooledName[0] := Basic.MakeString(moduleName);
  2825. pooledName[1] := Basic.MakeString(procedureName);
  2826. pooledName[2] := -1;
  2827. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2828. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2829. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2830. END;
  2831. END CallThisChecked;
  2832. (* 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. *)
  2833. PROCEDURE CallThis(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2834. BEGIN
  2835. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2836. END CallThis;
  2837. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2838. VAR
  2839. left,right: Operand;
  2840. leftSize, rightSize: IntermediateCode.Operand;
  2841. saved: RegisterEntry;
  2842. reg: IntermediateCode.Operand;
  2843. procedureName: SyntaxTree.IdentifierString;
  2844. BEGIN
  2845. procedureName := "CompareString";
  2846. SaveRegisters();ReleaseUsedRegisters(saved);
  2847. Designate(leftExpression,left);
  2848. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2849. Emit(Push(position,leftSize));
  2850. ReleaseIntermediateOperand(leftSize);
  2851. Emit(Push(position,left.op));
  2852. ReleaseOperand(left);
  2853. Designate(rightExpression,right);
  2854. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2855. Emit(Push(position,rightSize));
  2856. ReleaseIntermediateOperand(rightSize);
  2857. Emit(Push(position,right.op));
  2858. ReleaseOperand(right);
  2859. IF backend.cooperative THEN
  2860. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2861. ELSE
  2862. CallThis(position,runtimeModuleName,procedureName, 4);
  2863. END;
  2864. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2865. Emit(Result(position,reg));
  2866. (*
  2867. AcquireThisRegister(int8,IntermediateCode.Result);
  2868. *)
  2869. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2870. (*
  2871. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2872. *)
  2873. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2874. ReleaseIntermediateOperand(reg);
  2875. BrL(falseLabel);
  2876. END CompareString;
  2877. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2878. VAR
  2879. left,right: Operand;
  2880. leftSize, rightSize: IntermediateCode.Operand;
  2881. saved: RegisterEntry;
  2882. procedureName: SyntaxTree.IdentifierString;
  2883. BEGIN
  2884. procedureName := "CopyString";
  2885. SaveRegisters();ReleaseUsedRegisters(saved);
  2886. Designate(leftExpression,left);
  2887. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2888. Emit(Push(position,leftSize));
  2889. ReleaseIntermediateOperand(leftSize);
  2890. Emit(Push(position,left.op));
  2891. ReleaseOperand(left);
  2892. Designate(rightExpression,right);
  2893. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2894. Emit(Push(position,rightSize));
  2895. ReleaseIntermediateOperand(rightSize);
  2896. Emit(Push(position,right.op));
  2897. ReleaseOperand(right);
  2898. IF backend.cooperative THEN
  2899. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2900. ELSE
  2901. CallThis(position,runtimeModuleName,procedureName,4);
  2902. END;
  2903. RestoreRegisters(saved);
  2904. END CopyString;
  2905. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  2906. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2907. leftType,rightType: SyntaxTree.Type;
  2908. leftExpression,rightExpression : SyntaxTree.Expression;
  2909. componentType: IntermediateCode.Type;
  2910. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  2911. size: LONGINT;
  2912. BEGIN
  2913. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2914. dest := destination; destination := emptyOperand;
  2915. leftType := x.left.type.resolved;
  2916. rightType := x.right.type.resolved;
  2917. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  2918. CASE x.operator OF
  2919. Scanner.Or:
  2920. (* shortcut evaluation of left OR right *)
  2921. IF ~conditional THEN ConditionToValue(x);
  2922. ELSE
  2923. next := NewLabel();
  2924. Condition(x.left,trueLabel,next);
  2925. SetLabel(next);
  2926. Condition(x.right,trueLabel,falseLabel);
  2927. END;
  2928. |Scanner.And:
  2929. (* shortcut evaluation of left & right *)
  2930. IF ~conditional THEN ConditionToValue(x);
  2931. ELSE
  2932. next := NewLabel();
  2933. Condition(x.left,next,falseLabel);
  2934. SetLabel(next);
  2935. Condition(x.right,trueLabel,falseLabel);
  2936. END;
  2937. |Scanner.Is:
  2938. IF ~conditional THEN ConditionToValue(x);
  2939. ELSE
  2940. (* get type desc tag *)
  2941. IF IsPointerToRecord(leftType,recordType) THEN
  2942. Evaluate(x.left,left);
  2943. Dereference(left,recordType,IsUnsafePointer(leftType))
  2944. ELSE
  2945. Designate(x.left,left);
  2946. END;
  2947. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  2948. ReleaseOperand(left);
  2949. END;
  2950. |Scanner.Plus:
  2951. Evaluate(x.left,left);
  2952. Evaluate(x.right,right);
  2953. IF leftType IS SyntaxTree.SetType THEN
  2954. InitOperand(result,ModeValue);
  2955. Reuse2a(result.op,left.op,right.op,dest);
  2956. Emit(Or(position,result.op,left.op,right.op));
  2957. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2958. InitOperand(result,ModeValue);
  2959. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2960. Reuse2(result.tag,left.tag,right.tag);
  2961. Emit(Add(position,result.op,left.op,right.op));
  2962. Emit(Add(position,result.tag,left.tag,right.tag))
  2963. ELSE
  2964. InitOperand(result,ModeValue);
  2965. Reuse2a(result.op,left.op,right.op,dest);
  2966. Emit(Add(position,result.op,left.op,right.op));
  2967. END;
  2968. ReleaseOperand(left); ReleaseOperand(right);
  2969. |Scanner.Minus:
  2970. Evaluate(x.left,left);
  2971. Evaluate(x.right,right);
  2972. IF leftType IS SyntaxTree.SetType THEN
  2973. InitOperand(result,ModeValue);
  2974. Reuse1(result.op,right.op);
  2975. Emit(Not(position,result.op,right.op));
  2976. ReleaseOperand(right);
  2977. Emit(And(position,result.op,result.op,left.op));
  2978. ReleaseOperand(left);
  2979. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2980. InitOperand(result,ModeValue);
  2981. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2982. Reuse2(result.tag,left.tag,right.tag);
  2983. Emit(Sub(position,result.op,left.op,right.op));
  2984. Emit(Sub(position,result.tag,left.tag,right.tag));
  2985. ReleaseOperand(left); ReleaseOperand(right)
  2986. ELSE
  2987. InitOperand(result,ModeValue);
  2988. Reuse2a(result.op,left.op,right.op,dest);
  2989. Emit(Sub(position,result.op,left.op,right.op));
  2990. ReleaseOperand(left); ReleaseOperand(right);
  2991. END;
  2992. |Scanner.Times:
  2993. Evaluate(x.left,left);
  2994. Evaluate(x.right,right);
  2995. IF leftType IS SyntaxTree.SetType THEN
  2996. InitOperand(result,ModeValue);
  2997. Reuse2a(result.op,left.op,right.op,dest);
  2998. Emit(And(position,result.op,left.op,right.op));
  2999. ELSIF (x.type.resolved IS SyntaxTree.IntegerType) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  3000. InitOperand(result,ModeValue);
  3001. Reuse1a(result.op,left.op,dest);
  3002. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  3003. Emit(Shl(position,result.op,left.op,right.op));
  3004. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3005. InitOperand(result, ModeValue);
  3006. componentType := left.op.type;
  3007. (* TODO: review this *)
  3008. (*
  3009. result.op = left.op * right.op - left.tag * right.tag
  3010. result.tag = left.tag * right.op + left.op * right.tag
  3011. *)
  3012. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3013. Emit(Mul(position,result.op, left.op, right.op));
  3014. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3015. Emit(Mul(position,tempReg, left.tag, right.tag));
  3016. Emit(Sub(position,result.op, result.op, tempReg));
  3017. Reuse2(result.tag, left.tag, right.op);
  3018. Emit(Mul(position,result.tag, left.tag, right.op));
  3019. Emit(Mul(position,tempReg, left.op, right.tag));
  3020. Emit(Add(position,result.tag, result.tag, tempReg));
  3021. ReleaseIntermediateOperand(tempReg)
  3022. ELSE
  3023. InitOperand(result,ModeValue);
  3024. Reuse2a(result.op,left.op,right.op,dest);
  3025. Emit(Mul(position,result.op,left.op,right.op));
  3026. END;
  3027. ReleaseOperand(left); ReleaseOperand(right);
  3028. |Scanner.Div:
  3029. Evaluate(x.left,left);
  3030. Evaluate(x.right,right);
  3031. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  3032. InitOperand(result,ModeValue);
  3033. Reuse1a(result.op,left.op,dest);
  3034. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  3035. Emit(Shr(position,result.op,left.op,right.op));
  3036. ELSE
  3037. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3038. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3039. IF ~isUnchecked THEN
  3040. exit := NewLabel();
  3041. BrltL(exit,zero,right.op);
  3042. EmitTrap(position,NegativeDivisorTrap);
  3043. SetLabel(exit);
  3044. END;
  3045. END;
  3046. InitOperand(result,ModeValue);
  3047. Reuse2a(result.op,left.op,right.op,dest);
  3048. Emit(Div(position,result.op,left.op,right.op));
  3049. END;
  3050. ReleaseOperand(left); ReleaseOperand(right);
  3051. |Scanner.Mod:
  3052. Evaluate(x.left,left);
  3053. Evaluate(x.right,right);
  3054. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  3055. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system,x.type),value-1);
  3056. InitOperand(result,ModeValue);
  3057. Reuse1a(result.op,left.op,dest);
  3058. Emit(And(position,result.op,left.op,right.op));
  3059. ELSE
  3060. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3061. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3062. IF ~isUnchecked THEN
  3063. exit := NewLabel();
  3064. BrltL(exit,zero,right.op);
  3065. EmitTrap(position,NegativeDivisorTrap);
  3066. SetLabel(exit);
  3067. END;
  3068. END;
  3069. InitOperand(result,ModeValue);
  3070. Reuse2a(result.op,left.op,right.op,dest);
  3071. Emit(Mod(position,result.op,left.op,right.op));
  3072. END;
  3073. ReleaseOperand(left); ReleaseOperand(right);
  3074. |Scanner.Slash:
  3075. Evaluate(x.left,left);
  3076. Evaluate(x.right,right);
  3077. IF leftType IS SyntaxTree.SetType THEN
  3078. InitOperand(result,ModeValue);
  3079. Reuse2a(result.op,left.op,right.op,dest);
  3080. Emit(Xor(position,result.op,left.op,right.op));
  3081. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3082. InitOperand(result,ModeValue);
  3083. componentType := left.op.type;
  3084. (* review this *)
  3085. (*
  3086. divisor = right.op * right.op + right.tag * right.tag
  3087. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3088. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3089. *)
  3090. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3091. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3092. Emit(Mul(position,tempReg, right.op, right.op));
  3093. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3094. Emit(Add(position,tempReg, tempReg, tempReg2));
  3095. result.op := tempReg2;
  3096. Emit(Mul(position,result.op, left.op, right.op));
  3097. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3098. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3099. Emit(Add(position,result.op, result.op, tempReg2));
  3100. Emit(Div(position,result.op, result.op, tempReg));
  3101. Reuse2(result.tag, left.tag, right.op);
  3102. Emit(Mul(position,result.tag, left.tag, right.op));
  3103. Emit(Mul(position,tempReg2, left.op, right.tag));
  3104. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3105. Emit(Div(position,result.tag, result.tag, tempReg));
  3106. ReleaseIntermediateOperand(tempReg);
  3107. ReleaseIntermediateOperand(tempReg2)
  3108. ELSE
  3109. InitOperand(result,ModeValue);
  3110. Reuse2a(result.op,left.op,right.op,dest);
  3111. Emit(Div(position,result.op,left.op,right.op));
  3112. END;
  3113. ReleaseOperand(left); ReleaseOperand(right);
  3114. |Scanner.Equal:
  3115. IF ~conditional THEN ConditionToValue(x);
  3116. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3117. CompareString(BreqL,x.left,x.right);
  3118. ELSE
  3119. Evaluate(x.left,left);
  3120. Evaluate(x.right,right);
  3121. IF leftType IS SyntaxTree.RangeType THEN
  3122. ASSERT(rightType IS SyntaxTree.RangeType);
  3123. BrneL(falseLabel, left.op, right.op); (* first *)
  3124. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3125. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3126. ReleaseOperand(left); ReleaseOperand(right);
  3127. BrL(trueLabel)
  3128. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3129. BrneL(falseLabel, left.op, right.op); (* first *)
  3130. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3131. ReleaseOperand(left); ReleaseOperand(right);
  3132. BrL(trueLabel)
  3133. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3134. (* TODO: review this *)
  3135. BrneL(falseLabel, left.op, right.op); (* real part *)
  3136. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3137. ReleaseOperand(left); ReleaseOperand(right);
  3138. BrL(trueLabel)
  3139. ELSE
  3140. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3141. ReleaseOperand(left); ReleaseOperand(right);
  3142. BrL(trueLabel);
  3143. END;
  3144. END;
  3145. |Scanner.LessEqual:
  3146. IF ~conditional THEN ConditionToValue(x);
  3147. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3148. CompareString(BrgeL,x.right,x.left);
  3149. ELSE
  3150. Evaluate(x.left,left);
  3151. Evaluate(x.right,right);
  3152. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3153. Reuse1(temp.op,right.op);
  3154. Emit(And(position,temp.op,left.op,right.op));
  3155. ReleaseOperand(right);
  3156. BreqL(trueLabel,temp.op,left.op);
  3157. BrL(falseLabel);
  3158. ReleaseOperand(temp);ReleaseOperand(left);
  3159. ELSE
  3160. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3161. ReleaseOperand(left); ReleaseOperand(right);
  3162. BrL(trueLabel);
  3163. END;
  3164. END;
  3165. |Scanner.Less:
  3166. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3167. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.LessEqual);
  3168. leftExpression.SetType(system.booleanType);
  3169. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3170. rightExpression.SetType(system.booleanType);
  3171. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3172. leftExpression.SetType(system.booleanType);
  3173. Expression(leftExpression);
  3174. ELSIF ~conditional THEN ConditionToValue(x);
  3175. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3176. CompareString(BrltL,x.left,x.right);
  3177. ELSE
  3178. Evaluate(x.left,left);
  3179. Evaluate(x.right,right);
  3180. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3181. ReleaseOperand(left); ReleaseOperand(right);
  3182. BrL(trueLabel);
  3183. END;
  3184. |Scanner.Greater:
  3185. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3186. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.GreaterEqual);
  3187. leftExpression.SetType(system.booleanType);
  3188. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3189. rightExpression.SetType(system.booleanType);
  3190. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3191. leftExpression.SetType(system.booleanType);
  3192. Expression(leftExpression);
  3193. ELSIF ~conditional THEN ConditionToValue(x);
  3194. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3195. CompareString(BrltL,x.right,x.left);
  3196. ELSE
  3197. Evaluate(x.left,left);
  3198. Evaluate(x.right,right);
  3199. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3200. ReleaseOperand(left); ReleaseOperand(right);
  3201. BrL(trueLabel);
  3202. END;
  3203. |Scanner.GreaterEqual:
  3204. IF ~conditional THEN ConditionToValue(x);
  3205. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3206. CompareString(BrgeL,x.left,x.right);
  3207. ELSE
  3208. Evaluate(x.left,left);
  3209. Evaluate(x.right,right);
  3210. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3211. Reuse1(temp.op,left.op);
  3212. Emit(And(position,temp.op,left.op,right.op));
  3213. ReleaseOperand(left);
  3214. BreqL(trueLabel, temp.op,right.op);
  3215. ReleaseOperand(temp); ReleaseOperand(right);
  3216. BrL(falseLabel);
  3217. ELSE
  3218. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3219. ReleaseOperand(left); ReleaseOperand(right);
  3220. BrL(trueLabel);
  3221. END;
  3222. END;
  3223. |Scanner.Unequal:
  3224. IF ~conditional THEN ConditionToValue(x);
  3225. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3226. CompareString(BrneL,x.left,x.right);
  3227. ELSE
  3228. Evaluate(x.left,left);
  3229. Evaluate(x.right,right);
  3230. IF leftType IS SyntaxTree.RangeType THEN
  3231. ASSERT(rightType IS SyntaxTree.RangeType);
  3232. BrneL(trueLabel, left.op, right.op); (* first *)
  3233. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3234. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3235. ReleaseOperand(left); ReleaseOperand(right);
  3236. BrL(falseLabel)
  3237. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3238. BrneL(trueLabel, left.op, right.op); (* first *)
  3239. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3240. ReleaseOperand(left); ReleaseOperand(right);
  3241. BrL(falseLabel)
  3242. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3243. (* TODO: review this *)
  3244. BrneL(trueLabel, left.op, right.op); (* real part *)
  3245. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3246. ReleaseOperand(left); ReleaseOperand(right);
  3247. BrL(falseLabel)
  3248. ELSE
  3249. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3250. ReleaseOperand(left); ReleaseOperand(right);
  3251. BrL(trueLabel);
  3252. END;
  3253. END;
  3254. |Scanner.In:
  3255. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3256. Evaluate(x.left,left);
  3257. Evaluate(x.right,right);
  3258. Convert(left.op,setType);
  3259. ReuseCopy(temp.op,right.op);
  3260. Emit(Shr(position,temp.op,temp.op,left.op));
  3261. ReleaseOperand(right); ReleaseOperand(left);
  3262. IntermediateCode.InitImmediate(one,setType,1);
  3263. Emit(And(position,temp.op,temp.op,one));
  3264. IF conditional THEN
  3265. IntermediateCode.InitImmediate(zero,setType,0);
  3266. BrneL(trueLabel,temp.op,zero);
  3267. ReleaseOperand(temp);
  3268. BrL(falseLabel);
  3269. ELSE
  3270. Convert(temp.op,bool);
  3271. result.mode := ModeValue;
  3272. result.op := temp.op;
  3273. result.tag := nil; (* may be left over from calls to evaluate *)
  3274. END;
  3275. ELSE
  3276. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3277. IF x.operator = Scanner.Questionmarks THEN
  3278. leftExpression := x.left;
  3279. rightExpression := x.right;
  3280. ELSE
  3281. leftExpression := x.right;
  3282. rightExpression := x.left;
  3283. END;
  3284. Evaluate(leftExpression, left);
  3285. Emit(Push(position,left.op));
  3286. ReleaseOperand(left);
  3287. Designate(rightExpression, right);
  3288. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3289. IF ~backend.cellsAreObjects THEN
  3290. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3291. END;
  3292. Emit(Push(position,right.op));
  3293. ReleaseOperand(right);
  3294. IF backend.cellsAreObjects THEN
  3295. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3296. ELSE
  3297. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3298. END;
  3299. InitOperand(result, ModeValue);
  3300. result.op := NewRegisterOperand(bool);
  3301. Emit(Result(position,result.op));
  3302. IF conditional THEN
  3303. IntermediateCode.InitImmediate(zero,setType,0);
  3304. BrneL(trueLabel,result.op,zero);
  3305. ReleaseOperand(result);
  3306. BrL(falseLabel);
  3307. END;
  3308. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3309. leftExpression := x.left;
  3310. rightExpression := x.right;
  3311. Evaluate(leftExpression, left);
  3312. Emit(Push(position,left.op));
  3313. ReleaseOperand(left);
  3314. Evaluate(rightExpression, right);
  3315. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3316. IF ~backend.cellsAreObjects THEN
  3317. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3318. END;
  3319. Emit(Push(position,right.op));
  3320. ReleaseOperand(right);
  3321. IF backend.cellsAreObjects THEN
  3322. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3323. ELSE
  3324. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3325. END;
  3326. InitOperand(result, ModeValue);
  3327. result.op := NewRegisterOperand(bool);
  3328. Emit(Result(position,result.op));
  3329. IF conditional THEN
  3330. IntermediateCode.InitImmediate(zero,setType,0);
  3331. BrneL(trueLabel,result.op,zero);
  3332. ReleaseOperand(result);
  3333. BrL(falseLabel);
  3334. END;
  3335. ELSE
  3336. HALT(100);
  3337. END;
  3338. END;
  3339. destination := dest;
  3340. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3341. END VisitBinaryExpression;
  3342. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3343. VAR localResult, operand: Operand;
  3344. BEGIN
  3345. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3346. InitOperand(localResult, ModeValue);
  3347. ASSERT(x.first # NIL);
  3348. Evaluate(x.first, operand);
  3349. localResult.op := operand.op;
  3350. ReleaseOperand(operand);
  3351. UseIntermediateOperand(localResult.op);
  3352. ASSERT(x.last # NIL);
  3353. Evaluate(x.last, operand);
  3354. localResult.tag := operand.op;
  3355. ReleaseOperand(operand);
  3356. UseIntermediateOperand(localResult.tag);
  3357. IF x.step # NIL THEN
  3358. Evaluate(x.step, operand);
  3359. localResult.extra := operand.op;
  3360. ReleaseOperand(operand);
  3361. UseIntermediateOperand(localResult.extra);
  3362. END;
  3363. result := localResult;
  3364. IF Trace THEN TraceExit("VisitRangeExpression") END
  3365. END VisitRangeExpression;
  3366. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3367. BEGIN
  3368. HALT(100); (* should never be evaluated *)
  3369. END VisitTensorRangeExpression;
  3370. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3371. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3372. BEGIN
  3373. IF Trace THEN TraceEnter("VisitConversion") END;
  3374. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3375. dest := destination; destination := emptyOperand;
  3376. Evaluate(x.expression,old);
  3377. InitOperand(result,ModeValue);
  3378. result.op := old.op;
  3379. ASSERT(result.op.mode # 0);
  3380. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3381. (* convert TO a complex number *)
  3382. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3383. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3384. ASSERT(result.op.mode # 0);
  3385. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3386. (* convert FROM a complex number TO a complex number*)
  3387. result.tag := old.tag;
  3388. ASSERT(result.tag.mode # 0);
  3389. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3390. ASSERT(result.tag.mode # 0)
  3391. ELSE
  3392. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3393. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3394. END
  3395. ELSE
  3396. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3397. ASSERT(result.op.mode # 0);
  3398. result.tag := old.tag; (*! probably never used *)
  3399. END;
  3400. destination := dest;
  3401. IF Trace THEN TraceExit("VisitConversion") END;
  3402. END VisitConversion;
  3403. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3404. BEGIN
  3405. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3406. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3407. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3408. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3409. END VisitTypeDeclaration;
  3410. (** designators (expressions) *)
  3411. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3412. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3413. BEGIN
  3414. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3415. IF x.left # NIL THEN Expression(x.left) END;
  3416. Symbol(x.symbol,result);
  3417. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3418. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3419. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3420. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3421. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3422. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3423. END;
  3424. END;
  3425. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3426. END VisitSymbolDesignator;
  3427. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3428. BEGIN
  3429. IF isUnchecked THEN RETURN END;
  3430. IF tagsAvailable THEN
  3431. TrapC(BrltL,index,length,IndexCheckTrap);
  3432. END;
  3433. END BoundCheck;
  3434. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3435. VAR d: IntermediateCode.Operand;
  3436. BEGIN
  3437. IF isUnchecked THEN RETURN END;
  3438. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3439. TrapC(op,dim,d,ArraySizeTrap);
  3440. ReleaseIntermediateOperand(d);
  3441. END DimensionCheck;
  3442. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3443. VAR
  3444. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3445. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3446. expression: SyntaxTree.Expression;
  3447. resultingType, leftType, baseType: SyntaxTree.Type;
  3448. skipLabel1: Label;
  3449. i, indexListSize, indexDim, rangeCount, indexCount, tensorRangeCount, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3450. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3451. variableOp: Operand;
  3452. variable: SyntaxTree.Variable;
  3453. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList; VAR indexCount: LONGINT; VAR rangeCount: LONGINT; VAR tensorRangeCount: LONGINT);
  3454. VAR expression: SyntaxTree.Expression;
  3455. BEGIN
  3456. (* count the number of indices, ranges and tensorRanges in the index list *)
  3457. indexCount := 0; rangeCount := 0; tensorRangeCount := 0;
  3458. FOR i := 0 TO parameters.Length() - 1 DO
  3459. expression := parameters.GetExpression(i);
  3460. IF expression IS SyntaxTree.TensorRangeExpression THEN INC(tensorRangeCount)
  3461. ELSIF (expression.type # NIL) & (expression.type.resolved IS SyntaxTree.RangeType) THEN INC(indexCount)
  3462. ELSE INC(indexCount)
  3463. END
  3464. END;
  3465. END CountIndices;
  3466. BEGIN
  3467. ASSERT(tagsAvailable);
  3468. resultingType := x.type.resolved; (* resulting type *)
  3469. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3470. InitOperand(localResult, ModeReference);
  3471. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3472. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3473. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3474. (* a globally defined array destination tag is available -> use and invalidate it*)
  3475. localResult.tag := arrayDestinationTag;
  3476. IntermediateCode.InitOperand(arrayDestinationTag)
  3477. ELSE
  3478. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3479. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE);
  3480. Symbol(variable, variableOp);
  3481. ReuseCopy(localResult.tag, variableOp.op);
  3482. ReleaseOperand(variableOp);
  3483. END
  3484. END;
  3485. indexListSize := x.parameters.Length();
  3486. CountIndices(x.parameters, indexCount, rangeCount, tensorRangeCount);
  3487. ASSERT(tensorRangeCount <= 1);
  3488. (* designate the array to be indexed over, perform tensor range check if known *)
  3489. Designate(x.left, array);
  3490. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3491. Dereference(array, leftType,FALSE);
  3492. IF tensorRangeCount=0 THEN
  3493. DimensionCheck(array.tag, IntermediateCode.Immediate(int32, rangeCount+indexCount), BreqL)
  3494. END
  3495. END;
  3496. (* determine source and destination dimension offsets; this depends on if the list starts with a '?' *)
  3497. IF x.parameters.GetExpression(0) IS SyntaxTree.TensorRangeExpression THEN
  3498. srcDimOffset := -indexListSize;
  3499. destDimOffset := -rangeCount
  3500. ELSE
  3501. srcDimOffset := 0;
  3502. destDimOffset := 0
  3503. END;
  3504. indexDim := 0;
  3505. (* use address of source array as basis *)
  3506. (*
  3507. ReuseCopy(localResult.op, array.op);
  3508. *)
  3509. localResult.op := array.op;
  3510. UseIntermediateOperand(localResult.op);
  3511. (* go through the index list *)
  3512. FOR i := 0 TO indexListSize - 1 DO
  3513. expression := x.parameters.GetExpression(i);
  3514. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3515. (* nothing to do *)
  3516. ELSE
  3517. (* determine which dimension of source array is currently looked at *)
  3518. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3519. (* get the memory operand pointing to array descriptor dimension *)
  3520. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3521. (* make a reusable register from it *)
  3522. ReuseCopy(srcDim, tmp);
  3523. ReleaseIntermediateOperand(tmp);
  3524. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3525. ELSE
  3526. srcDim := IntermediateCode.Immediate(int32, i)
  3527. END;
  3528. (* get length and increment of source array for current dimension *)
  3529. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3530. Convert(sourceLength.op, sizeType);
  3531. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3532. Convert(sourceIncrement.op, sizeType);
  3533. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3534. ReleaseIntermediateOperand(srcDim);
  3535. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3536. (* SINGLE INDEX *)
  3537. Evaluate(expression, index);
  3538. ReleaseIntermediateOperand(index.tag);
  3539. index.tag := emptyOperand;
  3540. Convert(index.op, sizeType);
  3541. (* lower bound check *)
  3542. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3543. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3544. ELSIF isUnchecked THEN (* do nothing *)
  3545. ELSE
  3546. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3547. END;
  3548. (* upper bound check *)
  3549. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3550. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3551. ELSIF isUnchecked THEN (* do nothing *)
  3552. ELSE
  3553. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3554. END;
  3555. ReleaseOperand(sourceLength);
  3556. Convert(index.op, addressType);
  3557. summand := index.op;
  3558. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3559. (* RANGE OF INDICES *)
  3560. Evaluate(expression, range);
  3561. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3562. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3563. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3564. ReleaseOperand(range);
  3565. Convert(firstIndex, sizeType);
  3566. Convert(lastIndex, sizeType);
  3567. Convert(stepSize, sizeType);
  3568. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3569. if it is 'MAX(LONGINT)' *)
  3570. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3571. TransferToRegister(lastIndex, lastIndex);
  3572. skipLabel1 := NewLabel();
  3573. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3574. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3575. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3576. SetLabel(skipLabel1)
  3577. END;
  3578. (* check if step size is valid *)
  3579. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3580. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3581. ELSIF isUnchecked THEN (* do nothing *)
  3582. ELSE
  3583. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3584. END;
  3585. (* check lower bound check *)
  3586. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3587. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3588. ELSIF isUnchecked THEN (* do nothing *)
  3589. ELSE
  3590. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3591. END;
  3592. (* check upper bound check *)
  3593. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3594. (* statically open range: nothing to do *)
  3595. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3596. ASSERT(staticLastIndex < staticSourceLength)
  3597. ELSIF isUnchecked THEN (* do nothing *)
  3598. ELSE
  3599. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3600. END;
  3601. (* determine length of target array for current dimension *)
  3602. (* 1. incorporate last index: *)
  3603. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3604. (* last index is static *)
  3605. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3606. targetLength := sourceLength.op
  3607. ELSE
  3608. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3609. END;
  3610. UseIntermediateOperand(targetLength);
  3611. ELSE
  3612. (* targetLength := lastIndex + 1
  3613. Reuse1(targetLength, lastIndex);
  3614. *)
  3615. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3616. END;
  3617. ReleaseOperand(sourceLength);
  3618. ReleaseIntermediateOperand(lastIndex);
  3619. (* 2. incorporate first index: *)
  3620. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3621. (* first index and current target length are static *)
  3622. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3623. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3624. (* first index = 0: nothing to do *)
  3625. ELSE
  3626. (* targetLength := targetLength - firstIndex *)
  3627. TransferToRegister(targetLength, targetLength);
  3628. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3629. END;
  3630. (* clip negative lengths to 0 *)
  3631. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3632. IF staticTargetLength < 0 THEN
  3633. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3634. END
  3635. ELSE
  3636. skipLabel1 := NewLabel();
  3637. TransferToRegister(targetLength, targetLength);
  3638. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3639. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3640. SetLabel(skipLabel1)
  3641. END;
  3642. (* 3. incorporate index step size: *)
  3643. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3644. (*step size and current target length are static *)
  3645. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3646. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3647. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3648. (* step size = 1: nothing to do *)
  3649. ELSE
  3650. (* emit code for this:
  3651. targetLength := (targetLength-1) DIV stepSize +1;
  3652. *)
  3653. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3654. DivInt(targetLength, targetLength, stepSize);
  3655. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3656. END;
  3657. (* determine increment of target array for current dimension *)
  3658. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3659. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3660. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3661. (* step size = 1 *)
  3662. targetIncrement := sourceIncrement.op;
  3663. UseIntermediateOperand(targetIncrement)
  3664. ELSE
  3665. (* targetIncrement := sourceIncrement * stepSize *)
  3666. Reuse1(targetIncrement, stepSize);
  3667. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3668. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3669. END;
  3670. ReleaseIntermediateOperand(stepSize);
  3671. (* write length and increment of target array to descriptor *)
  3672. IF destDimOffset < 0 THEN
  3673. (* determine which dimension of target array is currently looked at *)
  3674. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3675. TransferToRegister(destDim, tmp);
  3676. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, indexDim + destDimOffset));
  3677. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3678. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3679. ReleaseIntermediateOperand(destDim)
  3680. ELSE
  3681. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3682. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim)
  3683. END;
  3684. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3685. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3686. INC(indexDim);
  3687. Convert(firstIndex, addressType);
  3688. TransferToRegister(summand, firstIndex);
  3689. ELSE HALT(100);
  3690. END;
  3691. (*
  3692. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3693. *)
  3694. Convert(sourceIncrement.op, addressType);
  3695. Convert(summand, addressType);
  3696. MulInt(summand, summand, sourceIncrement.op);
  3697. ReleaseIntermediateOperand(sourceIncrement.op);
  3698. AddInt(localResult.op, localResult.op, summand);
  3699. ReleaseIntermediateOperand(summand);
  3700. END
  3701. END;
  3702. result := localResult;
  3703. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3704. ReleaseIntermediateOperand(result.tag);
  3705. result.tag := TypeDescriptorAdr(resultingType);
  3706. IF ~newObjectFile THEN
  3707. IntermediateCode.MakeMemory(result.tag,addressType);
  3708. END;
  3709. ELSIF IsDelegate(resultingType) THEN
  3710. ReleaseIntermediateOperand(result.tag);
  3711. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3712. UseIntermediateOperand(result.tag);
  3713. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3714. ReleaseIntermediateOperand(result.tag);
  3715. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3716. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3717. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3718. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3719. (* finalize target array descriptor *)
  3720. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3721. (* write lengths and increments of target array for remaining dimensions *)
  3722. i := indexListSize;
  3723. WHILE indexDim < targetArrayDimensionality DO
  3724. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3725. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3726. ReleaseOperand(sourceLength);
  3727. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3728. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3729. ReleaseOperand(sourceIncrement);
  3730. INC(i); INC(indexDim);
  3731. END;
  3732. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3733. tmp := nil;
  3734. ELSE
  3735. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3736. END;
  3737. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3738. ReleaseIntermediateOperand(tmp);
  3739. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3740. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3741. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3742. ELSE
  3743. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3744. END;
  3745. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3746. ReleaseIntermediateOperand(tmp);
  3747. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3748. (* write dimensionality *)
  3749. IF targetArrayDimensionality # 0 THEN
  3750. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3751. END;
  3752. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3753. END;
  3754. ReleaseOperand(array);
  3755. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3756. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3757. END;
  3758. END MathIndexDesignator;
  3759. (* TENTATIVE *)
  3760. PROCEDURE DumpOperand(operand: Operand);
  3761. BEGIN
  3762. D.Log.String(" op = ");
  3763. IntermediateCode.DumpOperand(D.Log, operand.op );
  3764. D.Log.Ln;
  3765. D.Log.String(" tag = ");
  3766. IntermediateCode.DumpOperand(D.Log, operand.tag );
  3767. D.Log.Ln;
  3768. D.Log.String(" extra = ");
  3769. IntermediateCode.DumpOperand(D.Log, operand.extra );
  3770. D.Log.Ln;
  3771. D.Log.Update
  3772. END DumpOperand;
  3773. (* get the length of an array , trying to make use of static information *)
  3774. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3775. VAR res: IntermediateCode.Operand; size: LONGINT;
  3776. BEGIN
  3777. type := type.resolved;
  3778. IF type IS SyntaxTree.ArrayType THEN
  3779. WITH type: SyntaxTree.ArrayType DO
  3780. IF type.form = SyntaxTree.Static THEN
  3781. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3782. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3783. Evaluate(type.length, op);
  3784. ReleaseIntermediateOperand(op.tag);
  3785. RETURN op.op;*)
  3786. ELSE
  3787. res := tag;
  3788. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3789. IntermediateCode.MakeMemory(res,addressType);
  3790. UseIntermediateOperand(res);
  3791. RETURN res
  3792. END
  3793. END;
  3794. ELSE
  3795. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3796. RETURN IntermediateCode.Immediate(addressType,size);
  3797. END;
  3798. END ArrayLength;
  3799. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3800. BEGIN
  3801. ReleaseIntermediateOperand(res);
  3802. IF IsImmediate(x) & IsImmediate(y) THEN
  3803. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3804. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3805. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3806. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3807. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3808. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3809. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3810. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3811. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3812. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3813. UseIntermediateOperand(res);
  3814. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3815. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3816. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3817. UseIntermediateOperand(res);
  3818. ELSE
  3819. IF ~ReusableRegister(res) THEN
  3820. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3821. ELSE
  3822. UseIntermediateOperand(res);
  3823. END;
  3824. IF IsImmediate(x) & (x.intValue = 0) THEN
  3825. Emit(Mov(position,res,y))
  3826. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3827. Emit(Mov(position,res,x))
  3828. ELSE
  3829. Emit(Add(position,res, x, y));
  3830. END;
  3831. END;
  3832. END AddInt;
  3833. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3834. BEGIN
  3835. ReleaseIntermediateOperand(res);
  3836. IF IsImmediate(x) & IsImmediate(y) THEN
  3837. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3838. ELSE
  3839. IF ~ReusableRegister(res) THEN
  3840. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3841. ELSE UseIntermediateOperand(res);
  3842. END;
  3843. IF IsImmediate(x) & (x.intValue = 1) THEN
  3844. Emit(Mov(position,res,y))
  3845. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3846. Emit(Mov(position,res,x))
  3847. ELSE
  3848. Emit(Mul(position,res, x, y));
  3849. END;
  3850. END;
  3851. END MulInt;
  3852. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3853. BEGIN
  3854. ReleaseIntermediateOperand(res);
  3855. IF IsImmediate(x) & IsImmediate(y) THEN
  3856. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3857. ELSE
  3858. IF ~ReusableRegister(res) THEN
  3859. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3860. ELSE UseIntermediateOperand(res);
  3861. END;
  3862. IF IsImmediate(x) & (x.intValue = 1) THEN
  3863. Emit(Mov(position,res,y))
  3864. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3865. Emit(Mov(position,res,x))
  3866. ELSE
  3867. Emit(Div(position,res, x, y));
  3868. END;
  3869. END;
  3870. END DivInt;
  3871. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3872. VAR length,res: IntermediateCode.Operand; type: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3873. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3874. BEGIN
  3875. type := x.left.type.resolved;
  3876. IF type IS SyntaxTree.StringType THEN
  3877. atype := SyntaxTree.NewArrayType(-1, NIL, SyntaxTree.Static);
  3878. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3879. atype.SetLength(Global.NewIntegerValue(system,-1, type(SyntaxTree.StringType).length));
  3880. type := atype;
  3881. x.left.SetType(type);
  3882. END;
  3883. IntermediateCode.InitImmediate(res,addressType,0);
  3884. maxDim := x.parameters.Length()-1;
  3885. FOR i := 0 TO maxDim DO
  3886. e := x.parameters.GetExpression(i);
  3887. Evaluate(e,index);
  3888. Convert(index.op,addressType);
  3889. AddInt(res, res, index.op);
  3890. IF i = 0 THEN
  3891. (*
  3892. ReuseCopy(res, index.op);
  3893. *)
  3894. Designate(x.left,array);
  3895. type := x.left.type.resolved;
  3896. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3897. Dereference(array, type, FALSE);
  3898. END;
  3899. (*
  3900. ELSE AddInt(res, res, index.op);
  3901. *)
  3902. END;
  3903. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  3904. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  3905. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  3906. BoundCheck(index.op, length);
  3907. END;
  3908. ReleaseIntermediateOperand(length);
  3909. END;
  3910. ReleaseOperand(index);
  3911. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3912. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  3913. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3914. MulInt(res,res,length);
  3915. END;
  3916. ReleaseIntermediateOperand(length);
  3917. END;
  3918. IF (type IS SyntaxTree.ArrayType) THEN
  3919. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  3920. size := StaticSize(system, type);
  3921. IF size # 1 THEN
  3922. length := IntermediateCode.Immediate(addressType,size);
  3923. MulInt(res,res,length);
  3924. END;
  3925. ELSE
  3926. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  3927. IF size # 1 THEN
  3928. length := IntermediateCode.Immediate(addressType,size);
  3929. MulInt(res,res,length);
  3930. END;
  3931. END;
  3932. END;
  3933. AddInt(res,res,array.op);
  3934. InitOperand(result,ModeReference);
  3935. result.op := res;
  3936. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  3937. ReleaseIntermediateOperand(result.tag);
  3938. result.tag := TypeDescriptorAdr(type);
  3939. IF ~newObjectFile THEN
  3940. IntermediateCode.MakeMemory(result.tag,addressType);
  3941. END
  3942. ELSIF IsDelegate(type) THEN
  3943. ReleaseIntermediateOperand(result.tag);
  3944. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3945. UseIntermediateOperand(result.tag);
  3946. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3947. ReleaseIntermediateOperand(result.tag);
  3948. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  3949. ELSIF (type IS SyntaxTree.ArrayType) THEN
  3950. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  3951. END;
  3952. ReleaseOperand(array);
  3953. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  3954. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3955. END;
  3956. END IndexDesignator;
  3957. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  3958. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  3959. BEGIN
  3960. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  3961. dest := destination; destination := emptyOperand;
  3962. type := x.left.type.resolved;
  3963. IF type IS SyntaxTree.MathArrayType THEN
  3964. MathIndexDesignator(x);
  3965. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  3966. IndexDesignator(x);
  3967. END;
  3968. destination := dest;
  3969. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  3970. END VisitIndexDesignator;
  3971. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  3972. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  3973. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  3974. procedure: SyntaxTree.Procedure;
  3975. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  3976. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  3977. BEGIN
  3978. variable := GetTemporaryVariable(expression.left.type, FALSE);
  3979. parameters := expression.parameters;
  3980. moduleName := "FoxArrayBase";
  3981. procedureName := "CopyDescriptor";
  3982. IF AddImport(moduleName,arrayBase,TRUE) THEN
  3983. SaveRegisters();ReleaseUsedRegisters(saved);
  3984. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3985. IF procedure = NIL THEN
  3986. s := "procedure ";
  3987. Strings.Append(s,moduleName);
  3988. Strings.Append(s,".");
  3989. Strings.Append(s,procedureName);
  3990. Strings.Append(s," not present");
  3991. Error(position,s);
  3992. ELSE
  3993. (* push address of temporary variable *)
  3994. Symbol(variable,destOperand);
  3995. Emit(Push(position,destOperand.op));
  3996. ReleaseOperand(destOperand);
  3997. (* push src *)
  3998. Evaluate(expression.left,srcOperand);
  3999. (*
  4000. Dereference(srcOperand,expression.type.resolved);
  4001. Emit(Push(position,srcOperand.tag));
  4002. *)
  4003. Emit(Push(position,srcOperand.op));
  4004. ReleaseOperand(srcOperand);
  4005. tensorFound := FALSE;
  4006. FOR i := 0 TO parameters.Length()-1 DO
  4007. e := parameters.GetExpression(i);
  4008. IF e IS SyntaxTree.TensorRangeExpression THEN
  4009. tensorFound := TRUE;
  4010. ELSIF e IS SyntaxTree.RangeExpression THEN
  4011. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4012. ELSE
  4013. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4014. END;
  4015. END;
  4016. Emit(Push(position,IntermediateCode.Immediate(int32,prefixIndices)));
  4017. Emit(Push(position,IntermediateCode.Immediate(int32,prefixRanges)));
  4018. Emit(Push(position,IntermediateCode.Immediate(int32,suffixIndices)));
  4019. Emit(Push(position,IntermediateCode.Immediate(int32,suffixRanges)));
  4020. StaticCallOperand(procOp,procedure);
  4021. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  4022. ReleaseOperand(procOp);
  4023. END;
  4024. RestoreRegisters(saved);
  4025. END;
  4026. RETURN variable
  4027. END PrepareTensorDescriptor;
  4028. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4029. VAR
  4030. type, descriptorType, baseType: SyntaxTree.Type;
  4031. operand, tmpOperand, variableOp, variable2Op: Operand;
  4032. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4033. variable, variable2: SyntaxTree.Variable;
  4034. dim, i, size: LONGINT;
  4035. (* TODO: needed? *)
  4036. oldArrayDestinationTag: IntermediateCode.Operand;
  4037. oldArrayDestinationDimension: LONGINT;
  4038. position: LONGINT;
  4039. saved: RegisterEntry;
  4040. arrayFlags: SET;
  4041. m, n: LONGINT;
  4042. PROCEDURE Pass(op: IntermediateCode.Operand);
  4043. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4044. BEGIN
  4045. IF numberRegister >= 0 THEN
  4046. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  4047. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4048. Emit(Mov(position,parameterRegister, op));
  4049. ELSE
  4050. Emit(Push(position,op))
  4051. END
  4052. END Pass;
  4053. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4054. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4055. BEGIN
  4056. formalType := formalType.resolved; actualType := actualType.resolved;
  4057. IF IsOpenArray(formalType)THEN
  4058. IF actualType IS SyntaxTree.StringType THEN
  4059. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4060. RETURN;
  4061. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4062. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4063. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4064. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4065. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4066. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4067. ELSE
  4068. tmp := baseReg;
  4069. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4070. IntermediateCode.MakeMemory(tmp,addressType);
  4071. Pass((tmp));
  4072. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4073. END;
  4074. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4075. END;
  4076. END PushArrayLens;
  4077. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4078. BEGIN
  4079. CASE size OF
  4080. |2: INCL(flags,Size2Flag);
  4081. |3: INCL(flags,Size3Flag);
  4082. |4: INCL(flags,Size4Flag);
  4083. |5: INCL(flags,Size5Flag);
  4084. |6: INCL(flags,Size6Flag);
  4085. |7: INCL(flags,Size7Flag);
  4086. |8: INCL(flags,Size8Flag);
  4087. END;
  4088. END SetSmallArraySizeFlag;
  4089. BEGIN
  4090. IF Trace THEN TraceEnter("PushParameter") END;
  4091. position := expression.position;
  4092. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4093. type := expression.type.resolved;
  4094. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4095. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4096. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4097. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4098. );
  4099. (* TODO: needed? *)
  4100. oldArrayDestinationTag := arrayDestinationTag;
  4101. oldArrayDestinationDimension := arrayDestinationDimension;
  4102. IF IsArrayOfSystemByte(parameter.type) THEN
  4103. Designate(expression,operand);
  4104. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4105. ReleaseIntermediateOperand(operand.tag);
  4106. operand.tag := tmp;
  4107. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4108. Pass((operand.tag));
  4109. END;
  4110. Pass((operand.op));
  4111. ELSIF IsOpenArray(parameter.type) THEN
  4112. Designate(expression,operand);
  4113. baseReg := operand.tag;
  4114. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4115. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4116. END;
  4117. Pass((operand.op)); (* address of the array *)
  4118. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4119. (* case 1 *)
  4120. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4121. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4122. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4123. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4124. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4125. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4126. arrayDestinationTag := sp;
  4127. (* case 1b *)
  4128. IF expression IS SyntaxTree.IndexDesignator THEN
  4129. (*
  4130. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4131. descriptorType := GetMathArrayDescriptorType(dim);
  4132. variable := GetTemporaryVariable(descriptorType,expression.position);
  4133. Symbol(variable,variableOp);
  4134. arrayDestinationTag := variableOp.op;
  4135. *)
  4136. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4137. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4138. arrayDestinationDimension := dim;
  4139. Designate(expression,operand);
  4140. (* case 1a *)
  4141. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4142. Designate(expression,operand);
  4143. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4144. i := 0;
  4145. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4146. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4147. INC(i);
  4148. END;
  4149. type := expression.type.resolved;
  4150. WHILE (i<dim) DO (* remaining static dimensions *)
  4151. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4152. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4153. ReleaseOperand(tmpOperand);
  4154. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4155. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4156. ReleaseOperand(tmpOperand);
  4157. INC(i);
  4158. END;
  4159. dimOp := IntermediateCode.Immediate(addressType,dim);
  4160. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4161. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4162. (* case 1d *)
  4163. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4164. Designate(expression,operand);
  4165. Dereference(operand,type.resolved,FALSE);
  4166. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4167. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4168. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4169. (* case 1f *)
  4170. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4171. Designate(expression,operand);
  4172. FOR i := 0 TO dim-1 DO
  4173. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4174. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4175. ReleaseOperand(tmpOperand);
  4176. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4177. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4178. ReleaseOperand(tmpOperand);
  4179. END;
  4180. (*******
  4181. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4182. *)
  4183. arrayFlags := {StaticFlag};
  4184. IF dim = 1 THEN
  4185. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4186. ReleaseOperand(tmpOperand);
  4187. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4188. m := LONGINT(tmpOperand.op.intValue);
  4189. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4190. ELSIF dim = 2 THEN
  4191. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4192. ReleaseOperand(tmpOperand);
  4193. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4194. m := LONGINT(tmpOperand.op.intValue);
  4195. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4196. ReleaseOperand(tmpOperand);
  4197. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4198. n := LONGINT(tmpOperand.op.intValue);
  4199. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4200. INCL(arrayFlags,SmallMatrixFlag);
  4201. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4202. END;
  4203. END;
  4204. (*******)
  4205. dimOp := IntermediateCode.Immediate(addressType,dim);
  4206. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4207. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4208. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4209. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4210. baseType := SemanticChecker.ArrayBase(type,dim);
  4211. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4212. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4213. ELSE HALT(100);
  4214. END;
  4215. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4216. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4217. (* case 2b *)
  4218. IF expression IS SyntaxTree.IndexDesignator THEN
  4219. descriptorType := GetMathArrayDescriptorType(dim);
  4220. variable := GetTemporaryVariable(descriptorType, FALSE);
  4221. Symbol(variable,variableOp);
  4222. arrayDestinationTag := variableOp.op;
  4223. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4224. arrayDestinationDimension := dim;
  4225. NeedDescriptor := TRUE;
  4226. Designate(expression,operand);
  4227. Pass((operand.tag));
  4228. NeedDescriptor := FALSE;
  4229. (* case 2a *)
  4230. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4231. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4232. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4233. INC(i);
  4234. END;
  4235. IF i = dim THEN
  4236. Designate(expression,operand);
  4237. Pass((operand.tag));
  4238. ELSE (* open-static *)
  4239. type := expression.type.resolved;
  4240. descriptorType := GetMathArrayDescriptorType(dim);
  4241. variable := GetTemporaryVariable(descriptorType, FALSE);
  4242. Symbol(variable,variableOp);
  4243. arrayDestinationTag := variableOp.op;
  4244. Designate(expression,operand);
  4245. FOR i := 0 TO dim-1 DO
  4246. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4247. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4248. ReleaseOperand(tmpOperand);
  4249. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4250. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4251. ReleaseOperand(tmpOperand);
  4252. END;
  4253. dimOp := IntermediateCode.Immediate(addressType,dim);
  4254. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4255. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4256. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4257. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4258. baseType := SemanticChecker.ArrayBase(type,dim);
  4259. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4260. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4261. Pass((arrayDestinationTag));
  4262. END;
  4263. (* case 2d *)
  4264. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4265. Designate(expression,operand);
  4266. Dereference(operand,type.resolved,FALSE);
  4267. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4268. Pass((operand.tag));
  4269. (* case 2f *)
  4270. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4271. descriptorType := GetMathArrayDescriptorType(dim);
  4272. variable := GetTemporaryVariable(descriptorType, FALSE);
  4273. Symbol(variable,variableOp);
  4274. arrayDestinationTag := variableOp.op;
  4275. Designate(expression,operand);
  4276. FOR i := 0 TO dim-1 DO
  4277. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4278. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4279. ReleaseOperand(tmpOperand);
  4280. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4281. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4282. ReleaseOperand(tmpOperand);
  4283. END;
  4284. (*
  4285. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4286. *)
  4287. arrayFlags := {StaticFlag};
  4288. IF dim = 1 THEN
  4289. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4290. ReleaseOperand(tmpOperand);
  4291. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4292. m := LONGINT(tmpOperand.op.intValue);
  4293. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4294. ELSIF dim = 2 THEN
  4295. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4296. ReleaseOperand(tmpOperand);
  4297. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4298. m := LONGINT(tmpOperand.op.intValue);
  4299. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4300. ReleaseOperand(tmpOperand);
  4301. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4302. n := LONGINT(tmpOperand.op.intValue);
  4303. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4304. INCL(arrayFlags,SmallMatrixFlag);
  4305. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4306. END;
  4307. END;
  4308. (*******)
  4309. dimOp := IntermediateCode.Immediate(addressType,dim);
  4310. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4311. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4312. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4313. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4314. baseType := SemanticChecker.ArrayBase(type,dim);
  4315. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4316. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4317. Pass((arrayDestinationTag));
  4318. ELSE HALT(100);
  4319. END;
  4320. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4321. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4322. (* case 3b *)
  4323. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4324. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4325. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4326. Symbol(variable,variableOp);
  4327. LoadValue(variableOp,system.addressType);
  4328. ELSE
  4329. descriptorType := GetMathArrayDescriptorType(dim);
  4330. variable := GetTemporaryVariable(descriptorType, FALSE);
  4331. Symbol(variable,variableOp);
  4332. END;
  4333. arrayDestinationTag := variableOp.op;
  4334. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4335. arrayDestinationDimension := 0;
  4336. Designate(expression,operand);
  4337. Pass((operand.tag));
  4338. (* case 3a *)
  4339. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4340. i := 0;
  4341. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4342. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4343. INC(i);
  4344. END;
  4345. IF i = dim THEN
  4346. Designate(expression,operand);
  4347. Pass((operand.tag));
  4348. ELSE (* open-static *)
  4349. type := expression.type.resolved;
  4350. descriptorType := GetMathArrayDescriptorType(dim);
  4351. variable := GetTemporaryVariable(descriptorType, FALSE);
  4352. Symbol(variable,variableOp);
  4353. arrayDestinationTag := variableOp.op;
  4354. Designate(expression,operand);
  4355. FOR i := 0 TO dim-1 DO
  4356. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4357. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4358. ReleaseOperand(tmpOperand);
  4359. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4360. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4361. ReleaseOperand(tmpOperand);
  4362. END;
  4363. dimOp := IntermediateCode.Immediate(addressType,dim);
  4364. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4365. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4366. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4367. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4368. baseType := SemanticChecker.ArrayBase(type,dim);
  4369. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4370. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4371. Pass((arrayDestinationTag));
  4372. END;
  4373. (* case 3d *)
  4374. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4375. Designate(expression,operand);
  4376. Dereference(operand,type.resolved,FALSE);
  4377. (*
  4378. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4379. *)
  4380. Pass((operand.tag));
  4381. (* case 3f *)
  4382. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4383. descriptorType := GetMathArrayDescriptorType(dim);
  4384. variable := GetTemporaryVariable(descriptorType, FALSE);
  4385. Symbol(variable,variableOp);
  4386. arrayDestinationTag := variableOp.op;
  4387. Designate(expression,operand);
  4388. IF operand.op.type.length >1 THEN (* vector register *)
  4389. variable2 := GetTemporaryVariable(type, FALSE);
  4390. Symbol(variable2, variable2Op);
  4391. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4392. Emit(Mov(position,tmp, operand.op));
  4393. ReleaseOperand(operand);
  4394. Symbol(variable2, operand);
  4395. END;
  4396. FOR i := 0 TO dim-1 DO
  4397. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4398. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4399. ReleaseOperand(tmpOperand);
  4400. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4401. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4402. ReleaseOperand(tmpOperand);
  4403. END;
  4404. dimOp := IntermediateCode.Immediate(addressType,dim);
  4405. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4406. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4407. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4408. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4409. baseType := SemanticChecker.ArrayBase(type,dim);
  4410. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4411. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4412. Pass((arrayDestinationTag));
  4413. ELSE HALT(100);
  4414. END;
  4415. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4416. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4417. (* case 4b *)
  4418. IF (expression IS SyntaxTree.IndexDesignator) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4419. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4420. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4421. Symbol(variable,variableOp);
  4422. LoadValue(variableOp,system.addressType);
  4423. ELSE
  4424. descriptorType := GetMathArrayDescriptorType(dim);
  4425. variable := GetTemporaryVariable(descriptorType, FALSE);
  4426. Symbol(variable,variableOp);
  4427. END;
  4428. arrayDestinationTag := variableOp.op;
  4429. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4430. arrayDestinationDimension := 0;
  4431. Designate(expression,operand);
  4432. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4433. Symbol(variable,variableOp);
  4434. ELSE
  4435. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4436. Symbol(variable,variableOp);
  4437. MakeMemory(tmp,variableOp.op,addressType,0);
  4438. Emit(Mov(position,tmp,operand.tag));
  4439. ReleaseIntermediateOperand(tmp);
  4440. END;
  4441. Pass((variableOp.op));
  4442. ReleaseOperand(variableOp);
  4443. (* case 4a *)
  4444. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4445. i := 0;
  4446. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4447. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4448. INC(i);
  4449. END;
  4450. IF i = dim THEN
  4451. Designate(expression,operand);
  4452. arrayDestinationTag := operand.tag;
  4453. ELSE (* open-static *)
  4454. type := expression.type.resolved;
  4455. descriptorType := GetMathArrayDescriptorType(dim);
  4456. variable := GetTemporaryVariable(descriptorType, FALSE);
  4457. Symbol(variable,variableOp);
  4458. arrayDestinationTag := variableOp.op;
  4459. Designate(expression,operand);
  4460. FOR i := 0 TO dim-1 DO
  4461. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4462. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4463. ReleaseOperand(tmpOperand);
  4464. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4465. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4466. ReleaseOperand(tmpOperand);
  4467. END;
  4468. dimOp := IntermediateCode.Immediate(addressType,dim);
  4469. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4470. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4471. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4472. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4473. baseType := SemanticChecker.ArrayBase(type,dim);
  4474. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4475. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4476. END;
  4477. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4478. Symbol(variable,variableOp);
  4479. MakeMemory(tmp,variableOp.op,addressType,0);
  4480. Emit(Mov(position,tmp,arrayDestinationTag));
  4481. ReleaseIntermediateOperand(tmp);
  4482. Pass((variableOp.op));
  4483. ReleaseOperand(variableOp);
  4484. (* case 4d *)
  4485. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4486. Designate(expression,operand);
  4487. (*
  4488. Dereference(operand,type.resolved,FALSE);
  4489. *)
  4490. (*
  4491. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4492. *)
  4493. Pass((operand.op));
  4494. (* case 4f *)
  4495. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4496. descriptorType := GetMathArrayDescriptorType(dim);
  4497. variable := GetTemporaryVariable(descriptorType, FALSE);
  4498. Symbol(variable,variableOp);
  4499. arrayDestinationTag := variableOp.op;
  4500. Designate(expression,operand);
  4501. FOR i := 0 TO dim-1 DO
  4502. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4503. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4504. ReleaseOperand(tmpOperand);
  4505. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4506. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4507. ReleaseOperand(tmpOperand);
  4508. END;
  4509. dimOp := IntermediateCode.Immediate(addressType,dim);
  4510. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4511. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4512. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4513. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4514. baseType := SemanticChecker.ArrayBase(type,dim);
  4515. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4516. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4517. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4518. Symbol(variable,variableOp);
  4519. MakeMemory(tmp,variableOp.op,addressType,0);
  4520. Emit(Mov(position,tmp,arrayDestinationTag));
  4521. ReleaseIntermediateOperand(tmp);
  4522. Pass((variableOp.op));
  4523. ReleaseOperand(variableOp);
  4524. ELSE HALT(100);
  4525. END;
  4526. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4527. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4528. Designate(expression,operand);
  4529. IF operand.op.type.length > 1 THEN
  4530. Emit(Push(position, operand.op));
  4531. ReleaseOperand(operand);
  4532. ELSE
  4533. size := system.SizeOf(type);
  4534. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4535. size := ToMemoryUnits(system,size);
  4536. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4537. arrayDestinationTag := sp;
  4538. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4539. END;
  4540. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4541. Designate(expression,operand);
  4542. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4543. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4544. Symbol(variable,variableOp);
  4545. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4546. Emit(Mov(position,tmp,operand.op));
  4547. Emit(Push(position,variableOp.op));
  4548. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4549. Pass((operand.op));
  4550. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4551. END;
  4552. ELSE HALT(200)
  4553. END;
  4554. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4555. IF parameter.kind = SyntaxTree.VarParameter THEN
  4556. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4557. Designate(expression, operand);
  4558. Pass((operand.op));
  4559. ELSE
  4560. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4561. Evaluate(expression, operand);
  4562. Pass((operand.extra)); (* step *)
  4563. Pass((operand.tag)); (* last *)
  4564. Pass((operand.op)) (* first *)
  4565. END
  4566. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4567. IF parameter.kind = SyntaxTree.VarParameter THEN
  4568. Designate(expression, operand);
  4569. Pass((operand.op));
  4570. ELSE
  4571. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4572. Evaluate(expression, operand);
  4573. Pass((operand.tag)); (* real part *)
  4574. Pass((operand.op)) (* imaginary part *)
  4575. END
  4576. ELSE
  4577. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4578. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4579. Designate(expression,operand);
  4580. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4581. (* stack allocation *)
  4582. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4583. (*! parameter alignment to be discussed ... *)
  4584. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4585. size := type(SyntaxTree.StringType).length;
  4586. END;
  4587. IF backend.cooperative & parameter.NeedsTrace() THEN
  4588. dst := NewRegisterOperand (addressType);
  4589. Emit(Mov(position,dst, sp));
  4590. IntermediateCode.InitImmediate(null, byteType, 0);
  4591. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4592. ReleaseIntermediateOperand(dst);
  4593. SaveRegisters();ReleaseUsedRegisters(saved);
  4594. (* register dst has been freed before SaveRegisters already *)
  4595. CallAssignMethod(dst, operand.op, parameter.type);
  4596. RestoreRegisters(saved);
  4597. END;
  4598. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4599. ELSIF IsOpenArray(parameter.type) THEN
  4600. Designate(expression,operand);
  4601. baseReg := operand.tag;
  4602. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4603. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4604. END;
  4605. Pass((operand.op)); (* address of the array *)
  4606. ELSIF IsDelegate(parameter.type) THEN
  4607. Evaluate(expression,operand);
  4608. IF backend.cooperative & parameter.NeedsTrace() THEN
  4609. Emit(Push(position, nil));
  4610. dst := NewRegisterOperand (addressType);
  4611. Emit(Mov(position,dst, sp));
  4612. ReleaseIntermediateOperand(dst);
  4613. SaveRegisters();ReleaseUsedRegisters(saved);
  4614. Emit(Push(position, dst));
  4615. (* register dst has been freed before SaveRegisters already *)
  4616. Emit(Push(position, operand.tag));
  4617. CallThis(position,"GarbageCollector","Assign",2);
  4618. RestoreRegisters(saved);
  4619. ELSE
  4620. Pass((operand.tag));
  4621. END;
  4622. Pass((operand.op));
  4623. ELSE
  4624. Evaluate(expression,operand);
  4625. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) 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.op));
  4634. CallThis(position,"GarbageCollector","Assign",2);
  4635. RestoreRegisters(saved);
  4636. ELSE
  4637. Pass((operand.op));
  4638. END;
  4639. END;
  4640. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4641. Evaluate(expression,operand);
  4642. Pass((operand.op));
  4643. ELSE (* var parameter *)
  4644. Designate(expression,operand);
  4645. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4646. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4647. Pass((operand.tag));
  4648. END;
  4649. END;
  4650. Pass((operand.op));
  4651. END;
  4652. END;
  4653. (* TODO: needed? *)
  4654. arrayDestinationTag := oldArrayDestinationTag;
  4655. arrayDestinationDimension := oldArrayDestinationDimension;
  4656. IF needsParameterBackup THEN
  4657. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4658. ReuseCopy(parameterBackup, operand.op)
  4659. END;
  4660. ReleaseOperand(operand);
  4661. IF Trace THEN TraceExit("PushParameter") END;
  4662. END PushParameter;
  4663. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4664. VAR prevConditional: BOOLEAN;
  4665. BEGIN
  4666. prevConditional := conditional;
  4667. conditional := FALSE;
  4668. IF (x.result # NIL) & ( x.result IS SyntaxTree.SymbolDesignator) & (x.result(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) & (x.result(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).useRegister) THEN
  4669. Expression(x.result); (* use register *)
  4670. END;
  4671. Statement(x.statement);
  4672. conditional := prevConditional;
  4673. IF x.result # NIL THEN Expression(x.result) END;
  4674. 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
  4675. ReleaseIntermediateOperand(result.op);
  4676. END;
  4677. END VisitStatementDesignator;
  4678. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4679. VAR
  4680. procedure: SyntaxTree.Procedure;
  4681. procedureType: SyntaxTree.ProcedureType;
  4682. wasInline: BOOLEAN;
  4683. actualParameters: SyntaxTree.ExpressionList;
  4684. formalParameter: SyntaxTree.Parameter;
  4685. actualParameter: SyntaxTree.Expression;
  4686. i: LONGINT;
  4687. localVariable: SyntaxTree.Variable;
  4688. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4689. src, dest: Operand;
  4690. prevInlineExit : Label;
  4691. prevMapper: SymbolMapper;
  4692. tooComplex: BOOLEAN;
  4693. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4694. BEGIN
  4695. IF e = NIL THEN RETURN TRUE
  4696. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4697. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4698. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4699. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4700. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4701. ELSE RETURN FALSE
  4702. END;
  4703. END SimpleExpression;
  4704. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4705. BEGIN
  4706. RETURN checker.CanPassInRegister(type)
  4707. END FitsInRegister;
  4708. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4709. VAR
  4710. variable: SyntaxTree.Variable;
  4711. variableDesignator: SyntaxTree.Designator;
  4712. BEGIN
  4713. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type));
  4714. variableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4715. variableDesignator.SetType(type);
  4716. RETURN variableDesignator
  4717. END GetTemp;
  4718. BEGIN
  4719. wasInline := currentIsInline;
  4720. prevInlineExit := currentInlineExit;
  4721. prevMapper := currentMapper;
  4722. currentInlineExit := NewLabel();
  4723. tooComplex := FALSE;
  4724. NEW(currentMapper);
  4725. currentIsInline := TRUE;
  4726. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4727. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4728. formalParameter := procedureType.firstParameter;
  4729. actualParameters := x.parameters;
  4730. i := 0;
  4731. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4732. actualParameter := actualParameters.GetExpression(i);
  4733. IF actualParameter.resolved # NIL THEN
  4734. actualParameter := actualParameter.resolved
  4735. END;
  4736. (*
  4737. if expression is simple and can be passed immediately
  4738. or if type fits in register then we can proceed
  4739. otherwise we escape to ordinary procedure call.
  4740. *)
  4741. (* cases where the expression can be mapped identically *)
  4742. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4743. currentMapper.Add(formalParameter, actualParameter, NIL);
  4744. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4745. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4746. (*
  4747. Assign(variableDesignator, actualParameter);
  4748. *)
  4749. Evaluate(actualParameter, src);
  4750. Designate(variableDesignator, dest);
  4751. Emit(Mov(x.position, dest.op, src.op));
  4752. ReleaseOperand(dest);
  4753. ReleaseOperand(src);
  4754. currentMapper.Add(formalParameter, variableDesignator, NIL);
  4755. ELSE tooComplex := TRUE
  4756. END;
  4757. (*
  4758. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4759. currentMapper.Add(formalParameter, actualParameter, NIL);
  4760. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4761. variableDesignator := GetTemp(system.addressType, FALSE);
  4762. Designate(actualParameter, src);
  4763. Designate(variableDesignator, dest);
  4764. IntermediateCode.MakeMemory(dest.op,addressType);
  4765. Emit(Mov(x.position, dest.op, src.op));
  4766. ReleaseOperand(dest);
  4767. IF src.tag.mode # IntermediateCode.Undefined THEN
  4768. tagDesignator := GetTemp(system.addressType, FALSE);
  4769. Designate(tagDesignator, dest);
  4770. IntermediateCode.MakeMemory(dest.op,addressType);
  4771. Emit(Mov(x.position, dest.op, src.op));
  4772. END;
  4773. ReleaseOperand(dest); ReleaseOperand(src);
  4774. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4775. END;
  4776. *)
  4777. formalParameter := formalParameter.nextParameter;
  4778. INC(i);
  4779. END;
  4780. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4781. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4782. currentMapper.Add(NIL, returnDesignator, NIL);
  4783. END;
  4784. localVariable := procedure.procedureScope.firstVariable;
  4785. WHILE ~tooComplex & (localVariable # NIL) DO
  4786. variableDesignator := GetTemp(localVariable.type, FALSE);
  4787. currentMapper.Add(localVariable, variableDesignator, NIL);
  4788. localVariable := localVariable.nextVariable;
  4789. END;
  4790. IF ~tooComplex THEN
  4791. VisitStatementBlock(procedure.procedureScope.body);
  4792. SetLabel(currentInlineExit);
  4793. IF procedureType.returnType # NIL THEN
  4794. Designate(returnDesignator, result);
  4795. IF conditional THEN
  4796. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4797. ValueToCondition(result)
  4798. END;
  4799. END;
  4800. END;
  4801. currentMapper := prevMapper;
  4802. currentInlineExit := prevInlineExit;
  4803. currentIsInline := wasInline;
  4804. RETURN ~tooComplex
  4805. END InlineProcedureCall;
  4806. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4807. VAR
  4808. parameters: SyntaxTree.ExpressionList;
  4809. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4810. designator: SyntaxTree.Designator;
  4811. procedureType: SyntaxTree.ProcedureType;
  4812. formalParameter: SyntaxTree.Parameter;
  4813. operand, returnValue: Operand;
  4814. reg, size, mask, dest: IntermediateCode.Operand;
  4815. saved: RegisterEntry;
  4816. symbol: SyntaxTree.Symbol;
  4817. variable: SyntaxTree.Variable;
  4818. i, parametersSize, returnTypeSize : LONGINT;
  4819. structuredReturnType: BOOLEAN;
  4820. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4821. tempVariableDesignator: SyntaxTree.Designator;
  4822. gap, alignment: LONGINT; (*fld*)
  4823. (* TODO: remove unnecessary backup variables *)
  4824. oldResult: Operand;
  4825. oldCurrentScope: SyntaxTree.Scope;
  4826. oldArrayDestinationTag: IntermediateCode.Operand;
  4827. oldArrayDestinationDimension: LONGINT;
  4828. oldConstantDeclaration: SyntaxTree.Symbol;
  4829. oldDestination: IntermediateCode.Operand;
  4830. oldCurrentLoop: Label;
  4831. oldConditional: BOOLEAN;
  4832. oldTrueLabel, oldFalseLabel: Label;
  4833. oldLocked: BOOLEAN;
  4834. usedRegisters,oldUsedRegisters: RegisterEntry;
  4835. return: IntermediateCode.Operand;
  4836. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  4837. arg: IntermediateCode.Operand;
  4838. dummy: IntermediateCode.Operand;
  4839. recordType: SyntaxTree.RecordType;
  4840. operatorSelectionProcedureOperand: Operand;
  4841. operatorSelectionProcedure: SyntaxTree.Procedure;
  4842. fingerPrint: SyntaxTree.FingerPrint;
  4843. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  4844. identifierNumber: LONGINT;
  4845. parameterRegister: Backend.Registers;
  4846. parameterRegisters: LONGINT;
  4847. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  4848. procedure: SyntaxTree.Procedure;
  4849. PROCEDURE BackupGlobalState;
  4850. BEGIN
  4851. oldResult := result;
  4852. oldCurrentScope := currentScope;
  4853. oldArrayDestinationTag := arrayDestinationTag;
  4854. oldArrayDestinationDimension := arrayDestinationDimension;
  4855. oldConstantDeclaration := constantDeclaration;
  4856. oldDestination := destination;
  4857. oldCurrentLoop := currentLoop;
  4858. oldConditional := conditional;
  4859. oldTrueLabel := trueLabel;
  4860. oldFalseLabel := falseLabel;
  4861. oldLocked := locked;
  4862. oldUsedRegisters := usedRegisters
  4863. END BackupGlobalState;
  4864. PROCEDURE RestoreGlobalState;
  4865. BEGIN
  4866. result := oldResult;
  4867. currentScope := oldCurrentScope;
  4868. arrayDestinationTag := oldArrayDestinationTag;
  4869. arrayDestinationDimension := oldArrayDestinationDimension;
  4870. constantDeclaration := oldConstantDeclaration;
  4871. destination := oldDestination;
  4872. currentLoop := oldCurrentLoop;
  4873. conditional := oldConditional;
  4874. trueLabel := oldTrueLabel;
  4875. falseLabel := oldFalseLabel;
  4876. locked := oldLocked;
  4877. usedRegisters := oldUsedRegisters
  4878. END RestoreGlobalState;
  4879. (** do preparations before parameter push for array-structured object types (ASOTs):
  4880. if ASOT is passed as VAR parameter:
  4881. - allocate temporary variable of math array type
  4882. - copy contents of ASOT to be passed to temporary variable
  4883. - use temporary variable as the actual parameter instead
  4884. - 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)
  4885. **)
  4886. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  4887. VAR
  4888. expression: SyntaxTree.Expression;
  4889. BEGIN
  4890. IF actualParameter IS SyntaxTree.Designator THEN
  4891. designator := actualParameter(SyntaxTree.Designator);
  4892. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  4893. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  4894. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  4895. ASSERT(checker # NIL);
  4896. checker.SetCurrentScope(currentScope);
  4897. (* allocate temporary variable *)
  4898. ASSERT(actualParameter.type # NIL);
  4899. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  4900. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4901. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4902. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4903. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  4904. ASSERT(tempVariableDesignator.type # NIL);
  4905. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  4906. (* copy math array stored in actual parameter to temporary variable *)
  4907. BackupGlobalState;
  4908. AssignMathArray(tempVariableDesignator, actualParameter);
  4909. RestoreGlobalState;
  4910. (* use temporary variable as actual parameter instead of the original one *)
  4911. actualParameter := tempVariableDesignator;
  4912. (* create write-back call and store it in linked list *)
  4913. (* create new list entry *)
  4914. IF firstWriteBackCall = NIL THEN
  4915. NEW(firstWriteBackCall);
  4916. currentWriteBackCall := firstWriteBackCall
  4917. ELSE
  4918. ASSERT(currentWriteBackCall # NIL);
  4919. NEW(currentWriteBackCall.next);
  4920. currentWriteBackCall := currentWriteBackCall.next
  4921. END;
  4922. expression := checker.NewIndexOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4923. ASSERT(expression.type = NIL);
  4924. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4925. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  4926. (* prepare writeback for any other "normal" indexer *)
  4927. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4928. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4929. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4930. Assign(tempVariableDesignator, actualParameter);
  4931. actualParameter := tempVariableDesignator;
  4932. IF firstWriteBackCall = NIL THEN
  4933. NEW(firstWriteBackCall);
  4934. currentWriteBackCall := firstWriteBackCall
  4935. ELSE
  4936. ASSERT(currentWriteBackCall # NIL);
  4937. NEW(currentWriteBackCall.next);
  4938. currentWriteBackCall := currentWriteBackCall.next
  4939. END;
  4940. expression := checker.NewObjectOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4941. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4942. END
  4943. END
  4944. END PrepareParameter;
  4945. BEGIN
  4946. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  4947. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  4948. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4949. IF procedure.isOberonInline & (procedure.scope.ownerModule = module.module) THEN
  4950. IF InlineProcedureCall(x) THEN
  4951. RETURN
  4952. ELSE
  4953. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  4954. END
  4955. END;
  4956. END;
  4957. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4958. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  4959. dest := destination; destination := emptyOperand;
  4960. SaveRegisters();ReleaseUsedRegisters(saved);
  4961. parameters := x.parameters;
  4962. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  4963. (* an operator is called *)
  4964. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4965. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  4966. (* check if a dynamic operator call should be performed *)
  4967. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic
  4968. ELSE
  4969. isCallOfDynamicOperator := FALSE
  4970. END;
  4971. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  4972. Emit(Push(position, ap));
  4973. END;
  4974. alignment := procedureType.stackAlignment;
  4975. IF alignment > 1 THEN
  4976. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4977. Emit(Mov(position,reg, sp));
  4978. gap := ParametersSize(system, procedureType, FALSE) + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  4979. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  4980. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  4981. Emit(And(position,sp, sp, mask));
  4982. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  4983. Emit(Push(position,reg));
  4984. (*
  4985. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  4986. Emit(Mov(position,mem,reg));
  4987. *)
  4988. ReleaseIntermediateOperand(reg);
  4989. END;
  4990. IF (procedureType.callingConvention = SyntaxTree.DarwinCCallingConvention) & (system.addressSize = 32) THEN
  4991. (* align stack to 16-byte boundary *)
  4992. IntermediateCode.InitImmediate(mask,addressType,-16);
  4993. Emit(And(position,sp, sp, mask))
  4994. END;
  4995. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4996. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4997. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  4998. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4999. ELSE
  5000. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5001. END;
  5002. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5003. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5004. (* push ID *)
  5005. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5006. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5007. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5008. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5009. formalParameter := procedureType.firstParameter;
  5010. FOR i := 0 TO parameters.Length() - 1 DO
  5011. IF formalParameter.access # SyntaxTree.Hidden THEN
  5012. ASSERT(i < 2);
  5013. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5014. (* push pointer *)
  5015. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5016. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5017. (* add dereference *)
  5018. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5019. ReleaseIntermediateOperand(parameterBackups[i]);
  5020. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5021. END;
  5022. Emit(Push(position,parameterBackups[i]));
  5023. ReleaseIntermediateOperand(parameterBackups[i]);
  5024. (* push typetag *)
  5025. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5026. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5027. arg := TypeDescriptorAdr(recordType);
  5028. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5029. Emit(Push(position,arg));
  5030. ELSE
  5031. (* push 'NonPointer' *)
  5032. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5033. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5034. (* push fingerprint *)
  5035. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5036. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5037. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow))) (* TODO: push the type's fingerprint *)
  5038. END
  5039. END;
  5040. formalParameter := formalParameter.nextParameter
  5041. END;
  5042. (* for unary operators: complete the information for the second parameter *)
  5043. IF procedureType.numberParameters < 2 THEN
  5044. (* push 'NonPointer' *)
  5045. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5046. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5047. (* push 'NoType' *)
  5048. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5049. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5050. END;
  5051. (* call operator selection procedure *)
  5052. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5053. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5054. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  5055. ReleaseOperand(operatorSelectionProcedureOperand);
  5056. (* use the address that the operator selection procedure returned as the target address of the call *)
  5057. InitOperand(operand, ModeValue);
  5058. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5059. Emit(Result(position,operand.op))
  5060. END
  5061. ELSE
  5062. Evaluate(x.left, operand)
  5063. END;
  5064. IF symbol IS SyntaxTree.Procedure THEN
  5065. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5066. Emit(Push(position,operand.tag));
  5067. ELSIF (procedureType.isDelegate) THEN
  5068. Emit(Push(position,operand.tag));
  5069. END;
  5070. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5071. IF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5072. Emit(Push(position,operand.tag));
  5073. END;
  5074. ELSE HALT(200);
  5075. END;
  5076. ReleaseIntermediateOperand(operand.tag);
  5077. operand.tag := emptyOperand;
  5078. (* determine if a structured return type is needed *)
  5079. structuredReturnType := StructuredReturnType(procedureType);
  5080. IF structuredReturnType THEN
  5081. IF resultDesignator # NIL THEN
  5082. d := resultDesignator;
  5083. ELSE
  5084. variable := GetTemporaryVariable(procedureType.returnType, FALSE);
  5085. variable.SetUntraced(procedureType.hasUntracedReturn);
  5086. d := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  5087. d.SetType(variable.type);
  5088. END;
  5089. IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5090. Designate(d,returnValue);
  5091. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5092. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5093. Emit(Push(position,size));
  5094. Emit(Push(position,returnValue.op));
  5095. ReleaseOperand(returnValue);
  5096. ELSE
  5097. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  5098. END;
  5099. END;
  5100. firstWriteBackCall := NIL; (* reset write-back call list *)
  5101. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  5102. parameterRegister := backend.GetParameterRegisters(procedureType.callingConvention);
  5103. IF parameterRegister = NIL THEN parameterRegisters := 0
  5104. ELSE parameterRegisters := LEN(parameterRegister)
  5105. END;
  5106. passByRegister := parameterRegisters > 0;
  5107. registerNumber := 0;
  5108. formalParameter := procedureType.lastParameter;
  5109. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5110. actualParameter := parameters.GetExpression(i);
  5111. PrepareParameter(actualParameter, formalParameter);
  5112. IF passByRegister & (i < parameterRegisters) THEN
  5113. IF ~PassInRegister(formalParameter) THEN
  5114. Error(actualParameter.position,"cannot be passed by register")
  5115. ELSE
  5116. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,parameterRegister[i]);
  5117. END;
  5118. INC(registerNumber);
  5119. ELSE
  5120. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5121. END;
  5122. formalParameter := formalParameter.prevParameter;
  5123. END;
  5124. IF passByRegister & (registerNumber > 0) & ~SysvABI(procedureType.callingConvention) THEN
  5125. stackSize := ToMemoryUnits(system,parameterRegisters*addressType.sizeInBits);
  5126. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5127. END;
  5128. ELSE
  5129. hasDynamicOperands := FALSE;
  5130. formalParameter := procedureType.firstParameter;
  5131. FOR i := 0 TO parameters.Length() - 1 DO
  5132. actualParameter := parameters.GetExpression(i);
  5133. IF formalParameter # NIL THEN (* TENTATIVE *)
  5134. PrepareParameter(actualParameter, formalParameter);
  5135. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5136. ASSERT(i < 2);
  5137. hasDynamicOperands := TRUE;
  5138. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  5139. ELSE
  5140. IF passByRegister & (registerNumber > 0) THEN
  5141. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5142. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5143. END;
  5144. passByRegister := FALSE;
  5145. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5146. END;
  5147. formalParameter := formalParameter.nextParameter;
  5148. END;
  5149. END;
  5150. END;
  5151. IF symbol IS SyntaxTree.Procedure THEN
  5152. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5153. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5154. Emit(Push(position,reg));
  5155. ReleaseIntermediateOperand(reg);
  5156. END;
  5157. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5158. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5159. parametersSize := ParametersSize(system,procedureType,FALSE);
  5160. END;
  5161. ReleaseParameterRegisters();
  5162. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR SysvABI(procedureType.callingConvention) THEN
  5163. Emit(Call(position,operand.op,0));
  5164. ELSE
  5165. Emit(Call(position,operand.op,parametersSize));
  5166. END;
  5167. ReleaseOperand(operand);
  5168. IF procedureType.noReturn THEN
  5169. EmitTrap(position,NoReturnTrap);
  5170. END;
  5171. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5172. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5173. Emit(Result(position,return));
  5174. END;
  5175. (* === return parameter space === *)
  5176. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & passByRegister THEN
  5177. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5178. IF parametersSize < 32 THEN
  5179. (* allocated space for all parameter registers *)
  5180. parametersSize := 32
  5181. END;
  5182. size := IntermediateCode.Immediate(addressType,parametersSize);
  5183. Emit(Add(position,sp,sp,size))
  5184. END;
  5185. IF SysvABI(procedureType.callingConvention) THEN
  5186. IF passByRegister THEN
  5187. IF parameters.Length() > parameterRegisters THEN
  5188. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5189. ELSE
  5190. parametersSize := 0
  5191. END;
  5192. ELSE
  5193. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits)
  5194. END;
  5195. IF parametersSize > 0 THEN
  5196. size := IntermediateCode.Immediate(addressType,parametersSize);
  5197. Emit(Add(position,sp,sp,size))
  5198. END;
  5199. END;
  5200. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5201. IF structuredReturnType THEN
  5202. (* stack pointer rewinding done by callee
  5203. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5204. Emit(Add(position,sp,sp,size));
  5205. *)
  5206. RestoreRegisters(saved);
  5207. InitOperand(result,ModeReference);
  5208. Symbol(variable,result);
  5209. ELSE
  5210. RestoreRegisters(saved);
  5211. InitOperand(result,ModeValue);
  5212. result.op := return;
  5213. END;
  5214. END;
  5215. IF alignment > 1 THEN
  5216. Emit(Pop(position,sp));
  5217. END;
  5218. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5219. Emit(Pop(position, ap));
  5220. END;
  5221. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5222. ValueToCondition(result);
  5223. END;
  5224. destination := dest;
  5225. (* perform all write-back calls in the list *)
  5226. BackupGlobalState;
  5227. currentWriteBackCall := firstWriteBackCall;
  5228. WHILE currentWriteBackCall # NIL DO
  5229. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5230. currentWriteBackCall := currentWriteBackCall.next
  5231. END;
  5232. RestoreGlobalState;
  5233. (* TENATIVE *)
  5234. (*
  5235. IF isOperatorCall THEN
  5236. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5237. END;
  5238. *)
  5239. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5240. END VisitProcedureCallDesignator;
  5241. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5242. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5243. td: SyntaxTree.Symbol;
  5244. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5245. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5246. BEGIN
  5247. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5248. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5249. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5250. variable.SetType(system.anyType);
  5251. scope.AddVariable(variable);
  5252. hiddenPointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5253. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5254. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5255. typeDeclaration.SetScope(module.module.moduleScope);
  5256. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5257. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5258. END;
  5259. RETURN hiddenPointerType;
  5260. END GetHiddenPointerType;
  5261. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5262. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5263. BEGIN
  5264. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5265. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5266. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Procedure"));
  5267. variable.SetType(SyntaxTree.NewProcedureType(-1,NIL));
  5268. scope.AddVariable(variable);
  5269. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5270. variable.SetType(system.anyType);
  5271. scope.AddVariable(variable);
  5272. delegatePointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5273. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@Delegate"));
  5274. typeDeclaration.SetDeclaredType(delegatePointerType);
  5275. typeDeclaration.SetScope(module.module.moduleScope);
  5276. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5277. delegatePointerType.SetState(SyntaxTree.Resolved);
  5278. END;
  5279. RETURN delegatePointerType
  5280. END GetDelegateType;
  5281. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5282. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5283. such as in VAR a: RECORD ... END;
  5284. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5285. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5286. *)
  5287. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5288. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5289. BEGIN (* no code emission *)
  5290. source := NIL;
  5291. x := x.resolved;
  5292. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5293. x := GetHiddenPointerType();
  5294. ELSIF IsDelegate(x) THEN
  5295. x := GetDelegateType();
  5296. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5297. ELSE HALT(200);
  5298. END;
  5299. td := x.typeDeclaration;
  5300. IF td = NIL THEN
  5301. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5302. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5303. ASSERT(td # NIL);
  5304. END;
  5305. IF newObjectFile THEN
  5306. GetCodeSectionNameForSymbol(td,name);
  5307. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5308. meta.CheckTypeDeclaration(x);
  5309. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5310. ELSE
  5311. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5312. END;
  5313. IF backend.cooperative OR meta.simple THEN
  5314. offset := 0;
  5315. ELSE
  5316. IF x IS SyntaxTree.CellType THEN
  5317. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5318. IF baseRecord = NIL THEN
  5319. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5320. ELSE
  5321. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5322. END;
  5323. ELSE
  5324. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5325. END;
  5326. END;
  5327. ELSE
  5328. offset := 0;
  5329. source := module.allSections.FindBySymbol(td); (*TODO*)
  5330. IF source = NIL THEN
  5331. null := 0;
  5332. GetCodeSectionNameForSymbol(td,name);
  5333. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  5334. Basic.SuffixSegmentedName (name, module.module.name);
  5335. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5336. IntermediateCode.InitImmediate(op,addressType,0);
  5337. source(IntermediateCode.Section).Emit(Data(position,op));
  5338. source.SetReferenced(FALSE)
  5339. ELSE
  5340. name := source.name;
  5341. END;
  5342. END;
  5343. RETURN td
  5344. END GetBackendType;
  5345. BEGIN
  5346. (*td := t.typeDeclaration;*)
  5347. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5348. (*
  5349. IF t IS SyntaxTree.PointerType THEN
  5350. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5351. ELSE
  5352. source := GetBackendType(t);
  5353. END;
  5354. *)
  5355. IF newObjectFile THEN
  5356. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5357. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5358. IntermediateCode.SetOffset(res,offset);
  5359. ELSE
  5360. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5361. END;
  5362. (*
  5363. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5364. make memory should be used when tag is used, not earlier
  5365. *)
  5366. RETURN res
  5367. END TypeDescriptorAdr;
  5368. (*
  5369. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5370. VAR result: IntermediateCode.Operand;
  5371. BEGIN
  5372. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5373. operand.tag := TypeDescriptorAdr(operand.type);
  5374. IntermediateCode.MakeMemory(operand.tag,addressType);
  5375. UseIntermediateOperand(operand.tag);
  5376. END;
  5377. END MakeTypeTag;
  5378. *)
  5379. PROCEDURE ProfilerInit;
  5380. VAR reg: IntermediateCode.Operand;
  5381. BEGIN
  5382. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5383. Emit(Call(position,reg,0));
  5384. END ProfilerInit;
  5385. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5386. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5387. BEGIN
  5388. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5389. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5390. THEN
  5391. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5392. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5393. Emit(Push(position,reg));
  5394. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5395. Emit(Push(position,reg));
  5396. StaticCallOperand(result,procedure);
  5397. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5398. ReleaseOperand(result);
  5399. END;
  5400. END ProfilerEnterExit;
  5401. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5402. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5403. BEGIN
  5404. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5405. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5406. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5407. profileInit.Emit(Push(position,reg));
  5408. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5409. profileInit.Emit(Push(position,reg));
  5410. NEW(string, LEN(name)); COPY(name, string^);
  5411. sv := SyntaxTree.NewStringValue(-1,string);
  5412. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5413. sv.SetType(type);
  5414. Designate(sv,result);
  5415. profileInit.Emit(Push(position,result.tag));
  5416. profileInit.Emit(Push(position,result.op));
  5417. StaticCallOperand(result,procedure);
  5418. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5419. ReleaseOperand(result);
  5420. END;
  5421. END ProfilerAddProcedure;
  5422. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5423. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5424. BEGIN
  5425. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5426. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5427. profileInit.Emit(Push(position,reg));
  5428. profileInitPatchPosition := profileInit.pc;
  5429. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5430. NEW(string, LEN(name)); COPY(name, string^);
  5431. sv := SyntaxTree.NewStringValue(-1,string);
  5432. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5433. sv.SetType(type);
  5434. Designate(sv,result);
  5435. profileInit.Emit(Push(position,result.tag));
  5436. profileInit.Emit(Push(position,result.op));
  5437. StaticCallOperand(result,procedure);
  5438. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5439. ReleaseOperand(result);
  5440. END;
  5441. END ProfilerAddModule;
  5442. PROCEDURE ProfilerPatchInit;
  5443. VAR reg: IntermediateCode.Operand;
  5444. BEGIN
  5445. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5446. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5447. EmitLeave(profileInit,position,0);
  5448. profileInit.Emit(Exit(position,0,0));
  5449. END ProfilerPatchInit;
  5450. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5451. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5452. VAR
  5453. id: LONGINT;
  5454. leftType, rightType: SyntaxTree.Type;
  5455. procedureType: SyntaxTree.ProcedureType;
  5456. runtimeProcedure: SyntaxTree.Procedure;
  5457. runtimeProcedureOperand, operatorOperand: Operand;
  5458. kind: SET;
  5459. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5460. VAR
  5461. arg: IntermediateCode.Operand;
  5462. recordType: SyntaxTree.RecordType;
  5463. fingerPrint: SyntaxTree.FingerPrint;
  5464. BEGIN
  5465. IF type = NIL THEN
  5466. (* no type: push 'NoType' *)
  5467. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5468. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5469. ELSIF IsStrictlyPointerToRecord(type) THEN
  5470. (* pointer to record type: push typetag *)
  5471. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5472. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5473. arg := TypeDescriptorAdr(recordType);
  5474. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5475. ELSE
  5476. (* non-pointer to record type: push fingerprint *)
  5477. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5478. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5479. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow)
  5480. END;
  5481. operatorInitializationCodeSection.Emit(Push(position,arg))
  5482. END PushTypeInfo;
  5483. BEGIN
  5484. ASSERT(operatorInitializationCodeSection # NIL);
  5485. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5486. procedureType := operator.type(SyntaxTree.ProcedureType);
  5487. (* determine types *)
  5488. leftType := procedureType.firstParameter.type;
  5489. IF procedureType.numberParameters = 2 THEN
  5490. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5491. rightType := procedureType.firstParameter.nextParameter.type;
  5492. ELSE
  5493. rightType := NIL
  5494. END;
  5495. (* determine operator kind *)
  5496. IF IsStrictlyPointerToRecord(leftType) THEN
  5497. kind := {LhsIsPointer}
  5498. ELSE
  5499. kind := {}
  5500. END;
  5501. IF IsStrictlyPointerToRecord(rightType) THEN
  5502. kind := kind + {RhsIsPointer}
  5503. END;
  5504. IF kind # {} THEN (* TODO: to be removed later on *)
  5505. (* at least one of the types is a pointer to record *)
  5506. (* emit a code that registers this specific operator in the runtime *)
  5507. dump := operatorInitializationCodeSection.comments;
  5508. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5509. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5510. (* push ID *)
  5511. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5512. id := Global.GetSymbol(module.module.case, operator.name);
  5513. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5514. (* push kind *)
  5515. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5516. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5517. (* push type infos *)
  5518. PushTypeInfo(leftType);
  5519. PushTypeInfo(rightType);
  5520. (* push operator address *)
  5521. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5522. StaticCallOperand(operatorOperand, operator);
  5523. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5524. ReleaseOperand(operatorOperand);
  5525. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5526. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5527. ReleaseOperand(runtimeProcedureOperand)
  5528. END
  5529. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5530. END
  5531. END RegisterDynamicOperator;
  5532. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: LONGINT);
  5533. VAR
  5534. traceModule: SyntaxTree.Module;
  5535. procedure: SyntaxTree.Procedure;
  5536. procedureVariable: SyntaxTree.Variable;
  5537. s,msg: Basic.MessageString;
  5538. res: Operand;
  5539. i: LONGINT;
  5540. sv: SyntaxTree.StringValue;
  5541. type: SyntaxTree.Type;
  5542. recordType: SyntaxTree.RecordType;
  5543. printout: Printout.Printer;
  5544. stringWriter: Streams.StringWriter;
  5545. expression: SyntaxTree.Expression;
  5546. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5547. BEGIN
  5548. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5549. IF procedure = NIL THEN
  5550. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5551. END;
  5552. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5553. s := "procedure ";
  5554. Strings.Append(s,backend.traceModuleName);
  5555. Strings.Append(s,".");
  5556. Strings.Append(s,procedureName);
  5557. Strings.Append(s," not present");
  5558. Error(position,s);
  5559. RETURN FALSE
  5560. ELSE
  5561. RETURN TRUE
  5562. END;
  5563. END GetProcedure;
  5564. PROCEDURE CallProcedure;
  5565. VAR size: LONGINT;
  5566. BEGIN
  5567. IF procedure # NIL THEN
  5568. StaticCallOperand(result,procedure);
  5569. size := ProcedureParametersSize(system,procedure);
  5570. ELSE
  5571. Symbol(procedureVariable, result);
  5572. LoadValue(result, procedureVariable.type.resolved);
  5573. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5574. END;
  5575. Emit(Call(position,result.op,size));
  5576. END CallProcedure;
  5577. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5578. VAR res: Operand; string: SyntaxTree.String;
  5579. BEGIN
  5580. IF GetProcedure("String") THEN
  5581. NEW(string, LEN(s)); COPY(s, string^);
  5582. sv := SyntaxTree.NewStringValue(-1,string);
  5583. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  5584. sv.SetType(type);
  5585. Designate(sv,res);
  5586. Emit(Push(position,res.tag));
  5587. Emit(Push(position,res.op));
  5588. ReleaseOperand(res);
  5589. CallProcedure;
  5590. END;
  5591. END String;
  5592. PROCEDURE Integer(op: IntermediateCode.Operand);
  5593. BEGIN
  5594. IF GetProcedure("Int") THEN
  5595. Emit(Push(position,op));
  5596. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5597. CallProcedure;
  5598. END;
  5599. END Integer;
  5600. PROCEDURE Float(op: IntermediateCode.Operand);
  5601. BEGIN
  5602. IF GetProcedure("HIntHex") THEN
  5603. Emit(Push(position,op));
  5604. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5605. CallProcedure;
  5606. END;
  5607. END Float;
  5608. PROCEDURE Set(op: IntermediateCode.Operand);
  5609. BEGIN
  5610. IF GetProcedure("Set") THEN
  5611. Emit(Push(position,op));
  5612. (*
  5613. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5614. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5615. *)
  5616. CallProcedure;
  5617. END;
  5618. END Set;
  5619. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5620. BEGIN
  5621. IF GetProcedure("Boolean") THEN
  5622. Emit(Push(position,op));
  5623. CallProcedure;
  5624. END;
  5625. END Boolean;
  5626. PROCEDURE Char(op: IntermediateCode.Operand);
  5627. BEGIN
  5628. IF GetProcedure("Char") THEN
  5629. Emit(Push(position,op));
  5630. CallProcedure;
  5631. END;
  5632. END Char;
  5633. PROCEDURE Address(op: IntermediateCode.Operand);
  5634. BEGIN
  5635. IF GetProcedure("Address") THEN
  5636. Emit(Push(position,op));
  5637. CallProcedure;
  5638. END;
  5639. END Address;
  5640. PROCEDURE StringOperand(op,tag: IntermediateCode.Operand);
  5641. BEGIN
  5642. IF GetProcedure("String") THEN
  5643. Emit(Push(position,tag));
  5644. Emit(Push(position,op));
  5645. CallProcedure;
  5646. END;
  5647. END StringOperand;
  5648. PROCEDURE Ln;
  5649. BEGIN
  5650. IF GetProcedure("Ln") THEN
  5651. CallProcedure;
  5652. END;
  5653. END Ln;
  5654. BEGIN
  5655. IF backend.traceModuleName = "" THEN RETURN END;
  5656. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5657. IF GetProcedure("Enter") THEN
  5658. CallProcedure
  5659. END;
  5660. NEW(stringWriter,LEN(s));
  5661. FOR i := 0 TO x.Length()-1 DO
  5662. msg := "";
  5663. expression := x.GetExpression(i);
  5664. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5665. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5666. ELSE
  5667. Global.GetModuleName(module.module, s);
  5668. END;
  5669. IF i = 0 THEN
  5670. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos,1);
  5671. stringWriter.String(":");
  5672. END;
  5673. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5674. IF ~(expression IS SyntaxTree.StringValue) THEN
  5675. printout.Expression(expression);
  5676. stringWriter.Get(s);
  5677. Strings.Append(msg,s);
  5678. Strings.Append(msg,"= ");
  5679. ELSE stringWriter.Get(s); (* remove from string writer *)
  5680. Strings.Append(msg, s);
  5681. END;
  5682. String(msg);
  5683. IF SemanticChecker.IsStringType(expression.type) THEN
  5684. Designate(expression,res);
  5685. StringOperand(res.op,res.tag);
  5686. ELSE
  5687. Evaluate(expression,res);
  5688. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5689. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5690. Convert(res.op,int64);
  5691. END;
  5692. Integer(res.op);
  5693. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5694. Boolean(res.op);
  5695. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5696. Set(res.op);
  5697. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5698. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5699. Convert(res.op,float64);
  5700. END;
  5701. Float(res.op);
  5702. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5703. Char(res.op);
  5704. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5705. Address(res.op);String("H");
  5706. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5707. Address(res.op);String("H");
  5708. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5709. Address(res.op);String("H");
  5710. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5711. Address(res.op);String("H");
  5712. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5713. String("NIL");
  5714. ELSE HALT(200);
  5715. END;
  5716. END;
  5717. ReleaseOperand(res);
  5718. String("; ");
  5719. END;
  5720. IF GetProcedure("Exit") THEN
  5721. CallProcedure
  5722. ELSE
  5723. Ln;
  5724. END;
  5725. END;
  5726. END SystemTrace;
  5727. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5728. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5729. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5730. BEGIN
  5731. type := type.resolved;
  5732. IF type IS SyntaxTree.RecordType THEN
  5733. WITH type: SyntaxTree.RecordType DO
  5734. baseType := type.baseType;
  5735. IF baseType # NIL THEN
  5736. baseType := baseType.resolved;
  5737. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5738. InitFields(baseType,adr,offset);
  5739. END;
  5740. variable := type.recordScope.firstVariable;
  5741. WHILE variable # NIL DO
  5742. IF variable.initializer # NIL THEN
  5743. Evaluate(variable.initializer,initializerOp);
  5744. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5745. Emit(Mov(position,mem,initializerOp.op));
  5746. ReleaseOperand(initializerOp);
  5747. ReleaseIntermediateOperand(mem);
  5748. END;
  5749. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5750. variable := variable.nextVariable
  5751. END;
  5752. END;
  5753. ELSIF (type IS SyntaxTree.ArrayType) THEN
  5754. WITH type: SyntaxTree.ArrayType DO
  5755. IF type.form = SyntaxTree.Static THEN
  5756. baseType := type.arrayBase;
  5757. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5758. FOR i := 0 TO type.staticLength-1 DO
  5759. InitFields(baseType,adr,offset+i*size);
  5760. END;
  5761. END;
  5762. END;
  5763. ELSIF type IS SyntaxTree.MathArrayType THEN
  5764. WITH type: SyntaxTree.MathArrayType DO
  5765. IF type.form = SyntaxTree.Open THEN
  5766. dim := DynamicDim(type);
  5767. imm := IntermediateCode.Immediate(addressType,dim);
  5768. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  5769. baseType := SemanticChecker.ArrayBase(type,dim);
  5770. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  5771. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  5772. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  5773. ReleaseIntermediateOperand(imm);
  5774. (* flags remain empty (=0) for open array *)
  5775. ELSIF type.form = SyntaxTree.Static THEN
  5776. baseType := type.arrayBase;
  5777. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5778. ASSERT(type.staticLength < 1024*1024*1024);
  5779. FOR i := 0 TO type.staticLength-1 DO
  5780. InitFields(baseType,adr,offset+i*size);
  5781. END;
  5782. END;
  5783. END;
  5784. END;
  5785. END InitFields;
  5786. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable);
  5787. VAR type: SyntaxTree.Type; operand: Operand; tmp: IntermediateCode.Operand; reference: SyntaxTree.Expression;
  5788. BEGIN
  5789. type := variable.type.resolved;
  5790. IF (type IS SyntaxTree.MathArrayType) THEN
  5791. WITH type: SyntaxTree.MathArrayType DO
  5792. IF type.form = SyntaxTree.Open THEN
  5793. Symbol(variable,operand);
  5794. InitFields(type, operand.tag,0);
  5795. ELSIF type.form = SyntaxTree.Tensor THEN
  5796. Symbol(variable, operand);
  5797. MakeMemory(tmp,operand.op,addressType,0);
  5798. ReleaseOperand(operand);
  5799. Emit(Mov(position,tmp, nil ) );
  5800. ReleaseIntermediateOperand(tmp);
  5801. END;
  5802. END;
  5803. ELSE
  5804. Symbol(variable,operand);
  5805. IF variable.initializer # NIL THEN
  5806. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  5807. reference.SetType(variable.type.resolved);
  5808. reference.SetAssignable(TRUE);
  5809. Assign(reference,variable.initializer);
  5810. END;
  5811. InitFields(type, operand.op,0);
  5812. ReleaseOperand(operand);
  5813. END;
  5814. END InitVariable;
  5815. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  5816. VAR end: Label;
  5817. BEGIN
  5818. IF type.form = SyntaxTree.Tensor THEN
  5819. InitOperand(result,ModeValue);
  5820. ReuseCopy(result.op,base);
  5821. end := NewLabel();
  5822. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  5823. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  5824. SetLabel(end);
  5825. Convert(result.op,int32);
  5826. ELSE
  5827. InitOperand(result,ModeValue);
  5828. IntermediateCode.InitImmediate(result.op, int32, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  5829. END
  5830. END MathArrayDim;
  5831. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  5832. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  5833. BEGIN
  5834. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5835. MakeMemory(mem,base,addressType,offset);
  5836. Emit(Mov(position,mem,value));
  5837. ReleaseIntermediateOperand(mem);
  5838. END PutMathArrayField;
  5839. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  5840. VAR mem: IntermediateCode.Operand;
  5841. BEGIN
  5842. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5843. MakeMemory(mem,base,addressType,offset);
  5844. Emit(Mov(position,mem,value));
  5845. ReleaseIntermediateOperand(mem);
  5846. END PutMathArrayFieldOffset;
  5847. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  5848. BEGIN
  5849. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  5850. MakeMemory(value,base,addressType,offset);
  5851. END GetMathArrayField;
  5852. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  5853. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  5854. BEGIN
  5855. IF incr THEN
  5856. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  5857. ELSE
  5858. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  5859. END;
  5860. IF dim.mode=IntermediateCode.ModeImmediate THEN
  5861. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  5862. ELSE
  5863. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5864. Emit(Mov(position,reg,dim));
  5865. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  5866. Emit(Add(position,reg,reg,base));
  5867. MakeMemory(mem, reg, addressType, offset);
  5868. ReleaseIntermediateOperand(reg);
  5869. Emit(Mov(position,mem,value));
  5870. ReleaseIntermediateOperand(mem);
  5871. END;
  5872. END PutMathArrayLenOrIncr;
  5873. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  5874. BEGIN
  5875. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  5876. END PutMathArrayLength;
  5877. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  5878. BEGIN
  5879. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  5880. END PutMathArrayIncrement;
  5881. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5882. BEGIN
  5883. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  5884. END GetMathArrayIncrement;
  5885. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5886. BEGIN
  5887. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  5888. END GetMathArrayLength;
  5889. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5890. VAR dimOp: IntermediateCode.Operand;
  5891. BEGIN
  5892. dimOp := IntermediateCode.Immediate(int32, dim);
  5893. GetMathArrayLength(type, operand, dimOp, check, result);
  5894. END GetMathArrayLengthAt;
  5895. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5896. VAR dimOp: IntermediateCode.Operand;
  5897. BEGIN
  5898. dimOp := IntermediateCode.Immediate(int32, dim);
  5899. GetMathArrayIncrement(type, operand, dimOp, check, result);
  5900. END GetMathArrayIncrementAt;
  5901. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  5902. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5903. offset: LONGINT;
  5904. BEGIN
  5905. IF increment THEN
  5906. offset := MathIncrOffset;
  5907. ELSE
  5908. offset := MathLenOffset;
  5909. END;
  5910. INC(offset,operand.dimOffset*2);
  5911. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  5912. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  5913. END;
  5914. (* static dimension *)
  5915. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5916. IF check & (type.form = SyntaxTree.Tensor) THEN
  5917. DimensionCheck(operand.tag,dim,BrltL);
  5918. END;
  5919. val := SHORT(dim.intValue);
  5920. IF type.form # SyntaxTree.Tensor THEN
  5921. t := SemanticChecker.ArrayBase(type,val);
  5922. type := t.resolved(SyntaxTree.MathArrayType);
  5923. IF type.form = SyntaxTree.Static THEN
  5924. IF increment THEN
  5925. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  5926. ELSE
  5927. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5928. END;
  5929. InitOperand(result,ModeValue);
  5930. result.op := res;
  5931. RETURN;
  5932. END;
  5933. END;
  5934. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  5935. MakeMemory(res,operand.tag,addressType,offset);
  5936. (*
  5937. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5938. *)
  5939. InitOperand(result,ModeValue);
  5940. result.op := res;
  5941. ELSE
  5942. Convert(dim,addressType);
  5943. IF check THEN
  5944. IF type.form = SyntaxTree.Tensor THEN
  5945. DimensionCheck(operand.tag,dim,BrltL);
  5946. ELSIF isUnchecked THEN (* do nothing *)
  5947. ELSE
  5948. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5949. END;
  5950. END;
  5951. end := NewLabel(); next := NIL;
  5952. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5953. Emit(Mov(position,res,dim));
  5954. Convert(res,int32);
  5955. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5956. WHILE t IS SyntaxTree.MathArrayType DO
  5957. type := t(SyntaxTree.MathArrayType);
  5958. IF type.form = SyntaxTree.Static THEN
  5959. imm := IntermediateCode.Immediate(int32,val);
  5960. next := NewLabel();
  5961. BrneL(next,imm,res);
  5962. IF increment THEN
  5963. imm := IntermediateCode.Immediate(int32,ToMemoryUnits(system,type.staticIncrementInBits));
  5964. ELSE
  5965. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5966. END;
  5967. Emit(MovReplace(position,res,imm));
  5968. BrL(end);
  5969. ELSE hasDynamicPart := TRUE;
  5970. END;
  5971. t := type.arrayBase.resolved;
  5972. val := val + 1;
  5973. IF next # NIL THEN SetLabel(next) END;
  5974. END;
  5975. IF hasDynamicPart THEN
  5976. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5977. Emit(Mov(position,res2,dim));
  5978. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  5979. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5980. Emit(Add(position,res2,res2,imm));
  5981. Emit(Add(position,res2,res2,operand.tag));
  5982. IntermediateCode.MakeMemory(res2,int32);
  5983. Emit(MovReplace(position,res,res2));
  5984. ReleaseIntermediateOperand(res2);
  5985. END;
  5986. SetLabel(end);
  5987. Convert(res,int32);
  5988. InitOperand(result,ModeValue);
  5989. result.op := res;
  5990. END;
  5991. END MathArrayLenOrIncr;
  5992. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  5993. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5994. offset: LONGINT;
  5995. BEGIN
  5996. offset := operand.dimOffset+DynamicDim(type)-1;
  5997. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5998. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  5999. val := SHORT(dim.intValue);
  6000. t := SemanticChecker.ArrayBase(type,val);
  6001. type := t.resolved(SyntaxTree.ArrayType);
  6002. IF type.form = SyntaxTree.Static THEN
  6003. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6004. ELSE
  6005. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6006. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6007. END;
  6008. UseIntermediateOperand(res);
  6009. InitOperand(result,ModeValue);
  6010. result.op := res;
  6011. ELSE
  6012. Convert(dim,addressType);
  6013. IF ~isUnchecked THEN
  6014. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6015. END;
  6016. end := NewLabel(); next := NIL;
  6017. (* ReuseCopy(dim,res); *)
  6018. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6019. Emit(Mov(position,res,dim));
  6020. Convert(res,int32);
  6021. Convert(res,int32);
  6022. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6023. WHILE t IS SyntaxTree.ArrayType DO
  6024. type := t(SyntaxTree.ArrayType);
  6025. IF type.form = SyntaxTree.Static THEN
  6026. imm := IntermediateCode.Immediate(int32,val);
  6027. next := NewLabel();
  6028. BrneL(next,imm,res);
  6029. imm := IntermediateCode.Immediate(int32,type.staticLength);
  6030. Emit(MovReplace(position,res,imm));
  6031. BrL(end);
  6032. ELSE hasDynamicPart := TRUE;
  6033. END;
  6034. t := type.arrayBase.resolved;
  6035. val := val + 1;
  6036. IF next # NIL THEN SetLabel(next) END;
  6037. END;
  6038. IF hasDynamicPart THEN
  6039. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6040. Convert(res2,addressType);
  6041. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6042. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6043. Emit(Sub(position,res2,imm,res2));
  6044. Emit(Add(position,res2,res2,operand.tag));
  6045. IntermediateCode.MakeMemory(res2,int32);
  6046. Emit(MovReplace(position,res,res2));
  6047. ReleaseIntermediateOperand(res2);
  6048. END;
  6049. SetLabel(end);
  6050. Convert(res,int32);
  6051. InitOperand(result,ModeValue);
  6052. result.op := res;
  6053. END;
  6054. END ArrayLen;
  6055. (**
  6056. create a temporary variable in current scope
  6057. **)
  6058. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN): SyntaxTree.Variable;
  6059. VAR name: SyntaxTree.Identifier; string: SyntaxTree.IdentifierString ; variable: SyntaxTree.Variable;
  6060. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6061. BEGIN
  6062. IF ~register THEN
  6063. variable := temporaries.GetFreeVariable(type, index);
  6064. ELSE
  6065. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6066. END;
  6067. scope := currentScope;
  6068. IF variable = NIL THEN
  6069. COPY("@hiddenIRVar",string);
  6070. Basic.AppendNumber(string,index);
  6071. name := SyntaxTree.NewIdentifier(string);
  6072. variable := SyntaxTree.NewVariable(Diagnostics.Invalid,name);
  6073. variable.SetType(type);
  6074. variable.SetAccess(SyntaxTree.Hidden);
  6075. IF ~register THEN
  6076. temporaries.AddVariable(variable);
  6077. IF scope.lastVariable # NIL THEN
  6078. offset := scope.lastVariable.offsetInBits;
  6079. ELSE
  6080. offset := 0;
  6081. END;
  6082. DEC(offset,system.SizeOf(variable.type));
  6083. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6084. variable(SyntaxTree.Variable).SetOffset(offset);
  6085. scope.AddVariable(variable(SyntaxTree.Variable));
  6086. scope.EnterSymbol(variable, duplicate);
  6087. ASSERT(~duplicate);
  6088. InitVariable(variable(SyntaxTree.Variable));
  6089. ELSE
  6090. variable.SetUseRegister(TRUE);
  6091. variable(SyntaxTree.Variable).SetOffset(0);
  6092. END;
  6093. ELSE
  6094. InitVariable(variable(SyntaxTree.Variable));
  6095. (*
  6096. ASSERT(variable.type.resolved = type.resolved)
  6097. *)
  6098. END;
  6099. RETURN variable(SyntaxTree.Variable)
  6100. END GetTemporaryVariable;
  6101. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6102. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6103. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6104. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6105. i: LONGINT; duplicate: BOOLEAN;
  6106. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6107. VAR variable: SyntaxTree.Variable;
  6108. BEGIN
  6109. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier(name));
  6110. variable.SetType(type);
  6111. recordScope.AddVariable(variable);
  6112. END AddVariable;
  6113. BEGIN
  6114. name := "@ArrayDescriptor";
  6115. Basic.AppendNumber(name,dimensions);
  6116. identifier := SyntaxTree.NewIdentifier(name);
  6117. parentScope := module.module.moduleScope;
  6118. symbol := parentScope.FindSymbol(identifier);
  6119. IF symbol # NIL THEN
  6120. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6121. type := typeDeclaration.declaredType;
  6122. ELSE
  6123. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier(name));
  6124. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6125. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6126. recordType := SyntaxTree.NewRecordType( -1, parentScope, recordScope);
  6127. recordType.SetTypeDeclaration(typeDeclaration);
  6128. recordType.SetState(SyntaxTree.Resolved);
  6129. typeDeclaration.SetDeclaredType(recordType);
  6130. AddVariable("@ptr",system.anyType);
  6131. AddVariable("@adr",system.addressType);
  6132. AddVariable("@flags",system.addressType);
  6133. AddVariable("@dim",system.addressType);
  6134. AddVariable("@elementSize",system.addressType);
  6135. FOR i := 0 TO dimensions-1 DO
  6136. name := "@len";
  6137. Basic.AppendNumber(name,i);
  6138. AddVariable(name,system.addressType);
  6139. name := "@incr";
  6140. Basic.AppendNumber(name,i);
  6141. AddVariable(name,system.addressType);
  6142. END;
  6143. parentScope.AddTypeDeclaration(typeDeclaration);
  6144. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6145. ASSERT(~duplicate);
  6146. type := recordType;
  6147. END;
  6148. RETURN type
  6149. END GetMathArrayDescriptorType;
  6150. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6151. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6152. BEGIN
  6153. type := GetMathArrayDescriptorType(dimensions);
  6154. Emit(Push(position,op.op));
  6155. (* push type descriptor *)
  6156. reg := TypeDescriptorAdr(type);
  6157. IF ~newObjectFile THEN
  6158. IntermediateCode.MakeMemory(reg,addressType);
  6159. END;
  6160. Emit(Push(position,reg));
  6161. ReleaseIntermediateOperand(reg);
  6162. (* push realtime flag: false by default *)
  6163. Emit(Push(position,false));
  6164. CallThis(position,"Heaps","NewRec",3);
  6165. END NewMathArrayDescriptor;
  6166. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6167. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6168. BEGIN
  6169. NEW(string, LEN(s)); COPY(s, string^);
  6170. sv := SyntaxTree.NewStringValue(-1,string);
  6171. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  6172. sv.SetType(type);
  6173. Designate(sv,res);
  6174. Emit(Push(position,res.tag));
  6175. Emit(Push(position,res.op));
  6176. ReleaseOperand(res);
  6177. END PushConstString;
  6178. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6179. BEGIN
  6180. IF b THEN
  6181. Emit(Push(-1, true));
  6182. ELSE
  6183. Emit(Push(-1, false));
  6184. END;
  6185. END PushConstBoolean;
  6186. PROCEDURE PushConstSet(v: SET);
  6187. VAR value: SyntaxTree.Value; op: Operand;
  6188. BEGIN
  6189. value := SyntaxTree.NewSetValue(-1, v);
  6190. value.SetType(system.setType);
  6191. Evaluate(value, op);
  6192. Emit(Push(-1, op.op));
  6193. ReleaseOperand(op);
  6194. END PushConstSet;
  6195. PROCEDURE PushConstInteger(v: LONGINT);
  6196. VAR value: SyntaxTree.Value; op: Operand;
  6197. BEGIN
  6198. value := SyntaxTree.NewIntegerValue(-1, v);
  6199. value.SetType(system.longintType);
  6200. Evaluate(value, op);
  6201. Emit(Push(-1, op.op));
  6202. ReleaseOperand(op);
  6203. END PushConstInteger;
  6204. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6205. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6206. section: IntermediateCode.Section;
  6207. BEGIN
  6208. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6209. Global.GetSymbolSegmentedName(symbol, name);
  6210. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6211. procedure := SyntaxTree.NewProcedure(-1, SyntaxTree.NewIdentifier(""), procedureScope);
  6212. procedure.SetScope(moduleScope);
  6213. procedure.SetType(SyntaxTree.NewProcedureType(-1,scope));
  6214. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6215. procedure.SetAccess(SyntaxTree.Hidden);
  6216. currentScope := procedureScope;
  6217. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6218. EmitEnter(section, -1,NIL,0,0,0);
  6219. RETURN section;
  6220. END OpenInitializer;
  6221. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6222. BEGIN
  6223. EmitLeave(section, 0, 0 );
  6224. Emit(Exit(-1,ToMemoryUnits(system,addressType.sizeInBits),0));
  6225. section := prev;
  6226. END CloseInitializer;
  6227. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6228. VAR name: SyntaxTree.IdentifierString;
  6229. variable: SyntaxTree.Variable;
  6230. type: SyntaxTree.Type;
  6231. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6232. BEGIN
  6233. InitOperand(op,ModeReference);
  6234. op.op := fp;
  6235. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6236. Dereference(op, x, FALSE);
  6237. result := op;
  6238. Symbol(symbol, op);
  6239. END Field;
  6240. PROCEDURE Direction(direction: LONGINT): SET;
  6241. BEGIN
  6242. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6243. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6244. ELSE HALT(100);
  6245. END;
  6246. END Direction;
  6247. PROCEDURE AddPortProperty(port: SyntaxTree.Variable; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6248. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6249. BEGIN
  6250. Field(port, op);
  6251. ToMemory(op.op,addressType,0);
  6252. Emit(Push(-1, op.op));
  6253. ReleaseOperand(op);
  6254. Basic.GetString(modifier.identifier, name);
  6255. PushConstString(name);
  6256. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6257. ASSERT(SemanticChecker.IsStringType(value.type));
  6258. Designate(value, op);
  6259. Emit(Push(modifier.position, op.tag));
  6260. Emit(Push(modifier.position, op.op));
  6261. ReleaseOperand(op);
  6262. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6263. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6264. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6265. Evaluate(value, op);
  6266. Emit(Push(modifier.position, op.op));
  6267. ReleaseOperand(op);
  6268. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6269. ELSE
  6270. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6271. END;
  6272. END AddPortProperty;
  6273. PROCEDURE AddPortProperties(variable: SyntaxTree.Variable);
  6274. VAR modifier: SyntaxTree.Modifier;
  6275. BEGIN
  6276. modifier := variable.modifiers;
  6277. WHILE modifier # NIL DO
  6278. AddPortProperty(variable,modifier, modifier.expression);
  6279. modifier := modifier.nextModifier;
  6280. END;
  6281. END AddPortProperties;
  6282. PROCEDURE Variable(name: ARRAY OF CHAR; variable: SyntaxTree.Variable);
  6283. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6284. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6285. PROCEDURE PushLens(type: SyntaxTree.Type);
  6286. BEGIN
  6287. IF IsSemiDynamicArray(type) THEN
  6288. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6289. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6290. Emit(Push(-1, op.op));
  6291. ReleaseOperand(op);
  6292. INC(dim);
  6293. ELSIF IsStaticArray(type) THEN
  6294. len := len * type(SyntaxTree.ArrayType).staticLength;
  6295. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6296. INC(dim);
  6297. ELSE
  6298. baseType := type;
  6299. END;
  6300. END PushLens;
  6301. BEGIN
  6302. (* cell *)
  6303. IF variable.type IS SyntaxTree.ArrayType THEN
  6304. type := variable.type;
  6305. dim := 0;
  6306. len := 1;
  6307. PushLens(type);
  6308. portType := baseType.resolved(SyntaxTree.PortType);
  6309. ELSE
  6310. portType := variable.type(SyntaxTree.PortType);
  6311. END;
  6312. PushSelfPointer();
  6313. (* port / array of ports *)
  6314. IF IsStaticArray(type) THEN
  6315. PushConstInteger(len);
  6316. END;
  6317. Field(variable, op);
  6318. (*left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6319. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(x);
  6320. d := SyntaxTree.NewSymbolDesignator(-1, left, variable); d.SetType(variable.type);
  6321. Designate(d, op);*)
  6322. Emit(Push(-1, op.op));
  6323. ReleaseOperand(op);
  6324. (* name *)
  6325. PushConstString(name);
  6326. (* inout *)
  6327. PushConstSet(Direction(portType.direction));
  6328. (* width *)
  6329. PushConstInteger(portType.sizeInBits);
  6330. IF variable.type IS SyntaxTree.PortType THEN
  6331. CallThis(variable.position,"ActiveCellsRuntime","AddPort",6);
  6332. AddPortProperties(variable);
  6333. ELSIF IsStaticArray(type)THEN
  6334. CallThis(variable.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6335. ELSIF IsSemiDynamicArray(type) THEN
  6336. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6337. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6338. Emit(Add(position,reg, sp, size));
  6339. (* dim *)
  6340. PushConstInteger(dim);
  6341. (* len array *)
  6342. Emit(Push(position, reg));
  6343. ReleaseIntermediateOperand(reg);
  6344. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6345. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6346. Emit(Add(position, sp,sp, size));
  6347. ELSE
  6348. HALT(100);
  6349. END;
  6350. END Variable;
  6351. BEGIN
  6352. IF backend.cellsAreObjects THEN
  6353. variable := x.cellScope.firstVariable;
  6354. WHILE (variable # NIL) DO
  6355. type := variable.type.resolved;
  6356. WHILE (type IS SyntaxTree.ArrayType) DO
  6357. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6358. END;
  6359. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6360. Global.GetSymbolNameInScope(variable,x.cellScope,name);
  6361. Variable(name,variable);
  6362. END;
  6363. variable := variable.nextVariable;
  6364. END;
  6365. ELSE HALT(200)
  6366. END;
  6367. (*prevActiveCellsScope := currentActiveCellsScope;*)
  6368. (*
  6369. x.typeDeclaration.GetName(componentName);
  6370. instanceType := currentActiveCellsScope.NewType(componentName); (*backend.cification.NewType(componentName);*)
  6371. IF HasValue(x.modifiers,Global.StringDataMemorySize,dataMemorySize) THEN
  6372. instanceType.SetDataMemorySize(dataMemorySize);
  6373. END;
  6374. IF HasValue(x.modifiers,Global.StringCodeMemorySize,codeMemorySize) THEN
  6375. instanceType.SetInstructionMemorySize(codeMemorySize)
  6376. END;
  6377. IF HasFlag(x.modifiers, Global.StringVector) THEN
  6378. instanceType.AddCapability(ActiveCells.VectorCapability)
  6379. END;
  6380. IF HasFlag(x.modifiers, Global.StringTRMS) THEN
  6381. instanceType.AddCapability(ActiveCells.TRMSCapability)
  6382. END;
  6383. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN
  6384. instanceType.AddCapability(ActiveCells.FloatingPointCapability)
  6385. END;
  6386. AddDevices(instanceType, x);
  6387. *)
  6388. (*
  6389. IF x.isCellNet THEN
  6390. IF HasValue(x.modifiers,Global.StringFrequencyDivider,value) THEN backend.activeCellsSpecification.SetFrequencyDivider(value) END;
  6391. END;
  6392. *)
  6393. (*currentActiveCellsScope := instanceType;*)
  6394. (*
  6395. parameter := x.firstParameter;
  6396. portIndex := 0;
  6397. WHILE parameter # NIL DO
  6398. parameter.GetName(parameterName);
  6399. parameterType := parameter.type.resolved;
  6400. Parameter(parameterName, parameterType);
  6401. (*
  6402. IF SemanticChecker.IsStaticArray(parameterType,parameterType,len) THEN
  6403. ParameterArray(parameterType);
  6404. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6405. FOR i := 0 TO len-1 DO
  6406. COPY(parameterName,name);
  6407. AppendIndex(name,i);
  6408. port := instanceType.NewPort(name,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6409. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6410. INC(portIndex);
  6411. END;
  6412. ELSE
  6413. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6414. port := instanceType.NewPort(parameterName,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6415. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6416. INC(portIndex);
  6417. END;
  6418. *)
  6419. parameter := parameter.nextParameter;
  6420. END;
  6421. *)
  6422. (*
  6423. Scope(x.cellScope);
  6424. currentActiveCellsScope := prevActiveCellsScope;
  6425. AddModules(instanceType,x.cellScope);
  6426. *)
  6427. END AddPorts;
  6428. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6429. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6430. BEGIN
  6431. Symbol(cell,op);
  6432. ToMemory(op.op,addressType,0);
  6433. Emit(Push(position,op.op));
  6434. ReleaseOperand(op);
  6435. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6436. PushConstString(name);
  6437. IF (value # NIL) THEN
  6438. ASSERT(
  6439. SemanticChecker.IsStringType(property.type)
  6440. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6441. OR (property.type.resolved IS SyntaxTree.FloatType)
  6442. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6443. OR (property.type.resolved IS SyntaxTree.SetType)
  6444. );
  6445. left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6446. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(cellType);
  6447. d := SyntaxTree.NewSymbolDesignator(-1, left, property); d.SetType(property.type);
  6448. Designate(d, op);
  6449. IF SemanticChecker.IsStringType(property.type) THEN
  6450. Emit(Push(-1, op.tag))
  6451. END;
  6452. Emit(Push(-1, op.op));
  6453. ReleaseOperand(op);
  6454. END;
  6455. IF value = NIL THEN
  6456. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6457. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6458. ASSERT(SemanticChecker.IsStringType(value.type));
  6459. Designate(value, op);
  6460. Emit(Push(property.position, op.tag));
  6461. Emit(Push(property.position, op.op));
  6462. ReleaseOperand(op);
  6463. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6464. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6465. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6466. Evaluate(value, op);
  6467. Emit(Push(property.position, op.op));
  6468. ReleaseOperand(op);
  6469. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6470. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6471. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6472. Evaluate(value, op);
  6473. Emit(Push(property.position, op.op));
  6474. ReleaseOperand(op);
  6475. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6476. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6477. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6478. Evaluate(value, op);
  6479. Emit(Push(property.position, op.op));
  6480. ReleaseOperand(op);
  6481. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6482. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6483. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6484. Evaluate(value, op);
  6485. Emit(Push(property.position, op.op));
  6486. ReleaseOperand(op);
  6487. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6488. ELSE
  6489. HALT(200);
  6490. END;
  6491. END AddProperty;
  6492. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6493. VAR symbol: SyntaxTree.Symbol;
  6494. BEGIN
  6495. WHILE modifier # NIL DO
  6496. symbol := cellType.cellScope.FindSymbol(modifier.identifier);
  6497. IF (symbol # NIL) & (symbol IS SyntaxTree.Property) THEN
  6498. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6499. ELSE
  6500. (*! move this check to checker *)
  6501. Error(modifier.position, "undefined property");
  6502. END;
  6503. modifier := modifier.nextModifier;
  6504. END;
  6505. END AddModifiers;
  6506. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6507. VAR last: SyntaxTree.Modifier;
  6508. BEGIN
  6509. IF to = NIL THEN
  6510. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6511. ELSE
  6512. last := to;
  6513. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6514. last := last.nextModifier;
  6515. END;
  6516. IF last.identifier # this.identifier THEN
  6517. ASSERT(last.nextModifier = NIL);
  6518. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6519. END;
  6520. END;
  6521. END AppendModifier;
  6522. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6523. BEGIN
  6524. WHILE this # NIL DO
  6525. AppendModifier(to, this);
  6526. this := this.nextModifier;
  6527. END;
  6528. END AppendModifiers;
  6529. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6530. VAR base: SyntaxTree.Type;
  6531. BEGIN
  6532. AppendModifiers(to, c.modifiers);
  6533. base := c.GetBaseValueType();
  6534. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6535. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6536. END;
  6537. END AppendCellTypeModifiers;
  6538. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6539. VAR op: Operand;
  6540. BEGIN
  6541. Evaluate(p, op);
  6542. Emit(Push(p.position, op.op));
  6543. ReleaseOperand(op);
  6544. (*
  6545. WHILE (p # NIL) & ~(p.type.resolved IS SyntaxTree.CellType) DO
  6546. p := p(SyntaxTree.Designator).left;
  6547. END;
  6548. IF p # NIL THEN
  6549. Evaluate(p, op);
  6550. Emit(Push(p.position, op.op));
  6551. ReleaseOperand(op);
  6552. ELSE
  6553. Emit(Push(-1, nil));
  6554. END;
  6555. *)
  6556. END PushPort;
  6557. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6558. VAR
  6559. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6560. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6561. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6562. tmp:IntermediateCode.Operand;
  6563. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6564. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6565. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6566. dest: IntermediateCode.Operand;
  6567. staticLength: LONGINT; itype: IntermediateCode.Type;
  6568. convert,isTensor: BOOLEAN;
  6569. recordType: SyntaxTree.RecordType;
  6570. baseType: SyntaxTree.Type;
  6571. flags: SET;
  6572. left: SyntaxTree.Expression;
  6573. call: SyntaxTree.Designator;
  6574. procedure: SyntaxTree.Procedure;
  6575. temporaryVariable: SyntaxTree.Variable;
  6576. dummy: IntermediateCode.Operand;
  6577. customBuiltin: SyntaxTree.CustomBuiltin;
  6578. isVarPar: ARRAY 3 OF BOOLEAN;
  6579. callsection: Sections.Section;
  6580. segmentedName: Basic.SegmentedName;
  6581. needsTrace: BOOLEAN;
  6582. n: ARRAY 256 OF CHAR;
  6583. modifier: SyntaxTree.Modifier;
  6584. previous, init: IntermediateCode.Section;
  6585. prevScope: SyntaxTree.Scope;
  6586. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6587. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6588. priority: IntermediateCode.Operand;
  6589. op,callop: Operand;
  6590. BEGIN
  6591. IF type = NIL THEN RETURN END;
  6592. type := type.resolved;
  6593. IF type IS SyntaxTree.PointerType THEN
  6594. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6595. END;
  6596. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6597. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6598. recordScope := type(SyntaxTree.RecordType).recordScope;
  6599. IF recordScope.bodyProcedure # NIL THEN
  6600. procedure := recordScope.bodyProcedure;
  6601. body := procedure.procedureScope.body;
  6602. Emit(Push(position,self));
  6603. IF body.isActive THEN
  6604. StaticCallOperand(callop,procedure);
  6605. Emit(Push(position,callop.op));
  6606. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6607. Convert(priority,sizeType);
  6608. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6609. END;
  6610. Emit(Push(position,priority));
  6611. ReleaseIntermediateOperand(priority);
  6612. IF backend.cooperative THEN
  6613. Emit(Push(position,self));
  6614. CallThis(position,"Activities","Create",3)
  6615. ELSE
  6616. flags := 0;
  6617. IF body.isSafe THEN
  6618. flags := 1;
  6619. END;
  6620. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6621. Emit(Push(position,self));
  6622. CallThis(position,"Objects","CreateProcess",4)
  6623. END;
  6624. ELSE
  6625. Emit(Push(position,self));
  6626. StaticCallOperand(callop,procedure);
  6627. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6628. END;
  6629. Emit(Pop(position,self));
  6630. END;
  6631. END CallBodies;
  6632. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6633. BEGIN
  6634. actualType := actualType.resolved;
  6635. IF actualType IS SyntaxTree.StringType THEN
  6636. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6637. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6638. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6639. ELSE
  6640. tmp := op.tag;
  6641. IntermediateCode.MakeMemory(tmp,addressType);
  6642. Emit(Push(position,tmp));
  6643. END;
  6644. Emit(Push(position,op.op))
  6645. END PushString;
  6646. PROCEDURE PushTD(type: SyntaxTree.Type);
  6647. VAR op: IntermediateCode.Operand;
  6648. BEGIN
  6649. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6650. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6651. ELSE
  6652. IF type.resolved IS SyntaxTree.PointerType THEN
  6653. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6654. END;
  6655. op := TypeDescriptorAdr(type.resolved);
  6656. IF ~newObjectFile THEN
  6657. IntermediateCode.MakeMemory(op,addressType);
  6658. END;
  6659. Emit(Push(position,op));
  6660. END
  6661. END PushTD;
  6662. BEGIN
  6663. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6664. dest := destination; destination := emptyOperand;
  6665. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6666. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6667. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6668. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6669. CASE x.id OF
  6670. (* ---- COPY ----- *)
  6671. |Global.Copy:
  6672. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6673. (* ---- EXCL, INCL----- *)
  6674. |Global.Excl,Global.Incl:
  6675. Evaluate(p0,s0);
  6676. Evaluate(p1,s1);
  6677. Convert(s1.op,setType);
  6678. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6679. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6680. END;
  6681. ReuseCopy(res,s0.op);
  6682. ReleaseOperand(s0);
  6683. Reuse1(tmp,s1.op);
  6684. ReleaseOperand(s1);
  6685. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6686. IF x.id = Global.Excl THEN
  6687. Emit(Not(position,tmp,tmp));
  6688. Emit(And(position,res,res,tmp));
  6689. ELSE
  6690. Emit(Or(position,res,res,tmp));
  6691. END;
  6692. ReleaseIntermediateOperand(tmp);
  6693. Designate(p0,s0);
  6694. ToMemory(s0.op,setType,0);
  6695. Emit(Mov(position,s0.op,res));
  6696. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6697. (* ---- DISPOSE ----- *)
  6698. |Global.Dispose:
  6699. Designate(p0,s0);
  6700. Emit(Push(position,s0.op));
  6701. ReleaseOperand(s0);
  6702. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6703. (* ---- GETPROCEDURE ----- *)
  6704. |Global.GetProcedure:
  6705. Designate(p0,s0);
  6706. PushString(s0,p0.type);
  6707. Designate(p1,s1);
  6708. PushString(s1,p1.type);
  6709. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6710. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6711. ELSE PushTD(procedureType.firstParameter.type)
  6712. END;
  6713. PushTD(procedureType.returnType);
  6714. Designate(p2,s2);
  6715. Emit(Push(position,s2.op));
  6716. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6717. CallThis(position,"Modules","GetProcedure", 7);
  6718. (* ---- ASH, LSH, ROT ----- *)
  6719. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6720. Evaluate(p0,s0);
  6721. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6722. (* make unsigned arguments in order to produced a logical shift *)
  6723. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6724. convert:= TRUE;
  6725. itype := s0.op.type;
  6726. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6727. Convert(s0.op,itype);
  6728. ELSE
  6729. convert := FALSE;
  6730. END;
  6731. END;
  6732. Evaluate(p1,s1);
  6733. IF IsIntegerConstant(p1,hint) THEN
  6734. ReuseCopy(reg,s0.op);
  6735. IF hint > 0 THEN
  6736. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6737. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6738. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6739. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  6740. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  6741. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  6742. END;
  6743. ELSIF hint < 0 THEN
  6744. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  6745. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  6746. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  6747. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  6748. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  6749. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  6750. END;
  6751. END;
  6752. ReleaseOperand(s0); ReleaseOperand(s1);
  6753. ELSE
  6754. exit := NewLabel();
  6755. end := NewLabel();
  6756. ReuseCopy(reg,s0.op);
  6757. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  6758. Reuse1(tmp,s1.op);
  6759. Emit(Neg(position,tmp,s1.op));
  6760. Convert(tmp,s1.op.type);
  6761. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  6762. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  6763. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  6764. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  6765. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  6766. END;
  6767. ReleaseIntermediateOperand(tmp);
  6768. BrL(end);
  6769. SetLabel(exit);
  6770. ReuseCopy(tmp,s1.op);
  6771. Convert(tmp,s1.op.type);
  6772. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  6773. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  6774. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  6775. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  6776. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  6777. END;
  6778. ReleaseIntermediateOperand(tmp);
  6779. SetLabel(end);
  6780. ReleaseOperand(s0); ReleaseOperand(s1);
  6781. END;
  6782. InitOperand(result,ModeValue);
  6783. IF convert THEN
  6784. itype := reg.type;
  6785. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  6786. Convert(reg,itype);
  6787. END;
  6788. result.op := reg;
  6789. (* ---- CAP ----- *)
  6790. |Global.Cap:
  6791. Evaluate(p0,result);
  6792. ReuseCopy(reg,result.op);
  6793. ReleaseIntermediateOperand(result.op);
  6794. ignore := NewLabel();
  6795. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  6796. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  6797. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  6798. SetLabel(ignore);
  6799. result.op := reg;
  6800. (* ---- CHR ----- *)
  6801. |Global.Chr, Global.Chr32:
  6802. Evaluate(p0,result);
  6803. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6804. |Global.Entier, Global.EntierH:
  6805. Evaluate(p0,result);
  6806. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6807. (* ---- MIN and MAX ----- *)
  6808. |Global.Max,Global.Min:
  6809. Evaluate(p0,s0);
  6810. Evaluate(p1,s1);
  6811. Reuse2(res,s0.op,s1.op);
  6812. else := NewLabel();
  6813. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  6814. ELSE BrltL(else,s1.op,s0.op) END;
  6815. Emit(Mov(position,res,s0.op));
  6816. ReleaseOperand(s0);
  6817. end := NewLabel();
  6818. BrL(end);
  6819. SetLabel(else);
  6820. Emit(MovReplace(position,res,s1.op));
  6821. SetLabel(end);
  6822. ReleaseOperand(s1);
  6823. InitOperand(result,ModeValue);
  6824. result.op := res;
  6825. (* ---- ODD ----- *)
  6826. |Global.Odd:
  6827. IF ~conditional THEN
  6828. ConditionToValue(x)
  6829. ELSE
  6830. Evaluate(p0,result);
  6831. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6832. Reuse1(res,result.op);
  6833. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  6834. ReleaseIntermediateOperand(result.op);
  6835. result.op := res;
  6836. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  6837. ReleaseOperand(result);
  6838. BrL(falseLabel);
  6839. END;
  6840. (* ---- ORD ----- *)
  6841. |Global.Ord, Global.Ord32:
  6842. Evaluate(p0,result);
  6843. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6844. (* ---- SHORT, LONG ----- *)
  6845. |Global.Short, Global.Long:
  6846. Evaluate(p0,result);
  6847. IF x.type IS SyntaxTree.ComplexType THEN
  6848. componentType := x.type(SyntaxTree.ComplexType).componentType;
  6849. Convert(result.op, IntermediateCode.GetType(system, componentType));
  6850. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  6851. ELSE
  6852. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6853. END
  6854. (* ---- HALT, SYSTEM.HALT----- *)
  6855. |Global.Halt, Global.systemHalt:
  6856. val := p0.resolved(SyntaxTree.IntegerValue).value;
  6857. EmitTrap (position, val);
  6858. (* ---- ASSERT ----- *)
  6859. |Global.Assert:
  6860. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  6861. trueL := NewLabel();
  6862. falseL := NewLabel();
  6863. Condition(p0,trueL,falseL);
  6864. IF p1 = NIL THEN val := AssertTrap
  6865. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  6866. END;
  6867. SetLabel(falseL);
  6868. EmitTrap(position,val);
  6869. SetLabel(trueL);
  6870. END;
  6871. (*
  6872. Emit(TrapC(result.op,val);
  6873. *)
  6874. (* ---- INC, DEC----- *)
  6875. |Global.Inc,Global.Dec:
  6876. Expression(p0); adr := result.op;
  6877. LoadValue(result,p0.type); l := result;
  6878. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6879. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  6880. END;
  6881. IF x.id = Global.Inc THEN
  6882. Emit(Add(position,l.op,l.op,r.op));
  6883. ELSE
  6884. Emit(Sub(position,l.op,l.op,r.op));
  6885. END;
  6886. ReleaseOperand(l); ReleaseOperand(r);
  6887. (* ---- LEN ----- *)
  6888. |Global.Len: (* dynamic length, static length done by checker *)
  6889. Designate(p0,operand);
  6890. IF p1 = NIL THEN
  6891. InitOperand(l,ModeValue);
  6892. l.op := IntermediateCode.Immediate(int32,0);
  6893. ELSE
  6894. Evaluate(p1,l);
  6895. END;
  6896. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  6897. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  6898. Dereference(operand, p0.type.resolved, FALSE);
  6899. END;
  6900. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  6901. ReleaseOperand(operand); ReleaseOperand(l);
  6902. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  6903. ASSERT(p1 # NIL);
  6904. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  6905. Dereference(operand,p0.type.resolved,FALSE);
  6906. END;
  6907. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  6908. ReleaseOperand(operand); ReleaseOperand(l);
  6909. ELSE HALT(100);
  6910. END;
  6911. Convert(result.op,IntermediateCode.GetType(system, x.type));
  6912. (* ---- FIRST ---- *)
  6913. |Global.First:
  6914. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6915. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  6916. ELSE
  6917. Designate(p0, result)
  6918. END
  6919. (* ---- LAST ---- *)
  6920. |Global.Last:
  6921. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6922. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  6923. ELSE
  6924. Designate(p0, result);
  6925. (* make sure result.op is a register *)
  6926. tmp := result.op;
  6927. ReuseCopy(result.op, result.op);
  6928. ReleaseIntermediateOperand(tmp);
  6929. (* add offset to result.op *)
  6930. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6931. END
  6932. (* ---- STEP ---- *)
  6933. |Global.Step:
  6934. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6935. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  6936. ELSE
  6937. Designate(p0, result);
  6938. (* make sure result.op is a register *)
  6939. tmp := result.op;
  6940. ReuseCopy(result.op, result.op);
  6941. ReleaseIntermediateOperand(tmp);
  6942. (* add offset to result.op *)
  6943. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6944. END
  6945. (* ---- RE ---- *)
  6946. |Global.Re:
  6947. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  6948. Designate(p0, result)
  6949. ELSE
  6950. Evaluate(p0, result)
  6951. END
  6952. (* ---- IM ---- *)
  6953. |Global.Im:
  6954. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  6955. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  6956. Designate(p0, result);
  6957. (* make sure result.op is a register *)
  6958. tmp := result.op;
  6959. ReuseCopy(result.op, result.op);
  6960. ReleaseIntermediateOperand(tmp);
  6961. (* add offset to result.op *)
  6962. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  6963. (* ---- ABS ----- *)
  6964. |Global.Abs:
  6965. Evaluate(p0,operand);
  6966. type := p0.type.resolved;
  6967. InitOperand(result,ModeValue);
  6968. Reuse1a(result.op,operand.op,dest);
  6969. Emit(Abs(position,result.op,operand.op));
  6970. ReleaseOperand(operand);
  6971. (* ---- WAIT ----- *)
  6972. |Global.Wait:
  6973. Evaluate(p0,operand);
  6974. Emit(Push(position,operand.op));
  6975. ReleaseOperand(operand);
  6976. CallThis(position,"Activities","Wait", 1);
  6977. (* ---- NEW ----- *)
  6978. |Global.New:
  6979. (*! the following code is only correct for "standard" Oberon calling convention *)
  6980. type := p0.type.resolved;
  6981. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  6982. THEN
  6983. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  6984. IF backend.cooperative THEN
  6985. size := ToMemoryUnits(system,system.SizeOf(recordType));
  6986. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6987. IF recordType.isObject THEN
  6988. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6989. IF recordType.IsActive() THEN
  6990. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6991. END;
  6992. IF recordType.IsProtected() THEN
  6993. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6994. END;
  6995. ELSE
  6996. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6997. END;
  6998. END;
  6999. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7000. CallThis(position,"Runtime","New", 1);
  7001. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7002. Emit(Result(position, pointer));
  7003. exit := NewLabel();
  7004. BreqL(exit,pointer,nil);
  7005. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7006. GetRecordTypeName (recordType,name);
  7007. IF ~recordType.isObject THEN
  7008. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7009. END;
  7010. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7011. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7012. IF recordType.isObject THEN
  7013. IF recordType.IsProtected() THEN
  7014. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7015. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7016. END;
  7017. IF recordType.IsActive() THEN
  7018. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7019. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7020. END;
  7021. END;
  7022. END;
  7023. (* initialize fields *)
  7024. IF type(SyntaxTree.PointerType).isPlain THEN
  7025. size := 0;
  7026. ELSIF recordType.isObject THEN
  7027. size := BaseObjectTypeSize;
  7028. ELSE
  7029. size := BaseRecordTypeSize;
  7030. END;
  7031. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7032. (* call initializer *)
  7033. constructor := GetConstructor(recordType);
  7034. IF constructor # NIL THEN
  7035. (*! should be unified with ProcedureCallDesignator *)
  7036. Emit(Push(position,pointer));
  7037. ReleaseIntermediateOperand(pointer);
  7038. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7039. FOR i := 1 TO x.parameters.Length()-1 DO
  7040. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7041. formalParameter := formalParameter.nextParameter;
  7042. END;
  7043. (* static call of the constructor *)
  7044. GetCodeSectionNameForSymbol(constructor,name);
  7045. ASSERT(~constructor.isInline);
  7046. IF constructor.scope.ownerModule # module.module THEN
  7047. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7048. ELSE
  7049. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7050. END;
  7051. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7052. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7053. Emit(Pop(position,pointer));
  7054. END;
  7055. (* call bodies *)
  7056. CallBodies(pointer,p0.type);
  7057. SetLabel(exit);
  7058. needsTrace := p0.NeedsTrace();
  7059. IF needsTrace THEN ModifyAssignments(true) END;
  7060. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7061. Emit(Push(position, pointer));
  7062. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7063. Emit(Pop(position, pointer));
  7064. END;
  7065. Designate(p0,l);
  7066. IF needsTrace THEN
  7067. CallAssignPointer(l.op, pointer);
  7068. ELSE
  7069. ToMemory(l.op,addressType,0);
  7070. Emit(Mov(position,l.op,pointer));
  7071. END;
  7072. ReleaseIntermediateOperand(pointer);
  7073. ReleaseOperand(l);
  7074. IF needsTrace THEN ModifyAssignments(false) END;
  7075. ELSE
  7076. temporaryVariable := GetTemporaryVariable(type, FALSE);
  7077. IF temporaryVariable # NIL THEN
  7078. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7079. ELSE
  7080. Designate(p0,l);
  7081. END;
  7082. (* l.op contains address of pointer to record *)
  7083. Emit(Push(position,l.op)); (* address for use after syscall *)
  7084. Emit(Push(position,l.op));
  7085. ReleaseOperand(l);
  7086. (* push type descriptor *)
  7087. reg := TypeDescriptorAdr(recordType);
  7088. IF ~newObjectFile THEN
  7089. IntermediateCode.MakeMemory(reg,addressType);
  7090. END;
  7091. Emit(Push(position,reg));
  7092. ReleaseIntermediateOperand(reg);
  7093. (* push realtime flag *)
  7094. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7095. ELSE Emit(Push(position,false));
  7096. END;
  7097. CallThis(position,"Heaps","NewRec", 3);
  7098. (* check allocation success, if not successful then do not call initializers and bodies *)
  7099. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7100. Emit(Pop(position,pointer));
  7101. MakeMemory(reg,pointer,addressType,0);
  7102. ReleaseIntermediateOperand(pointer);
  7103. pointer := reg;
  7104. exit := NewLabel();
  7105. BreqL(exit,pointer,nil);
  7106. Emit(Push(position,pointer));
  7107. (* initialize fields *)
  7108. InitFields(recordType, pointer,0);
  7109. (* call initializer *)
  7110. constructor := GetConstructor(recordType);
  7111. IF constructor # NIL THEN
  7112. (*! should be unified with ProcedureCallDesignator *)
  7113. Emit(Push(position,pointer));
  7114. ReleaseIntermediateOperand(pointer);
  7115. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7116. FOR i := 1 TO x.parameters.Length()-1 DO
  7117. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7118. formalParameter := formalParameter.nextParameter;
  7119. END;
  7120. (* static call of the constructor *)
  7121. GetCodeSectionNameForSymbol(constructor,name);
  7122. ASSERT(~constructor.isInline);
  7123. IF constructor.scope.ownerModule # module.module THEN
  7124. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7125. ELSE
  7126. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7127. END;
  7128. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7129. ELSE
  7130. ReleaseIntermediateOperand(pointer);
  7131. END;
  7132. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7133. Emit(Pop(position,pointer));
  7134. IF temporaryVariable # NIL THEN
  7135. Designate(p0,l);
  7136. ToMemory(l.op,addressType,0);
  7137. Emit(Mov(position,l.op,pointer));
  7138. ReleaseOperand(l);
  7139. result.tag := emptyOperand;
  7140. END;
  7141. (* call bodies *)
  7142. CallBodies(pointer,p0.type);
  7143. ReleaseIntermediateOperand(pointer);
  7144. IF temporaryVariable # NIL THEN
  7145. end := NewLabel();
  7146. BrL(end);
  7147. SetLabel(exit);
  7148. Designate(p0,l);
  7149. ToMemory(l.op,addressType,0);
  7150. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7151. ReleaseOperand(l);
  7152. SetLabel(end);
  7153. ELSE
  7154. SetLabel(exit);
  7155. END;
  7156. END;
  7157. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7158. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7159. dim := 0;
  7160. IF p1 # NIL THEN
  7161. FOR i := 1 TO x.parameters.Length()-1 DO
  7162. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7163. parameter := x.parameters.GetExpression(i);
  7164. Evaluate(parameter,r);
  7165. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7166. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7167. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7168. END;
  7169. Emit(Push(position,r.op));
  7170. IF i=1 THEN
  7171. ReuseCopy(reg,r.op);
  7172. ELSE
  7173. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7174. END;
  7175. ReleaseOperand(r);
  7176. INC(dim);
  7177. END;
  7178. Convert(reg,addressType);
  7179. ELSE
  7180. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7181. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7182. END;
  7183. openDim := dim;
  7184. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7185. IF backend.cooperative THEN
  7186. size := ToMemoryUnits(system,system.SizeOf(type));
  7187. WHILE type IS SyntaxTree.ArrayType DO
  7188. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7189. END;
  7190. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7191. IF (size # 1) THEN
  7192. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7193. END;
  7194. Emit(Push(position,reg));
  7195. size := ToMemoryUnits(system,system.SizeOf(type));
  7196. IF (size # 1) THEN
  7197. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7198. END;
  7199. Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));
  7200. Emit(Push(position,reg));
  7201. ReleaseIntermediateOperand(reg);
  7202. CallThis(position,"Runtime","New", 1);
  7203. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7204. Emit(Result(position, pointer));
  7205. exit := NewLabel();
  7206. else := NewLabel();
  7207. BreqL(else,pointer,nil);
  7208. IF ~type.hasPointers THEN
  7209. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7210. ELSIF type IS SyntaxTree.RecordType THEN
  7211. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7212. ELSIF type IS SyntaxTree.ProcedureType THEN
  7213. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7214. ELSE
  7215. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7216. END;
  7217. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7218. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7219. 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))));
  7220. IF type IS SyntaxTree.RecordType THEN
  7221. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7222. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7223. ELSE
  7224. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7225. END;
  7226. i := openDim;
  7227. WHILE i > 0 DO
  7228. DEC (i);
  7229. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7230. END;
  7231. needsTrace := p0.NeedsTrace();
  7232. IF needsTrace THEN ModifyAssignments(true) END;
  7233. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7234. Emit(Push(position, pointer));
  7235. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7236. Emit(Pop(position, pointer));
  7237. END;
  7238. Designate(p0,l);
  7239. IF needsTrace THEN
  7240. CallAssignPointer(l.op, pointer);
  7241. ModifyAssignments(false);
  7242. ELSE
  7243. ToMemory(l.op,addressType,0);
  7244. Emit(Mov(position,l.op,pointer));
  7245. END;
  7246. ReleaseIntermediateOperand(pointer);
  7247. ReleaseOperand(l);
  7248. BrL(exit);
  7249. SetLabel(else);
  7250. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7251. Designate(p0,l);
  7252. IF needsTrace THEN
  7253. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7254. ELSE
  7255. ToMemory(l.op,addressType,0);
  7256. Emit(Mov(position,l.op,pointer));
  7257. END;
  7258. ReleaseOperand(l);
  7259. SetLabel(exit);
  7260. ELSE
  7261. (*! the following code is only correct for "standard" Oberon calling convention *)
  7262. IF SemanticChecker.ContainsPointer(type) THEN
  7263. IF type IS SyntaxTree.ArrayType THEN
  7264. staticLength := 1;
  7265. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7266. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7267. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7268. END;
  7269. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7270. Emit(Mul(position,reg,reg,tmp));
  7271. END;
  7272. Designate(p0,l);
  7273. IF openDim > 0 THEN
  7274. Emit(Push(position,l.op)); (* address for use after syscall *)
  7275. END;
  7276. Emit(Push(position,l.op)); (* address *)
  7277. ReleaseOperand(l);
  7278. tmp := TypeDescriptorAdr(type);
  7279. IF ~newObjectFile THEN
  7280. IntermediateCode.MakeMemory(tmp,addressType);
  7281. END;
  7282. Emit(Push(position,tmp)); (* type descriptor *)
  7283. ReleaseIntermediateOperand(tmp);
  7284. Emit(Push(position,reg)); (* number Elements *)
  7285. ReleaseIntermediateOperand(reg);
  7286. tmp := IntermediateCode.Immediate(addressType,dim);
  7287. Emit(Push(position,tmp)); (* dimensions *)
  7288. (* push realtime flag *)
  7289. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7290. ELSE Emit(Push(position,false));
  7291. END;
  7292. CallThis(position,"Heaps","NewArr",5)
  7293. ELSE
  7294. size := ToMemoryUnits(system,system.SizeOf(type));
  7295. IF (size # 1) THEN
  7296. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7297. END;
  7298. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7299. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7300. Emit(Add(position,reg,reg,tmp));
  7301. Designate(p0,l);
  7302. IF openDim >0 THEN
  7303. Emit(Push(position,l.op)); (* address for use after syscall *)
  7304. END;
  7305. Emit(Push(position,l.op)); (* address for syscall *)
  7306. ReleaseOperand(l); (* pointer address *)
  7307. Emit(Push(position,reg)); (* size *)
  7308. ReleaseIntermediateOperand(reg);
  7309. (* push realtime flag *)
  7310. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7311. ELSE Emit(Push(position,false));
  7312. END;
  7313. CallThis(position,"Heaps","NewSys", 3)
  7314. END;
  7315. IF openDim > 0 THEN
  7316. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7317. Emit(Pop(position,adr));
  7318. ToMemory(adr,addressType,0);
  7319. ReuseCopy(tmp,adr);
  7320. ReleaseIntermediateOperand(adr);
  7321. adr := tmp;
  7322. else := NewLabel();
  7323. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7324. i := openDim-1;
  7325. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7326. WHILE (i >= 0) DO
  7327. Emit(Pop(position,reg));
  7328. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7329. Emit(Mov(position,res,reg));
  7330. DEC(i);
  7331. END;
  7332. ReleaseIntermediateOperand(adr);
  7333. ReleaseIntermediateOperand(reg);
  7334. exit := NewLabel();
  7335. BrL(exit);
  7336. SetLabel(else);
  7337. (* else part: array could not be allocated *)
  7338. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7339. Emit(Add(position,sp,sp,tmp));
  7340. SetLabel(exit);
  7341. END;
  7342. END;
  7343. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7344. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7345. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7346. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7347. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7348. left.SetType(procedure.type);
  7349. formalParameter := procedureType.firstParameter;
  7350. (* push array to allocate *)
  7351. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7352. formalParameter :=formalParameter.nextParameter;
  7353. (* push length array *)
  7354. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7355. (* push size *)
  7356. type := t0;
  7357. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7358. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7359. END;
  7360. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7361. Emit(Push(position,tmp));
  7362. (* *)
  7363. IF SemanticChecker.ContainsPointer(type) THEN
  7364. tmp := TypeDescriptorAdr(type);
  7365. IF ~newObjectFile THEN
  7366. IntermediateCode.MakeMemory(tmp,addressType);
  7367. END;
  7368. ELSE
  7369. tmp := IntermediateCode.Immediate(addressType, 0);
  7370. END;
  7371. Emit(Push(position,tmp)); (* type descriptor *)
  7372. StaticCallOperand(result,procedure);
  7373. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7374. ReleaseOperand(result);
  7375. END;
  7376. (*
  7377. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7378. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7379. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7380. *)
  7381. ELSE
  7382. dim := 0;
  7383. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7384. (* generate geometry descriptor *)
  7385. Designate(p0,l);
  7386. NewMathArrayDescriptor(l, x.parameters.Length()-1);
  7387. ReleaseOperand(l);
  7388. isTensor := TRUE;
  7389. ELSE
  7390. isTensor := FALSE;
  7391. END;
  7392. FOR i := 1 TO x.parameters.Length()-1 DO
  7393. IF ~isTensor THEN
  7394. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7395. END;
  7396. parameter := x.parameters.GetExpression(i);
  7397. Evaluate(parameter,r);
  7398. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7399. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7400. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7401. END;
  7402. Emit(Push(position,r.op));
  7403. IF i=1 THEN
  7404. ReuseCopy(reg,r.op);
  7405. ELSE
  7406. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7407. END;
  7408. ReleaseOperand(r);
  7409. INC(dim);
  7410. END;
  7411. Convert(reg,addressType);
  7412. openDim := dim;
  7413. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7414. (*! the following code is only correct for "standard" Oberon calling convention *)
  7415. IF SemanticChecker.ContainsPointer(SemanticChecker.ArrayBase(type,MAX(LONGINT))) THEN
  7416. t := type;
  7417. IF ~isTensor & (t IS SyntaxTree.MathArrayType) THEN
  7418. staticLength := 1;
  7419. WHILE (t IS SyntaxTree.MathArrayType) DO (* static array *)
  7420. staticLength := staticLength * t(SyntaxTree.MathArrayType).staticLength;
  7421. t := t(SyntaxTree.MathArrayType).arrayBase.resolved;
  7422. END;
  7423. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7424. Emit(Mul(position,reg,reg,tmp));
  7425. END;
  7426. Designate(p0,l);
  7427. IF isTensor THEN
  7428. Dereference(l,type,FALSE);
  7429. t := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7430. END;
  7431. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7432. Emit(Push(position,l.tag)); (* address *)
  7433. ReleaseOperand(l);
  7434. tmp := TypeDescriptorAdr(t);
  7435. IF ~newObjectFile THEN
  7436. IntermediateCode.MakeMemory(tmp,addressType);
  7437. END;
  7438. Emit(Push(position,tmp)); (* type descriptor *)
  7439. ReleaseIntermediateOperand(tmp);
  7440. Emit(Push(position,reg)); (* number Elements *)
  7441. ReleaseIntermediateOperand(reg);
  7442. tmp := IntermediateCode.Immediate(addressType,0);
  7443. Emit(Push(position,tmp)); (* dimensions = 0, we control dimensions in the geometry descriptor *)
  7444. (* push realtime flag: false by default *)
  7445. Emit(Push(position,false));
  7446. CallThis(position,"Heaps","NewArr",5);
  7447. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7448. Emit(Pop(position,adr));
  7449. GetMathArrayField(tmp,adr,MathPtrOffset);
  7450. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7451. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrDataArrayOffset))));
  7452. PutMathArrayField(adr,reg,MathAdrOffset);
  7453. ReleaseIntermediateOperand(tmp);
  7454. ReleaseIntermediateOperand(reg);
  7455. ELSE
  7456. IF isTensor THEN
  7457. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT))));
  7458. ELSE
  7459. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim)));
  7460. END;
  7461. IF (size # 1) THEN
  7462. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7463. END;
  7464. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset));
  7465. Emit(Add(position,reg,reg,tmp));
  7466. Designate(p0,l);
  7467. IF isTensor THEN
  7468. Dereference(l,type,FALSE);
  7469. END;
  7470. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7471. Emit(Push(position,l.tag)); (* address for syscall *)
  7472. ReleaseOperand(l); (* pointer address *)
  7473. Emit(Push(position,reg)); (* size *)
  7474. ReleaseIntermediateOperand(reg);
  7475. (* push realtime flag: false by default *)
  7476. Emit(Push(position,false));
  7477. CallThis(position,"Heaps","NewSys",3);
  7478. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7479. Emit(Pop(position,adr));
  7480. GetMathArrayField(tmp,adr,MathPtrOffset);
  7481. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7482. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset))));
  7483. PutMathArrayField(adr,reg,MathAdrOffset);
  7484. ReleaseIntermediateOperand(tmp);
  7485. ReleaseIntermediateOperand(reg);
  7486. END;
  7487. flags := {};
  7488. IntermediateCode.InitImmediate(tmp,addressType,SYSTEM.VAL(LONGINT,flags));
  7489. PutMathArrayField(adr,tmp,MathFlagsOffset);
  7490. IntermediateCode.InitImmediate(tmp,addressType,openDim);
  7491. PutMathArrayField(adr,tmp,MathDimOffset);
  7492. else := NewLabel();
  7493. BreqL(else,IntermediateCode.Memory(addressType,adr,0),IntermediateCode.Immediate(addressType,0));
  7494. i := openDim-1;
  7495. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7496. IF isTensor THEN
  7497. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT)))));
  7498. ELSE
  7499. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim))));
  7500. END;
  7501. PutMathArrayField(adr,tmp,MathElementSizeOffset);
  7502. WHILE (i >= 0) DO
  7503. Emit(Pop(position,reg));
  7504. PutMathArrayLength(adr,reg,i);
  7505. PutMathArrayIncrement(adr,tmp,i);
  7506. IF i > 0 THEN
  7507. IF i=openDim-1 THEN
  7508. ReuseCopy(tmp,tmp);
  7509. END;
  7510. Emit(Mul(position,tmp,tmp,reg));
  7511. END;
  7512. DEC(i);
  7513. END;
  7514. ReleaseIntermediateOperand(adr);
  7515. ReleaseIntermediateOperand(reg);
  7516. ReleaseIntermediateOperand(tmp);
  7517. exit := NewLabel();
  7518. BrL(exit);
  7519. SetLabel(else);
  7520. (* else part: array could not be allocated *)
  7521. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7522. Emit(Add(position,sp,sp,tmp));
  7523. SetLabel(exit);
  7524. END;
  7525. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7526. THEN
  7527. IF ~backend.cellsAreObjects THEN RETURN END;
  7528. IF InCellScope(currentScope) THEN
  7529. PushSelfPointer()
  7530. ELSE
  7531. Emit(Push(position, nil));
  7532. END;
  7533. (* push temp address *)
  7534. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7535. temporaryVariable := GetTemporaryVariable(type, FALSE);
  7536. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7537. (* l.op contains address of pointer to record *)
  7538. Emit(Push(position,l.op)); (* address for use after syscall *)
  7539. ReleaseOperand(l);
  7540. (* push type descriptor *)
  7541. reg := TypeDescriptorAdr(baseType);
  7542. IF ~newObjectFile THEN
  7543. IntermediateCode.MakeMemory(reg,addressType);
  7544. END;
  7545. Emit(Push(position,reg));
  7546. ReleaseIntermediateOperand(reg);
  7547. (* push name *)
  7548. (*Global.GetSymbolName(p0, n);*)
  7549. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7550. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7551. ELSE
  7552. Global.GetModuleName(module.module, n);
  7553. END;
  7554. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position);
  7555. (*type.typeDeclaration.GetName(n);*)
  7556. PushConstString(n);
  7557. (* push cellnet boolean *)
  7558. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7559. (* push engine boolean *)
  7560. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7561. (* allocate *)
  7562. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7563. (* add capabilities *)
  7564. modifier := p0(SyntaxTree.Designator).modifiers;
  7565. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7566. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7567. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7568. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7569. END;
  7570. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7571. (*
  7572. modifier := baseType(SyntaxTree.CellType).modifiers;
  7573. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7574. modifier := p0(SyntaxTree.Designator).modifiers;
  7575. *)
  7576. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7577. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7578. (* l.op contains address of pointer to record *)
  7579. ToMemory(l.op,addressType,0);
  7580. (* l.op contains value of pointer to record *)
  7581. Emit(Push(position,l.op)); (* address for use after syscall *)
  7582. ReleaseOperand(l);
  7583. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7584. prevScope := currentScope;
  7585. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7586. previous := section;
  7587. section := init;
  7588. (* add ports *)
  7589. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7590. CloseInitializer(previous);
  7591. currentScope := prevScope;
  7592. Symbol(temporaryVariable,l);
  7593. ToMemory(l.op,addressType,0);
  7594. Emit(Push(position,l.op));
  7595. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7596. (*
  7597. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7598. IF constructor # NIL THEN
  7599. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7600. FOR i := 1 TO x.parameters.Length()-1 DO
  7601. p := x.parameters.GetExpression(i);
  7602. Global.GetSymbolName(parameter,name);
  7603. Evaluate(p, value);
  7604. ASSERT(value.type # NIL);
  7605. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7606. par := instance.AddParameter(name);
  7607. par.SetInteger(value.integer);
  7608. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7609. par := instance.AddParameter(name);
  7610. par.SetBoolean(value.boolean);
  7611. ELSE Error(x.position,NotYetImplemented)
  7612. END;
  7613. parameter := parameter.nextParameter
  7614. END;
  7615. END;
  7616. *)
  7617. (* call initializer *)
  7618. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7619. IF constructor # NIL THEN
  7620. (*! should be unified with ProcedureCallDesignator *)
  7621. IF backend.cellsAreObjects THEN
  7622. Symbol(temporaryVariable,l);
  7623. ToMemory(l.op,addressType,0);
  7624. Emit(Push(position,l.op));
  7625. ReleaseOperand(l);
  7626. END;
  7627. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7628. FOR i := 1 TO x.parameters.Length()-1 DO
  7629. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7630. formalParameter := formalParameter.nextParameter;
  7631. END;
  7632. (* static call of the constructor *)
  7633. Global.GetSymbolSegmentedName(constructor,name);
  7634. ASSERT(~constructor.isInline);
  7635. IF constructor.scope.ownerModule # module.module THEN
  7636. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7637. ELSE
  7638. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7639. END;
  7640. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7641. (*ELSE
  7642. ReleaseIntermediateOperand(pointer);*)
  7643. END;
  7644. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7645. ToMemory(l.op, addressType, 0);
  7646. Designate(p0,s0);
  7647. ToMemory(s0.op,addressType,0);
  7648. Emit(Mov(position,s0.op,l.op));
  7649. ReleaseOperand(l);
  7650. ReleaseOperand(s0);
  7651. result.tag := emptyOperand;
  7652. (* start *)
  7653. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7654. (* push cell *)
  7655. Symbol(temporaryVariable, l);
  7656. ToMemory(l.op,addressType,0);
  7657. Emit(Push(-1,l.op));
  7658. (* push delegate *)
  7659. Emit(Push(-1,l.op));
  7660. ReleaseOperand(l);
  7661. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7662. Emit(Push(position, s1.op));
  7663. ReleaseOperand(s1);
  7664. CallThis(position,"ActiveCellsRuntime","Start",3);
  7665. END;
  7666. (*IF temporaryVariable # NIL THEN
  7667. end := NewLabel();
  7668. BrL(end);
  7669. SetLabel(exit);
  7670. Designate(p0,l);
  7671. ToMemory(l.op,addressType,0);
  7672. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7673. ReleaseOperand(l);
  7674. SetLabel(end);
  7675. ELSE
  7676. SetLabel(exit);
  7677. END;
  7678. *)
  7679. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7680. ELSE (* no pointer to record, no pointer to array *)
  7681. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7682. (* ignore new statement *)
  7683. Warning(p0.position, "cannot run on final hardware");
  7684. ELSE
  7685. HALT(200);
  7686. END;
  7687. END;
  7688. (* ---- ADDRESSOF----- *)
  7689. |Global.systemAdr:
  7690. Designate(p0,s0);
  7691. s0.mode := ModeValue;
  7692. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7693. ReleaseIntermediateOperand(s0.op);
  7694. s0.op := s0.tag;
  7695. IntermediateCode.InitOperand(s0.tag);
  7696. END;
  7697. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7698. result := s0;
  7699. (* ---- BIT ----- *)
  7700. |Global.systemBit:
  7701. Evaluate(p0,s0);
  7702. ToMemory(s0.op,addressType,0);
  7703. ReuseCopy(res,s0.op);
  7704. ReleaseOperand(s0);
  7705. Evaluate(p1,s1);
  7706. Emit(Ror(position,res,res,s1.op));
  7707. ReleaseOperand(s1);
  7708. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7709. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7710. IF ~conditional THEN
  7711. InitOperand(result,ModeValue); result.op := res;
  7712. ELSE
  7713. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7714. BrL(falseLabel);
  7715. ReleaseIntermediateOperand(res);
  7716. END;
  7717. (* --- MSK ----*)
  7718. |Global.systemMsk:
  7719. Evaluate(p0,s0);
  7720. Evaluate(p1,s1);
  7721. ReuseCopy(res,s0.op);
  7722. ReleaseOperand(s0);
  7723. Emit(And(position,res,res,s1.op));
  7724. ReleaseOperand(s1);
  7725. InitOperand(result,ModeValue);
  7726. result.op := res;
  7727. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  7728. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  7729. Evaluate(p0,s0);
  7730. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  7731. ReleaseOperand(s0);
  7732. InitOperand(result,ModeValue);
  7733. result.op := res;
  7734. (* ---- SYSTEM.GetStackPointer ----- *)
  7735. |Global.systemGetStackPointer:
  7736. InitOperand(result,ModeValue);
  7737. result.op := sp;
  7738. (* ---- SYSTEM.GetFramePointer ----- *)
  7739. |Global.systemGetFramePointer:
  7740. InitOperand(result,ModeValue);
  7741. result.op := fp;
  7742. (* ---- SYSTEM.GetActivity ----- *)
  7743. |Global.systemGetActivity:
  7744. ASSERT(backend.cooperative);
  7745. InitOperand(result,ModeValue);
  7746. result.op := ap;
  7747. (* ---- SYSTEM.SetStackPointer ----- *)
  7748. |Global.systemSetStackPointer:
  7749. Evaluate(p0,s0); (* *)
  7750. Emit(Mov(position,sp,s0.op));
  7751. ReleaseOperand(s0);
  7752. (* ---- SYSTEM.SetFramePointer ----- *)
  7753. |Global.systemSetFramePointer:
  7754. Evaluate(p0,s0); (* *)
  7755. Emit(Mov(position,fp,s0.op));
  7756. ReleaseOperand(s0);
  7757. (* ---- SYSTEM.Activity ----- *)
  7758. |Global.systemSetActivity:
  7759. ASSERT(backend.cooperative);
  7760. Evaluate(p0,s0); (* *)
  7761. Emit(Mov(position,ap,s0.op));
  7762. ReleaseOperand(s0);
  7763. (* ---- SYSTEM.VAL ----- *)
  7764. |Global.systemVal:
  7765. Expression(p1);
  7766. s1 := result;
  7767. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7768. IF s1.mode = ModeReference THEN
  7769. (* nothing to be done if not record type, just take over new type *)
  7770. IF (type IS SyntaxTree.RecordType) THEN
  7771. ReleaseIntermediateOperand(s1.tag);
  7772. s1.tag := TypeDescriptorAdr(type);
  7773. IF ~newObjectFile THEN
  7774. IntermediateCode.MakeMemory(s1.tag,addressType);
  7775. END;
  7776. UseIntermediateOperand(s1.tag);
  7777. END;
  7778. result := s1;
  7779. ELSE (* copy over result to different type, may not use convert *)
  7780. itype := IntermediateCode.GetType(system,type);
  7781. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  7782. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  7783. Emit(Mov(position,s0.op,s1.op));
  7784. ReleaseOperand(s1);
  7785. InitOperand(result,ModeValue);
  7786. result.op := s0.op;
  7787. ELSE (* different size, must convert *)
  7788. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  7789. Convert(s1.op, IntermediateCode.GetType(system,type));
  7790. result := s1;
  7791. END;
  7792. END;
  7793. (* ---- SYSTEM.GET ----- *)
  7794. |Global.systemGet:
  7795. Evaluate(p0,s0); (* adr *)
  7796. Designate(p1,s1); (* variable *)
  7797. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  7798. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  7799. Emit(Mov(position,s1.op,s0.op));
  7800. ReleaseOperand(s1);
  7801. ReleaseOperand(s0);
  7802. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  7803. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  7804. Evaluate(p0,s0); (* *)
  7805. Evaluate(p1,s1); (* variable *)
  7806. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  7807. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  7808. (* real part *)
  7809. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  7810. Emit(Mov(position,res, s1.op));
  7811. ReleaseIntermediateOperand(res);
  7812. (* imaginary part *)
  7813. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  7814. Emit(Mov(position,res, s1.tag));
  7815. ReleaseIntermediateOperand(res);
  7816. ReleaseOperand(s1);
  7817. ReleaseOperand(s0);
  7818. ELSE
  7819. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  7820. ReleaseOperand(s0);
  7821. Emit(Mov(position,res,s1.op));
  7822. ReleaseIntermediateOperand(res);
  7823. ReleaseOperand(s1);
  7824. END;
  7825. (* ---- SYSTEM.MOVE ----- *)
  7826. |Global.systemMove:
  7827. Evaluate(p0,s0);
  7828. Evaluate(p1,s1);
  7829. Evaluate(p2,s2);
  7830. Emit(Copy(position,s1.op,s0.op,s2.op));
  7831. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7832. (* ---- SYSTEM.NEW ----- *)
  7833. |Global.systemNew:
  7834. Designate(p0,s0);
  7835. Emit(Push(position,s0.op));
  7836. ReleaseOperand(s0);
  7837. Evaluate(p1,s1);
  7838. Emit(Push(position,s1.op));
  7839. ReleaseOperand(s1);
  7840. (* push realtime flag: false by default *)
  7841. Emit(Push(position,false));
  7842. CallThis(position,"Heaps","NewSys",3);
  7843. (* ---- SYSTEM.CALL ----- *)
  7844. |Global.systemRef:
  7845. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  7846. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  7847. s0.mode := ModeValue;
  7848. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  7849. result := s0
  7850. (* ---- INCR ----- *)
  7851. |Global.Incr:
  7852. Designate(p0,operand);
  7853. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7854. Dereference(operand,p0.type.resolved,FALSE);
  7855. END;
  7856. ASSERT(p1 # NIL);
  7857. Evaluate(p1,l);
  7858. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  7859. ReleaseOperand(operand); ReleaseOperand(l);
  7860. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7861. (* ---- SUM ----- *)
  7862. |Global.Sum: HALT(200);
  7863. (* ---- ALL ----- *)
  7864. |Global.All: HALT(200);
  7865. (* ---- CAS ----- *)
  7866. |Global.Cas:
  7867. needsTrace := p0.NeedsTrace();
  7868. IF needsTrace THEN ModifyAssignments(true) END;
  7869. Designate(p0,s0);
  7870. Evaluate(p1,s1);
  7871. Evaluate(p2,s2);
  7872. IF needsTrace THEN
  7873. Emit(Push(position, s0.op));
  7874. Emit(Push(position, s1.op));
  7875. Emit(Push(position, s2.op));
  7876. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  7877. ELSE
  7878. Emit(Cas(position,s0.op,s1.op,s2.op));
  7879. END;
  7880. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7881. IF needsTrace THEN ModifyAssignments(false) END;
  7882. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7883. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  7884. IF conditional THEN
  7885. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7886. BrL(falseLabel);
  7887. ReleaseIntermediateOperand(res);
  7888. END;
  7889. (* ---- DIM ----- *)
  7890. |Global.Dim:
  7891. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  7892. Designate(p0,s0);
  7893. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7894. Dereference(s0,p0.type.resolved,FALSE);
  7895. END;
  7896. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  7897. ReleaseOperand(s0);
  7898. (* ---- RESHAPE ----- *)
  7899. |Global.Reshape:
  7900. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  7901. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7902. left.SetType(procedure.type);
  7903. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  7904. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  7905. END;
  7906. (* ---- SYSTEM.TYPECODE ----- *)
  7907. |Global.systemTypeCode:
  7908. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7909. IF type.resolved IS SyntaxTree.PointerType THEN
  7910. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7911. END;
  7912. result.op := TypeDescriptorAdr(type);
  7913. IF ~newObjectFile THEN
  7914. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  7915. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  7916. END;
  7917. result.mode := ModeValue;
  7918. (* ---- SYSTEM.TRACE ----- *)
  7919. |Global.systemTrace:
  7920. SystemTrace(x.parameters, x.position);
  7921. (* ----- CONNECT ------*)
  7922. |Global.Connect:
  7923. IF backend.cellsAreObjects THEN
  7924. PushPort(p0);
  7925. PushPort(p1);
  7926. IF p2 # NIL THEN
  7927. Evaluate(p2, s2);
  7928. Emit(Push(p2.position, s2.op));
  7929. ReleaseOperand(s2);
  7930. ELSE
  7931. Emit(Push(-1, IntermediateCode.Immediate(int32, -1)));
  7932. END;
  7933. CallThis(position,"ActiveCellsRuntime","Connect",3);
  7934. ELSE
  7935. Warning(x.position, "cannot run on final hardware");
  7936. END;
  7937. (* ----- DELEGATE ------*)
  7938. |Global.Delegate:
  7939. IF backend.cellsAreObjects THEN
  7940. PushPort(p0);
  7941. PushPort(p1);
  7942. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  7943. ELSE
  7944. Warning(x.position, "cannot run on final hardware");
  7945. END;
  7946. (* ----- SEND ------*)
  7947. |Global.Send:
  7948. Evaluate(p0,s0);
  7949. Evaluate(p1,s1);
  7950. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7951. Emit(Push(position,s0.op));
  7952. Emit(Push(position,s1.op));
  7953. (*
  7954. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7955. *)
  7956. IF ~backend.cellsAreObjects THEN
  7957. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  7958. END;
  7959. ReleaseOperand(s0);
  7960. ReleaseOperand(s1);
  7961. IF backend.cellsAreObjects THEN
  7962. CallThis(position,"ActiveCellsRuntime","Send",2);
  7963. ELSE
  7964. CallThis(position,ChannelModuleName,"Send",2);
  7965. END;
  7966. (* ----- RECEIVE ------*)
  7967. |Global.Receive:
  7968. Evaluate(p0,s0);
  7969. Emit(Push(position,s0.op));
  7970. Designate(p1,s1);
  7971. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7972. Emit(Push(position,s1.op));
  7973. IF p2 # NIL THEN
  7974. Designate(p2,s2);
  7975. Emit(Push(position,s2.op));
  7976. END;
  7977. (*
  7978. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7979. *)
  7980. IF ~backend.cellsAreObjects THEN
  7981. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  7982. END;
  7983. ReleaseOperand(s0);
  7984. ReleaseOperand(s1);
  7985. ReleaseOperand(s2);
  7986. IF backend.cellsAreObjects THEN
  7987. IF p2 = NIL THEN
  7988. CallThis(position,"ActiveCellsRuntime","Receive",2)
  7989. ELSE
  7990. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  7991. END;
  7992. ELSE
  7993. IF p2 = NIL THEN
  7994. CallThis(position,ChannelModuleName,"Receive",2)
  7995. ELSE
  7996. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  7997. END;
  7998. END;
  7999. | Global.systemSpecial:
  8000. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8001. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8002. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8003. (* determine if parameters are of the VAR kind *)
  8004. ASSERT(x.parameters.Length() <= 3);
  8005. formalParameter := procedureType.firstParameter;
  8006. FOR i := 0 TO x.parameters.Length() - 1 DO
  8007. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8008. formalParameter := formalParameter.nextParameter
  8009. END;
  8010. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8011. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8012. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8013. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8014. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8015. IF procedureType.returnType # NIL THEN
  8016. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8017. Emit(Result(position, res));
  8018. (*InitOperand(result,ModeValue);
  8019. result.op := res;
  8020. *)
  8021. IF ~conditional THEN
  8022. InitOperand(result,ModeValue); result.op := res;
  8023. ELSE
  8024. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8025. BrL(falseLabel);
  8026. ReleaseIntermediateOperand(res);
  8027. END;
  8028. END
  8029. ELSE (* function not yet implemented *)
  8030. Error(position,"not yet implemented");
  8031. END;
  8032. destination := dest;
  8033. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8034. END VisitBuiltinCallDesignator;
  8035. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  8036. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8037. BEGIN
  8038. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8039. dest := destination; destination := emptyOperand;
  8040. Expression(x.left);
  8041. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8042. ELSIF isUnchecked THEN (* no check *)
  8043. ELSE
  8044. trueL := NewLabel();
  8045. falseL := NewLabel();
  8046. IF IsPointerToRecord(x.left.type,recordType) THEN
  8047. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8048. Emit(Mov(position,tag, result.op));
  8049. IF result.mode # ModeValue THEN
  8050. ptr := tag;
  8051. IntermediateCode.MakeMemory(ptr,addressType);
  8052. Emit(Mov(position,tag, ptr));
  8053. END;
  8054. IF ~backend.cooperative THEN
  8055. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8056. END;
  8057. IntermediateCode.MakeMemory(tag,addressType);
  8058. ELSE
  8059. tag := result.tag;
  8060. END;
  8061. TypeTest(tag,x.type,trueL,falseL);
  8062. ReleaseIntermediateOperand(tag);
  8063. SetLabel(falseL);
  8064. EmitTrap(position,TypeCheckTrap);
  8065. SetLabel(trueL);
  8066. END;
  8067. destination := dest;
  8068. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8069. END VisitTypeGuardDesignator;
  8070. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8071. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8072. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8073. VAR label: Label; pc: LONGINT;
  8074. BEGIN
  8075. IF backend.cooperative & ~isUnchecked THEN
  8076. pc := section.pc;
  8077. label := NewLabel();
  8078. BrneL(label, operand.op, nil);
  8079. EmitTrap(position, NilPointerTrap);
  8080. SetLabel(label);
  8081. INC(statCoopNilCheck, section.pc - pc);
  8082. END;
  8083. END NilCheck;
  8084. BEGIN
  8085. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8086. ReuseCopy(dereferenced,operand.op);
  8087. ReleaseOperand(operand);
  8088. operand.mode := ModeReference;
  8089. operand.op := dereferenced;
  8090. operand.tag := dereferenced;
  8091. UseIntermediateOperand(operand.tag);
  8092. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8093. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8094. ReleaseIntermediateOperand(operand.tag);
  8095. operand.tag := TypeDescriptorAdr(type);
  8096. IF ~newObjectFile THEN
  8097. IntermediateCode.MakeMemory(operand.tag,addressType);
  8098. END;
  8099. ELSE
  8100. IF ~backend.cooperative THEN
  8101. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8102. END;
  8103. IntermediateCode.MakeMemory(operand.tag,addressType);
  8104. END;
  8105. NilCheck(operand.op);
  8106. ELSIF type IS SyntaxTree.ArrayType THEN
  8107. IF isUnsafe THEN
  8108. NilCheck(operand.op);
  8109. ReleaseIntermediateOperand(operand.tag);
  8110. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8111. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8112. ELSE
  8113. operand.tag := emptyOperand;
  8114. END;
  8115. ELSE
  8116. NilCheck(operand.op);
  8117. IF backend.cooperative THEN
  8118. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8119. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8120. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8121. ELSE
  8122. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8123. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8124. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8125. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8126. END;
  8127. END;
  8128. ELSIF type IS SyntaxTree.MathArrayType THEN
  8129. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8130. IntermediateCode.MakeMemory(operand.op,addressType);
  8131. ELSE HALT(100);
  8132. END;
  8133. END Dereference;
  8134. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  8135. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8136. BEGIN
  8137. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8138. dest := destination; destination := emptyOperand;
  8139. Evaluate(x.left,d);
  8140. type := x.type.resolved;
  8141. prevIsUnchecked := isUnchecked;
  8142. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8143. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8144. END;
  8145. Dereference(d,type,IsUnsafePointer(x.left.type));
  8146. isUnchecked := prevIsUnchecked;
  8147. result := d;
  8148. 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
  8149. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8150. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8151. END;
  8152. END;
  8153. destination := dest;
  8154. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8155. END VisitDereferenceDesignator;
  8156. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  8157. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8158. BEGIN
  8159. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8160. dest := destination; destination := emptyOperand;
  8161. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8162. tag := result.op;
  8163. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8164. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8165. StaticCallOperand(result,procedure.super);
  8166. ReleaseIntermediateOperand(result.tag);
  8167. UseIntermediateOperand(tag); (* necessary ? *)
  8168. result.tag := tag;
  8169. destination := dest;
  8170. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8171. END VisitSupercallDesignator;
  8172. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  8173. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8174. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8175. name: Basic.SegmentedName;
  8176. BEGIN
  8177. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8178. dest := destination; destination := emptyOperand;
  8179. scope := currentScope;
  8180. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8181. scope := scope.outerScope;
  8182. END;
  8183. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8184. IF newObjectFile THEN
  8185. moduleSection := meta.ModuleSection();
  8186. IF backend.cooperative THEN
  8187. moduleOffset := 0;
  8188. ELSE
  8189. moduleOffset := moduleSection.pc;
  8190. END;
  8191. result.mode := ModeValue;
  8192. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8193. ELSE
  8194. Symbol(moduleSelf,result);
  8195. IntermediateCode.MakeMemory(result.op,addressType);
  8196. END
  8197. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8198. result.mode := ModeValue;
  8199. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8200. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8201. ELSE
  8202. GetBaseRegister(basereg,currentScope,scope);
  8203. InitOperand(result,ModeReference);
  8204. result.op := basereg;
  8205. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  8206. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  8207. IF backend.cooperative THEN
  8208. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8209. END;
  8210. (* tag must be loaded when dereferencing SELF pointer *)
  8211. END;
  8212. destination := dest;
  8213. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8214. END VisitSelfDesignator;
  8215. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  8216. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8217. BEGIN
  8218. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8219. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8220. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8221. parameter := procedureType.returnParameter;
  8222. VisitParameter(parameter);
  8223. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8224. END VisitResultDesignator;
  8225. (** values *)
  8226. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  8227. BEGIN
  8228. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8229. IF conditional THEN
  8230. IF x.value THEN BrL(trueLabel)
  8231. ELSE BrL(falseLabel)
  8232. END;
  8233. ELSE
  8234. InitOperand(result,ModeValue);
  8235. IF x.value THEN result.op := true ELSE result.op := false END;
  8236. END;
  8237. END VisitBooleanValue;
  8238. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8239. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8240. BEGIN
  8241. Global.GetModuleSegmentedName(module.module, name);
  8242. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8243. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE);
  8244. RETURN section
  8245. END GetDataSection;
  8246. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8247. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8248. BEGIN
  8249. type := vop.type;
  8250. data := GetDataSection();
  8251. pc := EnterImmediate(data,vop);
  8252. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8253. IntermediateCode.MakeMemory(vop, type);
  8254. END GetImmediateMem;
  8255. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  8256. BEGIN
  8257. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8258. InitOperand(result,ModeValue);
  8259. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8260. IF ~supportedImmediate(result.op) &~inData THEN
  8261. GetImmediateMem(result.op)
  8262. END;
  8263. END VisitIntegerValue;
  8264. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  8265. BEGIN
  8266. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8267. InitOperand(result,ModeValue);
  8268. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8269. END VisitCharacterValue;
  8270. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  8271. BEGIN
  8272. IF Trace THEN TraceEnter("VisitSetValue") END;
  8273. InitOperand(result,ModeValue);
  8274. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8275. END VisitSetValue;
  8276. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  8277. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8278. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8279. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8280. BEGIN
  8281. numberElements := x.elements.Length();
  8282. FOR i := 0 TO numberElements-1 DO
  8283. expression := x.elements.GetExpression(i);
  8284. IF expression IS SyntaxTree.MathArrayExpression THEN
  8285. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8286. ELSE
  8287. inData := TRUE;
  8288. Evaluate(expression,op);
  8289. irv.Emit(Data(position,op.op));
  8290. inData := FALSE;
  8291. ReleaseOperand(op);
  8292. END;
  8293. END;
  8294. END RecursiveData;
  8295. BEGIN
  8296. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8297. IF ~TryConstantDeclaration() THEN
  8298. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8299. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8300. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8301. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8302. ELSE
  8303. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8304. END;
  8305. RecursiveData(x.array);
  8306. InitOperand(result,ModeReference);
  8307. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8308. END
  8309. END VisitMathArrayValue;
  8310. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8311. VAR constant: Sections.Section;
  8312. BEGIN
  8313. IF constantDeclaration = NIL THEN
  8314. RETURN FALSE
  8315. ELSE
  8316. (* Is a constant in this module: did we generate it already? *)
  8317. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8318. IF constant # NIL THEN
  8319. InitOperand(result,ModeReference);
  8320. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8321. RETURN TRUE;
  8322. END;
  8323. END;
  8324. RETURN FALSE
  8325. END TryConstantDeclaration;
  8326. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  8327. BEGIN
  8328. constantDeclaration := x;
  8329. x.value.resolved.Accept(SELF);
  8330. END VisitConstant;
  8331. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  8332. BEGIN
  8333. IF Trace THEN TraceEnter("VisitRealValue") END;
  8334. InitOperand(result,ModeValue);
  8335. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8336. END VisitRealValue;
  8337. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  8338. VAR
  8339. componentType: SyntaxTree.Type;
  8340. BEGIN
  8341. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8342. ASSERT(x.type IS SyntaxTree.ComplexType);
  8343. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8344. InitOperand(result,ModeValue);
  8345. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8346. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8347. END VisitComplexValue;
  8348. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  8349. VAR i: LONGINT; name: Basic.SegmentedName;
  8350. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8351. BEGIN
  8352. IF Trace THEN TraceEnter("VisitStringValue") END;
  8353. IF ~TryConstantDeclaration() THEN
  8354. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8355. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8356. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8357. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8358. ELSE
  8359. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8360. END;
  8361. FOR i := 0 TO x.length-1 DO
  8362. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8363. irv.Emit(Data(position,op));
  8364. END;
  8365. InitOperand(result,ModeReference);
  8366. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8367. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8368. END
  8369. END VisitStringValue;
  8370. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8371. BEGIN
  8372. IF Trace THEN TraceEnter("VisitNilValue") END;
  8373. InitOperand(result,ModeValue);
  8374. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8375. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8376. END VisitNilValue;
  8377. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8378. BEGIN
  8379. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8380. InitOperand(result,ModeValue);
  8381. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8382. END VisitEnumerationValue;
  8383. (** symbols *)
  8384. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8385. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8386. END VisitImport;
  8387. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8388. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8389. BEGIN
  8390. IF scope # baseScope THEN
  8391. (* left := [fp+8] *)
  8392. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8393. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8394. ReuseCopy(left,right);
  8395. ReleaseIntermediateOperand(right);
  8396. scope := scope.outerScope; DEC(level);
  8397. (* { left := [left+8] } *)
  8398. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8399. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8400. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8401. Emit(Mov(position,left,right));
  8402. scope := scope.outerScope; DEC(level);
  8403. END;
  8404. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8405. result := left;
  8406. ELSE
  8407. result := fp;
  8408. END;
  8409. END GetBaseRegister;
  8410. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8411. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8412. BEGIN
  8413. IF Trace THEN TraceEnter("VisitVariable"); END;
  8414. type := x.type.resolved;
  8415. IF (x.useRegister) THEN
  8416. InitOperand(result, ModeValue);
  8417. IF x.registerNumber < 0 THEN
  8418. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8419. reg := x.registerNumber;
  8420. ELSE
  8421. reg := registerUsageCount.Map(x.registerNumber);
  8422. UseRegister(reg);
  8423. END;
  8424. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8425. ELSIF x.externalName # NIL THEN
  8426. InitOperand(result,ModeReference);
  8427. Basic.ToSegmentedName(x.externalName^, name);
  8428. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8429. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8430. InitOperand(result,ModeReference);
  8431. GetBaseRegister(result.op,currentScope,x.scope);
  8432. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8433. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8434. InitOperand(result,ModeReference);
  8435. GetCodeSectionNameForSymbol(x,name);
  8436. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8437. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8438. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8439. InitOperand(result,ModeReference);
  8440. GetCodeSectionNameForSymbol(x,name);
  8441. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8442. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8443. ELSE (* field, left designator must have been emitted *)
  8444. ASSERT(result.mode = ModeReference);
  8445. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8446. ReuseCopy(temp,result.op);
  8447. ReleaseIntermediateOperand(result.op);
  8448. result.op := temp;
  8449. END;
  8450. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8451. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8452. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8453. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8454. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8455. END;
  8456. END;
  8457. END;
  8458. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8459. ValueToCondition(result);
  8460. ELSIF type IS SyntaxTree.ProcedureType THEN
  8461. ReleaseIntermediateOperand(result.tag);
  8462. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8463. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8464. UseIntermediateOperand(result.tag);
  8465. ELSE
  8466. result.tag := nil; (* nil *)
  8467. END;
  8468. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8469. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8470. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8471. ReleaseIntermediateOperand(result.tag);
  8472. Global.GetSymbolSegmentedName(x,name);
  8473. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8474. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8475. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8476. ELSE
  8477. END;
  8478. ELSE
  8479. ReleaseIntermediateOperand(result.tag);
  8480. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8481. END;
  8482. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8483. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8484. ReleaseIntermediateOperand(result.tag);
  8485. result.tag := result.op;
  8486. UseIntermediateOperand(result.tag);
  8487. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8488. IntermediateCode.MakeMemory(result.op,addressType);
  8489. END;
  8490. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8491. ReleaseIntermediateOperand(result.tag);
  8492. result.tag := TypeDescriptorAdr(type);
  8493. IF ~newObjectFile THEN
  8494. IntermediateCode.MakeMemory(result.tag,addressType);
  8495. END;
  8496. UseIntermediateOperand(result.tag);
  8497. (* tag for pointer type computed not here but during dereferencing *)
  8498. END;
  8499. IF Trace THEN TraceExit("VisitVariable") END;
  8500. END VisitVariable;
  8501. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8502. BEGIN
  8503. VisitVariable(property);
  8504. END VisitProperty;
  8505. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8506. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8507. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT;
  8508. BEGIN
  8509. type := x.type.resolved;
  8510. IF Trace THEN TraceEnter("VisitParameter") END;
  8511. IF x.ownerType IS SyntaxTree.CellType THEN
  8512. ptype := x.type.resolved;
  8513. IF ptype IS SyntaxTree.ArrayType THEN ptype := ptype(SyntaxTree.ArrayType).arrayBase.resolved END;
  8514. IF ~(ptype IS SyntaxTree.PortType) THEN
  8515. InitOperand(result,ModeReference);
  8516. GetCodeSectionNameForSymbol(x,name);
  8517. symbol := NewSection(module.allSections, Sections.ConstSection, name,x,commentPrintout # NIL);
  8518. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol),0);
  8519. RETURN
  8520. ELSE
  8521. InitOperand(result, ModeValue);
  8522. parameter := x.ownerType(SyntaxTree.CellType).firstParameter;
  8523. adr := 0;
  8524. WHILE parameter # x DO
  8525. parameterType := parameter.type;
  8526. inc := 1;
  8527. WHILE SemanticChecker.IsStaticArray(parameterType, parameterType, len) DO inc := inc * len END;
  8528. INC(adr, inc);
  8529. parameter := parameter.nextParameter
  8530. END;
  8531. IntermediateCode.InitImmediate(result.op,addressType,adr);
  8532. RETURN
  8533. END;
  8534. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8535. InitOperand(result,ModeReference);
  8536. GetCodeSectionNameForSymbol(x,name);
  8537. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8538. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8539. RETURN
  8540. ELSE
  8541. GetBaseRegister(basereg,currentScope,x.scope);
  8542. InitOperand(result,ModeReference);
  8543. result.op := basereg;
  8544. END;
  8545. IF IsOpenArray(type) THEN
  8546. result.tag := basereg;
  8547. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8548. IntermediateCode.MakeMemory(result.op,addressType);
  8549. IF Global.IsOberonProcedure(x.ownerType) THEN
  8550. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8551. UseIntermediateOperand(result.tag);
  8552. ELSE
  8553. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8554. END;
  8555. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8556. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8557. ELSIF IsStaticArray(type) THEN
  8558. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8559. IntermediateCode.MakeMemory(result.op,addressType);
  8560. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8561. ELSIF type IS SyntaxTree.MathArrayType THEN
  8562. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8563. WITH type: SyntaxTree.MathArrayType DO
  8564. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8565. IF type.form = SyntaxTree.Tensor THEN
  8566. ELSIF type.form = SyntaxTree.Open THEN
  8567. result.tag := result.op;
  8568. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8569. IntermediateCode.MakeMemory(result.op,addressType);
  8570. UseIntermediateOperand(result.tag);
  8571. ELSIF type.form = SyntaxTree.Static THEN
  8572. IF x.kind = SyntaxTree.ConstParameter THEN
  8573. IntermediateCode.MakeMemory(result.op,addressType);
  8574. END;
  8575. ELSE HALT(100)
  8576. END;
  8577. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8578. IF type.form = SyntaxTree.Tensor THEN
  8579. ToMemory(result.op,addressType,0);
  8580. ELSIF type.form = SyntaxTree.Open THEN
  8581. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8582. ReuseCopy(result.tag, mem);
  8583. ReleaseIntermediateOperand(mem);
  8584. ReleaseIntermediateOperand(result.op);
  8585. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8586. ELSIF type.form = SyntaxTree.Static THEN
  8587. IntermediateCode.MakeMemory(result.op,addressType);
  8588. ELSE HALT(100)
  8589. END;
  8590. ELSE HALT(100)
  8591. END;
  8592. END;
  8593. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8594. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8595. IntermediateCode.MakeMemory(result.op,addressType);
  8596. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8597. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8598. END;
  8599. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8600. ValueToCondition(result);
  8601. ELSIF type IS SyntaxTree.ProcedureType THEN
  8602. ReleaseIntermediateOperand(result.tag);
  8603. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8604. IF x.kind = SyntaxTree.VarParameter THEN
  8605. ReuseCopy(result.tag,result.op);
  8606. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8607. IntermediateCode.MakeMemory(result.tag,addressType);
  8608. ELSE
  8609. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8610. UseIntermediateOperand(result.tag);
  8611. END;
  8612. ELSE
  8613. result.tag := nil;
  8614. END;
  8615. (* tag for pointer type computed not here but during dereferencing *)
  8616. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) THEN
  8617. ReleaseIntermediateOperand(result.tag);
  8618. result.tag := basereg;
  8619. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8620. IntermediateCode.MakeMemory(result.tag,addressType);
  8621. UseIntermediateOperand(result.tag);
  8622. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind = SyntaxTree.ValueParameter) THEN
  8623. ReleaseIntermediateOperand(result.tag);
  8624. result.tag := TypeDescriptorAdr(type);
  8625. IF ~newObjectFile THEN
  8626. IntermediateCode.MakeMemory(result.tag,addressType);
  8627. END;
  8628. UseIntermediateOperand(result.tag);
  8629. END;
  8630. IF Trace THEN TraceExit("VisitParameter") END;
  8631. END VisitParameter;
  8632. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8633. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8634. BEGIN
  8635. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8636. (* left.p: left already emitted *)
  8637. tag := result.op; (* value of pointer to left *)
  8638. (* get type desc *)
  8639. tmp := result.tag;
  8640. IntermediateCode.MakeMemory(tmp,addressType);
  8641. (* get method adr *)
  8642. Reuse1(reg,tmp);
  8643. ReleaseIntermediateOperand(tmp);
  8644. IF backend.cooperative THEN
  8645. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8646. WHILE recordType.baseType # NIL DO
  8647. recordType := recordType.GetBaseRecord ();
  8648. END;
  8649. GetRecordTypeName (recordType,name);
  8650. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8651. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8652. offset := 0;
  8653. ELSE
  8654. offset := 2;
  8655. END;
  8656. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8657. ELSE
  8658. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8659. END;
  8660. InitOperand(operand,ModeReference);
  8661. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8662. operand.op := reg;
  8663. operand.tag := tag;
  8664. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8665. END DynamicCallOperand;
  8666. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8667. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8668. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8669. BEGIN
  8670. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8671. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8672. tag := operand.op;
  8673. ReleaseIntermediateOperand(operand.tag);
  8674. ELSE tag := nil
  8675. END;
  8676. IF x.isInline THEN
  8677. sectionType := Sections.InlineCodeSection;
  8678. ELSE
  8679. sectionType := Sections.CodeSection;
  8680. END;
  8681. IF x.externalName # NIL THEN
  8682. Basic.ToSegmentedName(x.externalName^, name);
  8683. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8684. ELSE
  8685. GetCodeSectionNameForSymbol(x, name);
  8686. IF (x.scope.ownerModule = module.module) THEN
  8687. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8688. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8689. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8690. IF source.pc = 0 THEN (* no code yet *)
  8691. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8692. END;
  8693. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8694. bits := x.procedureScope.body.code.inlineCode;
  8695. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8696. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8697. binary.CopyBits(bits, 0, bits.GetSize());
  8698. source.SetResolved(binary);
  8699. ELSE
  8700. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8701. END;
  8702. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8703. END;
  8704. InitOperand(operand,ModeValue);
  8705. operand.op := reg;
  8706. operand.tag := tag;
  8707. IF Trace THEN TraceExit("StaticCallOperand") END;
  8708. END StaticCallOperand;
  8709. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8710. (* handle expressions of the form designator.procedure or procedure *)
  8711. BEGIN
  8712. IF Trace THEN TraceEnter("VisitProcedure") END;
  8713. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) THEN
  8714. DynamicCallOperand(result,x);
  8715. ELSIF x.isInline THEN
  8716. StaticCallOperand(result,x);
  8717. ELSE
  8718. StaticCallOperand(result,x);
  8719. END;
  8720. IF Trace THEN TraceExit("VisitProcedure") END;
  8721. END VisitProcedure;
  8722. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  8723. BEGIN
  8724. VisitProcedure(x);
  8725. END VisitOperator;
  8726. (** statements *)
  8727. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  8728. BEGIN
  8729. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  8730. Expression(x.call);
  8731. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  8732. ReleaseOperand(result)
  8733. END;
  8734. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  8735. END VisitProcedureCallStatement;
  8736. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  8737. VAR leftType, rightType: SyntaxTree.MathArrayType;
  8738. leftBase, rightBase: SyntaxTree.Type;
  8739. procedureName,s: SyntaxTree.IdentifierString;
  8740. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  8741. size: LONGINT; rightKind: LONGINT;
  8742. dummy: IntermediateCode.Operand;
  8743. CONST moduleName = "FoxArrayBase";
  8744. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  8745. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  8746. BEGIN
  8747. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  8748. IF base IS SyntaxTree.MathArrayType THEN
  8749. base := OpenArray(base(SyntaxTree.MathArrayType));
  8750. END;
  8751. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  8752. result.SetArrayBase(base);
  8753. RETURN result
  8754. END OpenArray;
  8755. BEGIN
  8756. IF AddImport(moduleName,arrayBase,TRUE) THEN
  8757. SaveRegisters();ReleaseUsedRegisters(saved);
  8758. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  8759. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  8760. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  8761. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  8762. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  8763. IF leftType.form = SyntaxTree.Tensor THEN
  8764. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  8765. ELSIF leftType.form = SyntaxTree.Open THEN
  8766. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  8767. ELSIF leftType.form = SyntaxTree.Static THEN
  8768. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  8769. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  8770. END;
  8771. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  8772. IF procedure = NIL THEN
  8773. s := "Instruction not supported on target, emulation procedure ";
  8774. Strings.Append(s,moduleName);
  8775. Strings.Append(s,".");
  8776. Strings.Append(s,procedureName);
  8777. Strings.Append(s," not present");
  8778. Error(position,s);
  8779. ELSE
  8780. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  8781. parameter.SetType(leftType);
  8782. parameter.SetAccess(SyntaxTree.Internal);
  8783. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8784. parameter.SetKind(rightKind);
  8785. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8786. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  8787. Emit(Push(position,IntermediateCode.Immediate(int32,size)));
  8788. StaticCallOperand(result,procedure);
  8789. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  8790. ReleaseOperand(result);
  8791. END;
  8792. RestoreRegisters(saved);
  8793. END;
  8794. END AssignMathArray;
  8795. VAR modifyAssignmentCounter := 0: LONGINT;
  8796. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  8797. VAR processor,mem,dst: IntermediateCode.Operand;
  8798. BEGIN
  8799. IF value.intValue = true.intValue THEN
  8800. INC(modifyAssignmentCounter);
  8801. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  8802. modifyAssignmentsPC := section.pc;
  8803. ELSE
  8804. DEC(modifyAssignmentCounter);
  8805. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  8806. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  8807. END;
  8808. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  8809. dst := NewRegisterOperand (addressType);
  8810. Emit(Mov(position,dst, processor));
  8811. IntermediateCode.InitMemory(mem,bool, dst, 0);
  8812. Emit(Mov(position,mem, value));
  8813. ReleaseIntermediateOperand(dst);
  8814. END ModifyAssignments;
  8815. PROCEDURE CopySize(left: SyntaxTree.Expression): IntermediateCode.Operand;
  8816. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8817. BEGIN
  8818. type := left.type.resolved;
  8819. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  8820. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  8821. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  8822. IF procedureType.returnParameter = parameter THEN
  8823. RETURN IntermediateCode.Memory(addressType, fp, ToMemoryUnits(system, parameter.offsetInBits + system.addressSize));
  8824. END;
  8825. END;
  8826. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  8827. END CopySize;
  8828. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  8829. VAR
  8830. leftO, rightO: Operand;
  8831. mem, sizeOp: IntermediateCode.Operand;
  8832. leftType, rightType, componentType: SyntaxTree.Type;
  8833. size: LONGINT;
  8834. parameters: SyntaxTree.ExpressionList;
  8835. procedure: SyntaxTree.Procedure;
  8836. call: SyntaxTree.ProcedureCallDesignator;
  8837. designator: SyntaxTree.Designator;
  8838. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  8839. VAR procedureType: SyntaxTree.ProcedureType;
  8840. BEGIN
  8841. IF ReturnedAsParameter(right.type) THEN
  8842. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  8843. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  8844. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  8845. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  8846. WITH right: SyntaxTree.BuiltinCallDesignator DO
  8847. IF right.id = Global.Reshape THEN RETURN TRUE
  8848. END;
  8849. END;
  8850. END;
  8851. END;
  8852. RETURN FALSE
  8853. END CanPassAsResultParameter;
  8854. BEGIN
  8855. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  8856. leftType := left.type.resolved; rightType:= right.type.resolved;
  8857. IF backend.cooperative & left.NeedsTrace() THEN
  8858. ModifyAssignments(true);
  8859. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  8860. Designate(right, rightO);
  8861. Designate(left, leftO);
  8862. ASSERT(leftO.mode = ModeReference);
  8863. TransferToRegister(leftO.op, leftO.op);
  8864. TransferToRegister(rightO.op, rightO.op);
  8865. Emit(Push(position, leftO.op));
  8866. Emit(Push(position, rightO.op));
  8867. CallAssignMethod(leftO.op, rightO.op, left.type);
  8868. Emit(Pop(position, rightO.op));
  8869. Emit(Pop(position, leftO.op));
  8870. sizeOp := CopySize(left);
  8871. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8872. ReleaseOperand(leftO);
  8873. ReleaseOperand(rightO);
  8874. ELSE
  8875. Evaluate(right,rightO);
  8876. Designate(left,leftO);
  8877. ASSERT(leftO.mode = ModeReference);
  8878. IF (leftType IS SyntaxTree.ProcedureType) THEN
  8879. (* copy procedure address first *)
  8880. MakeMemory(mem,leftO.op,addressType,0);
  8881. Emit(Mov(position,mem,rightO.op));
  8882. ReleaseIntermediateOperand(mem);
  8883. (* copy pointer address *)
  8884. IntermediateCode.MakeAddress(leftO.tag, addressType);
  8885. CallAssignPointer(leftO.tag, rightO.tag);
  8886. ELSE
  8887. ASSERT(system.SizeOf(left.type) = system.addressSize);
  8888. CallAssignPointer(leftO.op, rightO.op);
  8889. END;
  8890. ReleaseOperand(leftO);
  8891. ReleaseOperand(rightO);
  8892. END;
  8893. ModifyAssignments(false);
  8894. RETURN;
  8895. END;
  8896. IF CanPassAsResultParameter(right) THEN
  8897. procedureResultDesignator := left(SyntaxTree.Designator);
  8898. Expression(right);
  8899. procedureResultDesignator := NIL;
  8900. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  8901. (* left <-- ALIAS OF right: zerocopy *)
  8902. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  8903. designator := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid, NIL, procedure);
  8904. designator.SetType(procedure.type);
  8905. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  8906. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  8907. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8908. END;
  8909. ELSIF leftType IS SyntaxTree.RangeType THEN
  8910. (* LHS is of array range type *)
  8911. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  8912. Evaluate(right, rightO);
  8913. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  8914. (* first *)
  8915. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 0);
  8916. Emit(Mov(position,mem, rightO.op));
  8917. ReleaseIntermediateOperand(mem);
  8918. (* last *)
  8919. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8920. Emit(Mov(position,mem, rightO.tag));
  8921. ReleaseIntermediateOperand(mem);
  8922. (* step *)
  8923. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8924. Emit(Mov(position,mem, rightO.extra));
  8925. ReleaseIntermediateOperand(mem);
  8926. ReleaseOperand(rightO);
  8927. ReleaseOperand(leftO)
  8928. ELSIF leftType IS SyntaxTree.ComplexType THEN
  8929. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  8930. Evaluate(right, rightO);
  8931. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  8932. componentType := leftType(SyntaxTree.ComplexType).componentType;
  8933. (* real part *)
  8934. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  8935. Emit(Mov(position,mem, rightO.op));
  8936. ReleaseIntermediateOperand(mem);
  8937. (* imaginary part *)
  8938. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8939. Emit(Mov(position,mem, rightO.tag));
  8940. ReleaseIntermediateOperand(mem);
  8941. ReleaseOperand(rightO);
  8942. ReleaseOperand(leftO)
  8943. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  8944. OR (leftType IS SyntaxTree.PortType) THEN
  8945. (* rightO := leftO;*)
  8946. Evaluate(right,rightO);
  8947. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  8948. Designate(left,leftO);
  8949. IF leftO.mode = ModeReference THEN
  8950. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  8951. destination := mem;
  8952. ELSE
  8953. destination := leftO.op;
  8954. END;
  8955. ReleaseOperand(leftO);
  8956. IF destination.mode # IntermediateCode.Undefined THEN
  8957. Emit(Mov(position,destination,rightO.op));
  8958. END;
  8959. ReleaseOperand(rightO);
  8960. ReleaseIntermediateOperand(mem);
  8961. IntermediateCode.InitOperand(destination);
  8962. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  8963. Evaluate(right,rightO);
  8964. Designate(left,leftO);
  8965. MakeMemory(mem,leftO.op,addressType,0);
  8966. Emit(Mov(position,mem,rightO.op));
  8967. ReleaseIntermediateOperand(mem);
  8968. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  8969. (* delegate *)
  8970. (*
  8971. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  8972. *)
  8973. Emit(Mov(position,leftO.tag,rightO.tag));
  8974. END;
  8975. ReleaseOperand(leftO);
  8976. ReleaseOperand(rightO);
  8977. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  8978. Designate(right,rightO);
  8979. Designate(left,leftO);
  8980. sizeOp := CopySize(left);
  8981. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8982. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8983. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  8984. IF (rightType IS SyntaxTree.StringType) THEN
  8985. CopyString(left,right);
  8986. 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
  8987. Designate(right,rightO);
  8988. Designate(left,leftO);
  8989. size := ToMemoryUnits(system,system.SizeOf(rightType));
  8990. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  8991. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8992. ELSE
  8993. HALT(201)
  8994. END;
  8995. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  8996. AssignMathArray(left,right);
  8997. ELSE
  8998. HALT(200);
  8999. END;
  9000. END Assign;
  9001. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  9002. BEGIN
  9003. IF Trace THEN TraceEnter("VisitAssignment") END;
  9004. Assign(x.left,x.right);
  9005. IF Trace THEN TraceExit("VisitAssignment") END;
  9006. END VisitAssignment;
  9007. PROCEDURE EmitCooperativeSwitch;
  9008. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9009. BEGIN
  9010. ASSERT (cooperativeSwitches);
  9011. pc := section.pc;
  9012. IF lastSwitchPC = section.pc THEN RETURN END;
  9013. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9014. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9015. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9016. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9017. INC(statCoopSwitch, section.pc - pc);
  9018. END EmitCooperativeSwitch;
  9019. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  9020. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9021. BEGIN
  9022. p0 := communication.left; p1 := communication.right;
  9023. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9024. Evaluate(p0,s0);
  9025. Evaluate(p1,s1);
  9026. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9027. Emit(Push(position,s0.op));
  9028. Emit(Push(position,s1.op));
  9029. (*
  9030. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9031. *)
  9032. IF ~backend.cellsAreObjects THEN
  9033. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9034. END;
  9035. ReleaseOperand(s0);
  9036. ReleaseOperand(s1);
  9037. IF backend.cellsAreObjects THEN
  9038. CallThis(position,"ActiveCellsRuntime","Send",2);
  9039. ELSE
  9040. CallThis(position,ChannelModuleName,"Send",2);
  9041. END;
  9042. (* ----- RECEIVE ------*)
  9043. ELSE
  9044. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9045. tmp := p0; p0 := p1; p1 := tmp;
  9046. END;
  9047. Evaluate(p0,s0);
  9048. Emit(Push(position,s0.op));
  9049. Designate(p1,s1);
  9050. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9051. Emit(Push(position,s1.op));
  9052. (*
  9053. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9054. *)
  9055. IF ~backend.cellsAreObjects THEN
  9056. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9057. END;
  9058. ReleaseOperand(s0);
  9059. ReleaseOperand(s1);
  9060. IF backend.cellsAreObjects THEN
  9061. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9062. ELSE
  9063. CallThis(position,ChannelModuleName,"Receive",2)
  9064. END;
  9065. END;
  9066. END VisitCommunicationStatement;
  9067. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  9068. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9069. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9070. VAR true, false: Label; condition, value: BOOLEAN;
  9071. BEGIN
  9072. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9073. IF condition THEN
  9074. true := NewLabel();
  9075. false := NewLabel();
  9076. Condition(if.condition,true,false);
  9077. SetLabel(true);
  9078. StatementSequence(if.statements);
  9079. BrL(end);
  9080. SetLabel(false);
  9081. ELSE
  9082. IF value THEN (* always true *)
  9083. escape := TRUE;
  9084. StatementSequence(if.statements);
  9085. (* no branch necessary -- rest skipped *)
  9086. END;
  9087. END;
  9088. END IfPart;
  9089. BEGIN
  9090. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9091. end := NewLabel();
  9092. elsifs := x.ElsifParts();
  9093. IfPart(x.ifPart);
  9094. FOR i := 0 TO elsifs-1 DO
  9095. IF ~escape THEN
  9096. elsif := x.GetElsifPart(i);
  9097. IfPart(elsif);
  9098. END;
  9099. END;
  9100. IF (x.elsePart # NIL) & ~escape THEN
  9101. StatementSequence(x.elsePart);
  9102. END;
  9103. SetLabel(end);
  9104. IF Trace THEN TraceExit("VisitIfStatement") END;
  9105. END VisitIfStatement;
  9106. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9107. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9108. BEGIN
  9109. (*IF x.variable.type.resolved = x.type.resolved THEN
  9110. (* always true, do nothing *)
  9111. ELSE*)
  9112. Designate(x.variable,res);
  9113. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9114. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9115. END;
  9116. trueL := NewLabel();
  9117. TypeTest(res.tag,x.type,trueL,falseL);
  9118. ReleaseOperand(res);
  9119. SetLabel(trueL);
  9120. StatementSequence(x.statements);
  9121. BrL(endL);
  9122. END WithPart;
  9123. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  9124. VAR endL,falseL: Label;i: LONGINT;
  9125. BEGIN
  9126. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9127. endL := NewLabel();
  9128. FOR i := 0 TO x.WithParts()-1 DO
  9129. falseL := NewLabel();
  9130. WithPart(x.GetWithPart(i),falseL,endL);
  9131. SetLabel(falseL);
  9132. END;
  9133. IF x.elsePart = NIL THEN
  9134. IF ~isUnchecked THEN
  9135. EmitTrap(position,WithTrap);
  9136. END;
  9137. ELSE
  9138. StatementSequence(x.elsePart)
  9139. END;
  9140. SetLabel(endL);
  9141. IF Trace THEN TraceExit("VisitWithStatement") END;
  9142. END VisitWithStatement;
  9143. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  9144. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9145. out,else: Label; label: Label;
  9146. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9147. symbol: SyntaxTree.Symbol;
  9148. BEGIN
  9149. (*! split case statement into if-elsif statements for large case label lists *)
  9150. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9151. size := x.max-x.min+1;
  9152. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9153. END;
  9154. Evaluate(x.variable,var);
  9155. ReuseCopy(tmp,var.op);
  9156. ReleaseIntermediateOperand(var.op);
  9157. var.op := tmp;
  9158. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9159. Convert(var.op,addressType);
  9160. size := x.max-x.min+1;
  9161. else := NewLabel();
  9162. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9163. (*
  9164. UniqueId(name,module.module,"case",caseId);
  9165. *)
  9166. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9167. Global.GetModuleSegmentedName(module.module, name);
  9168. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9169. symbol := SyntaxTree.NewSymbol(name[1]);
  9170. symbol.SetScope(moduleScope);
  9171. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9172. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9173. section.isCaseTable := TRUE;
  9174. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9175. ReuseCopy(res,var.op);
  9176. ReleaseOperand(var);
  9177. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9178. Emit(Add(position,res,res,jmp));
  9179. IntermediateCode.MakeMemory(res,addressType);
  9180. Emit(Br(position,res));
  9181. ReleaseIntermediateOperand(res);
  9182. out := NewLabel();
  9183. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9184. part := x.GetCasePart(i);
  9185. constant := part.firstConstant;
  9186. label := NewLabel();
  9187. SetLabel(label);
  9188. WHILE(constant # NIL) DO (* case labels for this case part *)
  9189. FOR j := constant.min TO constant.max DO
  9190. fixups[j-x.min] := label;
  9191. END;
  9192. constant := constant.next;
  9193. END;
  9194. StatementSequence(part.statements);
  9195. BrL(out);
  9196. END;
  9197. SetLabel(else);
  9198. FOR i := 0 TO size-1 DO
  9199. IF fixups[i] = NIL THEN
  9200. fixups[i] := else;
  9201. END;
  9202. END;
  9203. IF x.elsePart # NIL THEN
  9204. StatementSequence(x.elsePart);
  9205. ELSIF ~isUnchecked THEN
  9206. EmitTrap(position,CaseTrap);
  9207. END;
  9208. SetLabel(out);
  9209. FOR i := 0 TO size-1 DO
  9210. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9211. section.Emit(Data(position,op));
  9212. END;
  9213. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9214. END VisitCaseStatement;
  9215. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  9216. VAR start: Label; true,false: Label;
  9217. BEGIN
  9218. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9219. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9220. start := NewLabel();
  9221. true := NewLabel();
  9222. false := NewLabel();
  9223. SetLabel(start);
  9224. Condition(x.condition,true,false);
  9225. SetLabel(true);
  9226. StatementSequence(x.statements);
  9227. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9228. BrL(start);
  9229. SetLabel(false);
  9230. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9231. END VisitWhileStatement;
  9232. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  9233. VAR false,true: Label;
  9234. BEGIN
  9235. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9236. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9237. true := NewLabel();
  9238. false := NewLabel();
  9239. SetLabel(false);
  9240. StatementSequence(x.statements);
  9241. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9242. Condition(x.condition,true,false);
  9243. SetLabel(true);
  9244. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9245. END VisitRepeatStatement;
  9246. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  9247. VAR
  9248. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9249. temporaryVariable: SyntaxTree.Variable;
  9250. temporaryVariableDesignator : SyntaxTree.Designator;
  9251. BEGIN
  9252. IF Trace THEN TraceEnter("VisitForStatement") END;
  9253. true := NewLabel();
  9254. false := NewLabel();
  9255. start := NewLabel();
  9256. Assign(x.variable,x.from);
  9257. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE);
  9258. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, temporaryVariable);
  9259. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9260. Assign(temporaryVariableDesignator,x.to);
  9261. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9262. IF by > 0 THEN
  9263. cmp := Scanner.LessEqual
  9264. ELSE
  9265. cmp := Scanner.GreaterEqual
  9266. END;
  9267. binary := SyntaxTree.NewBinaryExpression(0,x.variable,temporaryVariableDesignator,cmp);
  9268. binary.SetType(system.booleanType);
  9269. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9270. SetLabel(start);
  9271. Condition(binary,true,false);
  9272. SetLabel(true);
  9273. StatementSequence(x.statements);
  9274. binary := SyntaxTree.NewBinaryExpression(0,x.variable,x.by,Scanner.Plus);
  9275. binary.SetType(x.variable.type);
  9276. Assign(x.variable,binary);
  9277. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9278. BrL(start);
  9279. SetLabel(false);
  9280. IF Trace THEN TraceExit("VisitForStatement") END;
  9281. END VisitForStatement;
  9282. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  9283. VAR prevLoop: Label;
  9284. BEGIN
  9285. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9286. prevLoop := currentLoop;
  9287. currentLoop := NewLabel();
  9288. StatementSequence(x.statements);
  9289. SetLabel(currentLoop);
  9290. currentLoop := prevLoop;
  9291. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9292. END VisitExitableBlock;
  9293. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  9294. VAR prevLoop,start: Label;
  9295. BEGIN
  9296. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9297. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9298. start := NewLabel();
  9299. prevLoop := currentLoop;
  9300. SetLabel(start);
  9301. currentLoop := NewLabel();
  9302. StatementSequence(x.statements);
  9303. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9304. BrL(start);
  9305. SetLabel(currentLoop);
  9306. currentLoop := prevLoop;
  9307. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9308. END VisitLoopStatement;
  9309. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  9310. VAR outer: SyntaxTree.Statement;
  9311. BEGIN
  9312. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9313. IF locked THEN (* r if we jump out of an exclusive block *)
  9314. outer := x.outer;
  9315. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9316. outer := outer.outer;
  9317. END;
  9318. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9319. Lock(FALSE);
  9320. END;
  9321. END;
  9322. BrL(currentLoop);
  9323. IF Trace THEN TraceExit("VisitExitStatement") END;
  9324. END VisitExitStatement;
  9325. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  9326. VAR
  9327. expression, parameterDesignator: SyntaxTree.Expression;
  9328. type, componentType: SyntaxTree.Type;
  9329. res, right: Operand;
  9330. left, mem, reg: IntermediateCode.Operand;
  9331. parameter: SyntaxTree.Parameter;
  9332. procedure: SyntaxTree.Procedure;
  9333. procedureType: SyntaxTree.ProcedureType;
  9334. returnTypeOffset: LONGINT;
  9335. delegate: BOOLEAN;
  9336. map: SymbolMap;
  9337. BEGIN
  9338. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9339. expression := x.returnValue;
  9340. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9341. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9342. IF currentIsInline THEN
  9343. IF expression # NIL THEN
  9344. map := currentMapper.Get(NIL);
  9345. IF map # NIL THEN
  9346. Assign(map.to, expression);
  9347. END;
  9348. END;
  9349. BrL(currentInlineExit);
  9350. RETURN;
  9351. END;
  9352. IF expression # NIL THEN
  9353. type := expression.type.resolved;
  9354. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9355. IF locked THEN Lock(FALSE) END;
  9356. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9357. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9358. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9359. (* return without structured return parameter *)
  9360. Evaluate(expression,res);
  9361. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9362. IF locked OR profile THEN
  9363. Emit(Push(position,res.op));
  9364. IF delegate THEN HALT(200) END;
  9365. ReleaseOperand(res);
  9366. IF locked THEN Lock(FALSE) END;
  9367. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9368. reg := NewRegisterOperand(res.op.type);
  9369. Emit(Pop(position,reg));
  9370. Emit(Return(position,reg));
  9371. ReleaseIntermediateOperand(reg);
  9372. ELSE
  9373. Emit(Return(position,res.op));
  9374. ReleaseOperand(res);
  9375. END;
  9376. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9377. THEN
  9378. (* return using structured return parameter *)
  9379. 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)
  9380. OR SemanticChecker.IsPointerType(type));
  9381. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9382. parameter :=procedureType.returnParameter;
  9383. ASSERT(parameter # NIL);
  9384. returnTypeOffset := parameter.offsetInBits;
  9385. (*
  9386. IF parameter# NIL THEN
  9387. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9388. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9389. ELSE
  9390. returnTypeOffset := system.offsetFirstParameter
  9391. END;
  9392. *)
  9393. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9394. IF type IS SyntaxTree.RangeType THEN
  9395. (* array range type *)
  9396. Evaluate(expression, right);
  9397. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 0);
  9398. Emit(Mov(position,mem, right.op)); (* first *)
  9399. ReleaseIntermediateOperand(mem);
  9400. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9401. Emit(Mov(position,mem, right.tag)); (* last *)
  9402. ReleaseIntermediateOperand(mem);
  9403. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9404. Emit(Mov(position,mem, right.extra)); (* step *)
  9405. ReleaseIntermediateOperand(mem);
  9406. ReleaseOperand(right);
  9407. ELSIF type IS SyntaxTree.ComplexType THEN
  9408. Evaluate(expression, right);
  9409. componentType := type(SyntaxTree.ComplexType).componentType;
  9410. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9411. Emit(Mov(position,mem, right.op)); (* real part *)
  9412. ReleaseIntermediateOperand(mem);
  9413. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9414. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9415. ReleaseIntermediateOperand(mem);
  9416. ReleaseOperand(right);
  9417. ELSE (* covers cases: pointer / record / array *)
  9418. parameter := procedureType.returnParameter;
  9419. checker.SetCurrentScope(currentScope);
  9420. ASSERT(parameter # NIL);
  9421. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9422. Assign(parameterDesignator,expression);
  9423. END;
  9424. ReleaseIntermediateOperand(left);
  9425. IF locked THEN Lock(FALSE) END;
  9426. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9427. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9428. parameter := procedureType.returnParameter;
  9429. checker.SetCurrentScope(currentScope);
  9430. IF parameter = NIL THEN
  9431. Error(procedure.position, "structured return of parameter of procedure not found");
  9432. ELSE
  9433. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9434. Assign(parameterDesignator,expression);
  9435. END;
  9436. IF locked THEN Lock(FALSE) END;
  9437. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9438. ELSE
  9439. HALT(200);
  9440. END;
  9441. ELSE
  9442. IF locked THEN Lock(FALSE) END;
  9443. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9444. END;
  9445. IF backend.cooperative THEN
  9446. BrL(exitLabel);
  9447. ELSE
  9448. EmitLeave(section, position,procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9449. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention));
  9450. END;
  9451. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9452. END VisitReturnStatement;
  9453. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9454. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9455. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9456. statements: SyntaxTree.StatementSequence;
  9457. name, suffix: SyntaxTree.IdentifierString;
  9458. BEGIN
  9459. Strings.IntToStr(awaitProcCounter,suffix);
  9460. Strings.Concat("@AwaitProcedure",suffix,name);
  9461. identifier := SyntaxTree.NewIdentifier(name);
  9462. INC(awaitProcCounter);
  9463. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9464. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9465. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9466. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9467. procedure.SetAccess(SyntaxTree.Hidden);
  9468. procedure.SetScope(currentScope);
  9469. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9470. procedureType.SetReturnType(system.booleanType);
  9471. procedure.SetType(procedureType);
  9472. body := SyntaxTree.NewBody(x.position,procedureScope);
  9473. procedureScope.SetBody(body);
  9474. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9475. returnStatement.SetReturnValue(x.condition);
  9476. statements := SyntaxTree.NewStatementSequence();
  9477. statements.AddStatement(returnStatement);
  9478. body.SetStatementSequence(statements);
  9479. currentScope.AddProcedure(procedure);
  9480. RETURN procedure
  9481. END MakeAwaitProcedure;
  9482. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9483. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9484. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9485. BEGIN
  9486. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9487. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9488. IF backend.cooperative THEN
  9489. start := NewLabel();
  9490. true := NewLabel();
  9491. false := NewLabel();
  9492. SetLabel(start);
  9493. Condition(x.condition,true,false);
  9494. SetLabel(false);
  9495. PushSelfPointer();
  9496. CallThis(position,"ExclusiveBlocks","Await",1);
  9497. BrL(start);
  9498. SetLabel(true);
  9499. PushSelfPointer();
  9500. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9501. ELSE
  9502. proc := MakeAwaitProcedure(x);
  9503. Emit(Push(position,fp));
  9504. GetCodeSectionNameForSymbol(proc,name);
  9505. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9506. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9507. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9508. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9509. Emit(Result(position,res));
  9510. (*
  9511. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9512. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9513. *)
  9514. InitOperand(result,ModeValue);
  9515. result.op := res;
  9516. label := NewLabel();
  9517. BreqL(label, result.op, SELF.true);
  9518. ReleaseOperand(result);
  9519. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9520. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9521. Emit(Push(position,res));
  9522. Emit(Push(position,fp));
  9523. PushSelfPointer();
  9524. Emit(Push(position,nil));
  9525. CallThis(position,"Objects","Await",4);
  9526. SetLabel(label);
  9527. END;
  9528. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9529. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9530. END VisitAwaitStatement;
  9531. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9532. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9533. BEGIN
  9534. FOR i := 0 TO x.Length() - 1 DO
  9535. statement := x.GetStatement( i );
  9536. Statement(statement);
  9537. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9538. END;
  9539. END StatementSequence;
  9540. PROCEDURE PushSelfPointer;
  9541. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9542. BEGIN
  9543. scope := currentScope;
  9544. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9545. scope := scope.outerScope;
  9546. END;
  9547. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9548. IF ~newObjectFile THEN
  9549. Symbol(moduleSelf,op);
  9550. IntermediateCode.MakeMemory(op.op,addressType);
  9551. ELSE
  9552. moduleSection := meta.ModuleSection();
  9553. IF backend.cooperative THEN
  9554. moduleOffset := 0;
  9555. ELSE
  9556. moduleOffset := moduleSection.pc;
  9557. END;
  9558. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9559. END;
  9560. ELSE
  9561. GetBaseRegister(op.op,currentScope,scope);
  9562. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  9563. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  9564. IF backend.cooperative THEN
  9565. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9566. END;
  9567. IntermediateCode.MakeMemory(op.op,addressType);
  9568. END;
  9569. Emit(Push(position,op.op));
  9570. ReleaseOperand(op);
  9571. END PushSelfPointer;
  9572. PROCEDURE Lock(lock: BOOLEAN);
  9573. BEGIN
  9574. IF Trace THEN TraceEnter("Lock") END;
  9575. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9576. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9577. ASSERT(modifyAssignmentCounter = 0);
  9578. IF dump # NIL THEN
  9579. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9580. dump.Ln;dump.Update;
  9581. END;
  9582. PushSelfPointer;
  9583. IF backend.cooperative THEN
  9584. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9585. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9586. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9587. END;
  9588. ELSE
  9589. Emit(Push(position,true));
  9590. IF lock THEN CallThis(position,"Objects","Lock",2)
  9591. ELSE CallThis(position,"Objects","Unlock",2);
  9592. END;
  9593. END;
  9594. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9595. IF Trace THEN TraceExit("Lock") END;
  9596. END Lock;
  9597. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9598. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9599. BEGIN
  9600. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9601. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9602. previouslyUnchecked := isUnchecked;
  9603. isUnchecked := isUnchecked OR x.isUnchecked;
  9604. previouslyCooperativeSwitches := cooperativeSwitches;
  9605. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9606. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9607. IF x.statements # NIL THEN
  9608. StatementSequence(x.statements);
  9609. END;
  9610. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9611. isUnchecked := previouslyUnchecked;
  9612. cooperativeSwitches := previouslyCooperativeSwitches;
  9613. IF Trace THEN TraceExit("VisitStatementBlock") END;
  9614. END VisitStatementBlock;
  9615. PROCEDURE VisitCode(x: SyntaxTree.Code);
  9616. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  9617. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  9618. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  9619. procedure: SyntaxTree.Procedure;
  9620. map: SymbolMap;
  9621. BEGIN
  9622. scope := currentScope;
  9623. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  9624. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9625. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9626. return := emptyOperand;
  9627. IF Trace THEN TraceEnter("VisitCode") END;
  9628. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  9629. NEW(in, x.inRules.Length());
  9630. FOR i := 0 TO LEN(in)-1 DO
  9631. statement := x.inRules.GetStatement(i);
  9632. WITH statement: SyntaxTree.Assignment DO
  9633. Evaluate(statement.right, operand);
  9634. result := operand.op;
  9635. NEW(str, 64);
  9636. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  9637. in[i] := result; IntermediateCode.SetString(in[i], str);
  9638. ReleaseIntermediateOperand(operand.tag);
  9639. END;
  9640. END;
  9641. ELSE in := NIL
  9642. END;
  9643. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  9644. NEW(out, x.outRules.Length());
  9645. FOR i := 0 TO LEN(out)-1 DO
  9646. statement := x.outRules.GetStatement(i);
  9647. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  9648. WITH statement: SyntaxTree.Assignment DO
  9649. Evaluate(statement.left, operand); (*?? or designate *)
  9650. result := operand.op;
  9651. NEW(str, 64);
  9652. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  9653. out[i] := result; IntermediateCode.SetString(out[i], str);
  9654. ReleaseIntermediateOperand(operand.tag);
  9655. |statement: SyntaxTree.ReturnStatement DO
  9656. NEW(str, 64);
  9657. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  9658. IF currentIsInline THEN
  9659. map := currentMapper.Get(NIL);
  9660. Evaluate(map.to, operand);
  9661. out[i] := operand.op;
  9662. ELSE
  9663. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9664. END;
  9665. IntermediateCode.SetString(out[i], str);
  9666. ReleaseIntermediateOperand(operand.tag);
  9667. return := out[i];
  9668. ELSE
  9669. END;
  9670. END;
  9671. ELSE out := NIL
  9672. END;
  9673. Emit(Asm(x.position,x.sourceCode, in, out));
  9674. IF in # NIL THEN
  9675. FOR i := 0 TO LEN(in)-1 DO
  9676. ReleaseIntermediateOperand(in[i]);
  9677. END;
  9678. END;
  9679. IF out # NIL THEN
  9680. FOR i := 0 TO LEN(out)-1 DO
  9681. WITH statement: SyntaxTree.Assignment DO
  9682. ReleaseIntermediateOperand(out[i]);
  9683. ELSE
  9684. IF currentIsInline THEN
  9685. ReleaseIntermediateOperand(out[i]);
  9686. END;
  9687. END;
  9688. statement := x.outRules.GetStatement(i);
  9689. END;
  9690. END;
  9691. IF return.mode # IntermediateCode.Undefined THEN
  9692. IF currentIsInline THEN
  9693. ELSIF ReturnedAsParameter(procedureType.returnType) THEN
  9694. Symbol(procedureType.returnParameter, par);
  9695. MakeMemory(mem, par.op, return.type, 0);
  9696. ReleaseOperand(par);
  9697. Emit(Mov(position, mem, return));
  9698. ReleaseIntermediateOperand(mem);
  9699. ELSE
  9700. Emit(Return(position,return));
  9701. END;
  9702. IF currentIsInline THEN RETURN END;
  9703. EmitLeave(section, position,procedureType(SyntaxTree.ProcedureType).callingConvention);
  9704. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,procedureType(SyntaxTree.ProcedureType).callingConvention));
  9705. ReleaseIntermediateOperand(return);
  9706. END;
  9707. IF Trace THEN TraceExit("VisitCode") END;
  9708. END VisitCode;
  9709. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  9710. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  9711. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  9712. const, call: IntermediateCode.Operand;
  9713. parameterDesignator: SyntaxTree.Expression;
  9714. saved: RegisterEntry;
  9715. name: Basic.SegmentedName;
  9716. BEGIN
  9717. IF Trace THEN TraceEnter("ParameterCopies") END;
  9718. parameter := x.firstParameter;
  9719. WHILE parameter # NIL DO
  9720. IF parameter.kind = SyntaxTree.ValueParameter THEN
  9721. type := parameter.type.resolved;
  9722. IF IsOpenArray(type) THEN
  9723. VisitParameter(parameter);
  9724. op := result;
  9725. IF backend.cooperative & parameter.NeedsTrace() THEN
  9726. length := GetArrayLength(type, op.tag);
  9727. size := NewRegisterOperand(addressType);
  9728. base := ArrayBaseType(type);
  9729. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  9730. Emit(Mul(position, size, length, const));
  9731. dst := NewRegisterOperand (addressType);
  9732. Emit(Mov(position, dst, size));
  9733. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9734. Emit(Sub(position,dst,sp,dst));
  9735. Emit(And(position,dst,dst,const));
  9736. Emit(Mov(position,sp,dst));
  9737. par := fp;
  9738. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9739. IntermediateCode.InitImmediate(null, byteType, 0);
  9740. Emit(Fill(position, dst, size, null));
  9741. ReleaseIntermediateOperand(dst);
  9742. ReleaseIntermediateOperand(length);
  9743. SaveRegisters();ReleaseUsedRegisters(saved);
  9744. (* register dst has been freed before SaveRegisters already *)
  9745. base := ArrayBaseType(type);
  9746. (* assign method of open array *)
  9747. IF base.IsRecordType() THEN
  9748. Emit (Push(position, length));
  9749. Emit (Push(position, dst));
  9750. Emit (Push(position, op.op));
  9751. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  9752. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  9753. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  9754. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  9755. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  9756. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  9757. Emit (Push(position,length));
  9758. Emit (Push(position, dst));
  9759. Emit (Push(position, length));
  9760. Emit (Push(position, op.op));
  9761. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  9762. ELSE
  9763. Emit (Push(position, length));
  9764. Emit (Push(position, dst));
  9765. Emit (Push(position, length));
  9766. Emit (Push(position, op.op));
  9767. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  9768. ASSERT(ArrayBaseType(type).IsPointer());
  9769. END;
  9770. RestoreRegisters(saved);
  9771. ELSE
  9772. temp := GetDynamicSize(type,op.tag);
  9773. ReuseCopy(size,temp);
  9774. ReleaseIntermediateOperand(temp);
  9775. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9776. Emit(Sub(position,size,sp,size));
  9777. Emit(And(position,size,size,const));
  9778. Emit(Mov(position,sp,size));
  9779. par := fp;
  9780. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9781. ReleaseIntermediateOperand(size);
  9782. size := GetDynamicSize(type,op.tag);
  9783. END;
  9784. Emit(Copy(position,sp,op.op,size));
  9785. ReleaseIntermediateOperand(size);
  9786. ReleaseOperand(op);
  9787. IntermediateCode.MakeMemory(par,addressType);
  9788. Emit(Mov(position,par,sp));
  9789. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  9790. checker.SetCurrentScope(currentScope);
  9791. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  9792. Assign(parameterDesignator,parameterDesignator);
  9793. END;
  9794. END;
  9795. parameter := parameter.nextParameter;
  9796. END;
  9797. IF Trace THEN TraceExit("ParameterCopies") END;
  9798. END ParameterCopies;
  9799. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  9800. VAR x: SyntaxTree.Variable;
  9801. BEGIN
  9802. x := scope.firstVariable;
  9803. WHILE x # NIL DO
  9804. InitVariable(x);
  9805. x := x.nextVariable;
  9806. END;
  9807. END InitVariables;
  9808. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  9809. BEGIN
  9810. IF (symbol # NIL) THEN
  9811. RETURN fingerPrinter.SymbolFP(symbol).shallow
  9812. ELSE
  9813. RETURN 0
  9814. END;
  9815. END GetFingerprint;
  9816. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  9817. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  9818. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  9819. saved: RegisterEntry;
  9820. BEGIN
  9821. IF Trace THEN TraceEnter("Body") END;
  9822. ReleaseUsedRegisters(saved); (* just in case ... *)
  9823. section := ir;
  9824. exitLabel := NewLabel ();
  9825. IF moduleBody THEN moduleBodySection := section END;
  9826. IF ir.comments # NIL THEN
  9827. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  9828. commentPrintout.SingleStatement(TRUE);
  9829. dump := ir.comments;
  9830. ELSE
  9831. commentPrintout := NIL;
  9832. dump := NIL;
  9833. END;
  9834. prevScope := currentScope;
  9835. currentScope := scope;
  9836. lastSwitchPC := 0;
  9837. cooperativeSwitches := backend.cooperative;
  9838. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9839. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9840. IF x # NIL THEN
  9841. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9842. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  9843. IF moduleBody THEN
  9844. ProfilerInit();
  9845. ELSE
  9846. Basic.SegmentedNameToString(ir.name, string);
  9847. ProfilerAddProcedure(numberProcedures,string);
  9848. ProfilerEnterExit(numberProcedures,TRUE);
  9849. END;
  9850. END;
  9851. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  9852. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  9853. END;
  9854. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  9855. IF moduleBody & ~newObjectFile THEN
  9856. InitVariables(moduleScope)
  9857. END;
  9858. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  9859. cellScope := scope.outerScope(SyntaxTree.CellScope);
  9860. IF procedure = cellScope.bodyProcedure THEN
  9861. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  9862. StaticCallOperand(op, cellScope.constructor);
  9863. Emit(Call(position,op.op,0));
  9864. END;
  9865. END;
  9866. END;
  9867. ParameterCopies(procedureType);
  9868. InitVariables(scope);
  9869. IF x.code = NIL THEN
  9870. VisitStatementBlock(x);
  9871. ELSE
  9872. VisitCode(x.code)
  9873. END;
  9874. IF x.finally # NIL THEN (*! mark finally block for object file *)
  9875. ir.SetFinally(ir.pc);
  9876. StatementSequence(x.finally)
  9877. END;
  9878. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  9879. IF ~backend.cooperative THEN
  9880. ProfilerEnterExit(numberProcedures,FALSE);
  9881. END;
  9882. INC(numberProcedures);
  9883. END;
  9884. END;
  9885. IF backend.cooperative THEN
  9886. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  9887. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  9888. ELSIF newObjectFile & moduleBody & ~suppressModuleRegistration & ~meta.simple THEN
  9889. (*! not required any more? check and delete!
  9890. PushSelfPointer();
  9891. CallThis(position,"Modules","SetInitialized",1);
  9892. *)
  9893. (*
  9894. SetLabel(end);
  9895. *)
  9896. END;
  9897. IF x # NIL THEN
  9898. SELF.position := x.position;
  9899. END;
  9900. CheckRegistersFree();
  9901. ASSERT(modifyAssignmentCounter = 0);
  9902. currentScope := prevScope;
  9903. IF Trace THEN TraceExit("Body") END;
  9904. END Body;
  9905. END ImplementationVisitor;
  9906. MetaDataGenerator=OBJECT
  9907. VAR
  9908. implementationVisitor: ImplementationVisitor;
  9909. declarationVisitor: DeclarationVisitor;
  9910. module: Sections.Module;
  9911. moduleName: ARRAY 128 OF CHAR;
  9912. moduleNamePool: Basic.HashTableInt;
  9913. moduleNamePoolSection: IntermediateCode.Section;
  9914. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  9915. MethodTableOffset: LONGINT; (* method table offset from zero *)
  9916. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  9917. TypeTags: LONGINT; (* type extension level support *)
  9918. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  9919. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  9920. BEGIN
  9921. IF implementationVisitor.backend.cooperative THEN
  9922. TypeTags := MAX(LONGINT);
  9923. BaseTypesTableOffset := 0;
  9924. MethodTableOffset := 2;
  9925. TypeRecordBaseOffset := 0;
  9926. ELSIF simple THEN
  9927. TypeTags := 3; (* only 3 extensions allowed *)
  9928. BaseTypesTableOffset := 1;
  9929. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  9930. TypeRecordBaseOffset := 0;
  9931. ELSE
  9932. TypeTags := 16;
  9933. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  9934. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  9935. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  9936. END;
  9937. SELF.simple := simple;
  9938. SELF.implementationVisitor := implementationVisitor;
  9939. SELF.declarationVisitor := declarationVisitor;
  9940. implementationVisitor.meta := SELF;
  9941. declarationVisitor.meta := SELF;
  9942. END InitMetaDataGenerator;
  9943. PROCEDURE SetModule(module: Sections.Module);
  9944. VAR namePoolOffset: LONGINT;
  9945. BEGIN
  9946. SELF.module := module;
  9947. Global.GetModuleName(module.module,moduleName);
  9948. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple THEN
  9949. NEW(moduleNamePool, 32);
  9950. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  9951. END;
  9952. END SetModule;
  9953. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  9954. BEGIN
  9955. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  9956. END GetTypeRecordBaseOffset;
  9957. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9958. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  9959. BEGIN
  9960. INC(dataAdrOffset,6);
  9961. Info(section,"headerAdr");
  9962. Address(section,0);
  9963. Info(section,"typeDesc");
  9964. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  9965. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  9966. NamedSymbol(section, name, symbol, 0, offset);
  9967. Info(section,"mark: LONGINT;");
  9968. Longint(section,-1);
  9969. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0);END;
  9970. Info(section,"dataAdr-: ADDRESS");
  9971. Symbol(section,section, dataAdrOffset,0);
  9972. Info(section,"size-: SIZE");
  9973. Address(section,0);
  9974. Info(section,"nextRealtime: HeapBlock;");
  9975. Address(section,0);
  9976. END HeapBlock;
  9977. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9978. VAR i: LONGINT;
  9979. BEGIN
  9980. INC(dataAdrOffset,14);
  9981. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  9982. Info(section,"count*: LONGINT");
  9983. Longint(section,0);
  9984. Info(section,"locked*: BOOLEAN");
  9985. Longint(section,0);
  9986. Info(section,"awaitingLock*: ProcessQueue");
  9987. Address(section,0);
  9988. Address(section,0);
  9989. Info(section,"awaitingCond*: ProcessQueue");
  9990. Address(section,0);
  9991. Address(section,0);
  9992. Info(section,"lockedBy*: ANY");
  9993. Address(section,0);
  9994. Info(section,"lock*: ANY");
  9995. Address(section,0);
  9996. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  9997. Longint(section,1);
  9998. FOR i := 2 TO 6 DO
  9999. Longint(section,0);
  10000. END;
  10001. END ProtectedHeapBlock;
  10002. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10003. BEGIN
  10004. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10005. END Info;
  10006. PROCEDURE Address(section: IntermediateCode.Section; value: LONGINT);
  10007. VAR op: IntermediateCode.Operand;
  10008. BEGIN
  10009. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10010. section.Emit(Data(-11,op));
  10011. END Address;
  10012. PROCEDURE Size(section: IntermediateCode.Section; value: LONGINT);
  10013. VAR op: IntermediateCode.Operand;
  10014. BEGIN
  10015. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10016. section.Emit(Data(-12,op));
  10017. END Size;
  10018. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  10019. VAR op: IntermediateCode.Operand;
  10020. BEGIN
  10021. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  10022. section.Emit(Data(-1,op));
  10023. END Set;
  10024. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10025. VAR op: IntermediateCode.Operand;
  10026. BEGIN
  10027. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10028. section.Emit(Data(-1,op));
  10029. END Longint;
  10030. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10031. VAR op,noOperand: IntermediateCode.Operand;
  10032. BEGIN
  10033. IntermediateCode.InitOperand(noOperand);
  10034. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10035. section.PatchOperands(pc,op,noOperand,noOperand);
  10036. END PatchAddress;
  10037. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10038. VAR op,noOperand: IntermediateCode.Operand;
  10039. BEGIN
  10040. IntermediateCode.InitOperand(noOperand);
  10041. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10042. section.PatchOperands(pc,op,noOperand,noOperand);
  10043. END PatchSize;
  10044. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10045. VAR op,noOperand: IntermediateCode.Operand;
  10046. BEGIN
  10047. IntermediateCode.InitOperand(noOperand);
  10048. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10049. section.PatchOperands(pc,op,noOperand,noOperand);
  10050. END PatchLongint;
  10051. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10052. VAR op, noOperand: IntermediateCode.Operand;
  10053. BEGIN
  10054. IntermediateCode.InitOperand(noOperand);
  10055. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10056. section.PatchOperands(pc,op,noOperand,noOperand);
  10057. END PatchSymbol;
  10058. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10059. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10060. BEGIN
  10061. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10062. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10063. section.Emit(Data(-1,op));
  10064. END Boolean;
  10065. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10066. VAR op: IntermediateCode.Operand;
  10067. BEGIN
  10068. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10069. section.Emit(Data(-1,op));
  10070. END Char;
  10071. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10072. VAR i: LONGINT;
  10073. BEGIN
  10074. Info(section,str);
  10075. i := 0;
  10076. WHILE(str[i] # 0X) DO
  10077. Char(section,str[i]);
  10078. INC(i);
  10079. END;
  10080. Char(section,0X);
  10081. END String;
  10082. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10083. VAR op: IntermediateCode.Operand;
  10084. BEGIN
  10085. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10086. IntermediateCode.SetOffset(op,realOffset);
  10087. section.Emit(Data(-1,op));
  10088. END NamedSymbol;
  10089. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10090. BEGIN
  10091. IF symbol= NIL THEN
  10092. Address( section, realOffset);
  10093. ASSERT(virtualOffset = 0);
  10094. ELSE
  10095. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10096. END;
  10097. END Symbol;
  10098. (* OutPointers delivers
  10099. {pointerOffset}
  10100. *)
  10101. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10102. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type;
  10103. BEGIN
  10104. type := type.resolved;
  10105. IF type IS SyntaxTree.AnyType THEN
  10106. Symbol(section, symbol, 0, (offset ));
  10107. INC(numberPointers);
  10108. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10109. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10110. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10111. ELSIF type IS SyntaxTree.PointerType THEN
  10112. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10113. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10114. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10115. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10116. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10117. ELSIF (type IS SyntaxTree.RecordType) THEN
  10118. (* never treat a record like a pointer, even if the pointer field is set! *)
  10119. WITH type: SyntaxTree.RecordType DO
  10120. base := type.GetBaseRecord();
  10121. IF base # NIL THEN
  10122. Pointers(offset,symbol,section, base,numberPointers);
  10123. END;
  10124. variable := type.recordScope.firstVariable;
  10125. WHILE(variable # NIL) DO
  10126. IF ~(variable.untraced) THEN
  10127. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10128. END;
  10129. variable := variable.nextVariable;
  10130. END;
  10131. END;
  10132. ELSIF (type IS SyntaxTree.CellType) THEN
  10133. WITH type: SyntaxTree.CellType DO
  10134. base := type.GetBaseRecord();
  10135. IF base # NIL THEN
  10136. Pointers(offset,symbol,section, base,numberPointers);
  10137. END;
  10138. variable := type.cellScope.firstVariable;
  10139. WHILE(variable # NIL) DO
  10140. IF ~(variable.untraced) THEN
  10141. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10142. END;
  10143. variable := variable.nextVariable;
  10144. END;
  10145. END;
  10146. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10147. WITH type: SyntaxTree.ArrayType DO
  10148. IF type.form= SyntaxTree.Static THEN
  10149. n := type.staticLength;
  10150. base := type.arrayBase.resolved;
  10151. WHILE(base IS SyntaxTree.ArrayType) DO
  10152. type := base(SyntaxTree.ArrayType);
  10153. n := n* type.staticLength;
  10154. base := type.arrayBase.resolved;
  10155. END;
  10156. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10157. IF SemanticChecker.ContainsPointer(base) THEN
  10158. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10159. FOR i := 0 TO n-1 DO
  10160. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10161. END;
  10162. END;
  10163. ELSE
  10164. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10165. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10166. END;
  10167. END;
  10168. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10169. WITH type: SyntaxTree.MathArrayType DO
  10170. IF type.form = SyntaxTree.Static THEN
  10171. n := type.staticLength;
  10172. base := type.arrayBase.resolved;
  10173. WHILE(base IS SyntaxTree.MathArrayType) DO
  10174. type := base(SyntaxTree.MathArrayType);
  10175. n := n* type.staticLength;
  10176. base := type.arrayBase.resolved;
  10177. END;
  10178. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10179. IF SemanticChecker.ContainsPointer(base) THEN
  10180. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10181. FOR i := 0 TO n-1 DO
  10182. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10183. END;
  10184. END;
  10185. ELSE
  10186. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10187. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10188. END
  10189. END;
  10190. (* ELSE no pointers in type *)
  10191. END;
  10192. END Pointers;
  10193. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10194. VAR position,i: LONGINT; ch: CHAR;
  10195. BEGIN
  10196. IF pool.Has(index) THEN
  10197. RETURN pool.GetInt(index)
  10198. ELSE
  10199. position := source.pc;
  10200. pool.PutInt(index, position);
  10201. Info(source, name);
  10202. i := 0;
  10203. REPEAT
  10204. ch := name[i]; INC(i);
  10205. Char( source, ch);
  10206. UNTIL ch = 0X;
  10207. END;
  10208. RETURN position;
  10209. END EnterDynamicName;
  10210. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10211. VAR name: Basic.SectionName; position: LONGINT;
  10212. BEGIN
  10213. IF pool.Has(index) THEN
  10214. RETURN pool.GetInt(index)
  10215. ELSE
  10216. StringPool.GetString(index, name);
  10217. position := EnterDynamicName(source,name,index, pool);
  10218. END;
  10219. RETURN position;
  10220. END DynamicName;
  10221. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10222. VAR name: ARRAY 128 OF CHAR; section: IntermediateCode.Section; pooledName: Basic.SegmentedName;
  10223. BEGIN
  10224. COPY(moduleName,name);
  10225. Strings.Append(name,suffix);
  10226. Basic.ToSegmentedName(name, pooledName);
  10227. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName, NIL,TRUE);
  10228. IF implementationVisitor.backend.cooperative THEN
  10229. Info(section, "TypeDescriptor");
  10230. Basic.ToSegmentedName("BaseTypes.Array", pooledName);
  10231. NamedSymbol(section, pooledName,NIL, 0, 0);
  10232. BasePointer(section);
  10233. offset := 0;
  10234. ELSE
  10235. HeapBlock(mName,typeName,section,2);
  10236. Info(section, "HeapBlock");
  10237. (*
  10238. Symbol(section,section,2,0);
  10239. *)
  10240. Address(section,0); (* empty such that GC does not go on traversing *)
  10241. Info(section, "TypeDescriptor");
  10242. Address(section,0);
  10243. offset := section.pc;
  10244. END;
  10245. RETURN section
  10246. END Block;
  10247. PROCEDURE Array(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR);
  10248. VAR name: Basic.SegmentedName;
  10249. BEGIN
  10250. Info(source,"ArrayHeader");
  10251. IF implementationVisitor.backend.cooperative THEN
  10252. sizePC := source.pc;
  10253. Address(source,0);
  10254. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10255. IF baseType # "" THEN
  10256. Basic.ToSegmentedName(baseType, name);
  10257. NamedSymbol(source, name,NIL, 0, 0);
  10258. ELSE
  10259. Address(source,0);
  10260. END;
  10261. Address(source,0);
  10262. ELSE
  10263. Address(source,0);
  10264. Address(source,0);
  10265. Address(source,0);
  10266. sizePC := source.pc;
  10267. Address(source,0);
  10268. Info(source,"array data");
  10269. END;
  10270. END Array;
  10271. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10272. BEGIN
  10273. IF implementationVisitor.backend.cooperative THEN
  10274. PatchSize(section, pc, size);
  10275. PatchSize(section, pc + 3, size);
  10276. ELSE
  10277. PatchSize(section, pc, size);
  10278. END;
  10279. END PatchArray;
  10280. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10281. VAR
  10282. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10283. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10284. poolMap: Basic.HashTableInt;
  10285. namePool: IntermediateCode.Section;
  10286. namePoolOffset: LONGINT;
  10287. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10288. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10289. BEGIN
  10290. Basic.SegmentedNameToString(s1.name,n1);
  10291. Basic.SegmentedNameToString(s2.name,n2);
  10292. index := 0;
  10293. ch1 := n1[index];
  10294. ch2 := n2[index];
  10295. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10296. INC(index);
  10297. ch1 := n1[index];
  10298. ch2 := n2[index];
  10299. END;
  10300. RETURN ch1 < ch2;
  10301. END Compare;
  10302. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10303. VAR
  10304. i, j: LONGINT;
  10305. x, t: Sections.Section;
  10306. BEGIN
  10307. IF lo < hi THEN
  10308. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10309. WHILE i <= j DO
  10310. WHILE Compare(list[i], x) DO INC(i) END;
  10311. WHILE Compare(x, list[j]) DO DEC(j) END;
  10312. IF i <= j THEN
  10313. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10314. INC(i); DEC(j)
  10315. END
  10316. END;
  10317. IF lo < j THEN QuickSort(list, lo, j) END;
  10318. IF i < hi THEN QuickSort(list, i, hi) END
  10319. END;
  10320. END QuickSort;
  10321. (*
  10322. ExportDesc* = RECORD
  10323. fp*: ADDRESS;
  10324. name* {UNTRACED}: DynamicName;
  10325. adr*: ADDRESS;
  10326. exports*: LONGINT;
  10327. dsc* {UNTRACED}: ExportArray
  10328. END;
  10329. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10330. *)
  10331. PROCEDURE ExportDesc2(
  10332. source: IntermediateCode.Section;
  10333. namePool: IntermediateCode.Section;
  10334. fingerPrinter: FingerPrinter.FingerPrinter;
  10335. symbol: Sections.Section;
  10336. name: StringPool.Index;
  10337. VAR patchAdr: LONGINT
  10338. ): BOOLEAN;
  10339. VAR fingerPrint: SyntaxTree.FingerPrint;
  10340. BEGIN
  10341. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10342. & (symbol.type # Sections.InlineCodeSection)
  10343. THEN
  10344. *)
  10345. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10346. & (symbol.type # Sections.InlineCodeSection))
  10347. THEN
  10348. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10349. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10350. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10351. Longint(source,fingerPrint.shallow);
  10352. ELSE
  10353. Longint(source, 0);
  10354. END;
  10355. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  10356. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10357. Symbol(source, symbol,0,0);
  10358. patchAdr := source.pc;
  10359. Longint(source, 0);
  10360. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  10361. Address(source,0);
  10362. END;
  10363. RETURN TRUE
  10364. ELSE
  10365. RETURN FALSE
  10366. END;
  10367. END ExportDesc2;
  10368. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10369. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10370. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10371. sym: Sections.Section; ignore: LONGINT; symbol: Sections.Section;
  10372. nextPatch: LONGINT;
  10373. TYPE
  10374. Scope = RECORD
  10375. elements: LONGINT;
  10376. gelements: LONGINT;
  10377. section: IntermediateCode.Section;
  10378. patchAdr: LONGINT;
  10379. arraySizePC: LONGINT;
  10380. beginPC: LONGINT; (* current scope start pc *)
  10381. END;
  10382. BEGIN
  10383. Basic.InitSegmentedName(prev);
  10384. olevel := -1;
  10385. scopes[0].section := source;
  10386. scopes[0].arraySizePC := MIN(LONGINT);
  10387. FOR s := 0 TO LEN(sections)-1 DO
  10388. symbol := sections[s];
  10389. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10390. this := sections[s].name;
  10391. level := 0;
  10392. WHILE (this[level] > 0) DO
  10393. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10394. INC(level);
  10395. END;
  10396. WHILE level < olevel DO
  10397. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10398. IF olevel > 0 THEN
  10399. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10400. nextPatch := scopes[olevel-1].patchAdr+1;
  10401. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10402. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10403. END;
  10404. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10405. DEC(olevel);
  10406. END;
  10407. IF (this[level] > 0) THEN
  10408. IF level > olevel THEN
  10409. (*TRACE("opening",level); *)
  10410. IF scopes[level].section = NIL THEN
  10411. arrayName := ".@ExportArray";
  10412. Strings.AppendInt(arrayName, level);
  10413. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,ignore);
  10414. Array(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc");
  10415. END;
  10416. scopes[level].beginPC := scopes[level].section.pc;
  10417. olevel := level;
  10418. scopes[olevel].elements := 0;
  10419. END;
  10420. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10421. sym := sections[s];
  10422. ELSE
  10423. sym := NIL;
  10424. END;
  10425. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10426. THEN
  10427. INC(scopes[olevel].elements);
  10428. END;
  10429. (*StringPool.GetString(this[level], name);*)
  10430. (*TRACE(level, name);*)
  10431. (* enter string in scope *)
  10432. INC(level);
  10433. END;
  10434. END;
  10435. Basic.SegmentedNameToString(this, name);
  10436. (*TRACE(level, "enter", name);*)
  10437. prev := this;
  10438. END;
  10439. END;
  10440. WHILE 0 <= olevel DO
  10441. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10442. IF olevel > 0 THEN
  10443. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10444. nextPatch := scopes[olevel-1].patchAdr+1;
  10445. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10446. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10447. END;
  10448. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10449. DEC(olevel);
  10450. END;
  10451. level := 0;
  10452. WHILE (level < LEN(scopes)) DO
  10453. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  10454. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10455. END;
  10456. INC(level);
  10457. END;
  10458. END Export;
  10459. BEGIN
  10460. NEW(fingerPrinter, module.system);
  10461. NEW(poolMap, 64);
  10462. (* 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 *)
  10463. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10464. NEW(sectionArray, module.allSections.Length());
  10465. FOR i := 0 TO module.allSections.Length() - 1 DO
  10466. section := module.allSections.GetSection(i);
  10467. sectionArray[i] := section;
  10468. END;
  10469. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10470. Export(sectionArray^);
  10471. END ExportDesc;
  10472. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10473. VAR
  10474. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10475. BEGIN
  10476. Info(source, "exception table offsets array descriptor");
  10477. size := 0;
  10478. Array(source,sizePC,"Modules.ExceptionTableEntry");
  10479. Info(source, "exception table content");
  10480. FOR i := 0 TO module.allSections.Length() - 1 DO
  10481. p := module.allSections.GetSection(i);
  10482. IF p.type = Sections.CodeSection THEN
  10483. finallyPC := p(IntermediateCode.Section).finally;
  10484. IF finallyPC>=0 THEN
  10485. Symbol( source, p, 0,0);
  10486. Symbol( source, p, finallyPC, 0);
  10487. Symbol( source, p, finallyPC,0);
  10488. INC(size);
  10489. END;
  10490. END
  10491. END;
  10492. PatchArray(source,sizePC,size);
  10493. END ExceptionArray;
  10494. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10495. VAR i: LONGINT; ch: CHAR;
  10496. BEGIN
  10497. i := 0;
  10498. REPEAT
  10499. ch := name[i]; INC(i);
  10500. Char( section, ch);
  10501. UNTIL ch = 0X;
  10502. WHILE i < 32 DO
  10503. Char( section, 0X); INC(i);
  10504. END;
  10505. END Name;
  10506. PROCEDURE References(section: IntermediateCode.Section);
  10507. CONST
  10508. rfDirect = 1X; rfIndirect = 3X;
  10509. rfStaticArray= 12X; rfDynamicArray=14X; rfOpenArray=15X;
  10510. rfByte = 1X; rfBoolean = 2X; rfChar8=3X; rfShortint=04X; rfInteger = 05X; rfLongint = 06X;
  10511. rfReal = 07X; rfLongreal = 08X; rfSet = 09X; rfDelegate = 0EX; rfString = 0FH; rfPointer = 0DX; rfHugeint = 10X;
  10512. rfChar16=11X; rfChar32=12X; rfAll=13X; rfSame=14X; rfRange=15X; rfRecord=16X; rfComplex = 17X; rfLongcomplex = 18X;
  10513. rfPort = 19X;
  10514. rfRecordPointer=1DX;
  10515. rfArrayFlag = 80X;
  10516. VAR
  10517. s: Sections.Section; sizePC, i, startPC, endPC: LONGINT;
  10518. PROCEDURE BaseType(type: SyntaxTree.Type): CHAR;
  10519. VAR char: CHAR;
  10520. BEGIN
  10521. IF type = NIL THEN char := rfLongint
  10522. ELSIF type IS SyntaxTree.ByteType THEN char := rfByte
  10523. ELSIF type IS SyntaxTree.BooleanType THEN char := rfBoolean
  10524. ELSIF type IS SyntaxTree.CharacterType THEN
  10525. IF type.sizeInBits = 8 THEN char := rfChar8
  10526. ELSIF type.sizeInBits = 16 THEN char := rfChar16
  10527. ELSIF type.sizeInBits = 32 THEN char := rfChar32
  10528. END;
  10529. ELSIF (type IS SyntaxTree.IntegerType) OR (type IS SyntaxTree.AddressType) OR (type IS SyntaxTree.SizeType) THEN
  10530. IF type.sizeInBits = 8 THEN char := rfShortint
  10531. ELSIF type.sizeInBits = 16 THEN char := rfInteger
  10532. ELSIF type.sizeInBits = 32 THEN char := rfLongint
  10533. ELSIF type.sizeInBits = 64 THEN char := rfHugeint
  10534. END;
  10535. ELSIF type IS SyntaxTree.SizeType THEN char := rfLongint
  10536. ELSIF type IS SyntaxTree.FloatType THEN
  10537. IF type.sizeInBits = 32 THEN char := rfReal
  10538. ELSIF type.sizeInBits = 64 THEN char := rfLongreal
  10539. END;
  10540. ELSIF type IS SyntaxTree.ComplexType THEN
  10541. IF type.sizeInBits = 64 THEN char := rfComplex
  10542. ELSIF type.sizeInBits = 128 THEN char := rfLongcomplex
  10543. END;
  10544. ELSIF type IS SyntaxTree.SetType THEN char := rfSet
  10545. ELSIF type IS SyntaxTree.AnyType THEN char := rfPointer
  10546. ELSIF type IS SyntaxTree.ObjectType THEN char := rfPointer
  10547. ELSIF type IS SyntaxTree.PointerType THEN char := rfPointer
  10548. ELSIF type IS SyntaxTree.ProcedureType THEN char := rfDelegate
  10549. ELSIF type IS SyntaxTree.RangeType THEN char := rfRange
  10550. ELSIF type IS SyntaxTree.PortType THEN char := rfPort
  10551. ELSE (*ASSERT(arrayOf);*) char := rfPointer; (*RETURN (* ARRAY OF unknown (record): do not write anything *)*)
  10552. END;
  10553. RETURN char
  10554. END BaseType;
  10555. PROCEDURE RecordType(type: SyntaxTree.RecordType);
  10556. VAR destination: Sections.Section;
  10557. BEGIN
  10558. destination := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10559. IF type.pointerType # NIL THEN
  10560. Char(section,rfRecordPointer)
  10561. ELSE
  10562. Char(section,rfRecord);
  10563. END;
  10564. IF destination = NIL THEN
  10565. Longint(section,0);
  10566. ELSE
  10567. Longint(section,destination.offset); (* used for ? *)
  10568. END;
  10569. END RecordType;
  10570. PROCEDURE StaticArrayLength(type: SyntaxTree.ArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10571. BEGIN
  10572. baseType := type.arrayBase.resolved;
  10573. IF type.form = SyntaxTree.Static THEN
  10574. IF baseType IS SyntaxTree.ArrayType THEN
  10575. RETURN type.staticLength * StaticArrayLength(baseType(SyntaxTree.ArrayType),baseType)
  10576. ELSE
  10577. RETURN type.staticLength
  10578. END
  10579. ELSE
  10580. RETURN 0
  10581. END;
  10582. END StaticArrayLength;
  10583. PROCEDURE ArrayType(type: SyntaxTree.ArrayType);
  10584. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10585. BEGIN
  10586. length := StaticArrayLength(type, baseType);
  10587. char := BaseType(baseType);
  10588. IF type.form # SyntaxTree.Open THEN
  10589. Char(section,CHR(ORD(char)+ORD(rfArrayFlag)));
  10590. Longint(section, length)
  10591. ELSE
  10592. length :=0;
  10593. (*length := 1+SemanticChecker.Dimension(type,{SyntaxTree.Open});*)
  10594. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10595. Longint(section, length)
  10596. END;
  10597. END ArrayType;
  10598. PROCEDURE StaticMathArrayLength(type: SyntaxTree.MathArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10599. BEGIN
  10600. baseType := type.arrayBase;
  10601. IF baseType # NIL THEN
  10602. baseType := baseType.resolved;
  10603. END;
  10604. IF type.form = SyntaxTree.Static THEN
  10605. IF (baseType # NIL) & (baseType IS SyntaxTree.MathArrayType) THEN
  10606. RETURN type.staticLength * StaticMathArrayLength(baseType(SyntaxTree.MathArrayType),baseType)
  10607. ELSE
  10608. RETURN type.staticLength
  10609. END
  10610. ELSE
  10611. RETURN 0
  10612. END;
  10613. END StaticMathArrayLength;
  10614. PROCEDURE MathArrayType(type: SyntaxTree.MathArrayType);
  10615. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10616. BEGIN
  10617. length := StaticMathArrayLength(type, baseType);
  10618. char := BaseType(baseType);
  10619. IF type.form = SyntaxTree.Open THEN
  10620. char := BaseType(module.system.addressType);
  10621. length := 5+2*SemanticChecker.Dimension(type,{SyntaxTree.Open});
  10622. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10623. Longint(section, length)
  10624. ELSIF type.form=SyntaxTree.Tensor THEN
  10625. char := BaseType(module.system.addressType);
  10626. Char(section, CHR(ORD(char)));
  10627. ELSE
  10628. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10629. Longint(section, length)
  10630. END;
  10631. END MathArrayType;
  10632. PROCEDURE Type(type: SyntaxTree.Type);
  10633. BEGIN
  10634. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10635. IF type IS SyntaxTree.BasicType THEN
  10636. Char(section, BaseType(type));
  10637. ELSIF type IS SyntaxTree.RecordType THEN
  10638. RecordType(type(SyntaxTree.RecordType));
  10639. ELSIF type IS SyntaxTree.ArrayType THEN
  10640. ArrayType(type(SyntaxTree.ArrayType))
  10641. ELSIF type IS SyntaxTree.EnumerationType THEN
  10642. Char(section, BaseType(module.system.longintType))
  10643. ELSIF type IS SyntaxTree.PointerType THEN
  10644. IF type(SyntaxTree.PointerType).pointerBase IS SyntaxTree.RecordType THEN
  10645. RecordType(type(SyntaxTree.PointerType).pointerBase(SyntaxTree.RecordType));
  10646. ELSE
  10647. Char(section, BaseType(type))
  10648. END;
  10649. ELSIF type IS SyntaxTree.ProcedureType THEN
  10650. Char(section, BaseType(type));
  10651. ELSIF type IS SyntaxTree.MathArrayType THEN
  10652. MathArrayType(type(SyntaxTree.MathArrayType));
  10653. ELSIF type IS SyntaxTree.CellType THEN
  10654. Char(section, BaseType(module.system.anyType));
  10655. ELSIF type IS SyntaxTree.PortType THEN
  10656. Char(section, rfPort);
  10657. ELSE HALT(200)
  10658. END;
  10659. END Type;
  10660. PROCEDURE WriteVariable(variable: SyntaxTree.Variable; indirect: BOOLEAN);
  10661. VAR name: ARRAY 256 OF CHAR;
  10662. BEGIN
  10663. IF variable.externalName # NIL THEN RETURN END;
  10664. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10665. variable.GetName(name);
  10666. Type(variable.type);
  10667. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10668. String(section,name);
  10669. END WriteVariable;
  10670. PROCEDURE WriteParameter(variable: SyntaxTree.Parameter; indirect: BOOLEAN);
  10671. VAR name: ARRAY 256 OF CHAR;
  10672. BEGIN
  10673. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10674. variable.GetName(name);
  10675. Type(variable.type);
  10676. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10677. variable.GetName(name);
  10678. String(section,name);
  10679. END WriteParameter;
  10680. PROCEDURE ReturnType(type: SyntaxTree.Type);
  10681. BEGIN
  10682. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10683. IF type IS SyntaxTree.ArrayType THEN
  10684. WITH type: SyntaxTree.ArrayType DO
  10685. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10686. ELSE Char(section,rfOpenArray)
  10687. END;
  10688. END
  10689. ELSIF type IS SyntaxTree.MathArrayType THEN
  10690. WITH type: SyntaxTree.MathArrayType DO
  10691. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10692. ELSE Char(section,rfOpenArray)
  10693. END;
  10694. END
  10695. ELSIF type IS SyntaxTree.RecordType THEN
  10696. Char(section,rfRecord);
  10697. ELSE
  10698. Char(section, BaseType(type));
  10699. END;
  10700. END ReturnType;
  10701. PROCEDURE Procedure(s: Sections.Section);
  10702. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10703. parameter: SyntaxTree.Parameter; variable: SyntaxTree.Variable;
  10704. name: ARRAY 256 OF CHAR;
  10705. BEGIN
  10706. procedure := s.symbol(SyntaxTree.Procedure); (*! check for variable or type symbol for object body *)
  10707. (*procedure.name,name);*)
  10708. Global.GetSymbolNameInScope(procedure,module.module.moduleScope,name);
  10709. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10710. Char(section,0F9X);
  10711. Symbol(section,s,0,0);
  10712. Symbol(section,s,s(IntermediateCode.Section).pc,0);
  10713. Longint(section,procedureType.numberParameters);
  10714. ReturnType(procedureType.returnType);
  10715. Longint(section,0); (*! level *)
  10716. Longint(section,0);
  10717. (*
  10718. IF procedure.scope IS SyntaxTree.RecordScope THEN (* add object name *)
  10719. record := procedure.scope(SyntaxTree.RecordScope).ownerRecord;
  10720. recordName := "";
  10721. IF record.pointerType # NIL THEN
  10722. DeclarationName(record.pointerType.typeDeclaration,recordName);
  10723. ELSE
  10724. DeclarationName(record.typeDeclaration,recordName);
  10725. END;
  10726. i := 0;
  10727. Info(section,recordName);
  10728. WHILE recordName[i] # 0X DO
  10729. Char(section,recordName[i]); INC(i);
  10730. INC(size);
  10731. END;
  10732. Char(section,".");
  10733. INC(size);
  10734. END;
  10735. *)
  10736. String(section,name);
  10737. parameter := procedureType.firstParameter;
  10738. WHILE(parameter # NIL) DO
  10739. WriteParameter(parameter,parameter.kind # SyntaxTree.ValueParameter); (*!treat exceptions !*)
  10740. parameter := parameter.nextParameter;
  10741. END;
  10742. variable := procedure.procedureScope.firstVariable;
  10743. WHILE(variable # NIL) DO
  10744. WriteVariable(variable,FALSE);
  10745. variable := variable.nextVariable;
  10746. END;
  10747. END Procedure;
  10748. PROCEDURE Scope(s: Sections.Section);
  10749. BEGIN
  10750. Char(section,0F8X);
  10751. Symbol(section,s,0,0); (* start *)
  10752. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  10753. String(section,"$$");
  10754. (* removed variables -- wrongly interpreted by Reflection
  10755. variable := module.module.moduleScope.firstVariable;
  10756. WHILE(variable # NIL) DO
  10757. WriteVariable(variable,FALSE);
  10758. variable := variable.nextVariable;
  10759. END;
  10760. *)
  10761. END Scope;
  10762. PROCEDURE ComputeSize(startPC, endPC: LONGINT): SIZE;
  10763. VAR result, i: LONGINT;
  10764. BEGIN
  10765. FOR i := startPC TO endPC -1 DO
  10766. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  10767. INC(result, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  10768. END;
  10769. RETURN result;
  10770. END ComputeSize;
  10771. BEGIN
  10772. Array(section,sizePC,"");
  10773. startPC := section.pc;
  10774. Char(section,0FFX); (* sign for trap writer *)
  10775. FOR i := 0 TO module.allSections.Length() - 1 DO
  10776. s := module.allSections.GetSection(i);
  10777. IF (s.type # Sections.InitCodeSection) & (s.symbol = module.module.moduleScope.bodyProcedure) THEN
  10778. Scope(s) (*! must be first procedure in ref section *)
  10779. END
  10780. END;
  10781. FOR i := 0 TO module.allSections.Length() - 1 DO
  10782. s := module.allSections.GetSection(i);
  10783. IF (s.symbol = module.module.moduleScope.bodyProcedure) THEN (* already done, see above *)
  10784. ELSIF (s.type # Sections.InitCodeSection) & (s.symbol # NIL) & (s.symbol IS SyntaxTree.Procedure) & ~s.symbol(SyntaxTree.Procedure).isInline THEN
  10785. Procedure(s)
  10786. END
  10787. END;
  10788. endPC := section.pc;
  10789. PatchArray(section,sizePC,ComputeSize(startPC, endPC));
  10790. END References;
  10791. (*
  10792. Command* = RECORD
  10793. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  10794. name*: Name; (* name of the procedure *)
  10795. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  10796. entryAdr* : ADDRESS; (* entry address of procedure *)
  10797. END;
  10798. *)
  10799. PROCEDURE CommandArray(source: IntermediateCode.Section);
  10800. VAR
  10801. p: Sections.Section; sizePC, numberCommands: LONGINT;
  10802. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10803. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  10804. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  10805. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  10806. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  10807. BEGIN
  10808. RETURN
  10809. (type = NIL) OR
  10810. (type.resolved IS SyntaxTree.RecordType) OR
  10811. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  10812. (type.resolved IS SyntaxTree.AnyType);
  10813. END TypeAllowed;
  10814. BEGIN
  10815. numberParameters := procedureType.numberParameters;
  10816. RETURN
  10817. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  10818. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  10819. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  10820. END GetProcedureAllowed;
  10821. PROCEDURE WriteType(type : SyntaxTree.Type);
  10822. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  10823. name: Basic.SegmentedName; offset: LONGINT;
  10824. BEGIN
  10825. IF type = NIL THEN
  10826. Address(source,0);
  10827. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  10828. Address(source,1);
  10829. ELSE
  10830. type := type.resolved;
  10831. IF type IS SyntaxTree.PointerType THEN
  10832. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  10833. END;
  10834. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  10835. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  10836. name[0] := typeDeclaration.name; name[1] := -1;
  10837. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10838. ASSERT(section # NIL);
  10839. ELSE
  10840. Global.GetSymbolSegmentedName(typeDeclaration,name);
  10841. (* TODO *)
  10842. section := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  10843. END;
  10844. IF implementationVisitor.backend.cooperative THEN
  10845. offset := 0;
  10846. ELSE
  10847. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  10848. END;
  10849. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  10850. END;
  10851. END WriteType;
  10852. BEGIN
  10853. Info(source, "command array descriptor");
  10854. Array(source,sizePC,"Modules.Command");
  10855. numberCommands := 0;
  10856. Info(source, "command array content");
  10857. FOR i := 0 TO module.allSections.Length() - 1 DO
  10858. p := module.allSections.GetSection(i);
  10859. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  10860. procedure := p.symbol(SyntaxTree.Procedure);
  10861. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10862. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  10863. procedure.GetName(name);
  10864. Name(source,name);
  10865. numberParameters := procedureType.numberParameters;
  10866. (* offset of type of first parameter *)
  10867. IF (numberParameters = 0 ) THEN WriteType(NIL)
  10868. ELSE WriteType(procedureType.firstParameter.type)
  10869. END;
  10870. (* offset of type of return parameter *)
  10871. WriteType(procedureType.returnType);
  10872. (* command name *)
  10873. (* command code offset *)
  10874. Symbol(source,p,0,0);
  10875. INC(numberCommands);
  10876. IF Trace THEN
  10877. D.Ln;
  10878. END;
  10879. END;
  10880. END
  10881. END;
  10882. PatchArray(source,sizePC,numberCommands);
  10883. END CommandArray;
  10884. (* to prevent from double import of different module aliases *)
  10885. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  10886. VAR i: SyntaxTree.Import;
  10887. BEGIN
  10888. i := module.module.moduleScope.firstImport;
  10889. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  10890. i := i.nextImport;
  10891. END;
  10892. RETURN i = import
  10893. END IsFirstDirectOccurence;
  10894. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  10895. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  10896. BEGIN
  10897. Array(source,pc,"");
  10898. Info(source, "import module array data");
  10899. IF implementationVisitor.backend.cooperative THEN
  10900. offset := 0;
  10901. ELSE
  10902. IF module.system.addressType.sizeInBits = 64 THEN
  10903. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  10904. ELSE
  10905. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  10906. END;
  10907. END;
  10908. import := module.module.moduleScope.firstImport;
  10909. numberImports := 0;
  10910. WHILE import # NIL DO
  10911. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  10912. Global.GetModuleSegmentedName(import.module,name);
  10913. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  10914. NamedSymbol(source, name, NIL, 0, offset);
  10915. INC(numberImports);
  10916. END;
  10917. import := import.nextImport
  10918. END;
  10919. PatchArray(source,pc,numberImports);
  10920. END ImportsArray;
  10921. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  10922. VAR
  10923. p: Sections.Section; sizePC, size, i: LONGINT;
  10924. BEGIN
  10925. Info(source, "Type info section");
  10926. size := 0;
  10927. Array(source,sizePC,"Modules.TypeDesc");
  10928. FOR i := 0 TO module.allSections.Length() - 1 DO
  10929. p := module.allSections.GetSection(i);
  10930. WITH p: IntermediateCode.Section DO
  10931. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  10932. Symbol(source,p,0,0);
  10933. INC(size);
  10934. END;
  10935. END
  10936. END;
  10937. PatchArray(source,sizePC,size);
  10938. END TypeInfoSection;
  10939. (*
  10940. ProcTableEntry* = RECORD
  10941. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  10942. noPtr*: LONGINT;
  10943. END;
  10944. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  10945. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  10946. *)
  10947. PROCEDURE PointersInProcTables(procArray, pointerArray: IntermediateCode.Section; VAR procArraySize, maxPointers: LONGINT);
  10948. VAR
  10949. destination: Sections.Section;
  10950. pointerArraySizePC, procArraySizePC, pointerArraySize, i: LONGINT;
  10951. PROCEDURE PointerOffsets(destination : IntermediateCode.Section);
  10952. VAR numberPointers: LONGINT; procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10953. variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; string: Basic.SectionName;
  10954. BEGIN
  10955. Info(procArray,"pcFrom");
  10956. Symbol(procArray,destination,0,0);
  10957. Info(procArray,"pcTo");
  10958. Symbol(procArray,destination,destination.pc,0);
  10959. Info(procArray,"pcStatementBegin");
  10960. Symbol(procArray,destination,destination.validPAFEnter,0);
  10961. Info(procArray,"pcStatementEnd");
  10962. Symbol(procArray,destination,destination.validPAFExit,0);
  10963. IF ~implementationVisitor.backend.cooperative THEN
  10964. Basic.SegmentedNameToString(destination.name, string);
  10965. Info(pointerArray,string);
  10966. procedure := destination.symbol(SyntaxTree.Procedure);
  10967. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10968. variable := procedure.procedureScope.firstVariable;
  10969. WHILE(variable # NIL) DO
  10970. IF ~(variable.untraced) THEN
  10971. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, pointerArray, variable.type, numberPointers);
  10972. END;
  10973. variable := variable.nextVariable
  10974. END;
  10975. parameter := procedureType.firstParameter;
  10976. WHILE(parameter # NIL) DO
  10977. IF ~(parameter.untraced) THEN
  10978. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, pointerArray, parameter.type, numberPointers);
  10979. END;
  10980. parameter := parameter.nextParameter;
  10981. END;
  10982. END;
  10983. Info(procArray,"numberPointers");
  10984. Longint(procArray,numberPointers);
  10985. IF numberPointers > maxPointers THEN maxPointers := numberPointers END;
  10986. INC(pointerArraySize, numberPointers);
  10987. END PointerOffsets;
  10988. BEGIN
  10989. maxPointers := 0;
  10990. Info(procArray, "proc array descriptor");
  10991. Address(procArray,0);
  10992. Address(procArray,0);
  10993. Address(procArray,0);
  10994. procArraySizePC := procArray.pc;
  10995. Address(procArray,0);
  10996. procArraySize := 0;
  10997. IF ~implementationVisitor.backend.cooperative THEN
  10998. Info(pointerArray, "pointer array descriptor");
  10999. Address(pointerArray,0);
  11000. Address(pointerArray,0);
  11001. Address(pointerArray,0);
  11002. pointerArraySizePC := pointerArray.pc;
  11003. Address(pointerArray,0);
  11004. pointerArraySize := 0;
  11005. END;
  11006. procArraySize := 0;
  11007. FOR i := 0 TO module.allSections.Length() - 1 DO
  11008. destination := module.allSections.GetSection(i);
  11009. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11010. PointerOffsets(destination(IntermediateCode.Section));
  11011. INC(procArraySize);
  11012. END
  11013. END;
  11014. PatchLongint(procArray,procArraySizePC,procArraySize);
  11015. IF ~implementationVisitor.backend.cooperative THEN
  11016. PatchLongint(pointerArray,pointerArraySizePC,pointerArraySize);
  11017. END;
  11018. END PointersInProcTables;
  11019. (*
  11020. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11021. VAR
  11022. next*: Module; (** once a module is published, all fields are read-only *)
  11023. name*: Name;
  11024. init, published: BOOLEAN;
  11025. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11026. sb*: ADDRESS; <- set to beginning of data section by loader
  11027. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11028. command*: POINTER TO ARRAY OF Command;
  11029. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11030. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11031. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11032. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11033. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11034. data*, code*: Bytes;
  11035. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11036. export*: ExportDesc;
  11037. term*: TerminationHandler;
  11038. exTable*: ExceptionTable;
  11039. noProcs*: LONGINT;
  11040. firstProc*: ADDRESS; <- done by loader
  11041. maxPtrs*: LONGINT;
  11042. crc*: LONGINT;
  11043. *)
  11044. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11045. BEGIN
  11046. Info(section, "cycle");
  11047. Size(section,0);
  11048. Info(section, "references");
  11049. Size(section,0);
  11050. Info(section, "nextMarked");
  11051. Address(section,0);
  11052. Info(section, "nextWatched");
  11053. Address(section,0);
  11054. END BasePointer;
  11055. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11056. BEGIN
  11057. BasePointer(section);
  11058. Info(section, "action");
  11059. Address(section,0);
  11060. Info(section, "monitor");
  11061. Address(section,0);
  11062. END BaseObject;
  11063. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  11064. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  11065. pooledName: Basic.SegmentedName;
  11066. symbol: SyntaxTree.Symbol;
  11067. BEGIN
  11068. Global.GetModuleName(module.module,name);
  11069. Strings.Append(name,".@Module.@Descriptor");
  11070. Basic.ToSegmentedName(name, pooledName);
  11071. descriptorSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  11072. Symbol(section,descriptorSection,0,0);
  11073. Info(descriptorSection, "descriptor");
  11074. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11075. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  11076. Address(descriptorSection,0);
  11077. Global.GetModuleName(module.module,name);
  11078. Strings.Append(name,".@Trace");
  11079. Basic.ToSegmentedName(name, pooledName);
  11080. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11081. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  11082. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11083. END ModuleDescriptor;
  11084. PROCEDURE ModuleSection(): IntermediateCode.Section;
  11085. VAR name: ARRAY 128 OF CHAR;
  11086. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  11087. symbol: SyntaxTree.Symbol;
  11088. BEGIN
  11089. Global.GetModuleName(module.module,name);
  11090. Strings.Append(name,".@Module");
  11091. Basic.ToSegmentedName(name, pooledName);
  11092. moduleSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  11093. moduleSection.SetExported(TRUE);
  11094. IF moduleSection.pc = 0 THEN
  11095. IF implementationVisitor.backend.cooperative THEN
  11096. Info(moduleSection, "descriptor");
  11097. ModuleDescriptor(moduleSection);
  11098. BaseObject(moduleSection);
  11099. implementationVisitor.CreateTraceModuleMethod(module.module);
  11100. ELSE
  11101. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  11102. Info(moduleSection, "HeapBlock");
  11103. Symbol(moduleSection,moduleSection,2,0);
  11104. Info(moduleSection, "TypeDescriptor");
  11105. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11106. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  11107. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  11108. END;
  11109. END;
  11110. RETURN moduleSection;
  11111. END ModuleSection;
  11112. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  11113. VAR
  11114. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  11115. typeInfoSection, procTableSection, ptrTableSection, referenceSection : IntermediateCode.Section;
  11116. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  11117. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, ptrTableSectionOffset, maxPointers, numberProcs,temp,
  11118. referenceSectionOffset : LONGINT;
  11119. BEGIN
  11120. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  11121. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  11122. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  11123. ImportsArray(importSection);
  11124. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  11125. CommandArray(commandsSection);
  11126. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  11127. ExceptionArray(exceptionSection);
  11128. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  11129. TypeInfoSection(typeInfoSection);
  11130. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  11131. References(referenceSection);
  11132. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  11133. IF ~implementationVisitor.backend.cooperative THEN
  11134. ptrTableSection := Block("Heaps","SystemBlockDesc",".@PtrTable",ptrTableSectionOffset);
  11135. ELSE
  11136. ptrTableSection := NIL;
  11137. END;
  11138. PointersInProcTables(procTableSection,ptrTableSection,numberProcs,maxPointers);
  11139. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  11140. Array(emptyArraySection,temp,"");
  11141. moduleSection := ModuleSection();
  11142. Info(moduleSection, "nextRoot*: RootObject");
  11143. Address(moduleSection,0);
  11144. Info(moduleSection, "next*: Module");
  11145. Address(moduleSection,0);
  11146. Info(moduleSection, "name*: Name");
  11147. Name(moduleSection,moduleName);
  11148. Info(moduleSection, "init, published: BOOLEAN");
  11149. Boolean(moduleSection,FALSE);
  11150. Boolean(moduleSection,FALSE);
  11151. Info(moduleSection,"filler"); (*! introduce alignment! *)
  11152. Boolean(moduleSection,FALSE);
  11153. Boolean(moduleSection,FALSE);
  11154. Info(moduleSection, "refcnt*: LONGINT");
  11155. Longint(moduleSection,0);
  11156. Info(moduleSection, "sb*: ADDRESS");
  11157. Address(moduleSection,0);
  11158. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  11159. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11160. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  11161. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  11162. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  11163. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  11164. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  11165. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  11166. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  11167. Symbol(moduleSection,importSection,emptyArraySectionOffset,0);
  11168. Info(moduleSection, "procTable*: ProcTable");
  11169. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  11170. Info(moduleSection, "ptrTable*: PtrTable");
  11171. IF ~implementationVisitor.backend.cooperative THEN
  11172. Symbol(moduleSection,ptrTableSection,ptrTableSectionOffset,0);
  11173. ELSE
  11174. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11175. END;
  11176. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  11177. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11178. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11179. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11180. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  11181. Info(moduleSection, "export*: ExportDesc");
  11182. ExportDesc(moduleSection);
  11183. Info(moduleSection, "term*: TerminationHandler");
  11184. Address(moduleSection,0);
  11185. Info(moduleSection, "exTable*: ExceptionTable");
  11186. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  11187. Info(moduleSection, "noProcs*: LONGINT");
  11188. Longint(moduleSection,numberProcs);
  11189. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END;
  11190. Info(moduleSection, "firstProc*: ADDRESS");
  11191. Address(moduleSection,0);
  11192. Info(moduleSection, "maxPtrs*: LONGINT");
  11193. Longint(moduleSection,maxPointers);
  11194. Info(moduleSection, "crc*: LONGINT");
  11195. Longint(moduleSection, 0); (*! must be implemented *)
  11196. Info(moduleSection, "body*: ADDRESS");
  11197. Symbol(moduleSection, bodyProc, 0,0);
  11198. IF implementationVisitor.backend.cooperative THEN
  11199. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  11200. Info(moduleSection, "monitor.owner");
  11201. Address(moduleSection,0);
  11202. Info(moduleSection, "monitor.nestingLevel");
  11203. Address(moduleSection,0);
  11204. Info(moduleSection, "monitor.blockedQueue");
  11205. Address(moduleSection,0); Address(moduleSection,0);
  11206. Info(moduleSection, "monitor.waitingQueue");
  11207. Address(moduleSection,0); Address(moduleSection,0);
  11208. Info(moduleSection, "monitor.waitingSentinel");
  11209. Address(moduleSection,0);
  11210. END;
  11211. END Module;
  11212. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  11213. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section;
  11214. BEGIN
  11215. Array(source,pc,"");
  11216. Info(source, "pointer offsets array data");
  11217. IF scope IS SyntaxTree.RecordScope THEN
  11218. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  11219. ELSIF scope IS SyntaxTree.CellScope THEN
  11220. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  11221. ELSIF scope IS SyntaxTree.ModuleScope THEN
  11222. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  11223. WHILE variable # NIL DO
  11224. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  11225. symbol := module.allSections.FindBySymbol(variable);
  11226. ASSERT(symbol # NIL);
  11227. Pointers(0,symbol, source,variable.type,numberPointers);
  11228. END;
  11229. variable := variable.nextVariable;
  11230. END;
  11231. END;
  11232. PatchArray(source,pc,numberPointers);
  11233. END PointerArray;
  11234. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  11235. VAR
  11236. name: Basic.SegmentedName;
  11237. section: IntermediateCode.Section;
  11238. BEGIN
  11239. ASSERT(implementationVisitor.newObjectFile);
  11240. Global.GetSymbolSegmentedName(symbol,name);
  11241. Basic.AppendToSegmentedName(name,suffix);
  11242. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11243. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  11244. Info(section, "HeapBlock");
  11245. Address(section,0); (* empty such that GC does not go on traversing *)
  11246. Info(section, suffix);
  11247. Address(section,0);
  11248. pc := section.pc;
  11249. RETURN section;
  11250. END SymbolSection;
  11251. PROCEDURE ReflectVariables(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11252. VAR type: SyntaxTree.Type; variable: SyntaxTree.Variable; pc: LONGINT; section: IntermediateCode.Section;
  11253. BEGIN
  11254. ASSERT(implementationVisitor.newObjectFile);
  11255. IF ~ReflectionSupport OR simple THEN variable := NIL
  11256. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11257. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11258. IF type IS SyntaxTree.PointerType THEN
  11259. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11260. END;
  11261. IF type IS SyntaxTree.RecordType THEN
  11262. variable := type(SyntaxTree.RecordType).recordScope.firstVariable
  11263. ELSIF type IS SyntaxTree.CellType THEN
  11264. variable := type(SyntaxTree.CellType).cellScope.firstVariable;
  11265. END;
  11266. ELSIF symbol IS SyntaxTree.Procedure THEN
  11267. variable := symbol(SyntaxTree.Procedure).procedureScope.firstVariable;
  11268. END;
  11269. Info(in, "variables");
  11270. IF variable # NIL THEN
  11271. section := SymbolSection(symbol, "@Variables",pc);
  11272. VariableArray(section, variable);
  11273. Symbol(in, section, pc, 0);
  11274. ELSE
  11275. Address(in, 0);
  11276. END;
  11277. END ReflectVariables;
  11278. PROCEDURE ReflectProcedures(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11279. VAR type: SyntaxTree.Type; procedure: SyntaxTree.Procedure; pc: LONGINT; section: IntermediateCode.Section;
  11280. BEGIN
  11281. ASSERT(implementationVisitor.newObjectFile);
  11282. IF ~ReflectionSupport OR simple THEN procedure := NIL
  11283. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11284. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11285. IF type IS SyntaxTree.PointerType THEN
  11286. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11287. END;
  11288. IF type IS SyntaxTree.RecordType THEN
  11289. procedure := type(SyntaxTree.RecordType).recordScope.firstProcedure
  11290. ELSIF type IS SyntaxTree.CellType THEN
  11291. procedure := type(SyntaxTree.CellType).cellScope.firstProcedure;
  11292. END;
  11293. ELSIF symbol IS SyntaxTree.Procedure THEN
  11294. procedure := symbol(SyntaxTree.Procedure).procedureScope.firstProcedure;
  11295. END;
  11296. Info(in, "procedures");
  11297. IF procedure # NIL THEN
  11298. section := SymbolSection(symbol, "@Procedures",pc);
  11299. ProcedureArray(section, procedure);
  11300. Symbol(in, section, pc, 0);
  11301. ELSE
  11302. Address(in, 0);
  11303. END;
  11304. END ReflectProcedures;
  11305. PROCEDURE VariableArray(source: IntermediateCode.Section; variable: SyntaxTree.Variable);
  11306. VAR pc, offset: LONGINT; tir: Sections.Section; size: LONGINT;
  11307. segmentedName: Basic.SegmentedName;
  11308. td: SyntaxTree.TypeDeclaration;
  11309. type: SyntaxTree.Type;
  11310. BEGIN
  11311. Array(source,pc,"Modules.FieldEntry");
  11312. Info(source, "FieldArray");
  11313. size :=0;
  11314. WHILE variable # NIL DO
  11315. Info(source,"name");
  11316. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, variable.name, moduleNamePool), 0); (* reference to dynamic name *)
  11317. type := variable.type.resolved;
  11318. Info(source,"offset");
  11319. Size(source, ToMemoryUnits(module.system,variable.offsetInBits));
  11320. Info(source,"type class");
  11321. IF type IS SyntaxTree.PointerType THEN
  11322. Size(source, 1);
  11323. ELSIF type IS SyntaxTree.RecordType THEN
  11324. Size(source, 2);
  11325. ELSIF type IS SyntaxTree.NumberType THEN
  11326. Size(source, 3);
  11327. ELSE
  11328. Size(source, 0);
  11329. END;
  11330. Info(source, "type desc");
  11331. IF type IS SyntaxTree.RecordType THEN
  11332. td := type(SyntaxTree.RecordType).typeDeclaration;
  11333. Global.GetSymbolSegmentedName(td,segmentedName);
  11334. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11335. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11336. ELSE
  11337. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11338. END;
  11339. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11340. Symbol(source, tir, 0, offset);
  11341. ELSE
  11342. Address(source, 0);
  11343. END;
  11344. Info(source,"flags");
  11345. Set(source, {});
  11346. variable := variable.nextVariable;
  11347. INC(size);
  11348. END;
  11349. PatchArray(source,pc,size);
  11350. END VariableArray;
  11351. PROCEDURE ProcedureArray(source: IntermediateCode.Section; procedure: SyntaxTree.Procedure);
  11352. VAR pc: LONGINT; size: LONGINT;
  11353. segmentedName: Basic.SegmentedName;
  11354. BEGIN
  11355. Array(source,pc,"Modules.ProcedureEntry");
  11356. Info(source, "ProcedureArray");
  11357. size :=0;
  11358. WHILE procedure # NIL DO
  11359. Info(source,"name");
  11360. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, procedure.name, moduleNamePool), 0); (* reference to dynamic name *)
  11361. Global.GetSymbolSegmentedName(procedure, segmentedName);
  11362. NamedSymbol(source, segmentedName, procedure, 0 , 0);
  11363. (* size *)
  11364. Size(source, 0);
  11365. (* parameters *)
  11366. Address(source, 0);
  11367. (* variables *)
  11368. ReflectVariables(source, procedure);
  11369. ReflectProcedures(source, procedure);
  11370. (* return type entry *)
  11371. Address(source, 0);
  11372. Address(source, 0);
  11373. procedure := procedure.nextProcedure;
  11374. INC(size);
  11375. END;
  11376. PatchArray(source,pc,size);
  11377. END ProcedureArray;
  11378. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  11379. VAR recordType: SyntaxTree.RecordType;
  11380. tir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  11381. section: Sections.Section; cellType: SyntaxTree.CellType;
  11382. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): Sections.Section;
  11383. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11384. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11385. sectionName: Basic.SectionName;
  11386. CONST MPO=-40000000H;
  11387. BEGIN
  11388. (*
  11389. TypeDesc* = POINTER TO RECORD
  11390. descSize: LONGINT;
  11391. sentinel: LONGINT; (* = MPO-4 *)
  11392. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11393. flags*: SET;
  11394. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11395. name*: Name;
  11396. END;
  11397. *)
  11398. (* source := module.sections.FindByName(...) *)
  11399. Global.GetSymbolSegmentedName(td,name);
  11400. Basic.AppendToSegmentedName(name,"@Info");
  11401. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11402. Info(source, "type info size"); Address(source, 3*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11403. Address(source,MPO-4);
  11404. Info(source, "type tag pointer");
  11405. Symbol( source, tag, offset, 0);
  11406. Info(source, "type flags");
  11407. flags := {};
  11408. IF isProtected THEN INCL(flags,31) END;
  11409. Set( source, flags);
  11410. Info(source, "pointer to module");
  11411. moduleSection := ModuleSection();
  11412. Symbol( source, moduleSection, moduleSection.pc,0);
  11413. Info(source, "type name");
  11414. i := 0;
  11415. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  11416. (*
  11417. Global.GetSymbolSegmentedName(td,name);
  11418. Basic.SegmentedNameToString(name, sectionName);
  11419. *)
  11420. Name(source,sectionName);
  11421. source.SetReferenced(FALSE);
  11422. Global.GetSymbolSegmentedName(td,name);
  11423. Basic.AppendToSegmentedName(name,"@Fields");
  11424. ReflectVariables(source, td);
  11425. ReflectProcedures(source, td);
  11426. (*
  11427. fieldSection := VariableArray(
  11428. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11429. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11430. Info(fieldSection, "HeapBlock");
  11431. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11432. Info(fieldSection, "TypeDescriptor");
  11433. Address(fieldSection,0);
  11434. Info(source, "FieldArray ref");
  11435. Symbol(source, fieldSection, fieldSection.pc, 0);
  11436. FieldArray(fieldSection);
  11437. Global.GetSymbolSegmentedName(td,name);
  11438. Basic.AppendToSegmentedName(name,"@Procedures");
  11439. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11440. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11441. Info(fieldSection, "HeapBlock");
  11442. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11443. Info(fieldSection, "TypeDescriptor");
  11444. Address(fieldSection,0);
  11445. Info(source, "Procedure Array ref");
  11446. Symbol(source, fieldSection, fieldSection.pc, 0);
  11447. ProcedureArray(fieldSection);
  11448. *)
  11449. RETURN source;
  11450. END NewTypeDescriptorInfo;
  11451. PROCEDURE NewTypeDescriptor;
  11452. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  11453. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  11454. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  11455. numberPointers: LONGINT; padding, i: LONGINT;
  11456. CONST MPO=-40000000H;
  11457. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  11458. VAR i: LONGINT;
  11459. PROCEDURE Td(record: SyntaxTree.RecordType);
  11460. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  11461. BEGIN
  11462. IF record # NIL THEN
  11463. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  11464. baseTD := record.typeDeclaration;
  11465. Global.GetSymbolSegmentedName(baseTD,name);
  11466. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11467. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11468. ELSE
  11469. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11470. END;
  11471. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  11472. Symbol(source, tir, 0, offset);
  11473. IF reverse THEN Td(record.GetBaseRecord()) END;
  11474. END;
  11475. END Td;
  11476. BEGIN
  11477. Info(source, "tag table");
  11478. baseRecord := recordType;
  11479. i := 0;
  11480. WHILE baseRecord # NIL DO
  11481. INC(i);
  11482. baseRecord := baseRecord.GetBaseRecord();
  11483. END;
  11484. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  11485. IF ~reverse THEN Td(recordType) END;
  11486. WHILE i < size DO
  11487. Address(source,0);
  11488. INC(i);
  11489. END;
  11490. IF reverse THEN Td(recordType) END;
  11491. END TdTable;
  11492. PROCEDURE MethodTable(reverse: BOOLEAN);
  11493. VAR i,methods: LONGINT;
  11494. BEGIN
  11495. Info(source, "method table");
  11496. IF recordType # NIL THEN
  11497. methods := recordType.recordScope.numberMethods;
  11498. IF reverse THEN
  11499. FOR i := methods-1 TO 0 BY -1 DO
  11500. procedure := recordType.recordScope.FindMethod(i);
  11501. Global.GetSymbolSegmentedName(procedure, name);
  11502. NamedSymbol(source, name,procedure, 0,0);
  11503. END;
  11504. ELSE
  11505. FOR i := 0 TO methods-1 DO
  11506. procedure := recordType.recordScope.FindMethod(i);
  11507. Global.GetSymbolSegmentedName(procedure, name);
  11508. NamedSymbol(source, name,procedure, 0,0);
  11509. END;
  11510. END;
  11511. END;
  11512. END MethodTable;
  11513. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  11514. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  11515. BEGIN
  11516. Info(source, "method table");
  11517. baseRecord := recordType;
  11518. WHILE baseRecord.baseType # NIL DO
  11519. baseRecord := baseRecord.GetBaseRecord ();
  11520. END;
  11521. GetRecordTypeName (baseRecord, name);
  11522. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  11523. IF name = stackFrame THEN
  11524. start := 0;
  11525. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  11526. baseRecord := recordType;
  11527. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  11528. baseRecord := baseRecord.GetBaseRecord ();
  11529. END;
  11530. IF baseRecord # NIL THEN
  11531. GetRecordTypeName (baseRecord, name);
  11532. IF pointer & ~baseRecord.isObject THEN
  11533. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11534. END;
  11535. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  11536. ELSIF recordType.isObject THEN
  11537. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  11538. ELSIF pointer THEN
  11539. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  11540. ELSE
  11541. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  11542. END;
  11543. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11544. Symbol(source, tir, 0, 0);
  11545. start := 0;
  11546. baseRecord := recordType;
  11547. WHILE (baseRecord # NIL) DO
  11548. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  11549. baseRecord := baseRecord.GetBaseRecord ();
  11550. END;
  11551. ELSE
  11552. (* explicit trace method: *)
  11553. procedure := recordType.recordScope.FindMethod(0);
  11554. IF ~procedure.isFinalizer THEN
  11555. Global.GetSymbolSegmentedName(procedure, name);
  11556. NamedSymbol(source, name,procedure, 0,0);
  11557. END;
  11558. start := 1;
  11559. END;
  11560. IF (name # stackFrame) & recordType.isObject THEN
  11561. baseRecord := recordType;
  11562. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  11563. baseRecord := baseRecord.GetBaseRecord ();
  11564. END;
  11565. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  11566. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  11567. ELSE
  11568. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  11569. END;
  11570. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11571. Symbol(source, tir, 0, 0);
  11572. END;
  11573. methods := recordType.recordScope.numberMethods;
  11574. FOR i := start TO methods-1 DO
  11575. procedure := recordType.recordScope.FindMethod(i);
  11576. IF ~procedure.isFinalizer THEN
  11577. Global.GetSymbolSegmentedName(procedure, name);
  11578. NamedSymbol(source, name,procedure, 0,0);
  11579. END;
  11580. END;
  11581. END CooperativeMethodTable;
  11582. BEGIN
  11583. Global.GetSymbolSegmentedName(td,name);
  11584. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  11585. source.SetExported(IsExported(td));
  11586. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  11587. IF implementationVisitor.backend.cooperative THEN
  11588. base := NIL;
  11589. baseRecord := recordType.GetBaseRecord();
  11590. IF baseRecord # NIL THEN
  11591. baseTD := baseRecord.typeDeclaration;
  11592. END;
  11593. IF ~recordType.isObject THEN
  11594. Info(source, "parent");
  11595. IF baseRecord # NIL THEN
  11596. Global.GetSymbolSegmentedName(baseTD,name);
  11597. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11598. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11599. ELSE
  11600. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11601. END;
  11602. Symbol(source, tir, 0, 0);
  11603. ELSE
  11604. Address(source,0);
  11605. END;
  11606. Info(source, "record size");
  11607. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11608. source.SetReferenced(FALSE);
  11609. CooperativeMethodTable(FALSE);
  11610. base := source;
  11611. Global.GetSymbolSegmentedName(td,name);
  11612. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11613. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11614. source.SetExported(IsExported(td));
  11615. source.SetReferenced(FALSE);
  11616. END;
  11617. Info(source, "parent");
  11618. IF baseRecord # NIL THEN
  11619. Global.GetSymbolSegmentedName(baseTD,name);
  11620. sym := baseTD;
  11621. IF ~recordType.isObject THEN
  11622. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11623. sym := NIL;
  11624. END;
  11625. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11626. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11627. ELSE
  11628. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11629. END;
  11630. Symbol(source, tir, 0, 0);
  11631. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  11632. Address(source,0);
  11633. ELSE
  11634. IF recordType.isObject THEN
  11635. Basic.ToSegmentedName ("BaseTypes.Object",name);
  11636. ELSE
  11637. Basic.ToSegmentedName ("BaseTypes.Record",name);
  11638. END;
  11639. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11640. Symbol(source, tir, 0, 0);
  11641. END;
  11642. Info(source, "base record descriptor");
  11643. Symbol(source, base, 0, 0);
  11644. CooperativeMethodTable(TRUE);
  11645. source.SetReferenced(FALSE);
  11646. IF recordType.hasPointers THEN
  11647. IF ~HasExplicitTraceMethod (recordType) THEN
  11648. implementationVisitor.CreateTraceMethod(recordType);
  11649. END;
  11650. implementationVisitor.CreateResetProcedure(recordType);
  11651. implementationVisitor.CreateAssignProcedure(recordType);
  11652. END;
  11653. ELSIF ~simple THEN
  11654. (*
  11655. MethodEnd = MPO
  11656. ---
  11657. methods (# methods)
  11658. ---
  11659. tags (16)
  11660. ---
  11661. TypeDesc = TypeInfoAdr
  11662. ---
  11663. td adr ---> rec size
  11664. ----
  11665. pointer offsets
  11666. ----
  11667. (padding)
  11668. -----
  11669. empty [2 addresses aligned]
  11670. empty
  11671. empty
  11672. numPtrs
  11673. ---
  11674. pointer offsets
  11675. ---
  11676. *)
  11677. Info(source, "MethodEnd = MPO");
  11678. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  11679. source(IntermediateCode.Section).Emit(Data(-1,op));
  11680. MethodTable(TRUE);
  11681. TdTable(TypeTags, TRUE);
  11682. Info(source, "type descriptor info pointer");
  11683. Symbol(source, NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected()),0,0);
  11684. IF (cellType # NIL) THEN
  11685. IF cellType.sizeInBits < 0 THEN
  11686. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  11687. END;
  11688. Info(source, "cell size");
  11689. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  11690. ELSE
  11691. Info(source, "record size");
  11692. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11693. END;
  11694. Info(source, "pointer offsets pointer");
  11695. padding := 1- source.pc MOD 2;
  11696. Symbol(source, source, source.pc+1+padding,0);
  11697. IF padding >0 THEN
  11698. Info(source, "padding");
  11699. FOR i := 1 TO padding DO Address(source,0) END;
  11700. END;
  11701. IF cellType # NIL THEN
  11702. PointerArray(source, cellType.cellScope, numberPointers);
  11703. ELSE
  11704. PointerArray(source, recordType.recordScope, numberPointers);
  11705. END;
  11706. ELSE
  11707. (*
  11708. simple:
  11709. td adr --> size
  11710. tag(1)
  11711. tag(2)
  11712. tag(3)
  11713. methods ->
  11714. *)
  11715. Info(source, "record size");
  11716. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11717. TdTable(TypeTags, FALSE);
  11718. MethodTable(FALSE);
  11719. source.SetReferenced(FALSE);
  11720. END;
  11721. END NewTypeDescriptor;
  11722. BEGIN
  11723. x := x.resolved;
  11724. IF (x IS SyntaxTree.PointerType) THEN
  11725. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  11726. END;
  11727. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  11728. recordType := x(SyntaxTree.RecordType);
  11729. td := x.typeDeclaration;
  11730. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  11731. ASSERT(td # NIL);
  11732. section := module.allSections.FindBySymbol(td); (* TODO *)
  11733. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11734. IF implementationVisitor.newObjectFile THEN
  11735. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11736. NewTypeDescriptor
  11737. END;
  11738. ELSE
  11739. (* data section in intermediate code *)
  11740. Global.GetSymbolSegmentedName(td,name);
  11741. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  11742. Basic.SuffixSegmentedName (name, module.module.name);
  11743. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  11744. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  11745. tir.Emit(Data(-1,op));
  11746. END;
  11747. END;
  11748. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  11749. cellType := x(SyntaxTree.CellType);
  11750. td := x.typeDeclaration;
  11751. section := module.allSections.FindBySymbol(td); (* TODO *)
  11752. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11753. IF implementationVisitor.newObjectFile THEN
  11754. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11755. NewTypeDescriptor
  11756. END;
  11757. END;
  11758. END;
  11759. END
  11760. END CheckTypeDeclaration
  11761. END MetaDataGenerator;
  11762. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  11763. VAR
  11764. trace-: BOOLEAN;
  11765. traceString-: SyntaxTree.IdentifierString;
  11766. traceModuleName-: SyntaxTree.IdentifierString;
  11767. newObjectFile-: BOOLEAN;
  11768. profile-: BOOLEAN;
  11769. noRuntimeChecks: BOOLEAN;
  11770. simpleMetaData-: BOOLEAN;
  11771. noAsserts: BOOLEAN;
  11772. optimize-: BOOLEAN;
  11773. cooperative-: BOOLEAN;
  11774. preregisterStatic-: BOOLEAN;
  11775. dump-: Basic.Writer;
  11776. cellsAreObjects: BOOLEAN;
  11777. PROCEDURE &InitIntermediateBackend*;
  11778. BEGIN
  11779. simpleMetaData := FALSE;
  11780. newObjectFile := FALSE;
  11781. InitBackend;
  11782. SetRuntimeModuleName(DefaultRuntimeModuleName);
  11783. SetTraceModuleName(DefaultTraceModuleName);
  11784. END InitIntermediateBackend;
  11785. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  11786. VAR
  11787. declarationVisitor: DeclarationVisitor;
  11788. implementationVisitor: ImplementationVisitor;
  11789. module: Sections.Module;
  11790. name, platformName: SyntaxTree.IdentifierString;
  11791. meta: MetaDataGenerator;
  11792. BEGIN
  11793. ResetError;
  11794. Global.GetSymbolName(x,name);
  11795. NEW(module,x,system); (* backend structures *)
  11796. Global.GetModuleName(x, name);
  11797. module.SetModuleName(name);
  11798. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  11799. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  11800. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  11801. declarationVisitor.Module(x,module);
  11802. IF newObjectFile & ~meta.simple THEN
  11803. meta.Module(implementationVisitor.moduleBodySection);
  11804. END;
  11805. GetDescription(platformName);
  11806. module.SetPlatformName(platformName);
  11807. RETURN module
  11808. END GenerateIntermediate;
  11809. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  11810. BEGIN RETURN TRUE
  11811. END SupportedImmediate;
  11812. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  11813. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  11814. END ProcessSyntaxTreeModule;
  11815. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  11816. VAR
  11817. result: Sections.Module;
  11818. traceName: Basic.MessageString;
  11819. BEGIN
  11820. ASSERT(intermediateCodeModule IS Sections.Module);
  11821. result := intermediateCodeModule(Sections.Module);
  11822. IF trace THEN
  11823. traceName := "intermediate code trace: ";
  11824. Strings.Append(traceName,traceString);
  11825. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  11826. IF (traceString="") OR (traceString="*") THEN
  11827. result.Dump(dump);
  11828. dump.Update
  11829. ELSE
  11830. Sections.DumpFiltered(dump, result, traceString);
  11831. END
  11832. END;
  11833. RETURN result
  11834. END ProcessIntermediateCodeModule;
  11835. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  11836. BEGIN instructionSet := "Intermediate";
  11837. END GetDescription;
  11838. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  11839. BEGIN
  11840. SELF.newObjectFile := newObjectFile;
  11841. SELF.simpleMetaData := simpleMetaData;
  11842. END SetNewObjectFile;
  11843. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  11844. BEGIN COPY(name, traceModuleName)
  11845. END SetTraceModuleName;
  11846. PROCEDURE DefineOptions(options: Options.Options);
  11847. BEGIN
  11848. DefineOptions^(options);
  11849. options.Add(0X,"trace",Options.String);
  11850. options.Add(0X,"runtime",Options.String);
  11851. options.Add(0X,"newObjectFile",Options.Flag);
  11852. options.Add(0X,"traceModule",Options.String);
  11853. options.Add(0X,"profile",Options.Flag);
  11854. options.Add(0X,"noRuntimeChecks",Options.Flag);
  11855. options.Add(0X,"noAsserts",Options.Flag);
  11856. options.Add(0X,"metaData",Options.String);
  11857. options.Add('o',"optimize", Options.Flag);
  11858. options.Add(0X,"preregisterStatic", Options.Flag);
  11859. options.Add(0X,"cellsAreObjects", Options.Flag);
  11860. END DefineOptions;
  11861. PROCEDURE GetOptions(options: Options.Options);
  11862. VAR name,string: SyntaxTree.IdentifierString;
  11863. BEGIN
  11864. GetOptions^(options);
  11865. trace := options.GetString("trace",traceString);
  11866. profile := options.GetFlag("profile");
  11867. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  11868. noAsserts := options.GetFlag("noAsserts");
  11869. cooperative := options.GetFlag("cooperative");
  11870. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  11871. IF cooperative THEN
  11872. SetRuntimeModuleName("CPU") END
  11873. END;
  11874. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  11875. simpleMetaData := TRUE
  11876. END;
  11877. IF options.GetString("metaData",string) THEN
  11878. IF string = "simple" THEN simpleMetaData := TRUE
  11879. ELSIF string ="full" THEN simpleMetaData := FALSE
  11880. END;
  11881. END;
  11882. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  11883. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  11884. optimize := options.GetFlag("optimize");
  11885. preregisterStatic := options.GetFlag("preregisterStatic");
  11886. cellsAreObjects := options.GetFlag("cellsAreObjects");
  11887. END GetOptions;
  11888. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  11889. BEGIN RETURN SymbolFileFormat.Get()
  11890. END DefaultSymbolFileFormat;
  11891. END IntermediateBackend;
  11892. (* ----------------------------------- register allocation ------------------------------------- *)
  11893. (* register mapping scheme
  11894. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  11895. spill offset
  11896. part(n) --> ticket <--> physical register
  11897. spill offset
  11898. *)
  11899. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  11900. emptyOperand: IntermediateCode.Operand;
  11901. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  11902. statCoopResetVariables: LONGINT;
  11903. statCoopModifyAssignments: LONGINT;
  11904. modifyAssignmentsPC : LONGINT;
  11905. statCoopNilCheck: LONGINT;
  11906. statCoopSwitch: LONGINT;
  11907. statCoopAssignProcedure: LONGINT;
  11908. statCoopTraceMethod: LONGINT;
  11909. statCoopResetProcedure: LONGINT;
  11910. statCoopTraceModule: LONGINT;
  11911. PROCEDURE ResetStatistics*;
  11912. BEGIN
  11913. statCoopResetVariables := 0;
  11914. statCoopModifyAssignments := 0;
  11915. statCoopNilCheck:= 0;
  11916. statCoopSwitch:= 0;
  11917. statCoopAssignProcedure:= 0;
  11918. statCoopTraceMethod:= 0;
  11919. statCoopResetProcedure:= 0;
  11920. statCoopTraceModule:= 0;
  11921. END ResetStatistics;
  11922. PROCEDURE Statistics*;
  11923. BEGIN
  11924. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  11925. TRACE(statCoopNilCheck, statCoopSwitch);
  11926. TRACE(statCoopAssignProcedure,
  11927. statCoopTraceMethod,
  11928. statCoopResetProcedure,
  11929. statCoopTraceModule)
  11930. END Statistics;
  11931. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  11932. VAR h: LONGINT;
  11933. BEGIN
  11934. WHILE b # 0 DO
  11935. h := a MOD b;
  11936. a := b;
  11937. b := h;
  11938. END;
  11939. RETURN a
  11940. END GCD;
  11941. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  11942. BEGIN
  11943. RETURN a*b DIV GCD(a,b)
  11944. END SCM;
  11945. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  11946. BEGIN
  11947. (*TRACE(a,b);*)
  11948. IF a = 0 THEN RETURN b
  11949. ELSIF b = 0 THEN RETURN a
  11950. ELSE RETURN SCM(a,b)
  11951. END;
  11952. END CommonAlignment;
  11953. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  11954. BEGIN
  11955. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  11956. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11957. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  11958. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  11959. 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)
  11960. END
  11961. END PassBySingleReference;
  11962. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  11963. BEGIN
  11964. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  11965. END PassInRegister;
  11966. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  11967. VAR new: RegisterEntry;
  11968. BEGIN
  11969. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  11970. IF queue = NIL THEN
  11971. queue := new
  11972. ELSE
  11973. new.next := queue;
  11974. IF queue#NIL THEN queue.prev := new END;
  11975. queue := new
  11976. END;
  11977. END AddRegisterEntry;
  11978. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  11979. VAR this: RegisterEntry;
  11980. BEGIN
  11981. this := queue;
  11982. WHILE (this # NIL) & (this.register # register) DO
  11983. this := this.next;
  11984. END;
  11985. IF this = NIL THEN
  11986. RETURN FALSE
  11987. END;
  11988. ASSERT(this # NIL);
  11989. IF this = queue THEN queue := queue.next END;
  11990. IF this.prev # NIL THEN this.prev.next := this.next END;
  11991. IF this.next # NIL THEN this.next.prev := this.prev END;
  11992. RETURN TRUE
  11993. END RemoveRegisterEntry;
  11994. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  11995. BEGIN ASSERT(cond);
  11996. END Assert;
  11997. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  11998. BEGIN
  11999. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12000. END ReusableRegister;
  12001. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12002. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12003. BEGIN
  12004. procedure := moduleScope.bodyProcedure;
  12005. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12006. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12007. procedure := SyntaxTree.NewProcedure(-1,Global.ModuleBodyName, procedureScope);
  12008. procedure.SetScope(moduleScope);
  12009. procedure.SetType(SyntaxTree.NewProcedureType(-1,moduleScope));
  12010. procedure.SetAccess(SyntaxTree.Hidden);
  12011. moduleScope.SetBodyProcedure(procedure);
  12012. moduleScope.AddProcedure(procedure);
  12013. procedureScope.SetBody(SyntaxTree.NewBody(-1,procedureScope)); (* empty body *)
  12014. END;
  12015. END EnsureBodyProcedure;
  12016. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12017. VAR import: SyntaxTree.Import;
  12018. selfName: SyntaxTree.IdentifierString;
  12019. module: SyntaxTree.Module;
  12020. BEGIN
  12021. scope.ownerModule.GetName(selfName);
  12022. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12023. module := scope.ownerModule
  12024. ELSE
  12025. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12026. IF import = NIL THEN
  12027. RETURN NIL
  12028. ELSIF import.module = NIL THEN
  12029. RETURN NIL
  12030. ELSE module := import.module
  12031. END;
  12032. END;
  12033. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12034. END GetSymbol;
  12035. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12036. BEGIN
  12037. op.mode := mode;
  12038. IntermediateCode.InitOperand(op.op);
  12039. IntermediateCode.InitOperand(op.tag);
  12040. IntermediateCode.InitOperand(op.extra);
  12041. op.dimOffset := 0;
  12042. END InitOperand;
  12043. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12044. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12045. BEGIN RETURN IntermediateCode.GetType(system, type)
  12046. END GetType;
  12047. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12048. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12049. BEGIN
  12050. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12051. (*
  12052. UniqueId(name,module,name,adr);
  12053. *)
  12054. constant := SyntaxTree.NewConstant(-1,SyntaxTree.NewIdentifier(name));
  12055. constant.SetValue(value);
  12056. constant.SetAccess(SyntaxTree.Hidden);
  12057. module.moduleScope.AddConstant(constant);
  12058. constant.SetScope(module.moduleScope);
  12059. RETURN constant
  12060. END BuildConstant;
  12061. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12062. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12063. BEGIN
  12064. variable := scope.firstVariable;
  12065. WHILE variable # NIL DO
  12066. IF variable.NeedsTrace() THEN
  12067. RETURN TRUE;
  12068. END;
  12069. variable := variable.nextVariable;
  12070. END;
  12071. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12072. WHILE parameter # NIL DO
  12073. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12074. RETURN TRUE;
  12075. END;
  12076. parameter := parameter.nextParameter;
  12077. END;
  12078. RETURN FALSE;
  12079. END HasPointers;
  12080. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12081. BEGIN RETURN (parameter.kind = SyntaxTree.VarParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ((parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType));
  12082. END IsVariableParameter;
  12083. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12084. VAR parameter: SyntaxTree.Parameter;
  12085. BEGIN
  12086. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12087. WHILE parameter # NIL DO
  12088. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12089. IF parameter.movable THEN RETURN TRUE END;
  12090. parameter := parameter.nextParameter;
  12091. END;
  12092. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12093. END HasVariableParameters;
  12094. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12095. BEGIN
  12096. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12097. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12098. END HasExplicitTraceMethod;
  12099. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12100. BEGIN
  12101. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12102. IF (expression IS SyntaxTree.IntegerValue) THEN
  12103. val := expression(SyntaxTree.IntegerValue).value;
  12104. RETURN TRUE
  12105. ELSE
  12106. RETURN FALSE
  12107. END;
  12108. END IsIntegerConstant;
  12109. PROCEDURE PowerOf2(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12110. BEGIN
  12111. IF val <= 0 THEN RETURN FALSE END;
  12112. exp := 0;
  12113. WHILE ~ODD(val) DO
  12114. val := val DIV 2;
  12115. INC(exp)
  12116. END;
  12117. RETURN val = 1
  12118. END PowerOf2;
  12119. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12120. VAR procedure: SyntaxTree.Procedure;
  12121. BEGIN
  12122. procedure := record.recordScope.constructor;
  12123. IF procedure = NIL THEN
  12124. record := record.GetBaseRecord();
  12125. IF record # NIL THEN
  12126. procedure := GetConstructor(record)
  12127. END;
  12128. END;
  12129. RETURN procedure;
  12130. END GetConstructor;
  12131. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12132. BEGIN
  12133. value := SHORT(op.intValue);
  12134. RETURN op.mode = IntermediateCode.ModeImmediate;
  12135. END IsIntegerImmediate;
  12136. (** whether a type strictily is a pointer to record or object type
  12137. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12138. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12139. BEGIN
  12140. IF type = NIL THEN
  12141. RETURN FALSE
  12142. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  12143. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  12144. ELSE
  12145. RETURN FALSE
  12146. END
  12147. END IsStrictlyPointerToRecord;
  12148. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  12149. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  12150. END IsUnsafePointer;
  12151. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  12152. BEGIN type := type.resolved;
  12153. IF type IS SyntaxTree.PointerType THEN
  12154. type := type(SyntaxTree.PointerType).pointerBase;
  12155. type := type.resolved;
  12156. IF type IS SyntaxTree.RecordType THEN
  12157. recordType := type(SyntaxTree.RecordType);
  12158. RETURN TRUE
  12159. ELSE
  12160. RETURN FALSE
  12161. END
  12162. ELSIF type IS SyntaxTree.RecordType THEN
  12163. recordType := type(SyntaxTree.RecordType);
  12164. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  12165. ELSIF type IS SyntaxTree.ObjectType THEN
  12166. RETURN TRUE
  12167. ELSIF type IS SyntaxTree.AnyType THEN
  12168. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  12169. ELSE
  12170. RETURN FALSE
  12171. END;
  12172. END IsPointerToRecord;
  12173. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  12174. BEGIN
  12175. type := type.resolved;
  12176. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  12177. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  12178. END IsArrayOfSystemByte;
  12179. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  12180. BEGIN
  12181. IF type = NIL THEN RETURN FALSE END;
  12182. type := type.resolved;
  12183. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  12184. END IsOpenArray;
  12185. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  12186. BEGIN
  12187. IF type = NIL THEN RETURN FALSE END;
  12188. type := type.resolved;
  12189. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  12190. END IsSemiDynamicArray;
  12191. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  12192. BEGIN
  12193. IF type = NIL THEN RETURN FALSE END;
  12194. type := type.resolved;
  12195. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  12196. END IsStaticArray;
  12197. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12198. VAR size: LONGINT;
  12199. BEGIN
  12200. size := 1;
  12201. WHILE (IsStaticArray(type)) DO
  12202. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  12203. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12204. END;
  12205. RETURN size;
  12206. END StaticArrayNumElements;
  12207. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12208. BEGIN
  12209. WHILE (IsStaticArray(type)) DO
  12210. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12211. END;
  12212. RETURN type;
  12213. END StaticArrayBaseType;
  12214. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12215. BEGIN
  12216. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  12217. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12218. END;
  12219. RETURN type;
  12220. END ArrayBaseType;
  12221. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  12222. BEGIN
  12223. IF type = NIL THEN RETURN FALSE END;
  12224. type := type.resolved;
  12225. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  12226. END IsDelegate;
  12227. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  12228. VAR i: LONGINT;
  12229. BEGIN
  12230. i := 0; type := type.resolved;
  12231. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12232. INC(i);
  12233. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  12234. END;
  12235. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12236. INC(i);
  12237. type := type(SyntaxTree.MathArrayType).arrayBase;
  12238. IF type # NIL THEN type := type.resolved END;
  12239. END;
  12240. RETURN i
  12241. END DynamicDim;
  12242. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  12243. BEGIN
  12244. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12245. type := type(SyntaxTree.ArrayType).arrayBase;
  12246. END;
  12247. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12248. type := type(SyntaxTree.MathArrayType).arrayBase;
  12249. END;
  12250. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  12251. END StaticSize;
  12252. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  12253. BEGIN
  12254. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  12255. END IsImmediate;
  12256. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  12257. BEGIN
  12258. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  12259. END IsAddress;
  12260. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  12261. BEGIN
  12262. RETURN (x.mode = IntermediateCode.ModeRegister);
  12263. END IsRegister;
  12264. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  12265. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  12266. BEGIN
  12267. typeDeclaration := recordType.typeDeclaration;
  12268. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12269. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12270. END GetRecordTypeName;
  12271. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  12272. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  12273. BEGIN
  12274. parSize := 0;
  12275. IF StructuredReturnType(procedureType) THEN
  12276. parameter := procedureType.returnParameter;
  12277. INC(parSize,system.SizeOfParameter(parameter));
  12278. parSize := parSize + (-parSize) MOD system.addressSize;
  12279. END;
  12280. parameter :=procedureType.lastParameter;
  12281. WHILE (parameter # NIL) DO
  12282. INC(parSize,system.SizeOfParameter(parameter));
  12283. parSize := parSize + (-parSize) MOD system.addressSize;
  12284. parameter := parameter.prevParameter;
  12285. END;
  12286. IF procedureType.isDelegate THEN INC(parSize,system.addressSize) END; (* method => self pointer *)
  12287. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  12288. RETURN ToMemoryUnits(system,parSize)
  12289. END ParametersSize;
  12290. PROCEDURE ReturnedAsParameter(type: SyntaxTree.Type): BOOLEAN;
  12291. BEGIN
  12292. IF type = NIL THEN RETURN FALSE
  12293. ELSE
  12294. type := type.resolved;
  12295. RETURN (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR (type IS SyntaxTree.ProcedureType) OR SemanticChecker.IsPointerType(type)
  12296. OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.MathArrayType);
  12297. END
  12298. END ReturnedAsParameter;
  12299. PROCEDURE StructuredReturnType(procedureType: SyntaxTree.ProcedureType): BOOLEAN;
  12300. BEGIN
  12301. RETURN (procedureType # NIL) & (procedureType.callingConvention=SyntaxTree.OberonCallingConvention) & ReturnedAsParameter(procedureType.returnType);
  12302. END StructuredReturnType;
  12303. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  12304. BEGIN
  12305. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  12306. END IsNested;
  12307. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  12308. BEGIN
  12309. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  12310. scope := scope.outerScope;
  12311. END;
  12312. RETURN scope # NIL;
  12313. END InCellScope;
  12314. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  12315. BEGIN
  12316. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  12317. RETURN 0
  12318. ELSE
  12319. *)
  12320. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  12321. (*END;*)
  12322. END ProcedureParametersSize;
  12323. PROCEDURE ToMemoryUnits*(system: Global.System; size: LONGINT): LONGINT;
  12324. VAR dataUnit: LONGINT;
  12325. BEGIN dataUnit := system.dataUnit;
  12326. ASSERT(size MOD system.dataUnit = 0);
  12327. RETURN size DIV system.dataUnit
  12328. END ToMemoryUnits;
  12329. PROCEDURE Get*(): Backend.Backend;
  12330. VAR backend: IntermediateBackend;
  12331. BEGIN NEW(backend); RETURN backend
  12332. END Get;
  12333. PROCEDURE Nop(position: LONGINT):IntermediateCode.Instruction;
  12334. VAR instruction: IntermediateCode.Instruction;
  12335. BEGIN
  12336. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  12337. RETURN instruction
  12338. END Nop;
  12339. PROCEDURE Mov(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12340. VAR instruction: IntermediateCode.Instruction;
  12341. BEGIN
  12342. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  12343. RETURN instruction
  12344. END Mov;
  12345. (* like Mov but ensures that no new register will be allocated for dest *)
  12346. PROCEDURE MovReplace(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12347. VAR instruction: IntermediateCode.Instruction;
  12348. BEGIN
  12349. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  12350. RETURN instruction
  12351. END MovReplace;
  12352. PROCEDURE Conv(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12353. VAR instruction: IntermediateCode.Instruction;
  12354. BEGIN
  12355. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  12356. RETURN instruction
  12357. END Conv;
  12358. PROCEDURE SysvABI( cc: LONGINT ): BOOLEAN;
  12359. BEGIN
  12360. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention})
  12361. END SysvABI;
  12362. PROCEDURE SysvABIorWINAPI( cc: LONGINT ): BOOLEAN;
  12363. BEGIN
  12364. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention, SyntaxTree.WinAPICallingConvention})
  12365. END SysvABIorWINAPI;
  12366. PROCEDURE Call*(position: LONGINT;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  12367. VAR instruction: IntermediateCode.Instruction;
  12368. BEGIN
  12369. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  12370. RETURN instruction
  12371. END Call;
  12372. PROCEDURE Exit(position: LONGINT;pcOffset: LONGINT; callingConvention: LONGINT): IntermediateCode.Instruction;
  12373. VAR op1, op2: IntermediateCode.Operand;
  12374. VAR instruction: IntermediateCode.Instruction;
  12375. BEGIN
  12376. IntermediateCode.InitNumber(op1,pcOffset);
  12377. IntermediateCode.InitNumber(op2,callingConvention);
  12378. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,emptyOperand);
  12379. RETURN instruction
  12380. END Exit;
  12381. PROCEDURE Return(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12382. VAR instruction: IntermediateCode.Instruction;
  12383. BEGIN
  12384. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  12385. RETURN instruction
  12386. END Return;
  12387. PROCEDURE Result*(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12388. VAR instruction: IntermediateCode.Instruction;
  12389. BEGIN
  12390. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  12391. RETURN instruction
  12392. END Result;
  12393. PROCEDURE Trap(position: LONGINT;nr: LONGINT): IntermediateCode.Instruction;
  12394. VAR op1: IntermediateCode.Operand;
  12395. VAR instruction: IntermediateCode.Instruction;
  12396. BEGIN
  12397. IntermediateCode.InitNumber(op1,nr);
  12398. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  12399. RETURN instruction
  12400. END Trap;
  12401. PROCEDURE Br(position: LONGINT;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  12402. VAR instruction: IntermediateCode.Instruction;
  12403. BEGIN
  12404. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  12405. RETURN instruction
  12406. END Br;
  12407. PROCEDURE Breq(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12408. VAR instruction: IntermediateCode.Instruction;
  12409. BEGIN
  12410. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  12411. RETURN instruction
  12412. END Breq;
  12413. PROCEDURE Brne(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12414. VAR instruction: IntermediateCode.Instruction;
  12415. BEGIN
  12416. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  12417. RETURN instruction
  12418. END Brne;
  12419. PROCEDURE Brge(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12420. VAR instruction: IntermediateCode.Instruction;
  12421. BEGIN
  12422. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  12423. RETURN instruction
  12424. END Brge;
  12425. PROCEDURE Brlt(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12426. VAR instruction: IntermediateCode.Instruction;
  12427. BEGIN
  12428. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  12429. RETURN instruction
  12430. END Brlt;
  12431. PROCEDURE Pop*(position: LONGINT;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  12432. VAR instruction: IntermediateCode.Instruction;
  12433. BEGIN
  12434. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  12435. RETURN instruction
  12436. END Pop;
  12437. PROCEDURE Push*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12438. VAR instruction: IntermediateCode.Instruction;
  12439. BEGIN
  12440. ASSERT(op.mode # IntermediateCode.Undefined);
  12441. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  12442. RETURN instruction
  12443. END Push;
  12444. PROCEDURE Neg(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12445. VAR instruction: IntermediateCode.Instruction;
  12446. BEGIN
  12447. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  12448. RETURN instruction
  12449. END Neg;
  12450. PROCEDURE Not(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12451. VAR instruction: IntermediateCode.Instruction;
  12452. BEGIN
  12453. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  12454. RETURN instruction
  12455. END Not;
  12456. PROCEDURE Abs(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12457. VAR instruction: IntermediateCode.Instruction;
  12458. BEGIN
  12459. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  12460. RETURN instruction
  12461. END Abs;
  12462. PROCEDURE Mul(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12463. VAR instruction: IntermediateCode.Instruction;
  12464. BEGIN
  12465. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  12466. RETURN instruction
  12467. END Mul;
  12468. PROCEDURE Div(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12469. VAR instruction: IntermediateCode.Instruction;
  12470. BEGIN
  12471. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  12472. RETURN instruction
  12473. END Div;
  12474. PROCEDURE Mod(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12475. VAR instruction: IntermediateCode.Instruction;
  12476. BEGIN
  12477. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  12478. RETURN instruction
  12479. END Mod;
  12480. PROCEDURE Sub(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12481. VAR instruction: IntermediateCode.Instruction;
  12482. BEGIN
  12483. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  12484. RETURN instruction
  12485. END Sub;
  12486. PROCEDURE Add(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12487. VAR instruction: IntermediateCode.Instruction;
  12488. BEGIN
  12489. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  12490. RETURN instruction
  12491. END Add;
  12492. PROCEDURE And(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12493. VAR instruction: IntermediateCode.Instruction;
  12494. BEGIN
  12495. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  12496. RETURN instruction
  12497. END And;
  12498. PROCEDURE Or(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12499. VAR instruction: IntermediateCode.Instruction;
  12500. BEGIN
  12501. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  12502. RETURN instruction
  12503. END Or;
  12504. PROCEDURE Xor(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12505. VAR instruction: IntermediateCode.Instruction;
  12506. BEGIN
  12507. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  12508. RETURN instruction
  12509. END Xor;
  12510. PROCEDURE Shl(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12511. VAR instruction: IntermediateCode.Instruction;
  12512. BEGIN
  12513. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  12514. RETURN instruction
  12515. END Shl;
  12516. PROCEDURE Shr(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12517. VAR instruction: IntermediateCode.Instruction;
  12518. BEGIN
  12519. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  12520. RETURN instruction
  12521. END Shr;
  12522. PROCEDURE Rol(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12523. VAR instruction: IntermediateCode.Instruction;
  12524. BEGIN
  12525. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  12526. RETURN instruction
  12527. END Rol;
  12528. PROCEDURE Ror(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12529. VAR instruction: IntermediateCode.Instruction;
  12530. BEGIN
  12531. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  12532. RETURN instruction
  12533. END Ror;
  12534. PROCEDURE Cas(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12535. VAR instruction: IntermediateCode.Instruction;
  12536. BEGIN
  12537. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  12538. RETURN instruction
  12539. END Cas;
  12540. PROCEDURE Copy(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12541. VAR instruction: IntermediateCode.Instruction;
  12542. BEGIN
  12543. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  12544. RETURN instruction
  12545. END Copy;
  12546. PROCEDURE Fill(position: LONGINT;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  12547. VAR instruction: IntermediateCode.Instruction;
  12548. BEGIN
  12549. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  12550. RETURN instruction
  12551. END Fill;
  12552. PROCEDURE Asm(position: LONGINT;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  12553. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  12554. BEGIN
  12555. string := IntermediateCode.String(s);
  12556. IntermediateCode.SetIntValue(string,position); (* for error reporting *)
  12557. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  12558. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  12559. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  12560. RETURN instruction
  12561. END Asm;
  12562. PROCEDURE Data*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12563. VAR instruction: IntermediateCode.Instruction;
  12564. BEGIN
  12565. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  12566. RETURN instruction
  12567. END Data;
  12568. PROCEDURE SpecialInstruction(position: LONGINT;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  12569. VAR instruction: IntermediateCode.Instruction;
  12570. BEGIN
  12571. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  12572. IntermediateCode.SetSubType(instruction, subtype);
  12573. RETURN instruction
  12574. END SpecialInstruction;
  12575. PROCEDURE Reserve(position: LONGINT;units: LONGINT): IntermediateCode.Instruction;
  12576. VAR op1: IntermediateCode.Operand;
  12577. VAR instruction: IntermediateCode.Instruction;
  12578. BEGIN
  12579. (*! generate a warning if size exceeds a certain limit *)
  12580. (*
  12581. ASSERT(bytes < 1000000); (* sanity check *)
  12582. *)
  12583. ASSERT(0 <= units); (* sanity check *)
  12584. IntermediateCode.InitNumber(op1,units);
  12585. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  12586. RETURN instruction
  12587. END Reserve;
  12588. PROCEDURE LabelInstruction(position: LONGINT): IntermediateCode.Instruction;
  12589. VAR op1: IntermediateCode.Operand;
  12590. VAR instruction: IntermediateCode.Instruction;
  12591. BEGIN
  12592. IntermediateCode.InitNumber(op1,position);
  12593. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  12594. RETURN instruction
  12595. END LabelInstruction;
  12596. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  12597. VAR pc: LONGINT;
  12598. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  12599. BEGIN
  12600. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  12601. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  12602. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  12603. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  12604. IF instr.op1.type.form = IntermediateCode.Float THEN
  12605. RETURN instr.op1.floatValue = op.floatValue
  12606. ELSE
  12607. RETURN instr.op1.intValue = op.intValue
  12608. END;
  12609. END ProvidesValue;
  12610. BEGIN
  12611. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  12612. pc := 0;
  12613. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  12614. INC(pc);
  12615. END;
  12616. IF pc = data.pc THEN
  12617. data.Emit(Data(-1,vop));
  12618. END;
  12619. RETURN pc
  12620. END EnterImmediate;
  12621. PROCEDURE Init;
  12622. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  12623. BEGIN
  12624. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  12625. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  12626. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  12627. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  12628. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  12629. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  12630. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  12631. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  12632. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  12633. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  12634. IntermediateCode.InitOperand(emptyOperand);
  12635. FOR i := 0 TO NumberSystemCalls-1 DO
  12636. name := "@SystemCall";
  12637. Basic.AppendNumber(name,i);
  12638. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  12639. END;
  12640. END Init;
  12641. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  12642. BEGIN
  12643. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  12644. END IsExported;
  12645. BEGIN
  12646. Init;
  12647. END FoxIntermediateBackend.
  12648. Compiler.Compile FoxIntermediateBackend.Mod ~