FoxIntermediateBackend.Mod 543 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200620162026203620462056206620762086209621062116212621362146215621662176218621962206221622262236224622562266227622862296230623162326233623462356236623762386239624062416242624362446245624662476248624962506251625262536254625562566257625862596260626162626263626462656266626762686269627062716272627362746275627662776278627962806281628262836284628562866287628862896290629162926293629462956296629762986299630063016302630363046305630663076308630963106311631263136314631563166317631863196320632163226323632463256326632763286329633063316332633363346335633663376338633963406341634263436344634563466347634863496350635163526353635463556356635763586359636063616362636363646365636663676368636963706371637263736374637563766377637863796380638163826383638463856386638763886389639063916392639363946395639663976398639964006401640264036404640564066407640864096410641164126413641464156416641764186419642064216422642364246425642664276428642964306431643264336434643564366437643864396440644164426443644464456446644764486449645064516452645364546455645664576458645964606461646264636464646564666467646864696470647164726473647464756476647764786479648064816482648364846485648664876488648964906491649264936494649564966497649864996500650165026503650465056506650765086509651065116512651365146515651665176518651965206521652265236524652565266527652865296530653165326533653465356536653765386539654065416542654365446545654665476548654965506551655265536554655565566557655865596560656165626563656465656566656765686569657065716572657365746575657665776578657965806581658265836584658565866587658865896590659165926593659465956596659765986599660066016602660366046605660666076608660966106611661266136614661566166617661866196620662166226623662466256626662766286629663066316632663366346635663666376638663966406641664266436644664566466647664866496650665166526653665466556656665766586659666066616662666366646665666666676668666966706671667266736674667566766677667866796680668166826683668466856686668766886689669066916692669366946695669666976698669967006701670267036704670567066707670867096710671167126713671467156716671767186719672067216722672367246725672667276728672967306731673267336734673567366737673867396740674167426743674467456746674767486749675067516752675367546755675667576758675967606761676267636764676567666767676867696770677167726773677467756776677767786779678067816782678367846785678667876788678967906791679267936794679567966797679867996800680168026803680468056806680768086809681068116812681368146815681668176818681968206821682268236824682568266827682868296830683168326833683468356836683768386839684068416842684368446845684668476848684968506851685268536854685568566857685868596860686168626863686468656866686768686869687068716872687368746875687668776878687968806881688268836884688568866887688868896890689168926893689468956896689768986899690069016902690369046905690669076908690969106911691269136914691569166917691869196920692169226923692469256926692769286929693069316932693369346935693669376938693969406941694269436944694569466947694869496950695169526953695469556956695769586959696069616962696369646965696669676968696969706971697269736974697569766977697869796980698169826983698469856986698769886989699069916992699369946995699669976998699970007001700270037004700570067007700870097010701170127013701470157016701770187019702070217022702370247025702670277028702970307031703270337034703570367037703870397040704170427043704470457046704770487049705070517052705370547055705670577058705970607061706270637064706570667067706870697070707170727073707470757076707770787079708070817082708370847085708670877088708970907091709270937094709570967097709870997100710171027103710471057106710771087109711071117112711371147115711671177118711971207121712271237124712571267127712871297130713171327133713471357136713771387139714071417142714371447145714671477148714971507151715271537154715571567157715871597160716171627163716471657166716771687169717071717172717371747175717671777178717971807181718271837184718571867187718871897190719171927193719471957196719771987199720072017202720372047205720672077208720972107211721272137214721572167217721872197220722172227223722472257226722772287229723072317232723372347235723672377238723972407241724272437244724572467247724872497250725172527253725472557256725772587259726072617262726372647265726672677268726972707271727272737274727572767277727872797280728172827283728472857286728772887289729072917292729372947295729672977298729973007301730273037304730573067307730873097310731173127313731473157316731773187319732073217322732373247325732673277328732973307331733273337334733573367337733873397340734173427343734473457346734773487349735073517352735373547355735673577358735973607361736273637364736573667367736873697370737173727373737473757376737773787379738073817382738373847385738673877388738973907391739273937394739573967397739873997400740174027403740474057406740774087409741074117412741374147415741674177418741974207421742274237424742574267427742874297430743174327433743474357436743774387439744074417442744374447445744674477448744974507451745274537454745574567457745874597460746174627463746474657466746774687469747074717472747374747475747674777478747974807481748274837484748574867487748874897490749174927493749474957496749774987499750075017502750375047505750675077508750975107511751275137514751575167517751875197520752175227523752475257526752775287529753075317532753375347535753675377538753975407541754275437544754575467547754875497550755175527553755475557556755775587559756075617562756375647565756675677568756975707571757275737574757575767577757875797580758175827583758475857586758775887589759075917592759375947595759675977598759976007601760276037604760576067607760876097610761176127613761476157616761776187619762076217622762376247625762676277628762976307631763276337634763576367637763876397640764176427643764476457646764776487649765076517652765376547655765676577658765976607661766276637664766576667667766876697670767176727673767476757676767776787679768076817682768376847685768676877688768976907691769276937694769576967697769876997700770177027703770477057706770777087709771077117712771377147715771677177718771977207721772277237724772577267727772877297730773177327733773477357736773777387739774077417742774377447745774677477748774977507751775277537754775577567757775877597760776177627763776477657766776777687769777077717772777377747775777677777778777977807781778277837784778577867787778877897790779177927793779477957796779777987799780078017802780378047805780678077808780978107811781278137814781578167817781878197820782178227823782478257826782778287829783078317832783378347835783678377838783978407841784278437844784578467847784878497850785178527853785478557856785778587859786078617862786378647865786678677868786978707871787278737874787578767877787878797880788178827883788478857886788778887889789078917892789378947895789678977898789979007901790279037904790579067907790879097910791179127913791479157916791779187919792079217922792379247925792679277928792979307931793279337934793579367937793879397940794179427943794479457946794779487949795079517952795379547955795679577958795979607961796279637964796579667967796879697970797179727973797479757976797779787979798079817982798379847985798679877988798979907991799279937994799579967997799879998000800180028003800480058006800780088009801080118012801380148015801680178018801980208021802280238024802580268027802880298030803180328033803480358036803780388039804080418042804380448045804680478048804980508051805280538054805580568057805880598060806180628063806480658066806780688069807080718072807380748075807680778078807980808081808280838084808580868087808880898090809180928093809480958096809780988099810081018102810381048105810681078108810981108111811281138114811581168117811881198120812181228123812481258126812781288129813081318132813381348135813681378138813981408141814281438144814581468147814881498150815181528153815481558156815781588159816081618162816381648165816681678168816981708171817281738174817581768177817881798180818181828183818481858186818781888189819081918192819381948195819681978198819982008201820282038204820582068207820882098210821182128213821482158216821782188219822082218222822382248225822682278228822982308231823282338234823582368237823882398240824182428243824482458246824782488249825082518252825382548255825682578258825982608261826282638264826582668267826882698270827182728273827482758276827782788279828082818282828382848285828682878288828982908291829282938294829582968297829882998300830183028303830483058306830783088309831083118312831383148315831683178318831983208321832283238324832583268327832883298330833183328333833483358336833783388339834083418342834383448345834683478348834983508351835283538354835583568357835883598360836183628363836483658366836783688369837083718372837383748375837683778378837983808381838283838384838583868387838883898390839183928393839483958396839783988399840084018402840384048405840684078408840984108411841284138414841584168417841884198420842184228423842484258426842784288429843084318432843384348435843684378438843984408441844284438444844584468447844884498450845184528453845484558456845784588459846084618462846384648465846684678468846984708471847284738474847584768477847884798480848184828483848484858486848784888489849084918492849384948495849684978498849985008501850285038504850585068507850885098510851185128513851485158516851785188519852085218522852385248525852685278528852985308531853285338534853585368537853885398540854185428543854485458546854785488549855085518552855385548555855685578558855985608561856285638564856585668567856885698570857185728573857485758576857785788579858085818582858385848585858685878588858985908591859285938594859585968597859885998600860186028603860486058606860786088609861086118612861386148615861686178618861986208621862286238624862586268627862886298630863186328633863486358636863786388639864086418642864386448645864686478648864986508651865286538654865586568657865886598660866186628663866486658666866786688669867086718672867386748675867686778678867986808681868286838684868586868687868886898690869186928693869486958696869786988699870087018702870387048705870687078708870987108711871287138714871587168717871887198720872187228723872487258726872787288729873087318732873387348735873687378738873987408741874287438744874587468747874887498750875187528753875487558756875787588759876087618762876387648765876687678768876987708771877287738774877587768777877887798780878187828783878487858786878787888789879087918792879387948795879687978798879988008801880288038804880588068807880888098810881188128813881488158816881788188819882088218822882388248825882688278828882988308831883288338834883588368837883888398840884188428843884488458846884788488849885088518852885388548855885688578858885988608861886288638864886588668867886888698870887188728873887488758876887788788879888088818882888388848885888688878888888988908891889288938894889588968897889888998900890189028903890489058906890789088909891089118912891389148915891689178918891989208921892289238924892589268927892889298930893189328933893489358936893789388939894089418942894389448945894689478948894989508951895289538954895589568957895889598960896189628963896489658966896789688969897089718972897389748975897689778978897989808981898289838984898589868987898889898990899189928993899489958996899789988999900090019002900390049005900690079008900990109011901290139014901590169017901890199020902190229023902490259026902790289029903090319032903390349035903690379038903990409041904290439044904590469047904890499050905190529053905490559056905790589059906090619062906390649065906690679068906990709071907290739074907590769077907890799080908190829083908490859086908790889089909090919092909390949095909690979098909991009101910291039104910591069107910891099110911191129113911491159116911791189119912091219122912391249125912691279128912991309131913291339134913591369137913891399140914191429143914491459146914791489149915091519152915391549155915691579158915991609161916291639164916591669167916891699170917191729173917491759176917791789179918091819182918391849185918691879188918991909191919291939194919591969197919891999200920192029203920492059206920792089209921092119212921392149215921692179218921992209221922292239224922592269227922892299230923192329233923492359236923792389239924092419242924392449245924692479248924992509251925292539254925592569257925892599260926192629263926492659266926792689269927092719272927392749275927692779278927992809281928292839284928592869287928892899290929192929293929492959296929792989299930093019302930393049305930693079308930993109311931293139314931593169317931893199320932193229323932493259326932793289329933093319332933393349335933693379338933993409341934293439344934593469347934893499350935193529353935493559356935793589359936093619362936393649365936693679368936993709371937293739374937593769377937893799380938193829383938493859386938793889389939093919392939393949395939693979398939994009401940294039404940594069407940894099410941194129413941494159416941794189419942094219422942394249425942694279428942994309431943294339434943594369437943894399440944194429443944494459446944794489449945094519452945394549455945694579458945994609461946294639464946594669467946894699470947194729473947494759476947794789479948094819482948394849485948694879488948994909491949294939494949594969497949894999500950195029503950495059506950795089509951095119512951395149515951695179518951995209521952295239524952595269527952895299530953195329533953495359536953795389539954095419542954395449545954695479548954995509551955295539554955595569557955895599560956195629563956495659566956795689569957095719572957395749575957695779578957995809581958295839584958595869587958895899590959195929593959495959596959795989599960096019602960396049605960696079608960996109611961296139614961596169617961896199620962196229623962496259626962796289629963096319632963396349635963696379638963996409641964296439644964596469647964896499650965196529653965496559656965796589659966096619662966396649665966696679668966996709671967296739674967596769677967896799680968196829683968496859686968796889689969096919692969396949695969696979698969997009701970297039704970597069707970897099710971197129713971497159716971797189719972097219722972397249725972697279728972997309731973297339734973597369737973897399740974197429743974497459746974797489749975097519752975397549755975697579758975997609761976297639764976597669767976897699770977197729773977497759776977797789779978097819782978397849785978697879788978997909791979297939794979597969797979897999800980198029803980498059806980798089809981098119812981398149815981698179818981998209821982298239824982598269827982898299830983198329833983498359836983798389839984098419842984398449845984698479848984998509851985298539854985598569857985898599860986198629863986498659866986798689869987098719872987398749875987698779878987998809881988298839884988598869887988898899890989198929893989498959896989798989899990099019902990399049905990699079908990999109911991299139914991599169917991899199920992199229923992499259926992799289929993099319932993399349935993699379938993999409941994299439944994599469947994899499950995199529953995499559956995799589959996099619962996399649965996699679968996999709971997299739974997599769977997899799980998199829983998499859986998799889989999099919992999399949995999699979998999910000100011000210003100041000510006100071000810009100101001110012100131001410015100161001710018100191002010021100221002310024100251002610027100281002910030100311003210033100341003510036100371003810039100401004110042100431004410045100461004710048100491005010051100521005310054100551005610057100581005910060100611006210063100641006510066100671006810069100701007110072100731007410075100761007710078100791008010081100821008310084100851008610087100881008910090100911009210093100941009510096100971009810099101001010110102101031010410105101061010710108101091011010111101121011310114101151011610117101181011910120101211012210123101241012510126101271012810129101301013110132101331013410135101361013710138101391014010141101421014310144101451014610147101481014910150101511015210153101541015510156101571015810159101601016110162101631016410165101661016710168101691017010171101721017310174101751017610177101781017910180101811018210183101841018510186101871018810189101901019110192101931019410195101961019710198101991020010201102021020310204102051020610207102081020910210102111021210213102141021510216102171021810219102201022110222102231022410225102261022710228102291023010231102321023310234102351023610237102381023910240102411024210243102441024510246102471024810249102501025110252102531025410255102561025710258102591026010261102621026310264102651026610267102681026910270102711027210273102741027510276102771027810279102801028110282102831028410285102861028710288102891029010291102921029310294102951029610297102981029910300103011030210303103041030510306103071030810309103101031110312103131031410315103161031710318103191032010321103221032310324103251032610327103281032910330103311033210333103341033510336103371033810339103401034110342103431034410345103461034710348103491035010351103521035310354103551035610357103581035910360103611036210363103641036510366103671036810369103701037110372103731037410375103761037710378103791038010381103821038310384103851038610387103881038910390103911039210393103941039510396103971039810399104001040110402104031040410405104061040710408104091041010411104121041310414104151041610417104181041910420104211042210423104241042510426104271042810429104301043110432104331043410435104361043710438104391044010441104421044310444104451044610447104481044910450104511045210453104541045510456104571045810459104601046110462104631046410465104661046710468104691047010471104721047310474104751047610477104781047910480104811048210483104841048510486104871048810489104901049110492104931049410495104961049710498104991050010501105021050310504105051050610507105081050910510105111051210513105141051510516105171051810519105201052110522105231052410525105261052710528105291053010531105321053310534105351053610537105381053910540105411054210543105441054510546105471054810549105501055110552105531055410555105561055710558105591056010561105621056310564105651056610567105681056910570105711057210573105741057510576105771057810579105801058110582105831058410585105861058710588105891059010591105921059310594105951059610597105981059910600106011060210603106041060510606106071060810609106101061110612106131061410615106161061710618106191062010621106221062310624106251062610627106281062910630106311063210633106341063510636106371063810639106401064110642106431064410645106461064710648106491065010651106521065310654106551065610657106581065910660106611066210663106641066510666106671066810669106701067110672106731067410675106761067710678106791068010681106821068310684106851068610687106881068910690106911069210693106941069510696106971069810699107001070110702107031070410705107061070710708107091071010711107121071310714107151071610717107181071910720107211072210723107241072510726107271072810729107301073110732107331073410735107361073710738107391074010741107421074310744107451074610747107481074910750107511075210753107541075510756107571075810759107601076110762107631076410765107661076710768107691077010771107721077310774107751077610777107781077910780107811078210783107841078510786107871078810789107901079110792107931079410795107961079710798107991080010801108021080310804108051080610807108081080910810108111081210813108141081510816108171081810819108201082110822108231082410825108261082710828108291083010831108321083310834108351083610837108381083910840108411084210843108441084510846108471084810849108501085110852108531085410855108561085710858108591086010861108621086310864108651086610867108681086910870108711087210873108741087510876108771087810879108801088110882108831088410885108861088710888108891089010891108921089310894108951089610897108981089910900109011090210903109041090510906109071090810909109101091110912109131091410915109161091710918109191092010921109221092310924109251092610927109281092910930109311093210933109341093510936109371093810939109401094110942109431094410945109461094710948109491095010951109521095310954109551095610957109581095910960109611096210963109641096510966109671096810969109701097110972109731097410975109761097710978109791098010981109821098310984109851098610987109881098910990109911099210993109941099510996109971099810999110001100111002110031100411005110061100711008110091101011011110121101311014110151101611017110181101911020110211102211023110241102511026110271102811029110301103111032110331103411035110361103711038110391104011041110421104311044110451104611047110481104911050110511105211053110541105511056110571105811059110601106111062110631106411065110661106711068110691107011071110721107311074110751107611077110781107911080110811108211083110841108511086110871108811089110901109111092110931109411095110961109711098110991110011101111021110311104111051110611107111081110911110111111111211113111141111511116111171111811119111201112111122111231112411125111261112711128111291113011131111321113311134111351113611137111381113911140111411114211143111441114511146111471114811149111501115111152111531115411155111561115711158111591116011161111621116311164111651116611167111681116911170111711117211173111741117511176111771117811179111801118111182111831118411185111861118711188111891119011191111921119311194111951119611197111981119911200112011120211203112041120511206112071120811209112101121111212112131121411215112161121711218112191122011221112221122311224112251122611227112281122911230112311123211233112341123511236112371123811239112401124111242112431124411245112461124711248112491125011251112521125311254112551125611257112581125911260112611126211263112641126511266112671126811269112701127111272112731127411275112761127711278112791128011281112821128311284112851128611287112881128911290112911129211293112941129511296112971129811299113001130111302113031130411305113061130711308113091131011311113121131311314113151131611317113181131911320113211132211323113241132511326113271132811329113301133111332113331133411335113361133711338113391134011341113421134311344113451134611347113481134911350113511135211353113541135511356113571135811359113601136111362113631136411365113661136711368113691137011371113721137311374113751137611377113781137911380113811138211383113841138511386113871138811389113901139111392113931139411395113961139711398113991140011401114021140311404114051140611407114081140911410114111141211413114141141511416114171141811419114201142111422114231142411425114261142711428114291143011431114321143311434114351143611437114381143911440114411144211443114441144511446114471144811449114501145111452114531145411455114561145711458114591146011461114621146311464114651146611467114681146911470114711147211473114741147511476114771147811479114801148111482114831148411485114861148711488114891149011491114921149311494114951149611497114981149911500115011150211503115041150511506115071150811509115101151111512115131151411515115161151711518115191152011521115221152311524115251152611527115281152911530115311153211533115341153511536115371153811539115401154111542115431154411545115461154711548115491155011551115521155311554115551155611557115581155911560115611156211563115641156511566115671156811569115701157111572115731157411575115761157711578115791158011581115821158311584115851158611587115881158911590115911159211593115941159511596115971159811599116001160111602116031160411605116061160711608116091161011611116121161311614116151161611617116181161911620116211162211623116241162511626116271162811629116301163111632116331163411635116361163711638116391164011641116421164311644116451164611647116481164911650116511165211653116541165511656116571165811659116601166111662116631166411665116661166711668116691167011671116721167311674116751167611677116781167911680116811168211683116841168511686116871168811689116901169111692116931169411695116961169711698116991170011701117021170311704117051170611707117081170911710117111171211713117141171511716117171171811719117201172111722117231172411725117261172711728117291173011731117321173311734117351173611737117381173911740117411174211743117441174511746117471174811749117501175111752117531175411755117561175711758117591176011761117621176311764117651176611767117681176911770117711177211773117741177511776117771177811779117801178111782117831178411785117861178711788117891179011791117921179311794117951179611797117981179911800118011180211803118041180511806118071180811809118101181111812118131181411815118161181711818118191182011821118221182311824118251182611827118281182911830118311183211833118341183511836118371183811839118401184111842118431184411845118461184711848118491185011851118521185311854118551185611857118581185911860118611186211863118641186511866118671186811869118701187111872118731187411875118761187711878118791188011881118821188311884118851188611887118881188911890118911189211893118941189511896118971189811899119001190111902119031190411905119061190711908119091191011911119121191311914119151191611917119181191911920119211192211923119241192511926119271192811929119301193111932119331193411935119361193711938119391194011941119421194311944119451194611947119481194911950119511195211953119541195511956119571195811959119601196111962119631196411965119661196711968119691197011971119721197311974119751197611977119781197911980119811198211983119841198511986119871198811989119901199111992119931199411995119961199711998119991200012001120021200312004120051200612007120081200912010120111201212013120141201512016120171201812019120201202112022120231202412025120261202712028120291203012031120321203312034120351203612037120381203912040120411204212043120441204512046120471204812049120501205112052120531205412055120561205712058120591206012061120621206312064120651206612067120681206912070120711207212073120741207512076120771207812079120801208112082120831208412085120861208712088120891209012091120921209312094120951209612097120981209912100121011210212103121041210512106121071210812109121101211112112121131211412115121161211712118121191212012121121221212312124121251212612127121281212912130121311213212133121341213512136121371213812139121401214112142121431214412145121461214712148121491215012151121521215312154121551215612157121581215912160121611216212163121641216512166121671216812169121701217112172121731217412175121761217712178121791218012181121821218312184121851218612187121881218912190121911219212193121941219512196121971219812199122001220112202122031220412205122061220712208122091221012211122121221312214122151221612217122181221912220122211222212223122241222512226122271222812229122301223112232122331223412235122361223712238122391224012241122421224312244122451224612247122481224912250122511225212253122541225512256122571225812259122601226112262122631226412265122661226712268122691227012271122721227312274122751227612277122781227912280122811228212283122841228512286122871228812289122901229112292122931229412295122961229712298122991230012301123021230312304123051230612307123081230912310123111231212313123141231512316123171231812319123201232112322123231232412325123261232712328123291233012331123321233312334123351233612337123381233912340123411234212343123441234512346123471234812349123501235112352123531235412355123561235712358123591236012361123621236312364123651236612367123681236912370123711237212373123741237512376123771237812379123801238112382123831238412385123861238712388123891239012391123921239312394123951239612397123981239912400124011240212403124041240512406124071240812409124101241112412124131241412415124161241712418124191242012421124221242312424124251242612427124281242912430124311243212433124341243512436124371243812439124401244112442124431244412445124461244712448124491245012451124521245312454124551245612457124581245912460124611246212463124641246512466124671246812469124701247112472124731247412475124761247712478124791248012481124821248312484124851248612487124881248912490124911249212493124941249512496124971249812499125001250112502125031250412505125061250712508125091251012511125121251312514125151251612517125181251912520125211252212523125241252512526125271252812529125301253112532125331253412535125361253712538125391254012541125421254312544125451254612547125481254912550125511255212553125541255512556125571255812559125601256112562125631256412565125661256712568125691257012571125721257312574125751257612577125781257912580125811258212583125841258512586125871258812589125901259112592125931259412595125961259712598125991260012601126021260312604126051260612607126081260912610126111261212613126141261512616126171261812619126201262112622126231262412625126261262712628126291263012631126321263312634126351263612637126381263912640126411264212643126441264512646126471264812649126501265112652126531265412655126561265712658126591266012661126621266312664126651266612667126681266912670126711267212673126741267512676126771267812679126801268112682126831268412685126861268712688126891269012691126921269312694126951269612697126981269912700127011270212703127041270512706127071270812709127101271112712127131271412715127161271712718127191272012721127221272312724127251272612727127281272912730127311273212733127341273512736127371273812739127401274112742127431274412745127461274712748127491275012751127521275312754127551275612757127581275912760127611276212763127641276512766127671276812769127701277112772127731277412775127761277712778127791278012781127821278312784127851278612787127881278912790127911279212793127941279512796127971279812799128001280112802128031280412805128061280712808128091281012811128121281312814128151281612817128181281912820128211282212823128241282512826128271282812829128301283112832128331283412835128361283712838128391284012841128421284312844128451284612847128481284912850128511285212853128541285512856128571285812859128601286112862128631286412865128661286712868128691287012871128721287312874128751287612877128781287912880128811288212883128841288512886128871288812889128901289112892128931289412895128961289712898128991290012901129021290312904129051290612907129081290912910129111291212913129141291512916129171291812919129201292112922129231292412925129261292712928129291293012931129321293312934129351293612937129381293912940129411294212943129441294512946129471294812949129501295112952129531295412955129561295712958129591296012961129621296312964129651296612967129681296912970129711297212973129741297512976129771297812979129801298112982129831298412985129861298712988129891299012991129921299312994129951299612997129981299913000130011300213003130041300513006130071300813009130101301113012130131301413015130161301713018130191302013021130221302313024130251302613027130281302913030130311303213033130341303513036130371303813039130401304113042130431304413045130461304713048130491305013051130521305313054130551305613057130581305913060130611306213063130641306513066130671306813069130701307113072130731307413075130761307713078130791308013081130821308313084130851308613087130881308913090130911309213093130941309513096130971309813099131001310113102131031310413105131061310713108131091311013111131121311313114131151311613117131181311913120131211312213123131241312513126131271312813129131301313113132131331313413135131361313713138131391314013141131421314313144131451314613147131481314913150131511315213153131541315513156131571315813159131601316113162131631316413165131661316713168131691317013171131721317313174131751317613177131781317913180131811318213183131841318513186131871318813189131901319113192131931319413195131961319713198131991320013201132021320313204132051320613207132081320913210132111321213213132141321513216132171321813219132201322113222132231322413225132261322713228132291323013231132321323313234132351323613237132381323913240132411324213243132441324513246132471324813249132501325113252132531325413255132561325713258132591326013261132621326313264132651326613267132681326913270132711327213273132741327513276132771327813279132801328113282132831328413285132861328713288132891329013291132921329313294132951329613297132981329913300133011330213303133041330513306133071330813309133101331113312133131331413315133161331713318133191332013321133221332313324133251332613327133281332913330133311333213333133341333513336133371333813339133401334113342133431334413345133461334713348133491335013351133521335313354133551335613357133581335913360133611336213363133641336513366133671336813369133701337113372133731337413375133761337713378133791338013381133821338313384133851338613387133881338913390133911339213393133941339513396133971339813399134001340113402134031340413405134061340713408134091341013411134121341313414134151341613417134181341913420134211342213423134241342513426134271342813429134301343113432134331343413435134361343713438134391344013441134421344313444134451344613447134481344913450134511345213453134541345513456134571345813459134601346113462134631346413465134661346713468134691347013471134721347313474134751347613477134781347913480134811348213483134841348513486134871348813489134901349113492134931349413495134961349713498134991350013501135021350313504135051350613507135081350913510135111351213513135141351513516135171351813519135201352113522135231352413525135261352713528135291353013531135321353313534135351353613537135381353913540135411354213543135441354513546135471354813549135501355113552135531355413555135561355713558135591356013561135621356313564135651356613567135681356913570135711357213573135741357513576135771357813579135801358113582135831358413585135861358713588135891359013591135921359313594135951359613597135981359913600136011360213603136041360513606136071360813609136101361113612136131361413615136161361713618136191362013621136221362313624136251362613627136281362913630136311363213633136341363513636136371363813639136401364113642136431364413645136461364713648136491365013651136521365313654136551365613657136581365913660136611366213663136641366513666136671366813669136701367113672136731367413675136761367713678136791368013681136821368313684136851368613687136881368913690136911369213693136941369513696136971369813699137001370113702137031370413705137061370713708137091371013711137121371313714137151371613717137181371913720137211372213723137241372513726137271372813729137301373113732137331373413735137361373713738137391374013741137421374313744137451374613747137481374913750137511375213753137541375513756137571375813759137601376113762137631376413765137661376713768137691377013771137721377313774137751377613777137781377913780137811378213783137841378513786137871378813789137901379113792137931379413795137961379713798137991380013801138021380313804138051380613807138081380913810138111381213813138141381513816138171381813819138201382113822138231382413825138261382713828138291383013831138321383313834138351383613837138381383913840138411384213843138441384513846138471384813849138501385113852138531385413855138561385713858138591386013861138621386313864138651386613867138681386913870138711387213873138741387513876138771387813879138801388113882138831388413885138861388713888138891389013891138921389313894138951389613897138981389913900139011390213903139041390513906139071390813909139101391113912139131391413915139161391713918139191392013921139221392313924139251392613927139281392913930139311393213933139341393513936139371393813939139401394113942139431394413945139461394713948139491395013951139521395313954139551395613957139581395913960139611396213963139641396513966139671396813969139701397113972
  1. MODULE FoxIntermediateBackend; (** AUTHOR ""; PURPOSE ""; *)
  2. IMPORT Basic := FoxBasic, SyntaxTree := FoxSyntaxTree, SemanticChecker := FoxSemanticChecker, Backend := FoxBackend, Global := FoxGlobal,
  3. Scanner := FoxScanner, IntermediateCode := FoxIntermediateCode, Sections := FoxSections, BinaryCode := FoxBinaryCode, Printout := FoxPrintout,
  4. SYSTEM, Diagnostics, Strings, Options, Streams, Compiler, Formats := FoxFormats, SymbolFileFormat := FoxTextualSymbolFile, D := Debugging,
  5. FingerPrinter := FoxFingerPrinter, StringPool;
  6. CONST
  7. (* operand modes *)
  8. ModeUndefined = 0;
  9. ModeReference = 1;
  10. ModeValue = 2;
  11. (* heap data offsets *)
  12. ArrayDimTable = 3; (* dimension table in dyn arrays *)
  13. (* math array offsets *)
  14. MathPtrOffset=0;
  15. MathAdrOffset=1;
  16. MathFlagsOffset=2;
  17. MathDimOffset=3;
  18. MathElementSizeOffset=4;
  19. MathLenOffset=5;
  20. MathIncrOffset=6;
  21. SysDataArrayOffset* = 0; (* array offset in system bl ock, for 32 byte alignment *)
  22. ArrDataArrayOffset*= 16*8; (* 16 bytes array offset in array block, to be compatible with the GC scheme of POINTER TO ARRAY OF ... *)
  23. TensorFlag* = 0; (* flag indicating a tensor array *)
  24. RangeFlag* = 1; (* flag indicating a range, e.g. an array derived from A[..,..] *)
  25. StackFlag* = 2; (* flag indicates temporary result *)
  26. StaticFlag* = 1; (* flag indicating a static array, may not be reallocated *)
  27. (** compiler generated traps *)
  28. WithTrap* = 1; (* generated when a WITH statement fails *)
  29. CaseTrap* = 2; (* generated when a case statement without else block fails *)
  30. ReturnTrap* = 3;
  31. TypeEqualTrap* = 5;
  32. TypeCheckTrap* = 6;
  33. IndexCheckTrap* = 7; (* generated when index is out of bounds or range is invalid *)
  34. AssertTrap* = 8; (* generated when an assert fails *)
  35. ArraySizeTrap* = 9;
  36. ArrayFormTrap*=10; (* indicates that array cannot be (re-)allocated since shape, type or size does not match *)
  37. SetElementTrap*=11; (* indicates that a set element is out of MIN(SET)...MAX(SET) *)
  38. NegativeDivisorTrap*=12;
  39. NoReturnTrap*=16; (* indicates that a procedure marked no return did return *)
  40. NilPointerTrap*=17; (* indicates that a nil pointer was being dereferenced *)
  41. Trace = FALSE;
  42. TraceRegisterUsageCount=TRUE;
  43. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  44. (** system call numbers *)
  45. NumberSystemCalls* = 12;
  46. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  47. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  48. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  49. DefaultRuntimeModuleName ="Runtime";
  50. DefaultTraceModuleName ="KernelLog";
  51. ChannelModuleName = "Channels";
  52. suppressModuleRegistration=FALSE;
  53. NonPointer = -1; (* special pointer values *)
  54. NoType = 0; (* special type info values *)
  55. LhsIsPointer = 0; (* for the operator kind *)
  56. RhsIsPointer = 1;
  57. (* priority values, lower means higher priority *)
  58. EntryPriority=-4;
  59. FirstPriority=-3;
  60. InitPriority=-2;
  61. ExitPriority=-1;
  62. StrictChecks = FALSE;
  63. BasePointerTypeSize = 5;
  64. BaseArrayTypeSize = BasePointerTypeSize + 3;
  65. LengthOffset = BasePointerTypeSize + 0;
  66. DataOffset = BasePointerTypeSize + 1;
  67. DescriptorOffset = BasePointerTypeSize + 2;
  68. BaseRecordTypeSize = BasePointerTypeSize + 2;
  69. ActionOffset = BasePointerTypeSize + 0;
  70. MonitorOffset = BasePointerTypeSize + 1;
  71. BaseObjectTypeSize = BaseRecordTypeSize;
  72. ActionTypeSize = 3;
  73. MonitorTypeSize = 7;
  74. ProcessorOffset = BaseObjectTypeSize + 1;
  75. StackLimitOffset* = BaseObjectTypeSize + 3;
  76. QuantumOffset = BaseObjectTypeSize + 4;
  77. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  78. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  79. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  80. Size2Flag = 4; (* size = 2 *)
  81. Size3Flag = 5; (* size = 3 *)
  82. Size4Flag = 6; (* size = 4 *)
  83. Size5Flag = 7; (* size = 5 *)
  84. Size6Flag = 8; (* size = 6 *)
  85. Size7Flag = 9; (* size = 7 *)
  86. Size8Flag = 10; (* size = 8 *)
  87. ReflectionSupport = TRUE;
  88. TYPE
  89. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  90. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  91. Operand = RECORD
  92. mode: SHORTINT;
  93. op: IntermediateCode.Operand;
  94. tag: IntermediateCode.Operand;
  95. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  96. dimOffset: LONGINT;
  97. END;
  98. Fixup= POINTER TO RECORD
  99. pc: LONGINT;
  100. nextFixup: Fixup;
  101. END;
  102. WriteBackCall = POINTER TO RECORD
  103. call: SyntaxTree.ProcedureCallDesignator;
  104. next: WriteBackCall;
  105. END;
  106. Label= OBJECT
  107. VAR
  108. fixups: Fixup;
  109. section: IntermediateCode.Section;
  110. pc: LONGINT;
  111. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  112. BEGIN
  113. SELF.section := section; pc := -1;
  114. END InitLabel;
  115. PROCEDURE Resolve(pc: LONGINT);
  116. VAR at: LONGINT;
  117. BEGIN
  118. SELF.pc := pc;
  119. WHILE(fixups # NIL) DO
  120. at := fixups.pc;
  121. section.PatchAddress(at,pc);
  122. fixups := fixups.nextFixup;
  123. END;
  124. END Resolve;
  125. PROCEDURE AddFixup(at: LONGINT);
  126. VAR fixup: Fixup;
  127. BEGIN
  128. ASSERT(pc=-1);
  129. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  130. END AddFixup;
  131. END Label;
  132. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  133. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  134. VAR
  135. backend: IntermediateBackend;
  136. implementationVisitor: ImplementationVisitor;
  137. meta: MetaDataGenerator;
  138. system: Global.System;
  139. currentScope: SyntaxTree.Scope;
  140. module: Sections.Module;
  141. moduleSelf: SyntaxTree.Variable;
  142. dump: BOOLEAN;
  143. forceModuleBody: BOOLEAN;
  144. addressType: IntermediateCode.Type;
  145. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  146. BEGIN
  147. currentScope := NIL; module := NIL; moduleSelf := NIL;
  148. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  149. SELF.dump := dump;
  150. SELF.backend := backend;
  151. SELF.forceModuleBody := forceModuleBody;
  152. addressType := IntermediateCode.GetType(system,system.addressType)
  153. END Init;
  154. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  155. BEGIN
  156. backend.Error(module.module.sourceName, position, Diagnostics.Invalid, s);
  157. END Error;
  158. PROCEDURE Type(x: SyntaxTree.Type);
  159. BEGIN
  160. x.Accept(SELF);
  161. END Type;
  162. (** types **)
  163. PROCEDURE VisitBasicType(x: SyntaxTree.BasicType);
  164. BEGIN (* no code emission *) END VisitBasicType;
  165. PROCEDURE VisitCharacterType(x: SyntaxTree.CharacterType);
  166. BEGIN (* no code emission *) END VisitCharacterType;
  167. PROCEDURE VisitIntegerType(x: SyntaxTree.IntegerType);
  168. BEGIN (* no code emission *) END VisitIntegerType;
  169. PROCEDURE VisitFloatType(x: SyntaxTree.FloatType);
  170. BEGIN (* no code emission *) END VisitFloatType;
  171. PROCEDURE VisitComplexType(x: SyntaxTree.ComplexType);
  172. BEGIN (* no code emission *) END VisitComplexType;
  173. PROCEDURE VisitQualifiedType(x: SyntaxTree.QualifiedType);
  174. VAR type: SyntaxTree.Type;
  175. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  176. type := x.resolved;
  177. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  178. meta.CheckTypeDeclaration(type);
  179. END;
  180. END VisitQualifiedType;
  181. PROCEDURE VisitStringType(x: SyntaxTree.StringType);
  182. BEGIN (* no code emission *) END VisitStringType;
  183. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  184. BEGIN (* no code emission *)
  185. END VisitArrayRangeType;
  186. PROCEDURE VisitArrayType(x: SyntaxTree.ArrayType);
  187. BEGIN (* no code emission *) END VisitArrayType;
  188. PROCEDURE VisitMathArrayType(x: SyntaxTree.MathArrayType);
  189. BEGIN
  190. meta.CheckTypeDeclaration(x);
  191. END VisitMathArrayType;
  192. PROCEDURE VisitPointerType(x: SyntaxTree.PointerType);
  193. BEGIN
  194. meta.CheckTypeDeclaration(x);
  195. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  196. END VisitPointerType;
  197. PROCEDURE VisitRecordType(x: SyntaxTree.RecordType);
  198. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  199. BEGIN (* no code emission *)
  200. meta.CheckTypeDeclaration(x);
  201. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  202. IF x.pointerType.typeDeclaration # NIL THEN
  203. td := x.pointerType.typeDeclaration
  204. ELSE
  205. td := x.typeDeclaration
  206. END;
  207. Global.GetSymbolName(td,name);
  208. (* code section for object *)
  209. END;
  210. Scope(x.recordScope);
  211. END VisitRecordType;
  212. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  213. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  214. BEGIN
  215. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  216. WHILE (this # NIL) & (this.identifier# id) DO
  217. this := this.nextModifier;
  218. END;
  219. RETURN this # NIL
  220. END HasFlag;
  221. PROCEDURE VisitCellType(x: SyntaxTree.CellType);
  222. VAR port,adr: LONGINT; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  223. (*
  224. PROCEDURE CreatePorts(type: SyntaxTree.Type; len: LONGINT);
  225. VAR i,len2: LONGINT; baseType: SyntaxTree.Type;
  226. BEGIN
  227. FOR i := 0 TO len-1 DO
  228. IF SemanticChecker.IsStaticArray(type, baseType, len2) THEN
  229. CreatePorts(baseType, len*len2);
  230. ELSIF IsSemiDynamicArray(type) THEN
  231. port := MIN(LONGINT); (* unknown port address from here on *)
  232. ELSE
  233. IntermediateCode.InitImmediate(op,addressType,adr);
  234. symbol.Emit(Data(-1,op));
  235. INC(port);
  236. END;
  237. END;
  238. END CreatePorts;
  239. *)
  240. BEGIN
  241. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  242. (*
  243. IF (x.cellScope.ownerModule = module.module) THEN
  244. td := x.typeDeclaration;
  245. Global.GetSymbolSegmentedName(td,name);
  246. (* code section for object *)
  247. END;
  248. *)
  249. (* unnecessary to generate space for ports: already represented as hidden variables *)
  250. (*
  251. port := 0;
  252. parameter := x.firstParameter;
  253. WHILE parameter # NIL DO
  254. type := parameter.type.resolved;
  255. Global.GetSymbolSegmentedName(parameter,name);
  256. symbol := implementationVisitor.NewSection(module.allSections, Sections.ConstSection,name,parameter,dump);
  257. IF port >= 0 THEN
  258. (*! could be used for optimization: query value here ???
  259. parameter.SetResolved(SyntaxTree.NewIntegerValue(-1, port));
  260. *)
  261. END;
  262. CreatePorts(type, 1);
  263. IF backend.cellsAreObjects THEN
  264. IF IsStaticArray(parameter.type.resolved) THEN
  265. Error(parameter.position, "static arrays of ports are currently not implemented, please use a property (array property of port)");
  266. END;
  267. END;
  268. parameter := parameter.nextParameter;
  269. END;
  270. *)
  271. capabilities := {};
  272. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  273. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  274. backend.SetCapabilities(capabilities);
  275. Scope(x.cellScope);
  276. END VisitCellType;
  277. PROCEDURE VisitProcedureType(x: SyntaxTree.ProcedureType);
  278. BEGIN (* no code emission *) END VisitProcedureType;
  279. PROCEDURE VisitEnumerationType(x: SyntaxTree.EnumerationType);
  280. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  281. END VisitEnumerationType;
  282. (* symbols *)
  283. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  284. BEGIN
  285. Procedure(x);
  286. END VisitProcedure;
  287. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  288. BEGIN
  289. Procedure(x);
  290. END VisitOperator;
  291. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  292. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i, dim: LONGINT;
  293. size, addressSize: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  294. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  295. BEGIN
  296. type := type.resolved;
  297. IF type IS SyntaxTree.RecordType THEN
  298. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  299. ELSIF (type IS SyntaxTree.ArrayType) THEN
  300. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  301. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  302. END;
  303. ELSIF type IS SyntaxTree.MathArrayType THEN
  304. WITH type: SyntaxTree.MathArrayType DO
  305. IF type.form = SyntaxTree.Open THEN
  306. RETURN TRUE
  307. ELSIF type.form = SyntaxTree.Static THEN
  308. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  309. END;
  310. END;
  311. END;
  312. RETURN FALSE
  313. END TypeNeedsInitialization;
  314. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  315. VAR variable: SyntaxTree.Variable;
  316. BEGIN
  317. variable := scope.firstVariable;
  318. WHILE variable # NIL DO
  319. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  320. IF variable.initializer # NIL THEN RETURN TRUE END;
  321. variable := variable.nextVariable;
  322. END;
  323. RETURN FALSE
  324. END ScopeNeedsInitialization;
  325. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset: LONGINT);
  326. BEGIN
  327. size := offset - lastUpdated;
  328. IF size > 0 THEN
  329. irv.Emit(Reserve(x.position,size));
  330. END;
  331. irv.Emit(Data(x.position, op));
  332. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  333. END SingleInitialize;
  334. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset: LONGINT);
  335. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable;
  336. BEGIN
  337. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  338. WITH type: SyntaxTree.RecordType DO
  339. baseType := type.baseType;
  340. IF baseType # NIL THEN
  341. baseType := baseType.resolved;
  342. IF baseType IS SyntaxTree.PointerType THEN
  343. baseType := baseType(SyntaxTree.PointerType).pointerBase
  344. END;
  345. Initialize(baseType,NIL, offset);
  346. END;
  347. variable := type.recordScope.firstVariable;
  348. WHILE variable # NIL DO
  349. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  350. variable := variable.nextVariable
  351. END;
  352. | type: SyntaxTree.ArrayType DO
  353. IF type.form = SyntaxTree.Static THEN
  354. baseType := type.arrayBase;
  355. IF TypeNeedsInitialization(baseType) THEN
  356. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  357. FOR i := 0 TO type.staticLength-1 DO
  358. Initialize(baseType,NIL,offset+i*size);
  359. END;
  360. END;
  361. END;
  362. | type: SyntaxTree.MathArrayType DO
  363. IF type.form = SyntaxTree.Open THEN
  364. dim := DynamicDim(type);
  365. baseType := SemanticChecker.ArrayBase(type,dim);
  366. imm := IntermediateCode.Immediate(addressType,dim);
  367. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  368. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  369. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  370. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  371. (* flags remain empty (=0) for open array *)
  372. ELSIF type.form = SyntaxTree.Static THEN
  373. baseType := type.arrayBase;
  374. IF TypeNeedsInitialization(baseType) THEN
  375. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  376. ASSERT(type.staticLength < 1024*1024*1024);
  377. FOR i := 0 TO type.staticLength-1 DO
  378. Initialize(baseType,NIL,offset+i*size);
  379. END;
  380. END;
  381. END;
  382. ELSE
  383. IF initializer # NIL THEN
  384. implementationVisitor.Evaluate(initializer, op);
  385. SingleInitialize(op.op, offset);
  386. END;
  387. END;
  388. END Initialize;
  389. BEGIN
  390. IF x.externalName # NIL THEN RETURN END;
  391. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  392. (* code section for variable *)
  393. Global.GetSymbolSegmentedName(x,name);
  394. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  395. irv.SetExported(IsExported(x));
  396. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  397. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  398. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  399. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  400. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  401. FOR i := 0 TO DynamicDim(x.type)-1 DO
  402. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  403. END;
  404. ELSE
  405. lastUpdated:= 0;
  406. IF implementationVisitor.newObjectFile & ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  407. Initialize(x.type, x.initializer, 0);
  408. END;
  409. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  410. IF size > 0 THEN
  411. irv.Emit(Reserve(x.position,size));
  412. END;
  413. IF ~x.fixed THEN
  414. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  415. ELSE
  416. align := x.alignment;
  417. END;
  418. irv.SetPositionOrAlignment(x.fixed, align);
  419. meta.CheckTypeDeclaration(x.type);
  420. END;
  421. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  422. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  423. END;
  424. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  425. END VisitVariable;
  426. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  427. VAR name: Basic.SegmentedName; irv, irl: IntermediateCode.Section; op: Operand; dim: LONGINT;
  428. BEGIN
  429. HALT(100);
  430. (*
  431. ASSERT(currentScope.outerScope IS SyntaxTree.CellScope);
  432. (* code section for variable *)
  433. Global.GetSymbolSegmentedName(x,name);
  434. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  435. irv.SetPositionOrAlignment(x.fixed, x.alignment);
  436. (*
  437. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  438. *)
  439. IF IsSemiDynamicArray(x.type) & ~backend.cellsAreObjects THEN
  440. HALT(100);
  441. irv.Emit(Reserve(x.position, system.addressSize));
  442. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  443. irl := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  444. irl.Emit(Reserve(x.position, DynamicDim(x.type) * system.addressSize));
  445. ELSIF x.defaultValue = NIL THEN
  446. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))))
  447. ELSE
  448. implementationVisitor.inData := TRUE;
  449. implementationVisitor.Evaluate(x.defaultValue, op);
  450. irv.Emit(Data(x.position,op.op));
  451. implementationVisitor.inData := FALSE;
  452. END;
  453. meta.CheckTypeDeclaration(x.type);
  454. *)
  455. END VisitParameter;
  456. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  457. BEGIN
  458. Type(x.declaredType); (* => code in objects *)
  459. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  460. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  461. END;
  462. END VisitTypeDeclaration;
  463. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  464. BEGIN
  465. IF (SyntaxTree.Public * x.access # {}) THEN
  466. implementationVisitor.VisitConstant(x);
  467. END;
  468. END VisitConstant;
  469. PROCEDURE Scope(x: SyntaxTree.Scope);
  470. VAR procedure: SyntaxTree.Procedure;
  471. constant: SyntaxTree.Constant;
  472. variable: SyntaxTree.Variable;
  473. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  474. BEGIN
  475. prevScope := currentScope;
  476. currentScope := x;
  477. (* constants treated in implementation visitor *)
  478. typeDeclaration := x.firstTypeDeclaration;
  479. WHILE typeDeclaration # NIL DO
  480. VisitTypeDeclaration(typeDeclaration);
  481. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  482. END;
  483. variable := x.firstVariable;
  484. WHILE variable # NIL DO
  485. VisitVariable(variable);
  486. variable := variable.nextVariable;
  487. END;
  488. procedure := x.firstProcedure;
  489. WHILE procedure # NIL DO
  490. VisitProcedure(procedure);
  491. procedure := procedure.nextProcedure;
  492. END;
  493. constant := x.firstConstant;
  494. WHILE constant # NIL DO
  495. VisitConstant(constant);
  496. constant := constant.nextConstant;
  497. END;
  498. currentScope := prevScope;
  499. END Scope;
  500. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  501. VAR parameter: SyntaxTree.Parameter;
  502. BEGIN
  503. parameter := first;
  504. WHILE parameter # NIL DO
  505. VisitParameter(parameter);
  506. parameter := parameter.nextParameter;
  507. END;
  508. END Parameters;
  509. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  510. VAR scope: SyntaxTree.ProcedureScope;
  511. prevScope: SyntaxTree.Scope;
  512. inline, finalizer: BOOLEAN;
  513. procedureType: SyntaxTree.ProcedureType;
  514. pc: LONGINT;
  515. stackSize: LONGINT;
  516. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  517. null,size,src,dest,fp,res: IntermediateCode.Operand;
  518. cc: LONGINT;
  519. cellType: SyntaxTree.CellType;
  520. registerNumber: LONGINT;
  521. registerParameter: Backend.Registers;
  522. registerParameters: LONGINT;
  523. registerClass: IntermediateCode.RegisterClass;
  524. type: IntermediateCode.Type;
  525. formalParameter: SyntaxTree.Parameter;
  526. recordType: SyntaxTree.RecordType;
  527. isModuleBody: BOOLEAN;
  528. PROCEDURE Signature;
  529. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  530. BEGIN
  531. procedureType := x.type(SyntaxTree.ProcedureType);
  532. returnType := procedureType.returnType;
  533. IF returnType # NIL THEN
  534. meta.CheckTypeDeclaration(returnType)
  535. END;
  536. parameter := procedureType.firstParameter;
  537. WHILE parameter # NIL DO
  538. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  539. parameter := parameter.nextParameter;
  540. END;
  541. END Signature;
  542. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  543. VAR result: BOOLEAN;
  544. BEGIN
  545. result := FALSE;
  546. IF x = SyntaxTree.invalidExpression THEN
  547. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  548. result := TRUE;
  549. value := x.resolved(SyntaxTree.IntegerValue).value;
  550. ELSE
  551. Error(x.position,"expression is not an integer constant");
  552. END;
  553. RETURN result;
  554. END CheckIntegerValue;
  555. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  556. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  557. BEGIN
  558. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  559. WHILE (this # NIL) & (this.identifier # id) DO
  560. this := this.nextModifier;
  561. END;
  562. IF this # NIL THEN
  563. IF this.expression = NIL THEN
  564. Error(this.position,"expected expression value");
  565. ELSIF CheckIntegerValue(this.expression,value) THEN
  566. END;
  567. RETURN TRUE
  568. ELSE RETURN FALSE
  569. END;
  570. END HasValue;
  571. CONST DefaultDataMemorySize=512;
  572. BEGIN
  573. IF x.externalName # NIL THEN RETURN END;
  574. (*
  575. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  576. *)
  577. (* code section for this procedure *)
  578. scope := x.procedureScope;
  579. prevScope := currentScope;
  580. currentScope := scope;
  581. procedureType := x.type(SyntaxTree.ProcedureType);
  582. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  583. implementationVisitor.temporaries.Init;
  584. implementationVisitor.usedRegisters := NIL;
  585. implementationVisitor.registerUsageCount.Init;
  586. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  587. IF (scope.body # NIL) & (x.isInline) THEN
  588. inline := TRUE;
  589. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  590. ir.SetExported(IsExported(x));
  591. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  592. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  593. IF backend.cellsAreObjects THEN
  594. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  595. ir.SetExported(IsExported(x));
  596. ELSE
  597. RETURN; (* cellnet cannot be compiled for final static hardware *)
  598. END;
  599. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  600. inline := FALSE;
  601. AddBodyCallStub(x);
  602. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  603. ir.SetExported(IsExported(x));
  604. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  605. inline := FALSE;
  606. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  607. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := DefaultDataMemorySize END;
  608. AddBodyCallStub(x);
  609. AddStackAllocation(x,stackSize);
  610. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  611. ir.SetExported(IsExported(x));
  612. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  613. inline := FALSE;
  614. Parameters(procedureType.firstParameter);
  615. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  616. ir.SetExported(IsExported(x));
  617. ELSE
  618. inline := FALSE;
  619. IF x.isEntry OR x.isExit THEN
  620. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,x,dump);
  621. ir.SetExported(TRUE);
  622. IF x.isEntry THEN ir.SetPriority(EntryPriority) ELSE ir.SetPriority(ExitPriority) END;
  623. ELSE
  624. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  625. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  626. END;
  627. END;
  628. cc := procedureType.callingConvention;
  629. IF scope.body # NIL THEN
  630. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  631. registerNumber := 0;
  632. IF ~inline THEN
  633. IF scope.lastVariable = NIL THEN
  634. stackSize := 0
  635. ELSE
  636. stackSize := scope.lastVariable.offsetInBits;
  637. IF stackSize <0 THEN stackSize := -stackSize END;
  638. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  639. END;
  640. (*
  641. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  642. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  643. *)
  644. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  645. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  646. END;
  647. pc := ir.pc-1;
  648. (*
  649. ir.Emit(Nop(position)); (* placeholder for fill *)
  650. *)
  651. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  652. registerParameter := backend.GetParameterRegisters(procedureType.callingConvention);
  653. IF registerParameter = NIL THEN registerParameters := 0
  654. ELSE registerParameters := LEN(registerParameter)
  655. END;
  656. formalParameter := procedureType.lastParameter;
  657. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  658. IF ~PassInRegister(formalParameter) THEN
  659. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  660. ELSE
  661. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, registerParameter[registerNumber]);
  662. type := GetType(system, formalParameter.type);
  663. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  664. IntermediateCode.InitMemory(dest,GetType(system,formalParameter.type),implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  665. ir.Emit(Mov(-1,dest, src));
  666. implementationVisitor.ReleaseIntermediateOperand(src);
  667. INC(registerNumber);
  668. formalParameter := formalParameter.prevParameter;
  669. END;
  670. END;
  671. END;
  672. ir.EnterValidPAF;
  673. END;
  674. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  675. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  676. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  677. IF scope.lastVariable # NIL THEN
  678. stackSize := scope.lastVariable.offsetInBits;
  679. IF stackSize <0 THEN stackSize := -stackSize END;
  680. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  681. END;
  682. END;
  683. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  684. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  685. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  686. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  687. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  688. ir.EmitAt(pc,Push(size));
  689. implementationVisitor.StaticCallOperand(result,procedure);
  690. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  691. END;
  692. *)
  693. END;
  694. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  695. IF stackSize > 0 THEN
  696. IF (stackSize MOD system.addressSize = 0) THEN
  697. null := IntermediateCode.Immediate(addressType,0);
  698. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  699. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  700. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  701. ELSE
  702. null := IntermediateCode.Immediate(int8,0);
  703. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  704. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  705. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  706. END;
  707. (*! should potentially be called by backend -- enter might initialize
  708. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  709. *)
  710. END;
  711. ir.ExitValidPAF;
  712. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  713. finalizer := FALSE;
  714. IF backend.cooperative & x.isFinalizer THEN
  715. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  716. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  717. GetRecordTypeName(recordType,name);
  718. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  719. END;
  720. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  721. IF backend.cooperative THEN
  722. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  723. IF implementationVisitor.profile & ~isModuleBody THEN
  724. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  725. END;
  726. END;
  727. implementationVisitor.EmitLeave(ir, x.position,cc);
  728. IF finalizer THEN
  729. IF backend.hasLinkRegister THEN
  730. ir.Emit(Pop(-1, implementationVisitor.lr));
  731. END;
  732. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  733. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  734. ir.Emit(Br(x.position,dest));
  735. ELSE
  736. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  737. END;
  738. ELSE
  739. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  740. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  741. END;
  742. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  743. IF backend.cooperative THEN
  744. IF HasPointers (scope) THEN
  745. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  746. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  747. ir.Emit(Result(x.position, res));
  748. ir.Emit(Push(x.position, res));
  749. implementationVisitor.ResetVariables(scope);
  750. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  751. ir.Emit(Pop(x.position, res));
  752. ir.Emit(Return(x.position, res));
  753. ELSE
  754. implementationVisitor.ResetVariables(scope);
  755. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  756. END;
  757. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  758. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  759. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  760. ir.Emit(Result(x.position, res));
  761. ir.Emit(Push(x.position, res));
  762. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  763. ir.Emit(Pop(x.position, res));
  764. ir.Emit(Return(x.position, res));
  765. ELSE
  766. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  767. END;
  768. END;
  769. implementationVisitor.EmitLeave(ir,x.position,cc);
  770. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  771. ELSE
  772. ir.Emit(Nop(x.position));
  773. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  774. implementationVisitor.EmitLeave(ir,x.position,cc);
  775. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  776. END;
  777. END;
  778. END
  779. END;
  780. ELSE (* force body for procedures *)
  781. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  782. ir.EnterValidPAF;
  783. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  784. IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;
  785. ir.ExitValidPAF;
  786. implementationVisitor.EmitLeave(ir,x.position,cc);
  787. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  788. END;
  789. Scope(scope);
  790. Signature;
  791. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  792. currentScope := prevScope;
  793. END Procedure;
  794. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  795. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  796. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  797. BEGIN
  798. ASSERT (bodyProcedure # NIL);
  799. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  800. procedure := SyntaxTree.NewProcedure(-1,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  801. procedure.SetScope(bodyProcedure.scope);
  802. procedure.SetType(SyntaxTree.NewProcedureType(-1,bodyProcedure.scope));
  803. procedure.SetAccess(SyntaxTree.Hidden);
  804. Global.GetSymbolSegmentedName (procedure,name);
  805. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  806. ir.SetExported(TRUE);
  807. ir.SetPriority(InitPriority);
  808. Global.GetSymbolSegmentedName (bodyProcedure,name);
  809. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  810. implementationVisitor.currentScope := module.module.moduleScope;
  811. implementationVisitor.section := ir;
  812. implementationVisitor.PushSelfPointer();
  813. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  814. ELSIF backend.preregisterStatic THEN
  815. implementationVisitor.currentScope := module.module.moduleScope;
  816. implementationVisitor.section := ir;
  817. implementationVisitor.PushSelfPointer();
  818. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  819. ELSE
  820. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  821. ir.Emit(Call(bodyProcedure.position,op, 0));
  822. END;
  823. END AddBodyCallStub;
  824. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  825. VAR name: Basic.SegmentedName;
  826. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  827. BEGIN
  828. Global.GetSymbolSegmentedName (symbol,name);
  829. Basic.RemoveSuffix(name);
  830. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  831. ir := implementationVisitor.NewSection(module.allSections,Sections.InitCodeSection,name,NIL,dump);
  832. ir.SetExported(TRUE);
  833. ir.SetPriority(FirstPriority);
  834. IntermediateCode.InitImmediate(op,addressType,initStack);
  835. ir.Emit(Mov(-1,implementationVisitor.sp,op));
  836. END AddStackAllocation;
  837. (** entry function to visit a complete module *)
  838. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  839. VAR
  840. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  841. hasDynamicOperatorDeclarations: BOOLEAN;
  842. operator: SyntaxTree.Operator;
  843. import: SyntaxTree.Import;
  844. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  845. BEGIN
  846. type := type.resolved;
  847. IF type IS SyntaxTree.RecordType THEN
  848. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  849. ELSIF (type IS SyntaxTree.ArrayType) THEN
  850. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  851. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  852. END;
  853. ELSIF type IS SyntaxTree.MathArrayType THEN
  854. WITH type: SyntaxTree.MathArrayType DO
  855. IF type.form = SyntaxTree.Open THEN
  856. RETURN TRUE
  857. ELSIF type.form = SyntaxTree.Static THEN
  858. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  859. END;
  860. END;
  861. END;
  862. RETURN FALSE
  863. END TypeNeedsInitialization;
  864. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  865. VAR variable: SyntaxTree.Variable;
  866. BEGIN
  867. variable := scope.firstVariable;
  868. WHILE variable # NIL DO
  869. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  870. IF variable.initializer # NIL THEN RETURN TRUE END;
  871. variable := variable.nextVariable;
  872. END;
  873. RETURN FALSE
  874. END ScopeNeedsInitialization;
  875. BEGIN
  876. ASSERT(x # NIL); ASSERT(module # NIL);
  877. SELF.module := module;
  878. (* add import names to the generated Sections.Module *)
  879. import := x.moduleScope.firstImport;
  880. WHILE import # NIL DO
  881. import.module.GetName(idstr);
  882. module.imports.AddName(idstr);
  883. import := import.nextImport
  884. END;
  885. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  886. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  887. moduleSelf := SyntaxTree.NewVariable(0,SyntaxTree.NewIdentifier("@moduleSelf"));
  888. moduleSelf.SetType(system.anyType);
  889. moduleSelf.SetScope(x.moduleScope);
  890. moduleSelf.SetUntraced(TRUE);
  891. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  892. ir.SetExported(TRUE);
  893. IntermediateCode.InitImmediate(op,addressType,0);
  894. ir.Emit(Data(-1,op));
  895. END;
  896. implementationVisitor.module := module;
  897. implementationVisitor.moduleScope := x.moduleScope;
  898. implementationVisitor.moduleSelf := moduleSelf;
  899. implementationVisitor.canBeLoaded := TRUE;
  900. meta.SetModule(module);
  901. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  902. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  903. END;
  904. IF backend.profile THEN
  905. EnsureBodyProcedure(x.moduleScope);
  906. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  907. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  908. implementationVisitor.profileId.Emit(Reserve(-1,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  909. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  910. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  911. implementationVisitor.EmitEnter(implementationVisitor.profileInit,-1,NIL,0,0,0);
  912. Global.GetModuleName(module.module,idstr);
  913. implementationVisitor.ProfilerAddModule(idstr);
  914. implementationVisitor.numberProcedures := 0;
  915. END;
  916. implementationVisitor.profile := backend.profile;
  917. (* check if there is at least one dynamic operator locally defined *)
  918. hasDynamicOperatorDeclarations := FALSE;
  919. operator := x.moduleScope.firstOperator;
  920. WHILE operator # NIL DO
  921. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  922. operator := operator.nextOperator
  923. END;
  924. (* add operator initialization code section *)
  925. IF hasDynamicOperatorDeclarations THEN
  926. EnsureBodyProcedure(x.moduleScope);
  927. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  928. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  929. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,-1,NIL,0,0,0);
  930. END;
  931. Scope(x.moduleScope);
  932. IF hasDynamicOperatorDeclarations THEN
  933. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,-1,0);
  934. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(-1,0,0));
  935. END;
  936. IF backend.profile THEN
  937. implementationVisitor.ProfilerPatchInit;
  938. END;
  939. END Module;
  940. END DeclarationVisitor;
  941. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  942. RegisterUsageCount*=OBJECT
  943. VAR used: UsedArray; count: LONGINT;
  944. PROCEDURE &Init;
  945. VAR i: LONGINT;
  946. BEGIN
  947. count := 0;
  948. IF used = NIL THEN NEW(used,64); END;
  949. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  950. END Init;
  951. PROCEDURE Grow;
  952. VAR new: UsedArray; size,i: LONGINT;
  953. BEGIN
  954. size := LEN(used)*2;
  955. NEW(new,size);
  956. FOR i := 0 TO LEN(used)-1 DO
  957. new[i].count := used[i].count;
  958. new[i].type := used[i].type;
  959. new[i].map := used[i].map
  960. END;
  961. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  962. used := new
  963. END Grow;
  964. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  965. BEGIN
  966. INC(count);
  967. IF count = LEN(used) THEN Grow END;
  968. used[count].type := type;
  969. used[count].class := class;
  970. used[count].map := count;
  971. RETURN count;
  972. END Next;
  973. PROCEDURE IncUse(register: LONGINT);
  974. BEGIN
  975. INC(used[register].count);
  976. (*
  977. IF (register = 1) & (count > 30) THEN
  978. D.TraceBack;
  979. END;
  980. *)
  981. END IncUse;
  982. PROCEDURE DecUse(register: LONGINT);
  983. BEGIN
  984. DEC(used[register].count);
  985. END DecUse;
  986. PROCEDURE Map(register: LONGINT): LONGINT;
  987. VAR map : LONGINT;
  988. BEGIN
  989. IF register > 0 THEN
  990. map := used[register].map;
  991. WHILE register # map DO register := map; map := used[register].map END;
  992. END;
  993. RETURN register
  994. END Map;
  995. PROCEDURE Use(register: LONGINT): LONGINT;
  996. BEGIN
  997. IF register< LEN(used) THEN
  998. RETURN used[register].count
  999. ELSE
  1000. RETURN 0
  1001. END
  1002. END Use;
  1003. END RegisterUsageCount;
  1004. RegisterEntry = POINTER TO RECORD
  1005. prev,next: RegisterEntry;
  1006. register: LONGINT;
  1007. registerClass: IntermediateCode.RegisterClass;
  1008. type: IntermediateCode.Type;
  1009. END;
  1010. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1011. Variables = OBJECT (Basic.List)
  1012. VAR
  1013. inUse: VariableUse;
  1014. registerIndex: LONGINT;
  1015. PROCEDURE & Init;
  1016. VAR i: LONGINT;
  1017. BEGIN
  1018. InitList(16);
  1019. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1020. registerIndex := 1024;
  1021. END Init;
  1022. PROCEDURE GetUsage(VAR use: VariableUse);
  1023. BEGIN
  1024. use := inUse;
  1025. END GetUsage;
  1026. PROCEDURE SetUsage(CONST use: VariableUse);
  1027. BEGIN
  1028. inUse := use;
  1029. END SetUsage;
  1030. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1031. VAR any: ANY;
  1032. BEGIN
  1033. any := Get(i);;
  1034. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1035. END GetVariable;
  1036. PROCEDURE Occupy(pos: LONGINT);
  1037. BEGIN
  1038. INCL(inUse[pos DIV 32], pos MOD 32);
  1039. END Occupy;
  1040. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1041. BEGIN
  1042. Occupy(Length());
  1043. Add(v);
  1044. END AddVariable;
  1045. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; VAR pos: LONGINT): SyntaxTree.Variable;
  1046. VAR var : SyntaxTree.Variable;
  1047. BEGIN
  1048. FOR pos := 0 TO Length()-1 DO
  1049. IF ~((pos MOD 32) IN inUse[pos DIV 32]) THEN
  1050. var := GetVariable(pos);
  1051. IF type.SameType(var.type) THEN
  1052. Occupy(pos); RETURN var
  1053. END;
  1054. END;
  1055. END;
  1056. pos := Length();
  1057. RETURN NIL
  1058. END GetFreeVariable;
  1059. END Variables;
  1060. SymbolMap = POINTER TO RECORD this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap; END;
  1061. SymbolMapper = OBJECT
  1062. VAR
  1063. first: SymbolMap;
  1064. PROCEDURE & Init;
  1065. BEGIN
  1066. first := NIL;
  1067. END Init;
  1068. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression);
  1069. VAR new: SymbolMap;
  1070. BEGIN
  1071. NEW(new); new.this := this; new.to := to; new.tag := tag;
  1072. new.next := first; first := new;
  1073. END Add;
  1074. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1075. VAR s: SymbolMap;
  1076. BEGIN
  1077. s := first;
  1078. WHILE (s # NIL) & (s.this # this) DO
  1079. s := s.next
  1080. END;
  1081. RETURN s
  1082. END Get;
  1083. END SymbolMapper;
  1084. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1085. VAR
  1086. system: Global.System;
  1087. section: IntermediateCode.Section;
  1088. module: Sections.Module;
  1089. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1090. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1091. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1092. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1093. checker: SemanticChecker.Checker;
  1094. backend: IntermediateBackend;
  1095. meta: MetaDataGenerator;
  1096. position: LONGINT;
  1097. moduleSelf: SyntaxTree.Variable;
  1098. (* variables for hand over of variables / temporary state *)
  1099. currentScope: SyntaxTree.Scope;
  1100. constantDeclaration : SyntaxTree.Symbol;
  1101. result: Operand; (* result of the most recent expression / statement *)
  1102. destination: IntermediateCode.Operand;
  1103. arrayDestinationTag: IntermediateCode.Operand;
  1104. arrayDestinationDimension:LONGINT;
  1105. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1106. conditional: BOOLEAN;
  1107. trueLabel, falseLabel, exitLabel: Label;
  1108. locked: BOOLEAN;
  1109. (*
  1110. usedRegisters: Registers;
  1111. *)
  1112. registerUsageCount: RegisterUsageCount;
  1113. usedRegisters: RegisterEntry;
  1114. (* useful operands and types *)
  1115. nil,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1116. bool,addressType,setType, sizeType, byteType: IntermediateCode.Type;
  1117. commentPrintout: Printout.Printer;
  1118. dump: Streams.Writer;
  1119. tagsAvailable : BOOLEAN;
  1120. supportedInstruction: SupportedInstructionProcedure;
  1121. supportedImmediate: SupportedImmediateProcedure;
  1122. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1123. emitLabels: BOOLEAN;
  1124. runtimeModuleName : SyntaxTree.IdentifierString;
  1125. newObjectFile: BOOLEAN;
  1126. indexCounter: LONGINT;
  1127. profile: BOOLEAN;
  1128. profileId, profileInit: IntermediateCode.Section;
  1129. profileInitPatchPosition: LONGINT;
  1130. numberProcedures: LONGINT;
  1131. procedureResultDesignator : SyntaxTree.Designator;
  1132. operatorInitializationCodeSection: IntermediateCode.Section;
  1133. fingerPrinter: FingerPrinter.FingerPrinter;
  1134. temporaries: Variables;
  1135. canBeLoaded : BOOLEAN;
  1136. currentIsInline: BOOLEAN;
  1137. currentMapper: SymbolMapper;
  1138. currentInlineExit: Label;
  1139. moduleBodySection: IntermediateCode.Section;
  1140. NeedDescriptor : BOOLEAN;
  1141. cooperativeSwitches: BOOLEAN;
  1142. lastSwitchPC: LONGINT;
  1143. isUnchecked: BOOLEAN;
  1144. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1145. newObjectFile: BOOLEAN);
  1146. BEGIN
  1147. SELF.system := system;
  1148. SELF.runtimeModuleName := runtime;
  1149. currentScope := NIL;
  1150. hiddenPointerType := NIL;
  1151. delegatePointerType := NIL;
  1152. awaitProcCounter := 0;
  1153. labelId := 0; constId := 0; labelId := 0;
  1154. SELF.checker := checker;
  1155. SELF.backend := backend;
  1156. position := Diagnostics.Invalid;
  1157. conditional := FALSE;
  1158. locked := FALSE;
  1159. InitOperand(result,ModeUndefined);
  1160. addressType := IntermediateCode.GetType(system,system.addressType);
  1161. setType := IntermediateCode.GetType(system,system.setType);
  1162. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1163. byteType := IntermediateCode.GetType(system, system.byteType);
  1164. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1165. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1166. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1167. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1168. nil := IntermediateCode.Immediate(addressType,0);
  1169. IntermediateCode.InitOperand(destination);
  1170. tagsAvailable := TRUE;
  1171. supportedInstruction := supportedInstructionProcedure;
  1172. supportedImmediate := supportedImmediateProcedure;
  1173. inData := FALSE;
  1174. SELF.emitLabels := emitLabels;
  1175. IntermediateCode.InitOperand(arrayDestinationTag);
  1176. bool := IntermediateCode.GetType(system,system.booleanType);
  1177. IntermediateCode.InitImmediate(false,bool,0);
  1178. IntermediateCode.InitImmediate(true,bool,1);
  1179. SELF.newObjectFile := newObjectFile;
  1180. indexCounter := 0;
  1181. NEW(registerUsageCount);
  1182. usedRegisters := NIL;
  1183. procedureResultDesignator := NIL;
  1184. NEW(fingerPrinter, system);
  1185. NEW(temporaries);
  1186. currentIsInline := FALSE;
  1187. NeedDescriptor := FALSE;
  1188. isUnchecked := backend.noRuntimeChecks;
  1189. END Init;
  1190. TYPE Context = RECORD
  1191. section: IntermediateCode.Section;
  1192. registerUsageCount: RegisterUsageCount;
  1193. usedRegisters: RegisterEntry;
  1194. END;
  1195. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1196. VAR context: Context;
  1197. BEGIN
  1198. context.section := section;
  1199. context.registerUsageCount := registerUsageCount;
  1200. context.usedRegisters := usedRegisters;
  1201. section := new;
  1202. NEW(registerUsageCount);
  1203. usedRegisters := NIL;
  1204. RETURN context;
  1205. END SwitchContext;
  1206. PROCEDURE ReturnToContext(context: Context);
  1207. BEGIN
  1208. section := context.section;
  1209. registerUsageCount := context.registerUsageCount;
  1210. usedRegisters := context.usedRegisters;
  1211. END ReturnToContext;
  1212. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1213. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1214. BEGIN
  1215. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1216. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1217. END;
  1218. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1219. section.SetExported(IsExported(syntaxTreeSymbol));
  1220. RETURN section
  1221. END NewSection;
  1222. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1223. VAR new: LONGINT;
  1224. BEGIN
  1225. new := registerUsageCount.Next(type,class);
  1226. UseRegister(new);
  1227. RETURN new
  1228. END AcquireRegister;
  1229. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1230. VAR
  1231. fingerPrint: SyntaxTree.FingerPrint;
  1232. fingerPrintString: ARRAY 32 OF CHAR;
  1233. BEGIN
  1234. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1235. string := "[";
  1236. Strings.IntToHexStr(fingerPrint.shallow, 8, fingerPrintString);
  1237. Strings.Append(string, fingerPrintString);
  1238. Strings.Append(string, "]");
  1239. END GetFingerprintString;
  1240. (** get the name for the code section that represens a certain symbol
  1241. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1242. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1243. VAR string: ARRAY 32 OF CHAR;
  1244. BEGIN
  1245. Global.GetSymbolSegmentedName(symbol, name);
  1246. (* if the symbol is an operator, then append the fingerprint to the name *)
  1247. IF symbol IS SyntaxTree.Operator THEN
  1248. GetFingerprintString(symbol, string);
  1249. Basic.AppendToSegmentedName(name,string);
  1250. END
  1251. END GetCodeSectionNameForSymbol;
  1252. (** get the name for the code section that represens a certain symbol
  1253. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1254. PROCEDURE GetCodeSectionNameForSymbolInScope(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope; VAR name: ARRAY OF CHAR);
  1255. VAR string: ARRAY 32 OF CHAR;
  1256. BEGIN
  1257. Global.GetSymbolNameInScope(symbol, scope, name);
  1258. (* if the symbol is an operator, then append the fingerprint to the name *)
  1259. IF symbol IS SyntaxTree.Operator THEN
  1260. GetFingerprintString(symbol, string);
  1261. Strings.Append(name, string);
  1262. END
  1263. END GetCodeSectionNameForSymbolInScope;
  1264. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1265. BEGIN
  1266. IF dump # NIL THEN
  1267. dump.String("enter "); dump.String(s); dump.Ln;
  1268. END;
  1269. END TraceEnter;
  1270. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1271. BEGIN
  1272. IF dump # NIL THEN
  1273. dump.String("exit "); dump.String(s); dump.Ln;
  1274. END;
  1275. END TraceExit;
  1276. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1277. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1278. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1279. VAR i: LONGINT;
  1280. BEGIN
  1281. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1282. IF op.rule # NIL THEN
  1283. FOR i := 0 TO LEN(op.rule)-1 DO
  1284. CheckRegister(op.rule[i])
  1285. END;
  1286. END;
  1287. END CheckRegister;
  1288. BEGIN
  1289. CheckRegister(instruction.op1);
  1290. CheckRegister(instruction.op2);
  1291. CheckRegister(instruction.op3);
  1292. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1293. ELSE section.Emit(instruction);
  1294. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1295. END;
  1296. END Emit;
  1297. PROCEDURE EmitTrap (position, trapNo: LONGINT);
  1298. BEGIN
  1299. IF backend.cooperative THEN
  1300. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1301. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1302. ELSE
  1303. Emit(Trap(position,trapNo));
  1304. END;
  1305. END EmitTrap;
  1306. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: LONGINT; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1307. VAR name: Basic.SegmentedName;
  1308. VAR op1, op2, reg: IntermediateCode.Operand;
  1309. VAR call, nocall: Label;
  1310. VAR parametersSize: LONGINT;
  1311. VAR prevSection: IntermediateCode.Section;
  1312. VAR prevDump: Streams.Writer;
  1313. VAR body: SyntaxTree.Body;
  1314. BEGIN
  1315. ASSERT((procedure = NIL) OR ~procedure.type(SyntaxTree.ProcedureType).noPAF);
  1316. prevSection := SELF.section;
  1317. SELF.section := section;
  1318. prevDump := dump;
  1319. dump := section.comments;
  1320. IF backend.hasLinkRegister THEN
  1321. Emit(Push(-1, lr));
  1322. END;
  1323. Emit(Push(-1,fp));
  1324. IF backend.cooperative & (callconv = SyntaxTree.OberonCallingConvention) THEN
  1325. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1326. GetCodeSectionNameForSymbol(procedure, name);
  1327. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  1328. ELSE
  1329. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1330. END;
  1331. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1332. Emit(Push(-1,op1));
  1333. Emit(Mov(-1,fp, sp));
  1334. body := procedure.procedureScope.body;
  1335. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1336. NEW(call, section);
  1337. NEW(nocall, section);
  1338. reg := NewRegisterOperand(addressType);
  1339. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1340. Emit(Sub(-1,reg, sp, op1));
  1341. BrltL(call, sp, reg);
  1342. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1343. BrgeL(nocall, sp, op2);
  1344. call.Resolve(section.pc);
  1345. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1346. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1347. Emit(Push(-1, op2));
  1348. Emit(Push(-1, reg));
  1349. ReleaseIntermediateOperand(reg);
  1350. CallThis(position, "Activities","ExpandStack",2);
  1351. Emit(Result(-1, sp));
  1352. nocall.Resolve(section.pc);
  1353. END;
  1354. ELSE
  1355. Emit(Mov(-1, fp, sp));
  1356. END;
  1357. Emit(Enter(-1, callconv, varSize));
  1358. SELF.section := prevSection;
  1359. dump := prevDump;
  1360. END EmitEnter;
  1361. PROCEDURE Enter(position: LONGINT; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1362. VAR op1,op2: IntermediateCode.Operand;
  1363. VAR instruction: IntermediateCode.Instruction;
  1364. BEGIN
  1365. IntermediateCode.InitNumber(op1,callconv);
  1366. IntermediateCode.InitNumber(op2,varSize);
  1367. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1368. RETURN instruction
  1369. END Enter;
  1370. PROCEDURE Leave(position: LONGINT; callconv: LONGINT): IntermediateCode.Instruction;
  1371. VAR op1: IntermediateCode.Operand;
  1372. VAR instruction: IntermediateCode.Instruction;
  1373. BEGIN
  1374. IntermediateCode.InitNumber(op1,callconv);
  1375. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1376. RETURN instruction
  1377. END Leave;
  1378. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: LONGINT; callconv: LONGINT);
  1379. VAR prevSection: IntermediateCode.Section;
  1380. VAR op2: IntermediateCode.Operand;
  1381. BEGIN
  1382. prevSection := SELF.section;
  1383. SELF.section := section;
  1384. Emit(Leave(position, callconv));
  1385. IF backend.cooperative THEN
  1386. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1387. Emit(Add(position, sp, fp, op2));
  1388. ELSE
  1389. Emit(Mov(position, sp, fp));
  1390. END;
  1391. Emit(Pop(position, fp));
  1392. SELF.section := prevSection;
  1393. END EmitLeave;
  1394. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1395. VAR m: SymbolMap;
  1396. BEGIN
  1397. position := x.position;
  1398. IF currentIsInline THEN
  1399. m := currentMapper.Get(x);
  1400. IF m # NIL THEN
  1401. (*
  1402. Printout.Info("mapping from", x);
  1403. Printout.Info("mapping to ", m.to);
  1404. *)
  1405. m.to.Accept(SELF);
  1406. op := result;
  1407. IF m.tag # NIL THEN
  1408. ReleaseIntermediateOperand(result.tag);
  1409. m.tag.Accept(SELF);
  1410. op.tag := result.op;
  1411. ReleaseIntermediateOperand(result.tag);
  1412. END;
  1413. RETURN
  1414. END;
  1415. END;
  1416. x.Accept(SELF);
  1417. op := result;
  1418. END Symbol;
  1419. PROCEDURE Expression(x: SyntaxTree.Expression);
  1420. BEGIN
  1421. position := x.position;
  1422. constantDeclaration := NIL;
  1423. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1424. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1425. END;
  1426. IF x.resolved # NIL THEN
  1427. x.resolved.Accept(SELF)
  1428. ELSE
  1429. x.Accept(SELF)
  1430. END;
  1431. (* check this, was commented out in ActiveCells3 *)
  1432. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1433. Error(x.position, "unsupported modifier");
  1434. END;
  1435. END Expression;
  1436. (*
  1437. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1438. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1439. BEGIN
  1440. temporaries.GetUsage(current);
  1441. FOR i := 0 TO LEN(current)-1 DO
  1442. set := current[i] - previous[i];
  1443. IF set # {} THEN
  1444. FOR j := 0 TO MAX(SET)-1 DO
  1445. IF j IN set THEN
  1446. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1447. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1448. Symbol(variable, op);
  1449. MakeMemory(tmp,op.op,addressType,0);
  1450. ReleaseOperand(op);
  1451. Emit(Mov(position,tmp, nil ) );
  1452. ReleaseIntermediateOperand(tmp);
  1453. END;
  1454. END;
  1455. END;
  1456. END;
  1457. END;
  1458. END ResetUsedTemporaries;
  1459. *)
  1460. PROCEDURE Statement(x: SyntaxTree.Statement);
  1461. VAR use: VariableUse;
  1462. BEGIN
  1463. temporaries.GetUsage(use);
  1464. position := x.position;
  1465. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1466. IF commentPrintout # NIL THEN
  1467. commentPrintout.Statement(x);
  1468. dump.Ln;
  1469. (*dump.Update;*)
  1470. END;
  1471. x.Accept(SELF);
  1472. (*
  1473. CheckRegistersFree();
  1474. *)
  1475. (*ResetUsedTemporaries(use);*)
  1476. temporaries.SetUsage(use);
  1477. END Statement;
  1478. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1479. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1480. *)
  1481. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1482. BEGIN
  1483. IF op.mode = IntermediateCode.ModeMemory THEN
  1484. ReuseCopy(res,op);
  1485. ELSE
  1486. res := op;
  1487. UseIntermediateOperand(res);
  1488. END;
  1489. IntermediateCode.AddOffset(res,offset);
  1490. IntermediateCode.MakeMemory(res,type);
  1491. END MakeMemory;
  1492. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1493. VAR mem: IntermediateCode.Operand;
  1494. BEGIN
  1495. MakeMemory(mem,res,type,offset);
  1496. ReleaseIntermediateOperand(res);
  1497. res := mem;
  1498. END ToMemory;
  1499. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1500. VAR mem: IntermediateCode.Operand;
  1501. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1502. componentType: SyntaxTree.Type;
  1503. BEGIN
  1504. type := type.resolved;
  1505. IF operand.mode = ModeReference THEN
  1506. IF type IS SyntaxTree.RangeType THEN
  1507. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.longintType), 0);
  1508. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1509. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1510. ReleaseOperand(operand);
  1511. operand.op := firstOp;
  1512. operand.tag := lastOp;
  1513. operand.extra := stepOp;
  1514. ELSIF type IS SyntaxTree.ComplexType THEN
  1515. componentType := type(SyntaxTree.ComplexType).componentType;
  1516. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1517. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1518. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1519. ReleaseOperand(operand);
  1520. operand.op := firstOp;
  1521. operand.tag := lastOp
  1522. ELSE
  1523. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1524. ReleaseIntermediateOperand(operand.op);
  1525. operand.op := mem;
  1526. END;
  1527. operand.mode := ModeValue;
  1528. END;
  1529. ASSERT(operand.mode = ModeValue);
  1530. END LoadValue;
  1531. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1532. VAR prevConditional: BOOLEAN;
  1533. BEGIN
  1534. prevConditional := conditional;
  1535. conditional := FALSE;
  1536. InitOperand(result, ModeUndefined);
  1537. Expression(x);
  1538. op := result;
  1539. LoadValue(op,x.type.resolved);
  1540. conditional := prevConditional;
  1541. END Evaluate;
  1542. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1543. VAR prevConditional: BOOLEAN;
  1544. BEGIN
  1545. prevConditional := conditional;
  1546. conditional := FALSE;
  1547. InitOperand(result,ModeUndefined);
  1548. Expression(x);
  1549. op := result;
  1550. (*
  1551. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1552. *)
  1553. conditional := prevConditional;
  1554. END Designate;
  1555. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1556. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1557. BEGIN
  1558. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1559. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1560. conditional := TRUE;
  1561. trueLabel := trueL; falseLabel := falseL;
  1562. Expression(x);
  1563. trueL := trueLabel; falseL := falseLabel;
  1564. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1565. END Condition;
  1566. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1567. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1568. BEGIN
  1569. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1570. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1571. RETURN op
  1572. END NewRegisterOperand;
  1573. PROCEDURE UnuseRegister(register: LONGINT);
  1574. BEGIN
  1575. IF (register > 0) THEN
  1576. register := registerUsageCount.Map(register);
  1577. registerUsageCount.DecUse(register);
  1578. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1579. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1580. END;
  1581. IF registerUsageCount.Use(register)=0 THEN
  1582. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1583. Warning(position, "register cannot be removed");
  1584. END;
  1585. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1586. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1587. END;
  1588. ELSIF registerUsageCount.Use(register)<0 THEN
  1589. Warning(position, "register removed too often");
  1590. IF dump # NIL THEN
  1591. dump.String("register removed too often"); dump.Ln; dump.Update;
  1592. END;
  1593. D.TraceBack;
  1594. END;
  1595. END;
  1596. END UnuseRegister;
  1597. PROCEDURE UseRegister(register: LONGINT);
  1598. BEGIN
  1599. IF (register > 0) THEN
  1600. register := registerUsageCount.Map(register);
  1601. registerUsageCount.IncUse(register);
  1602. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1603. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1604. END;
  1605. IF registerUsageCount.Use(register)=1 THEN
  1606. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1607. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1608. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1609. END;
  1610. END;
  1611. END;
  1612. END UseRegister;
  1613. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1614. BEGIN
  1615. UnuseRegister(op.register)
  1616. END ReleaseIntermediateOperand;
  1617. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1618. BEGIN
  1619. UseRegister(op.register)
  1620. END UseIntermediateOperand;
  1621. PROCEDURE ReleaseOperand(CONST op: Operand);
  1622. BEGIN
  1623. UnuseRegister(op.op.register);
  1624. UnuseRegister(op.tag.register);
  1625. UnuseRegister(op.extra.register);
  1626. END ReleaseOperand;
  1627. (* save registers marked in array "markedRegisters" to the stack
  1628. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1629. *)
  1630. PROCEDURE SaveRegisters();
  1631. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1632. BEGIN
  1633. entry := usedRegisters;
  1634. WHILE entry # NIL DO
  1635. type := registerUsageCount.used[entry.register].type;
  1636. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1637. Emit(Push(position,op));
  1638. entry := entry.next;
  1639. END;
  1640. END SaveRegisters;
  1641. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1642. BEGIN
  1643. saved := usedRegisters;
  1644. usedRegisters := NIL;
  1645. END ReleaseUsedRegisters;
  1646. (** remove parameter registers from used queue *)
  1647. PROCEDURE ReleaseParameterRegisters;
  1648. VAR entry,prev,next: RegisterEntry;
  1649. BEGIN
  1650. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1651. WHILE entry # NIL DO
  1652. next := entry.next;
  1653. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1654. registerUsageCount.DecUse(entry.register);
  1655. ASSERT(registerUsageCount.Use(entry.register)=0);
  1656. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1657. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1658. END;
  1659. ELSIF prev = NIL THEN
  1660. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1661. ELSE
  1662. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1663. END;
  1664. entry := next;
  1665. END;
  1666. END ReleaseParameterRegisters;
  1667. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1668. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1669. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1670. BEGIN
  1671. entry := saved;
  1672. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1673. entry := prev;
  1674. WHILE entry # NIL DO
  1675. prev := entry.prev;
  1676. type := entry.type;
  1677. class := entry.registerClass;
  1678. IntermediateCode.InitRegister(op,type,class,entry.register);
  1679. (*
  1680. new := registerUsageCount.Next(type,class);
  1681. registerUsageCount.Remap(entry.register,new);
  1682. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1683. dump.String("remap register "); dump.Int(entry.register,1);
  1684. dump.String("to "); dump.Int(new,1);
  1685. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1686. END;
  1687. entry.register := new;
  1688. *)
  1689. Emit(Pop(position,op));
  1690. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1691. entry := prev;
  1692. END;
  1693. (*
  1694. usedRegisters := saved;
  1695. *)
  1696. END RestoreRegisters;
  1697. PROCEDURE CheckRegistersFree;
  1698. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1699. BEGIN
  1700. IF usedRegisters # NIL THEN
  1701. r := usedRegisters;
  1702. WHILE r # NIL DO
  1703. warning := "register ";
  1704. Strings.AppendInt(warning, r.register);
  1705. Strings.Append(warning, " not released.");
  1706. Warning(position,warning);
  1707. r := r .next;
  1708. END;
  1709. END;
  1710. FOR i := 0 TO registerUsageCount.count-1 DO
  1711. IF registerUsageCount.used[i].count < 0 THEN
  1712. warning := "register ";
  1713. Strings.AppendInt(warning, i);
  1714. Strings.Append(warning, " unused too often.");
  1715. Warning(position,warning);
  1716. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1717. warning := "register ";
  1718. Strings.AppendInt(warning, i);
  1719. Strings.Append(warning, " not unused often enough.");
  1720. Warning(position,warning);
  1721. END;
  1722. END;
  1723. END CheckRegistersFree;
  1724. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1725. Otherwise allocate a new register.
  1726. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1727. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1728. BEGIN
  1729. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1730. UseIntermediateOperand(result);
  1731. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1732. UseIntermediateOperand(result);
  1733. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1734. END;
  1735. END Reuse2;
  1736. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1737. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1738. If not then allocate a new register.
  1739. Does NOT necessarily keep the content of src1 or src2 in result!
  1740. *)
  1741. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1742. BEGIN
  1743. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1744. UseIntermediateOperand(result);
  1745. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1746. UseIntermediateOperand(result);
  1747. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1748. result := alternative; alternative := emptyOperand;
  1749. UseIntermediateOperand(result);
  1750. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1751. END;
  1752. END Reuse2a;
  1753. (* like reuse2 but only one source *)
  1754. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1755. BEGIN
  1756. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1757. UseIntermediateOperand(result);
  1758. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1759. END;
  1760. END Reuse1;
  1761. (* like reuse2a but only one source *)
  1762. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1763. BEGIN
  1764. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1765. UseIntermediateOperand(result);
  1766. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1767. UseIntermediateOperand(result);
  1768. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1769. END;
  1770. END Reuse1a;
  1771. (* like reuse1 but guarantees that content of src1 is in result *)
  1772. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1773. BEGIN
  1774. IF ReusableRegister(src1) THEN
  1775. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1776. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1777. UseIntermediateOperand(result);
  1778. ELSE
  1779. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1780. Emit(Mov(position,result,src1));
  1781. END
  1782. END ReuseCopy;
  1783. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1784. BEGIN
  1785. IF ReusableRegister(src) THEN
  1786. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1787. ELSE
  1788. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1789. Emit(Mov(position,result,src));
  1790. ReleaseIntermediateOperand(src);
  1791. END
  1792. END TransferToRegister;
  1793. (** labels and branches **)
  1794. PROCEDURE NewLabel(): Label;
  1795. VAR label: Label;
  1796. BEGIN
  1797. NEW(label,section); RETURN label;
  1798. END NewLabel;
  1799. PROCEDURE SetLabel(label: Label);
  1800. BEGIN label.Resolve(section.pc);
  1801. END SetLabel;
  1802. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1803. BEGIN
  1804. ASSERT(label # NIL);
  1805. IF label.pc < 0 THEN (* label not yet set *)
  1806. label.AddFixup(section.pc);
  1807. END;
  1808. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1809. END LabelOperand;
  1810. PROCEDURE BrL(label: Label);
  1811. BEGIN
  1812. Emit(Br(position,LabelOperand(label)));
  1813. END BrL;
  1814. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1815. BEGIN
  1816. Emit(Brge(position,LabelOperand(label),left,right));
  1817. END BrgeL;
  1818. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1819. BEGIN
  1820. Emit(Brlt(position,LabelOperand(label),left,right));
  1821. END BrltL;
  1822. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1823. BEGIN
  1824. Emit(Breq(position,LabelOperand(label),left,right));
  1825. END BreqL;
  1826. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1827. BEGIN
  1828. Emit(Brne(position,LabelOperand(label),left,right));
  1829. END BrneL;
  1830. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1831. VAR new: IntermediateCode.Operand;
  1832. BEGIN
  1833. IF Trace THEN TraceEnter("Convert") END;
  1834. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1835. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1836. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1837. & (operand.offset = 0)
  1838. THEN
  1839. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1840. Emit(Conv(position,new,operand));
  1841. ELSE
  1842. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1843. Emit(Conv(position,new,operand));
  1844. ReleaseIntermediateOperand(operand);
  1845. END;
  1846. operand := new;
  1847. ELSIF (operand.mode = IntermediateCode.ModeImmediate) & (operand.symbol.name = "") & (operand.type.sizeInBits <= type.sizeInBits) & (operand.type.form IN IntermediateCode.Integer) & (type.form IN IntermediateCode.Integer) THEN
  1848. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1849. ELSE
  1850. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1851. Emit(Conv(position,new,operand));
  1852. ReleaseIntermediateOperand(operand);
  1853. operand := new;
  1854. END;
  1855. IF Trace THEN TraceExit("Convert") END;
  1856. END Convert;
  1857. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1858. VAR exit: Label;
  1859. BEGIN
  1860. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1861. exit := NewLabel();
  1862. br(exit,left,right);
  1863. EmitTrap(position,trapNo);
  1864. SetLabel(exit);
  1865. END TrapC;
  1866. (** expressions *)
  1867. (** emit necessary runtime check for set elements **)
  1868. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1869. VAR max: IntermediateCode.Operand;
  1870. BEGIN
  1871. IF isUnchecked THEN RETURN END;
  1872. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1873. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1874. TrapC(BrgeL, max, o, SetElementTrap);
  1875. END;
  1876. END CheckSetElement;
  1877. (** the set that a range represents **)
  1878. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1879. VAR
  1880. operand: Operand;
  1881. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1882. BEGIN
  1883. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1884. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1885. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1886. one := IntermediateCode.Immediate(setType, 1);
  1887. Evaluate(x, operand);
  1888. Convert(operand.op, setType);
  1889. Convert(operand.tag, setType);
  1890. CheckSetElement(operand.op);
  1891. CheckSetElement(operand.tag);
  1892. (* create mask for lower bound
  1893. i.e. shift 11111111 to the left by the value of the lower bound
  1894. *)
  1895. Reuse1(temp, operand.op);
  1896. Emit(Shl(position,temp, allBits, operand.op));
  1897. ReleaseIntermediateOperand(operand.op);
  1898. operand.op := temp;
  1899. (* create mask for upper bound
  1900. i.e. shift 11111111 to the right by the difference between the
  1901. upper bound and the maximum number of set elements
  1902. *)
  1903. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1904. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1905. Reuse1(temp, operand.tag);
  1906. ELSE
  1907. Reuse1(temp, operand.tag);
  1908. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1909. Emit(Sub(position,temp, size, operand.tag));
  1910. END;
  1911. Emit(Shr(position,temp, allBits, operand.tag));
  1912. ReleaseIntermediateOperand(operand.tag);
  1913. operand.tag := temp;
  1914. Reuse2(resultingSet, operand.op, operand.tag);
  1915. (* intersect the two masks *)
  1916. Emit(And(position,resultingSet, operand.op, operand.tag));
  1917. ReleaseOperand(operand);
  1918. RETURN resultingSet
  1919. END SetFromRange;
  1920. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1921. VAR
  1922. res, operand: Operand;
  1923. temp, one, noBits, dest: IntermediateCode.Operand;
  1924. expression: SyntaxTree.Expression;
  1925. i: LONGINT;
  1926. BEGIN
  1927. IF Trace THEN TraceEnter("VisitSet") END;
  1928. dest := destination;
  1929. destination := emptyOperand;
  1930. noBits := IntermediateCode.Immediate(setType, 0);
  1931. one := IntermediateCode.Immediate(setType, 1);
  1932. (* start off with the empty set *)
  1933. InitOperand(res, ModeValue);
  1934. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1935. Emit(Mov(position,res.op, noBits));
  1936. FOR i := 0 TO x.elements.Length() - 1 DO
  1937. expression := x.elements.GetExpression(i);
  1938. IF expression IS SyntaxTree.RangeExpression THEN
  1939. (* range of set elements *)
  1940. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  1941. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  1942. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1943. ReleaseIntermediateOperand(temp)
  1944. ELSE
  1945. (* singelton element *)
  1946. Evaluate(expression, operand);
  1947. Convert(operand.op, setType);
  1948. CheckSetElement(operand.op);
  1949. (* create subset containing single element *)
  1950. Reuse1(temp, operand.op);
  1951. Emit(Shl(position,temp, one, operand.op));
  1952. ReleaseOperand(operand);
  1953. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1954. ReleaseIntermediateOperand(temp);
  1955. END
  1956. END;
  1957. result := res;
  1958. destination := dest;
  1959. IF Trace THEN TraceExit("VisitSet") END;
  1960. END VisitSet;
  1961. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  1962. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  1963. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  1964. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  1965. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  1966. element: SyntaxTree.IntegerValue;
  1967. BEGIN
  1968. numberElements := x.elements.Length();
  1969. expression := index.parameters.GetExpression(dim);
  1970. element := expression(SyntaxTree.IntegerValue);
  1971. FOR i := 0 TO numberElements-1 DO
  1972. expression := x.elements.GetExpression(i);
  1973. element.SetValue(i);
  1974. IF expression IS SyntaxTree.MathArrayExpression THEN
  1975. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  1976. ELSE
  1977. Assign(index,expression);
  1978. END;
  1979. END;
  1980. END RecursiveAssignment;
  1981. BEGIN
  1982. variable := GetTemporaryVariable(x.type, FALSE);
  1983. designator := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  1984. designator.SetType(variable.type);
  1985. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  1986. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  1987. FOR i := 0 TO dim-1 DO
  1988. element := SyntaxTree.NewIntegerValue(x.position,0);
  1989. element.SetType(system.longintType);
  1990. index.parameters.AddExpression(element);
  1991. END;
  1992. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  1993. RecursiveAssignment(x,0);
  1994. Expression(designator);
  1995. END VisitMathArrayExpression;
  1996. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  1997. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1998. BEGIN
  1999. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2000. dest := destination; destination := emptyOperand;
  2001. IF x.operator = Scanner.Not THEN
  2002. IF conditional THEN
  2003. Condition(x.left,falseLabel,trueLabel)
  2004. ELSE
  2005. Evaluate(x.left,operand);
  2006. InitOperand(result,ModeValue);
  2007. Reuse1a(result.op,operand.op,dest);
  2008. Emit(Xor(position,result.op,operand.op,true));
  2009. ReleaseOperand(operand);
  2010. END;
  2011. ELSIF x.operator = Scanner.Minus THEN
  2012. Evaluate(x.left,operand);
  2013. InitOperand(result,ModeValue);
  2014. Reuse1a(result.op,operand.op,dest);
  2015. type := x.left.type.resolved;
  2016. IF type IS SyntaxTree.SetType THEN
  2017. Emit(Not(position,result.op,operand.op));
  2018. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2019. Reuse1(result.tag,operand.tag);
  2020. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2021. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2022. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2023. Emit(Neg(position,result.op,operand.op));
  2024. ELSE HALT(200)
  2025. END;
  2026. ReleaseOperand(operand);
  2027. ELSIF x.operator = Scanner.Address THEN
  2028. Designate(x.left,operand);
  2029. operand.mode := ModeValue;
  2030. t0 := x.left.type.resolved;
  2031. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2032. ReleaseIntermediateOperand(operand.op);
  2033. operand.op := operand.tag;
  2034. IntermediateCode.InitOperand(operand.tag);
  2035. END;
  2036. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2037. result := operand;
  2038. ELSE HALT(100)
  2039. END;
  2040. destination := dest;
  2041. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2042. END VisitUnaryExpression;
  2043. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2044. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2045. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2046. BEGIN
  2047. type := type.resolved;
  2048. originalType := type;
  2049. IF type IS SyntaxTree.PointerType THEN
  2050. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2051. END;
  2052. IF type IS SyntaxTree.ObjectType THEN
  2053. BrL(trueL);
  2054. ELSE
  2055. ASSERT(type IS SyntaxTree.RecordType);
  2056. (*
  2057. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2058. *)
  2059. ReuseCopy(left,tag);
  2060. right := TypeDescriptorAdr(type);
  2061. IF ~newObjectFile THEN
  2062. IntermediateCode.MakeMemory(right,addressType);
  2063. END;
  2064. IF backend.cooperative THEN
  2065. repeatL := NewLabel();
  2066. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2067. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2068. END;
  2069. SetLabel(repeatL);
  2070. BreqL(trueL,left,right);
  2071. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2072. BrneL(repeatL,left,nil);
  2073. ELSIF meta.simple THEN
  2074. level := type(SyntaxTree.RecordType).Level();
  2075. (* get type desc tag of level relative to base tag *)
  2076. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2077. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2078. IntermediateCode.MakeMemory(left,addressType);
  2079. BreqL(trueL,left,right);
  2080. ELSE
  2081. level := type(SyntaxTree.RecordType).Level();
  2082. (* get type desc tag of level relative to base tag *)
  2083. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2084. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2085. IntermediateCode.MakeMemory(left,addressType);
  2086. BreqL(trueL,left,right);
  2087. END;
  2088. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2089. BrL(falseL);
  2090. END;
  2091. END TypeTest;
  2092. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  2093. BEGIN
  2094. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  2095. IF dump # NIL THEN
  2096. dump.String(s); dump.Ln;
  2097. END;
  2098. END Error;
  2099. PROCEDURE Warning(position: LONGINT; CONST s: ARRAY OF CHAR);
  2100. BEGIN
  2101. backend.diagnostics.Warning(module.module.sourceName,position,Diagnostics.Invalid,s);
  2102. IF dump # NIL THEN
  2103. dump.String(s); dump.Ln; dump.Update;
  2104. END;
  2105. END Warning;
  2106. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2107. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2108. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2109. operand:Operand;
  2110. BEGIN
  2111. previousSection := section;
  2112. Global.GetModuleName(mod,name);
  2113. Strings.Append(name,".@Trace");
  2114. Basic.ToSegmentedName(name, pooledName);
  2115. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2116. IF dump # NIL THEN dump := section.comments END;
  2117. IF backend.hasLinkRegister THEN
  2118. Emit(Push(-1, lr));
  2119. END;
  2120. variable := mod.moduleScope.firstVariable;
  2121. WHILE variable # NIL DO
  2122. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2123. Symbol(variable, operand);
  2124. register := operand.op;
  2125. CallTraceMethod(register, variable.type);
  2126. ReleaseIntermediateOperand(register);
  2127. END;
  2128. variable := variable.nextVariable;
  2129. END;
  2130. IF backend.hasLinkRegister THEN
  2131. Emit(Pop(-1, lr));
  2132. END;
  2133. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2134. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2135. Emit(Br(position,op));
  2136. INC(statCoopTraceModule, section.pc);
  2137. section := previousSection;
  2138. IF dump # NIL THEN dump := section.comments END;
  2139. END CreateTraceModuleMethod;
  2140. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2141. BEGIN
  2142. Emit (Push(position, dst));
  2143. Emit (Push(position, src));
  2144. CallThis(position,"GarbageCollector","Assign", 2);
  2145. END CallAssignPointer;
  2146. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2147. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2148. BEGIN
  2149. IF SemanticChecker.IsPointerType (type) THEN
  2150. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2151. ELSIF type.IsRecordType() THEN
  2152. Emit (Push(position,dst));
  2153. Emit (Push(position,src));
  2154. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2155. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2156. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2157. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2158. ELSIF IsStaticArray(type) THEN
  2159. size := StaticArrayNumElements(type);
  2160. base := StaticArrayBaseType(type);
  2161. IF base.IsRecordType() THEN
  2162. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2163. Emit (Push(position, dst));
  2164. Emit (Push(position, src));
  2165. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2166. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2167. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2168. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2169. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2170. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2171. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2172. Emit (Push(position, dst));
  2173. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2174. Emit (Push(position, src));
  2175. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2176. ELSE
  2177. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2178. Emit (Push(position, dst));
  2179. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2180. Emit (Push(position, src));
  2181. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2182. ASSERT(StaticArrayBaseType(type).IsPointer());
  2183. END;
  2184. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2185. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2186. Emit (Push(position, dst));
  2187. Emit (Push(position, src));
  2188. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2189. ELSE HALT(100); (* missing ? *)
  2190. END;
  2191. END CallAssignMethod;
  2192. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2193. VAR name: Basic.SegmentedName;
  2194. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2195. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2196. context: Context;
  2197. BEGIN
  2198. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2199. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2200. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2201. GetRecordTypeName (recordType,name);
  2202. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2203. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2204. IF dump # NIL THEN dump := section.comments END;
  2205. IF backend.hasLinkRegister THEN
  2206. Emit(Push(-1, lr));
  2207. END;
  2208. variable := recordType.recordScope.firstVariable;
  2209. WHILE variable # NIL DO
  2210. IF variable.NeedsTrace() THEN
  2211. dst := NewRegisterOperand (addressType);
  2212. src := NewRegisterOperand (addressType);
  2213. Emit (Mov(position, dst, parameter1));
  2214. Emit (Mov(position, src, parameter2));
  2215. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2216. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2217. CallAssignMethod(dst, src, variable.type);
  2218. ReleaseIntermediateOperand(src);
  2219. ReleaseIntermediateOperand(dst);
  2220. END;
  2221. variable := variable.nextVariable;
  2222. END;
  2223. recordBase := recordType.GetBaseRecord();
  2224. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2225. IF backend.hasLinkRegister THEN
  2226. Emit(Pop(-1, lr));
  2227. END;
  2228. GetRecordTypeName (recordBase,name);
  2229. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2230. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2231. Emit(Br(position,op));
  2232. ELSE
  2233. Emit(Exit(position,0,0));
  2234. END;
  2235. IF ~recordType.isObject THEN
  2236. GetRecordTypeName (recordType,name);
  2237. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2238. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2239. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2240. NEW(registerUsageCount);
  2241. usedRegisters := NIL;
  2242. dst := NewRegisterOperand (addressType);
  2243. src := NewRegisterOperand (addressType);
  2244. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2245. Emit(Mov(position, dst, parameter1));
  2246. Emit(Mov(position, src, parameter2));
  2247. label := NewLabel();
  2248. SetLabel(label);
  2249. Emit(Push(position, dst));
  2250. Emit(Push(position, src));
  2251. GetRecordTypeName (recordType,name);
  2252. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2253. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2254. Emit(Call(position, op, 0));
  2255. Emit(Pop(position, src));
  2256. Emit(Pop(position, dst));
  2257. Emit(Add(position, dst, dst, ofs));
  2258. Emit(Add(position, src, src, ofs));
  2259. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2260. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2261. Emit(Exit(position,0,0));
  2262. END;
  2263. INC(statCoopAssignProcedure, section.pc);
  2264. ReturnToContext(context);
  2265. IF dump # NIL THEN dump := section.comments END;
  2266. END CreateAssignProcedure;
  2267. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2268. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2269. BEGIN
  2270. IF IsUnsafePointer (type) THEN
  2271. skip := NewLabel();
  2272. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2273. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2274. BreqL (skip, op, nil);
  2275. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2276. SetLabel (skip);
  2277. ELSIF SemanticChecker.IsPointerType (type) THEN
  2278. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2279. CallThis(position,"GarbageCollector","Mark", 1);
  2280. ELSIF type.IsRecordType() THEN
  2281. Emit (Push(position,register));
  2282. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2283. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2284. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2285. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2286. ELSIF IsStaticArray(type) THEN
  2287. size := StaticArrayNumElements(type);
  2288. base := StaticArrayBaseType(type);
  2289. IF base.IsRecordType() THEN
  2290. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2291. Emit (Push(position, register));
  2292. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2293. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2294. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2295. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2296. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2297. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2298. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2299. Emit (Push(position, register));
  2300. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2301. ELSE
  2302. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2303. Emit (Push(position, register));
  2304. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2305. ASSERT(base.IsPointer());
  2306. END;
  2307. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2308. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2309. CallThis(position,"GarbageCollector","Mark", 1);
  2310. ELSE HALT(100); (* missing ? *)
  2311. END;
  2312. END CallTraceMethod;
  2313. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2314. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2315. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2316. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2317. BEGIN
  2318. previousSection := section;
  2319. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2320. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2321. GetRecordTypeName (recordType,name);
  2322. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2323. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2324. IF dump # NIL THEN dump := section.comments END;
  2325. IF backend.hasLinkRegister THEN
  2326. Emit(Push(-1, lr));
  2327. END;
  2328. variable := recordType.recordScope.firstVariable;
  2329. WHILE variable # NIL DO
  2330. IF variable.NeedsTrace() THEN
  2331. register := NewRegisterOperand (addressType);
  2332. Emit (Mov(position,register,parameter1));
  2333. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2334. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2335. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2336. END;
  2337. CallTraceMethod(register, variable.type);
  2338. ReleaseIntermediateOperand(register);
  2339. END;
  2340. variable := variable.nextVariable;
  2341. END;
  2342. recordBase := recordType.GetBaseRecord();
  2343. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2344. recordBase := recordBase.GetBaseRecord();
  2345. END;
  2346. IF recordBase # NIL THEN
  2347. IF backend.hasLinkRegister THEN
  2348. Emit(Pop(-1, lr));
  2349. END;
  2350. GetRecordTypeName (recordBase,name);
  2351. IF HasExplicitTraceMethod (recordBase) THEN
  2352. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2353. ELSE
  2354. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2355. END;
  2356. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2357. Emit(Br(position,op));
  2358. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2359. Emit(Exit(position,0,0));
  2360. ELSE
  2361. IF backend.hasLinkRegister THEN
  2362. Emit(Pop(-1, lr));
  2363. END;
  2364. IF recordType.isObject THEN
  2365. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2366. ELSE
  2367. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2368. END;
  2369. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2370. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2371. Emit(Br(position,op));
  2372. END;
  2373. IF ~recordType.isObject THEN
  2374. GetRecordTypeName (recordType,name);
  2375. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2376. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2377. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2378. NEW(registerUsageCount);
  2379. usedRegisters := NIL;
  2380. IF dump # NIL THEN dump := section.comments END;
  2381. register := NewRegisterOperand (addressType);
  2382. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2383. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2384. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2385. END;
  2386. Emit (Push(position,register));
  2387. GetRecordTypeName (recordType,name);
  2388. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2389. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2390. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2391. ReleaseIntermediateOperand(register);
  2392. Emit(Exit(position,0,0));
  2393. GetRecordTypeName (recordType,name);
  2394. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2395. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2396. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2397. NEW(registerUsageCount);
  2398. usedRegisters := NIL;
  2399. register := NewRegisterOperand (addressType);
  2400. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2401. Emit(Mov(position, register, parameter1));
  2402. label := NewLabel();
  2403. SetLabel(label);
  2404. Emit(Push(position, register));
  2405. GetRecordTypeName (recordType,name);
  2406. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2407. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2408. Emit(Call(position, op, 0));
  2409. Emit(Pop(position, register));
  2410. Emit(Add(position, register, register, ofs));
  2411. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2412. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2413. Emit(Exit(position,0,0));
  2414. END;
  2415. INC(statCoopTraceMethod, section.pc);
  2416. ReturnToContext(context);
  2417. IF dump # NIL THEN dump := section.comments END;
  2418. END CreateTraceMethod;
  2419. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2420. VAR name: Basic.SegmentedName;
  2421. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2422. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2423. context: Context;
  2424. BEGIN
  2425. IF recordType.isObject THEN RETURN END;
  2426. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2427. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2428. GetRecordTypeName (recordType,name);
  2429. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2430. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2431. IF dump # NIL THEN dump := section.comments END;
  2432. IF backend.hasLinkRegister THEN
  2433. Emit(Push(-1, lr));
  2434. END;
  2435. variable := recordType.recordScope.firstVariable;
  2436. WHILE variable # NIL DO
  2437. IF variable.NeedsTrace() THEN
  2438. dst := NewRegisterOperand (addressType);
  2439. Emit (Mov(position, dst, parameter1));
  2440. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2441. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2442. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2443. END;
  2444. CallResetProcedure(dst, nil, variable.type);
  2445. ReleaseIntermediateOperand(dst);
  2446. END;
  2447. variable := variable.nextVariable;
  2448. END;
  2449. recordBase := recordType.GetBaseRecord();
  2450. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2451. IF backend.hasLinkRegister THEN
  2452. Emit(Pop(-1, lr));
  2453. END;
  2454. GetRecordTypeName (recordBase,name);
  2455. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2456. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2457. Emit(Br(position,op));
  2458. ELSE
  2459. Emit(Exit(position,0,0));
  2460. END;
  2461. GetRecordTypeName (recordType,name);
  2462. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2463. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2464. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2465. NEW(registerUsageCount);
  2466. usedRegisters := NIL;
  2467. dst := NewRegisterOperand (addressType);
  2468. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2469. Emit(Mov(position, dst, parameter1));
  2470. label := NewLabel();
  2471. SetLabel(label);
  2472. Emit(Push(position, dst));
  2473. GetRecordTypeName (recordType,name);
  2474. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2475. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2476. Emit(Call(position, op, 0));
  2477. Emit(Pop(position, dst));
  2478. Emit(Add(position, dst, dst, ofs));
  2479. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2480. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2481. Emit(Exit(position,0,0));
  2482. INC(statCoopResetProcedure, section.pc);
  2483. ReturnToContext(context);
  2484. IF dump # NIL THEN dump := section.comments END;
  2485. END CreateResetProcedure;
  2486. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2487. VAR name: Basic.SegmentedName; context: Context;
  2488. BEGIN
  2489. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2490. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2491. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2492. IF dump # NIL THEN dump := section.comments END;
  2493. IF backend.hasLinkRegister THEN
  2494. Emit(Push(-1, lr));
  2495. END;
  2496. Emit(Push(position,fp));
  2497. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2498. ResetVariables(scope);
  2499. Emit(Pop(position,fp));
  2500. Emit(Exit(position,0,0));
  2501. ReturnToContext(context);
  2502. IF dump # NIL THEN dump := section.comments END;
  2503. END CreateResetMethod;
  2504. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2505. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2506. BEGIN
  2507. IF SemanticChecker.IsPointerType (type) THEN
  2508. Emit (Push(position, dest));
  2509. CallThis(position,"GarbageCollector","Reset", 1);
  2510. ELSIF type.IsRecordType() THEN
  2511. Emit (Push(position, dest));
  2512. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2513. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2514. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2515. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2516. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2517. size := GetArrayLength(type, tag);
  2518. base := ArrayBaseType(type);
  2519. IF base.IsRecordType() THEN
  2520. Emit (Push(position, size));
  2521. Emit (Push(position, dest));
  2522. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2523. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2524. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2525. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2526. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2527. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2528. Emit (Push(position, size));
  2529. Emit (Push(position, dest));
  2530. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2531. ELSE
  2532. Emit (Push(position, size));
  2533. Emit (Push(position, dest));
  2534. CallThis(position,"GarbageCollector","ResetArray", 2);
  2535. ASSERT(ArrayBaseType(type).IsPointer());
  2536. END;
  2537. ReleaseIntermediateOperand(size);
  2538. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2539. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2540. Emit (Push(position, dest));
  2541. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2542. ELSE HALT(100); (* missing ? *)
  2543. END;
  2544. END CallResetProcedure;
  2545. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2546. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2547. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2548. VAR operand: Operand;
  2549. BEGIN
  2550. Symbol (symbol, operand);
  2551. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2552. ReleaseOperand(operand);
  2553. END Reset;
  2554. BEGIN
  2555. previousScope := currentScope;
  2556. currentScope := scope;
  2557. pc := section.pc;
  2558. variable := scope.firstVariable;
  2559. WHILE variable # NIL DO
  2560. IF variable.NeedsTrace() THEN
  2561. Reset (variable);
  2562. END;
  2563. variable := variable.nextVariable;
  2564. END;
  2565. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2566. WHILE parameter # NIL DO
  2567. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2568. Reset (parameter);
  2569. END;
  2570. parameter := parameter.nextParameter;
  2571. END;
  2572. INC(statCoopResetVariables, section.pc - pc);
  2573. currentScope := previousScope;
  2574. END ResetVariables;
  2575. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2576. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2577. VAR op: IntermediateCode.Operand; context: Context;
  2578. BEGIN
  2579. previousSection := section;
  2580. GetCodeSectionNameForSymbol(procedure, name);
  2581. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  2582. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE));
  2583. IF dump # NIL THEN dump := section.comments END;
  2584. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2585. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2586. Emit(Data(position,op));
  2587. Emit(Data(position,nil));
  2588. IF HasPointers (procedure.procedureScope) THEN
  2589. GetCodeSectionNameForSymbol(procedure, name);
  2590. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2591. ELSE
  2592. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2593. END;
  2594. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2595. Emit(Data(position,op));
  2596. ReturnToContext(context);
  2597. IF dump # NIL THEN dump := section.comments END;
  2598. END CreateProcedureDescriptor;
  2599. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2600. VAR import: SyntaxTree.Import;
  2601. s: Basic.MessageString;
  2602. selfName: SyntaxTree.IdentifierString;
  2603. BEGIN
  2604. moduleScope.ownerModule.GetName(selfName);
  2605. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2606. module := moduleScope.ownerModule
  2607. ELSE
  2608. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2609. IF import = NIL THEN
  2610. import := SyntaxTree.NewImport(-1,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2611. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2612. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2613. s := "Module ";
  2614. Strings.Append(s,moduleName);
  2615. Strings.Append(s," cannot be imported.");
  2616. IF force THEN
  2617. Error(position,s);
  2618. ELSIF canBeLoaded THEN
  2619. Strings.Append(s, "=> no dynamic linking.");
  2620. Warning(position, s);
  2621. canBeLoaded := FALSE;
  2622. END;
  2623. RETURN FALSE
  2624. ELSE
  2625. SELF.module.imports.AddName(moduleName)
  2626. END;
  2627. ELSIF import.module = NIL THEN (* already tried *)
  2628. RETURN FALSE
  2629. END;
  2630. module := import.module;
  2631. END;
  2632. RETURN TRUE
  2633. END AddImport;
  2634. (* needed for old binary object file format*)
  2635. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2636. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2637. BEGIN
  2638. IF AddImport(moduleName,module,TRUE) THEN
  2639. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2640. IF procedure = NIL THEN
  2641. s := "Instruction not supported on target, emulation procedure ";
  2642. Strings.Append(s,moduleName);
  2643. Strings.Append(s,".");
  2644. Strings.Append(s,procedureName);
  2645. Strings.Append(s," not present");
  2646. Error(position,s);
  2647. ELSE
  2648. StaticCallOperand(r,procedure);
  2649. ReleaseOperand(r);
  2650. fp := GetFingerprint(procedure);
  2651. END;
  2652. END;
  2653. END EnsureSymbol;
  2654. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2655. VAR exit: Label; trueL,falseL: Label;
  2656. BEGIN
  2657. trueL := NewLabel();
  2658. falseL := NewLabel();
  2659. exit := NewLabel();
  2660. Condition(x,trueL,falseL);
  2661. InitOperand(result,ModeValue);
  2662. SetLabel(trueL);
  2663. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2664. Emit(Mov(position,result.op,true));
  2665. BrL(exit);
  2666. SetLabel(falseL);
  2667. Emit(MovReplace(position,result.op,false));
  2668. SetLabel(exit);
  2669. END ConditionToValue;
  2670. PROCEDURE ValueToCondition(VAR op: Operand);
  2671. BEGIN
  2672. LoadValue(op,system.booleanType);
  2673. BrneL(trueLabel,op.op, false);
  2674. ReleaseOperand(op);
  2675. BrL(falseLabel);
  2676. END ValueToCondition;
  2677. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2678. VAR size: LONGINT;
  2679. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2680. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2681. BEGIN
  2682. ASSERT(type.form = SyntaxTree.Open);
  2683. baseType := type.arrayBase.resolved;
  2684. IF IsOpenArray(baseType) THEN
  2685. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2686. ELSE
  2687. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2688. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2689. END;
  2690. len := tag;
  2691. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2692. IntermediateCode.MakeMemory(len,addressType);
  2693. UseIntermediateOperand(len);
  2694. Reuse2(res,sizeOperand,len);
  2695. Emit(Mul(position,res,sizeOperand,len));
  2696. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2697. RETURN res
  2698. END GetArraySize;
  2699. BEGIN
  2700. type := type.resolved;
  2701. IF IsOpenArray(type) THEN
  2702. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2703. RETURN tag
  2704. ELSE
  2705. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2706. END;
  2707. ELSE
  2708. size := ToMemoryUnits(system,system.SizeOf(type));
  2709. RETURN IntermediateCode.Immediate(addressType,size)
  2710. END;
  2711. END GetDynamicSize;
  2712. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2713. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2714. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2715. BEGIN
  2716. ASSERT(type.form = SyntaxTree.Open);
  2717. baseType := type.arrayBase.resolved;
  2718. IF IsOpenArray(baseType) THEN
  2719. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2720. ELSE
  2721. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2722. END;
  2723. len := tag;
  2724. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2725. IntermediateCode.MakeMemory(len,addressType);
  2726. UseIntermediateOperand(len);
  2727. Reuse2(res,sizeOperand,len);
  2728. Emit(Mul(position,res,sizeOperand,len));
  2729. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2730. RETURN res
  2731. END GetLength;
  2732. BEGIN
  2733. type := type.resolved;
  2734. IF IsOpenArray(type) THEN
  2735. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2736. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2737. ELSE
  2738. RETURN IntermediateCode.Immediate(addressType,1)
  2739. END;
  2740. END GetArrayLength;
  2741. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2742. VAR result: IntermediateCode.Operand;
  2743. BEGIN
  2744. IF backend.cooperative THEN
  2745. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2746. ELSE
  2747. MakeMemory(result, tag, addressType, 0);
  2748. END;
  2749. RETURN result
  2750. END GetSizeFromTag;
  2751. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2752. VAR parameter: SyntaxTree.Parameter;
  2753. BEGIN
  2754. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2755. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2756. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2757. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2758. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2759. END;
  2760. RETURN GetDynamicSize(e.type, tag);
  2761. END GetArrayOfBytesSize;
  2762. (*
  2763. to find imported symbol. not needed ?
  2764. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2765. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2766. BEGIN
  2767. IF AddImport(moduleName,importedModule,FALSE) THEN
  2768. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2769. RETURN symbol
  2770. ELSE
  2771. RETURN NIL
  2772. END
  2773. END SymbolByName;
  2774. *)
  2775. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2776. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2777. BEGIN
  2778. IF AddImport(moduleName,runtimeModule,force) THEN
  2779. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2780. IF procedure = NIL THEN
  2781. s := "Procedure ";
  2782. Strings.Append(s,moduleName);
  2783. Strings.Append(s,".");
  2784. Strings.Append(s,procedureName);
  2785. Strings.Append(s," not present");
  2786. Error(position,s);
  2787. RETURN FALSE
  2788. ELSE
  2789. RETURN TRUE
  2790. END;
  2791. ELSE RETURN FALSE
  2792. END;
  2793. END GetRuntimeProcedure;
  2794. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2795. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2796. s: Basic.MessageString;
  2797. BEGIN
  2798. Basic.InitSegmentedName(name);
  2799. name[0] := Basic.MakeString(moduleName);
  2800. name[1] := Basic.MakeString(typeName);
  2801. name[2] := -1;
  2802. IF AddImport(moduleName,importedModule, FALSE) THEN
  2803. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2804. IF symbol = NIL THEN
  2805. s := "type ";
  2806. Strings.Append(s,moduleName);
  2807. Strings.Append(s,".");
  2808. Strings.Append(s,typeName);
  2809. Strings.Append(s," not present");
  2810. Error(position,s);
  2811. END;
  2812. ELSE symbol := NIL;
  2813. END;
  2814. IF importedModule = moduleScope.ownerModule THEN
  2815. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2816. ELSE
  2817. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2818. END;
  2819. RETURN symbol
  2820. END GetTypeDescriptor;
  2821. (* Call a runtime procedure. If numberParameters >= 0 then the procedure may be called without module import. Otherwise the signature has to be inferred from the import. *)
  2822. PROCEDURE CallThisChecked(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2823. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2824. pooledName: Basic.SegmentedName; size: LONGINT;
  2825. BEGIN
  2826. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2827. StaticCallOperand(result,procedure);
  2828. IF numberParameters < 0 THEN
  2829. size := ProcedureParametersSize(system,procedure);
  2830. ELSE
  2831. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2832. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2833. Error(position,"runtime call parameter count mismatch");
  2834. END;
  2835. END;
  2836. Emit(Call(position, result.op, size));
  2837. ReleaseOperand(result);
  2838. ELSE (* only static linking possible *)
  2839. ASSERT(numberParameters >= 0);
  2840. Basic.InitSegmentedName(pooledName);
  2841. pooledName[0] := Basic.MakeString(moduleName);
  2842. pooledName[1] := Basic.MakeString(procedureName);
  2843. pooledName[2] := -1;
  2844. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2845. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2846. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2847. END;
  2848. END CallThisChecked;
  2849. (* Call a runtime procedure. If numberParameters >= 0 then the procedure may be called without module import. Otherwise the signature has to be inferred from the import. *)
  2850. PROCEDURE CallThis(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2851. BEGIN
  2852. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2853. END CallThis;
  2854. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2855. VAR
  2856. left,right: Operand;
  2857. leftSize, rightSize: IntermediateCode.Operand;
  2858. saved: RegisterEntry;
  2859. reg: IntermediateCode.Operand;
  2860. procedureName: SyntaxTree.IdentifierString;
  2861. BEGIN
  2862. procedureName := "CompareString";
  2863. SaveRegisters();ReleaseUsedRegisters(saved);
  2864. Designate(leftExpression,left);
  2865. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2866. Emit(Push(position,leftSize));
  2867. ReleaseIntermediateOperand(leftSize);
  2868. Emit(Push(position,left.op));
  2869. ReleaseOperand(left);
  2870. Designate(rightExpression,right);
  2871. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2872. Emit(Push(position,rightSize));
  2873. ReleaseIntermediateOperand(rightSize);
  2874. Emit(Push(position,right.op));
  2875. ReleaseOperand(right);
  2876. IF backend.cooperative THEN
  2877. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2878. ELSE
  2879. CallThis(position,runtimeModuleName,procedureName, 4);
  2880. END;
  2881. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2882. Emit(Result(position,reg));
  2883. (*
  2884. AcquireThisRegister(int8,IntermediateCode.Result);
  2885. *)
  2886. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2887. (*
  2888. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2889. *)
  2890. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2891. ReleaseIntermediateOperand(reg);
  2892. BrL(falseLabel);
  2893. END CompareString;
  2894. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2895. VAR
  2896. left,right: Operand;
  2897. leftSize, rightSize: IntermediateCode.Operand;
  2898. saved: RegisterEntry;
  2899. procedureName: SyntaxTree.IdentifierString;
  2900. BEGIN
  2901. procedureName := "CopyString";
  2902. SaveRegisters();ReleaseUsedRegisters(saved);
  2903. Designate(leftExpression,left);
  2904. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2905. Emit(Push(position,leftSize));
  2906. ReleaseIntermediateOperand(leftSize);
  2907. Emit(Push(position,left.op));
  2908. ReleaseOperand(left);
  2909. Designate(rightExpression,right);
  2910. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2911. Emit(Push(position,rightSize));
  2912. ReleaseIntermediateOperand(rightSize);
  2913. Emit(Push(position,right.op));
  2914. ReleaseOperand(right);
  2915. IF backend.cooperative THEN
  2916. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2917. ELSE
  2918. CallThis(position,runtimeModuleName,procedureName,4);
  2919. END;
  2920. RestoreRegisters(saved);
  2921. END CopyString;
  2922. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  2923. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2924. leftType,rightType: SyntaxTree.Type;
  2925. leftExpression,rightExpression : SyntaxTree.Expression;
  2926. componentType: IntermediateCode.Type;
  2927. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  2928. size: LONGINT;
  2929. BEGIN
  2930. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2931. dest := destination; destination := emptyOperand;
  2932. leftType := x.left.type.resolved;
  2933. rightType := x.right.type.resolved;
  2934. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  2935. CASE x.operator OF
  2936. Scanner.Or:
  2937. (* shortcut evaluation of left OR right *)
  2938. IF ~conditional THEN ConditionToValue(x);
  2939. ELSE
  2940. next := NewLabel();
  2941. Condition(x.left,trueLabel,next);
  2942. SetLabel(next);
  2943. Condition(x.right,trueLabel,falseLabel);
  2944. END;
  2945. |Scanner.And:
  2946. (* shortcut evaluation of left & right *)
  2947. IF ~conditional THEN ConditionToValue(x);
  2948. ELSE
  2949. next := NewLabel();
  2950. Condition(x.left,next,falseLabel);
  2951. SetLabel(next);
  2952. Condition(x.right,trueLabel,falseLabel);
  2953. END;
  2954. |Scanner.Is:
  2955. IF ~conditional THEN ConditionToValue(x);
  2956. ELSE
  2957. (* get type desc tag *)
  2958. IF IsPointerToRecord(leftType,recordType) THEN
  2959. Evaluate(x.left,left);
  2960. Dereference(left,recordType,IsUnsafePointer(leftType))
  2961. ELSE
  2962. Designate(x.left,left);
  2963. END;
  2964. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  2965. ReleaseOperand(left);
  2966. END;
  2967. |Scanner.Plus:
  2968. Evaluate(x.left,left);
  2969. Evaluate(x.right,right);
  2970. IF leftType IS SyntaxTree.SetType THEN
  2971. InitOperand(result,ModeValue);
  2972. Reuse2a(result.op,left.op,right.op,dest);
  2973. Emit(Or(position,result.op,left.op,right.op));
  2974. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2975. InitOperand(result,ModeValue);
  2976. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2977. Reuse2(result.tag,left.tag,right.tag);
  2978. Emit(Add(position,result.op,left.op,right.op));
  2979. Emit(Add(position,result.tag,left.tag,right.tag))
  2980. ELSE
  2981. InitOperand(result,ModeValue);
  2982. Reuse2a(result.op,left.op,right.op,dest);
  2983. Emit(Add(position,result.op,left.op,right.op));
  2984. END;
  2985. ReleaseOperand(left); ReleaseOperand(right);
  2986. |Scanner.Minus:
  2987. Evaluate(x.left,left);
  2988. Evaluate(x.right,right);
  2989. IF leftType IS SyntaxTree.SetType THEN
  2990. InitOperand(result,ModeValue);
  2991. Reuse1(result.op,right.op);
  2992. Emit(Not(position,result.op,right.op));
  2993. ReleaseOperand(right);
  2994. Emit(And(position,result.op,result.op,left.op));
  2995. ReleaseOperand(left);
  2996. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2997. InitOperand(result,ModeValue);
  2998. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2999. Reuse2(result.tag,left.tag,right.tag);
  3000. Emit(Sub(position,result.op,left.op,right.op));
  3001. Emit(Sub(position,result.tag,left.tag,right.tag));
  3002. ReleaseOperand(left); ReleaseOperand(right)
  3003. ELSE
  3004. InitOperand(result,ModeValue);
  3005. Reuse2a(result.op,left.op,right.op,dest);
  3006. Emit(Sub(position,result.op,left.op,right.op));
  3007. ReleaseOperand(left); ReleaseOperand(right);
  3008. END;
  3009. |Scanner.Times:
  3010. Evaluate(x.left,left);
  3011. Evaluate(x.right,right);
  3012. IF leftType IS SyntaxTree.SetType THEN
  3013. InitOperand(result,ModeValue);
  3014. Reuse2a(result.op,left.op,right.op,dest);
  3015. Emit(And(position,result.op,left.op,right.op));
  3016. ELSIF (x.type.resolved IS SyntaxTree.IntegerType) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  3017. InitOperand(result,ModeValue);
  3018. Reuse1a(result.op,left.op,dest);
  3019. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  3020. Emit(Shl(position,result.op,left.op,right.op));
  3021. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3022. InitOperand(result, ModeValue);
  3023. componentType := left.op.type;
  3024. (* TODO: review this *)
  3025. (*
  3026. result.op = left.op * right.op - left.tag * right.tag
  3027. result.tag = left.tag * right.op + left.op * right.tag
  3028. *)
  3029. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3030. Emit(Mul(position,result.op, left.op, right.op));
  3031. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3032. Emit(Mul(position,tempReg, left.tag, right.tag));
  3033. Emit(Sub(position,result.op, result.op, tempReg));
  3034. Reuse2(result.tag, left.tag, right.op);
  3035. Emit(Mul(position,result.tag, left.tag, right.op));
  3036. Emit(Mul(position,tempReg, left.op, right.tag));
  3037. Emit(Add(position,result.tag, result.tag, tempReg));
  3038. ReleaseIntermediateOperand(tempReg)
  3039. ELSE
  3040. InitOperand(result,ModeValue);
  3041. Reuse2a(result.op,left.op,right.op,dest);
  3042. Emit(Mul(position,result.op,left.op,right.op));
  3043. END;
  3044. ReleaseOperand(left); ReleaseOperand(right);
  3045. |Scanner.Div:
  3046. Evaluate(x.left,left);
  3047. Evaluate(x.right,right);
  3048. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  3049. InitOperand(result,ModeValue);
  3050. Reuse1a(result.op,left.op,dest);
  3051. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  3052. Emit(Shr(position,result.op,left.op,right.op));
  3053. ELSE
  3054. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3055. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3056. IF ~isUnchecked THEN
  3057. exit := NewLabel();
  3058. BrltL(exit,zero,right.op);
  3059. EmitTrap(position,NegativeDivisorTrap);
  3060. SetLabel(exit);
  3061. END;
  3062. END;
  3063. InitOperand(result,ModeValue);
  3064. Reuse2a(result.op,left.op,right.op,dest);
  3065. Emit(Div(position,result.op,left.op,right.op));
  3066. END;
  3067. ReleaseOperand(left); ReleaseOperand(right);
  3068. |Scanner.Mod:
  3069. Evaluate(x.left,left);
  3070. Evaluate(x.right,right);
  3071. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  3072. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system,x.type),value-1);
  3073. InitOperand(result,ModeValue);
  3074. Reuse1a(result.op,left.op,dest);
  3075. Emit(And(position,result.op,left.op,right.op));
  3076. ELSE
  3077. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3078. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3079. IF ~isUnchecked THEN
  3080. exit := NewLabel();
  3081. BrltL(exit,zero,right.op);
  3082. EmitTrap(position,NegativeDivisorTrap);
  3083. SetLabel(exit);
  3084. END;
  3085. END;
  3086. InitOperand(result,ModeValue);
  3087. Reuse2a(result.op,left.op,right.op,dest);
  3088. Emit(Mod(position,result.op,left.op,right.op));
  3089. END;
  3090. ReleaseOperand(left); ReleaseOperand(right);
  3091. |Scanner.Slash:
  3092. Evaluate(x.left,left);
  3093. Evaluate(x.right,right);
  3094. IF leftType IS SyntaxTree.SetType THEN
  3095. InitOperand(result,ModeValue);
  3096. Reuse2a(result.op,left.op,right.op,dest);
  3097. Emit(Xor(position,result.op,left.op,right.op));
  3098. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3099. InitOperand(result,ModeValue);
  3100. componentType := left.op.type;
  3101. (* review this *)
  3102. (*
  3103. divisor = right.op * right.op + right.tag * right.tag
  3104. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3105. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3106. *)
  3107. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3108. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3109. Emit(Mul(position,tempReg, right.op, right.op));
  3110. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3111. Emit(Add(position,tempReg, tempReg, tempReg2));
  3112. result.op := tempReg2;
  3113. Emit(Mul(position,result.op, left.op, right.op));
  3114. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3115. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3116. Emit(Add(position,result.op, result.op, tempReg2));
  3117. Emit(Div(position,result.op, result.op, tempReg));
  3118. Reuse2(result.tag, left.tag, right.op);
  3119. Emit(Mul(position,result.tag, left.tag, right.op));
  3120. Emit(Mul(position,tempReg2, left.op, right.tag));
  3121. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3122. Emit(Div(position,result.tag, result.tag, tempReg));
  3123. ReleaseIntermediateOperand(tempReg);
  3124. ReleaseIntermediateOperand(tempReg2)
  3125. ELSE
  3126. InitOperand(result,ModeValue);
  3127. Reuse2a(result.op,left.op,right.op,dest);
  3128. Emit(Div(position,result.op,left.op,right.op));
  3129. END;
  3130. ReleaseOperand(left); ReleaseOperand(right);
  3131. |Scanner.Equal:
  3132. IF ~conditional THEN ConditionToValue(x);
  3133. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3134. CompareString(BreqL,x.left,x.right);
  3135. ELSE
  3136. Evaluate(x.left,left);
  3137. Evaluate(x.right,right);
  3138. IF leftType IS SyntaxTree.RangeType THEN
  3139. ASSERT(rightType IS SyntaxTree.RangeType);
  3140. BrneL(falseLabel, left.op, right.op); (* first *)
  3141. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3142. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3143. ReleaseOperand(left); ReleaseOperand(right);
  3144. BrL(trueLabel)
  3145. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3146. BrneL(falseLabel, left.op, right.op); (* first *)
  3147. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3148. ReleaseOperand(left); ReleaseOperand(right);
  3149. BrL(trueLabel)
  3150. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3151. (* TODO: review this *)
  3152. BrneL(falseLabel, left.op, right.op); (* real part *)
  3153. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3154. ReleaseOperand(left); ReleaseOperand(right);
  3155. BrL(trueLabel)
  3156. ELSE
  3157. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3158. ReleaseOperand(left); ReleaseOperand(right);
  3159. BrL(trueLabel);
  3160. END;
  3161. END;
  3162. |Scanner.LessEqual:
  3163. IF ~conditional THEN ConditionToValue(x);
  3164. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3165. CompareString(BrgeL,x.right,x.left);
  3166. ELSE
  3167. Evaluate(x.left,left);
  3168. Evaluate(x.right,right);
  3169. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3170. Reuse1(temp.op,right.op);
  3171. Emit(And(position,temp.op,left.op,right.op));
  3172. ReleaseOperand(right);
  3173. BreqL(trueLabel,temp.op,left.op);
  3174. BrL(falseLabel);
  3175. ReleaseOperand(temp);ReleaseOperand(left);
  3176. ELSE
  3177. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3178. ReleaseOperand(left); ReleaseOperand(right);
  3179. BrL(trueLabel);
  3180. END;
  3181. END;
  3182. |Scanner.Less:
  3183. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3184. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.LessEqual);
  3185. leftExpression.SetType(system.booleanType);
  3186. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3187. rightExpression.SetType(system.booleanType);
  3188. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3189. leftExpression.SetType(system.booleanType);
  3190. Expression(leftExpression);
  3191. ELSIF ~conditional THEN ConditionToValue(x);
  3192. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3193. CompareString(BrltL,x.left,x.right);
  3194. ELSE
  3195. Evaluate(x.left,left);
  3196. Evaluate(x.right,right);
  3197. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3198. ReleaseOperand(left); ReleaseOperand(right);
  3199. BrL(trueLabel);
  3200. END;
  3201. |Scanner.Greater:
  3202. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3203. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.GreaterEqual);
  3204. leftExpression.SetType(system.booleanType);
  3205. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3206. rightExpression.SetType(system.booleanType);
  3207. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3208. leftExpression.SetType(system.booleanType);
  3209. Expression(leftExpression);
  3210. ELSIF ~conditional THEN ConditionToValue(x);
  3211. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3212. CompareString(BrltL,x.right,x.left);
  3213. ELSE
  3214. Evaluate(x.left,left);
  3215. Evaluate(x.right,right);
  3216. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3217. ReleaseOperand(left); ReleaseOperand(right);
  3218. BrL(trueLabel);
  3219. END;
  3220. |Scanner.GreaterEqual:
  3221. IF ~conditional THEN ConditionToValue(x);
  3222. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3223. CompareString(BrgeL,x.left,x.right);
  3224. ELSE
  3225. Evaluate(x.left,left);
  3226. Evaluate(x.right,right);
  3227. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3228. Reuse1(temp.op,left.op);
  3229. Emit(And(position,temp.op,left.op,right.op));
  3230. ReleaseOperand(left);
  3231. BreqL(trueLabel, temp.op,right.op);
  3232. ReleaseOperand(temp); ReleaseOperand(right);
  3233. BrL(falseLabel);
  3234. ELSE
  3235. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3236. ReleaseOperand(left); ReleaseOperand(right);
  3237. BrL(trueLabel);
  3238. END;
  3239. END;
  3240. |Scanner.Unequal:
  3241. IF ~conditional THEN ConditionToValue(x);
  3242. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3243. CompareString(BrneL,x.left,x.right);
  3244. ELSE
  3245. Evaluate(x.left,left);
  3246. Evaluate(x.right,right);
  3247. IF leftType IS SyntaxTree.RangeType THEN
  3248. ASSERT(rightType IS SyntaxTree.RangeType);
  3249. BrneL(trueLabel, left.op, right.op); (* first *)
  3250. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3251. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3252. ReleaseOperand(left); ReleaseOperand(right);
  3253. BrL(falseLabel)
  3254. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3255. BrneL(trueLabel, left.op, right.op); (* first *)
  3256. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3257. ReleaseOperand(left); ReleaseOperand(right);
  3258. BrL(falseLabel)
  3259. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3260. (* TODO: review this *)
  3261. BrneL(trueLabel, left.op, right.op); (* real part *)
  3262. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3263. ReleaseOperand(left); ReleaseOperand(right);
  3264. BrL(falseLabel)
  3265. ELSE
  3266. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3267. ReleaseOperand(left); ReleaseOperand(right);
  3268. BrL(trueLabel);
  3269. END;
  3270. END;
  3271. |Scanner.In:
  3272. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3273. Evaluate(x.left,left);
  3274. Evaluate(x.right,right);
  3275. Convert(left.op,setType);
  3276. ReuseCopy(temp.op,right.op);
  3277. Emit(Shr(position,temp.op,temp.op,left.op));
  3278. ReleaseOperand(right); ReleaseOperand(left);
  3279. IntermediateCode.InitImmediate(one,setType,1);
  3280. Emit(And(position,temp.op,temp.op,one));
  3281. IF conditional THEN
  3282. IntermediateCode.InitImmediate(zero,setType,0);
  3283. BrneL(trueLabel,temp.op,zero);
  3284. ReleaseOperand(temp);
  3285. BrL(falseLabel);
  3286. ELSE
  3287. Convert(temp.op,bool);
  3288. result.mode := ModeValue;
  3289. result.op := temp.op;
  3290. result.tag := nil; (* may be left over from calls to evaluate *)
  3291. END;
  3292. ELSE
  3293. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3294. IF x.operator = Scanner.Questionmarks THEN
  3295. leftExpression := x.left;
  3296. rightExpression := x.right;
  3297. ELSE
  3298. leftExpression := x.right;
  3299. rightExpression := x.left;
  3300. END;
  3301. Evaluate(leftExpression, left);
  3302. Emit(Push(position,left.op));
  3303. ReleaseOperand(left);
  3304. Designate(rightExpression, right);
  3305. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3306. IF ~backend.cellsAreObjects THEN
  3307. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3308. END;
  3309. Emit(Push(position,right.op));
  3310. ReleaseOperand(right);
  3311. IF backend.cellsAreObjects THEN
  3312. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3313. ELSE
  3314. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3315. END;
  3316. InitOperand(result, ModeValue);
  3317. result.op := NewRegisterOperand(bool);
  3318. Emit(Result(position,result.op));
  3319. IF conditional THEN
  3320. IntermediateCode.InitImmediate(zero,setType,0);
  3321. BrneL(trueLabel,result.op,zero);
  3322. ReleaseOperand(result);
  3323. BrL(falseLabel);
  3324. END;
  3325. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3326. leftExpression := x.left;
  3327. rightExpression := x.right;
  3328. Evaluate(leftExpression, left);
  3329. Emit(Push(position,left.op));
  3330. ReleaseOperand(left);
  3331. Evaluate(rightExpression, right);
  3332. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3333. IF ~backend.cellsAreObjects THEN
  3334. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3335. END;
  3336. Emit(Push(position,right.op));
  3337. ReleaseOperand(right);
  3338. IF backend.cellsAreObjects THEN
  3339. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3340. ELSE
  3341. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3342. END;
  3343. InitOperand(result, ModeValue);
  3344. result.op := NewRegisterOperand(bool);
  3345. Emit(Result(position,result.op));
  3346. IF conditional THEN
  3347. IntermediateCode.InitImmediate(zero,setType,0);
  3348. BrneL(trueLabel,result.op,zero);
  3349. ReleaseOperand(result);
  3350. BrL(falseLabel);
  3351. END;
  3352. ELSE
  3353. HALT(100);
  3354. END;
  3355. END;
  3356. destination := dest;
  3357. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3358. END VisitBinaryExpression;
  3359. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3360. VAR localResult, operand: Operand;
  3361. BEGIN
  3362. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3363. InitOperand(localResult, ModeValue);
  3364. ASSERT(x.first # NIL);
  3365. Evaluate(x.first, operand);
  3366. localResult.op := operand.op;
  3367. ReleaseOperand(operand);
  3368. UseIntermediateOperand(localResult.op);
  3369. ASSERT(x.last # NIL);
  3370. Evaluate(x.last, operand);
  3371. localResult.tag := operand.op;
  3372. ReleaseOperand(operand);
  3373. UseIntermediateOperand(localResult.tag);
  3374. IF x.step # NIL THEN
  3375. Evaluate(x.step, operand);
  3376. localResult.extra := operand.op;
  3377. ReleaseOperand(operand);
  3378. UseIntermediateOperand(localResult.extra);
  3379. END;
  3380. result := localResult;
  3381. IF Trace THEN TraceExit("VisitRangeExpression") END
  3382. END VisitRangeExpression;
  3383. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3384. BEGIN
  3385. HALT(100); (* should never be evaluated *)
  3386. END VisitTensorRangeExpression;
  3387. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3388. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3389. BEGIN
  3390. IF Trace THEN TraceEnter("VisitConversion") END;
  3391. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3392. dest := destination; destination := emptyOperand;
  3393. Evaluate(x.expression,old);
  3394. InitOperand(result,ModeValue);
  3395. result.op := old.op;
  3396. ASSERT(result.op.mode # 0);
  3397. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3398. (* convert TO a complex number *)
  3399. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3400. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3401. ASSERT(result.op.mode # 0);
  3402. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3403. (* convert FROM a complex number TO a complex number*)
  3404. result.tag := old.tag;
  3405. ASSERT(result.tag.mode # 0);
  3406. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3407. ASSERT(result.tag.mode # 0)
  3408. ELSE
  3409. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3410. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3411. END
  3412. ELSE
  3413. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3414. ASSERT(result.op.mode # 0);
  3415. result.tag := old.tag; (*! probably never used *)
  3416. END;
  3417. destination := dest;
  3418. IF Trace THEN TraceExit("VisitConversion") END;
  3419. END VisitConversion;
  3420. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3421. BEGIN
  3422. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3423. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3424. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3425. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3426. END VisitTypeDeclaration;
  3427. (** designators (expressions) *)
  3428. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3429. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3430. BEGIN
  3431. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3432. IF x.left # NIL THEN Expression(x.left) END;
  3433. Symbol(x.symbol,result);
  3434. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3435. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3436. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3437. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3438. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3439. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3440. END;
  3441. END;
  3442. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3443. END VisitSymbolDesignator;
  3444. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3445. BEGIN
  3446. IF isUnchecked THEN RETURN END;
  3447. IF tagsAvailable THEN
  3448. TrapC(BrltL,index,length,IndexCheckTrap);
  3449. END;
  3450. END BoundCheck;
  3451. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3452. VAR d: IntermediateCode.Operand;
  3453. BEGIN
  3454. IF isUnchecked THEN RETURN END;
  3455. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3456. TrapC(op,dim,d,ArraySizeTrap);
  3457. ReleaseIntermediateOperand(d);
  3458. END DimensionCheck;
  3459. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3460. VAR
  3461. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3462. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3463. expression: SyntaxTree.Expression;
  3464. resultingType, leftType, baseType: SyntaxTree.Type;
  3465. skipLabel1: Label;
  3466. i, indexListSize, indexDim, rangeCount, indexCount, tensorRangeCount, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3467. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3468. variableOp: Operand;
  3469. variable: SyntaxTree.Variable;
  3470. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList; VAR indexCount: LONGINT; VAR rangeCount: LONGINT; VAR tensorRangeCount: LONGINT);
  3471. VAR expression: SyntaxTree.Expression;
  3472. BEGIN
  3473. (* count the number of indices, ranges and tensorRanges in the index list *)
  3474. indexCount := 0; rangeCount := 0; tensorRangeCount := 0;
  3475. FOR i := 0 TO parameters.Length() - 1 DO
  3476. expression := parameters.GetExpression(i);
  3477. IF expression IS SyntaxTree.TensorRangeExpression THEN INC(tensorRangeCount)
  3478. ELSIF (expression.type # NIL) & (expression.type.resolved IS SyntaxTree.RangeType) THEN INC(indexCount)
  3479. ELSE INC(indexCount)
  3480. END
  3481. END;
  3482. END CountIndices;
  3483. BEGIN
  3484. ASSERT(tagsAvailable);
  3485. resultingType := x.type.resolved; (* resulting type *)
  3486. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3487. InitOperand(localResult, ModeReference);
  3488. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3489. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3490. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3491. (* a globally defined array destination tag is available -> use and invalidate it*)
  3492. localResult.tag := arrayDestinationTag;
  3493. IntermediateCode.InitOperand(arrayDestinationTag)
  3494. ELSE
  3495. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3496. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE);
  3497. Symbol(variable, variableOp);
  3498. ReuseCopy(localResult.tag, variableOp.op);
  3499. ReleaseOperand(variableOp);
  3500. END
  3501. END;
  3502. indexListSize := x.parameters.Length();
  3503. CountIndices(x.parameters, indexCount, rangeCount, tensorRangeCount);
  3504. ASSERT(tensorRangeCount <= 1);
  3505. (* designate the array to be indexed over, perform tensor range check if known *)
  3506. Designate(x.left, array);
  3507. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3508. Dereference(array, leftType,FALSE);
  3509. IF tensorRangeCount=0 THEN
  3510. DimensionCheck(array.tag, IntermediateCode.Immediate(int32, rangeCount+indexCount), BreqL)
  3511. END
  3512. END;
  3513. (* determine source and destination dimension offsets; this depends on if the list starts with a '?' *)
  3514. IF x.parameters.GetExpression(0) IS SyntaxTree.TensorRangeExpression THEN
  3515. srcDimOffset := -indexListSize;
  3516. destDimOffset := -rangeCount
  3517. ELSE
  3518. srcDimOffset := 0;
  3519. destDimOffset := 0
  3520. END;
  3521. indexDim := 0;
  3522. (* use address of source array as basis *)
  3523. (*
  3524. ReuseCopy(localResult.op, array.op);
  3525. *)
  3526. localResult.op := array.op;
  3527. UseIntermediateOperand(localResult.op);
  3528. (* go through the index list *)
  3529. FOR i := 0 TO indexListSize - 1 DO
  3530. expression := x.parameters.GetExpression(i);
  3531. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3532. (* nothing to do *)
  3533. ELSE
  3534. (* determine which dimension of source array is currently looked at *)
  3535. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3536. (* get the memory operand pointing to array descriptor dimension *)
  3537. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3538. (* make a reusable register from it *)
  3539. ReuseCopy(srcDim, tmp);
  3540. ReleaseIntermediateOperand(tmp);
  3541. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3542. ELSE
  3543. srcDim := IntermediateCode.Immediate(int32, i)
  3544. END;
  3545. (* get length and increment of source array for current dimension *)
  3546. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3547. Convert(sourceLength.op, sizeType);
  3548. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3549. Convert(sourceIncrement.op, sizeType);
  3550. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3551. ReleaseIntermediateOperand(srcDim);
  3552. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3553. (* SINGLE INDEX *)
  3554. Evaluate(expression, index);
  3555. ReleaseIntermediateOperand(index.tag);
  3556. index.tag := emptyOperand;
  3557. Convert(index.op, sizeType);
  3558. (* lower bound check *)
  3559. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3560. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3561. ELSIF isUnchecked THEN (* do nothing *)
  3562. ELSE
  3563. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3564. END;
  3565. (* upper bound check *)
  3566. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3567. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3568. ELSIF isUnchecked THEN (* do nothing *)
  3569. ELSE
  3570. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3571. END;
  3572. ReleaseOperand(sourceLength);
  3573. Convert(index.op, addressType);
  3574. summand := index.op;
  3575. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3576. (* RANGE OF INDICES *)
  3577. Evaluate(expression, range);
  3578. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3579. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3580. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3581. ReleaseOperand(range);
  3582. Convert(firstIndex, sizeType);
  3583. Convert(lastIndex, sizeType);
  3584. Convert(stepSize, sizeType);
  3585. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3586. if it is 'MAX(LONGINT)' *)
  3587. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3588. TransferToRegister(lastIndex, lastIndex);
  3589. skipLabel1 := NewLabel();
  3590. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3591. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3592. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3593. SetLabel(skipLabel1)
  3594. END;
  3595. (* check if step size is valid *)
  3596. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3597. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3598. ELSIF isUnchecked THEN (* do nothing *)
  3599. ELSE
  3600. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3601. END;
  3602. (* check lower bound check *)
  3603. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3604. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3605. ELSIF isUnchecked THEN (* do nothing *)
  3606. ELSE
  3607. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3608. END;
  3609. (* check upper bound check *)
  3610. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3611. (* statically open range: nothing to do *)
  3612. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3613. ASSERT(staticLastIndex < staticSourceLength)
  3614. ELSIF isUnchecked THEN (* do nothing *)
  3615. ELSE
  3616. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3617. END;
  3618. (* determine length of target array for current dimension *)
  3619. (* 1. incorporate last index: *)
  3620. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3621. (* last index is static *)
  3622. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3623. targetLength := sourceLength.op
  3624. ELSE
  3625. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3626. END;
  3627. UseIntermediateOperand(targetLength);
  3628. ELSE
  3629. (* targetLength := lastIndex + 1
  3630. Reuse1(targetLength, lastIndex);
  3631. *)
  3632. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3633. END;
  3634. ReleaseOperand(sourceLength);
  3635. ReleaseIntermediateOperand(lastIndex);
  3636. (* 2. incorporate first index: *)
  3637. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3638. (* first index and current target length are static *)
  3639. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3640. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3641. (* first index = 0: nothing to do *)
  3642. ELSE
  3643. (* targetLength := targetLength - firstIndex *)
  3644. TransferToRegister(targetLength, targetLength);
  3645. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3646. END;
  3647. (* clip negative lengths to 0 *)
  3648. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3649. IF staticTargetLength < 0 THEN
  3650. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3651. END
  3652. ELSE
  3653. skipLabel1 := NewLabel();
  3654. TransferToRegister(targetLength, targetLength);
  3655. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3656. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3657. SetLabel(skipLabel1)
  3658. END;
  3659. (* 3. incorporate index step size: *)
  3660. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3661. (*step size and current target length are static *)
  3662. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3663. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3664. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3665. (* step size = 1: nothing to do *)
  3666. ELSE
  3667. (* emit code for this:
  3668. targetLength := (targetLength-1) DIV stepSize +1;
  3669. *)
  3670. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3671. DivInt(targetLength, targetLength, stepSize);
  3672. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3673. END;
  3674. (* determine increment of target array for current dimension *)
  3675. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3676. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3677. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3678. (* step size = 1 *)
  3679. targetIncrement := sourceIncrement.op;
  3680. UseIntermediateOperand(targetIncrement)
  3681. ELSE
  3682. (* targetIncrement := sourceIncrement * stepSize *)
  3683. Reuse1(targetIncrement, stepSize);
  3684. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3685. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3686. END;
  3687. ReleaseIntermediateOperand(stepSize);
  3688. (* write length and increment of target array to descriptor *)
  3689. IF destDimOffset < 0 THEN
  3690. (* determine which dimension of target array is currently looked at *)
  3691. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3692. TransferToRegister(destDim, tmp);
  3693. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, indexDim + destDimOffset));
  3694. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3695. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3696. ReleaseIntermediateOperand(destDim)
  3697. ELSE
  3698. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3699. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim)
  3700. END;
  3701. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3702. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3703. INC(indexDim);
  3704. Convert(firstIndex, addressType);
  3705. TransferToRegister(summand, firstIndex);
  3706. ELSE HALT(100);
  3707. END;
  3708. (*
  3709. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3710. *)
  3711. Convert(sourceIncrement.op, addressType);
  3712. Convert(summand, addressType);
  3713. MulInt(summand, summand, sourceIncrement.op);
  3714. ReleaseIntermediateOperand(sourceIncrement.op);
  3715. AddInt(localResult.op, localResult.op, summand);
  3716. ReleaseIntermediateOperand(summand);
  3717. END
  3718. END;
  3719. result := localResult;
  3720. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3721. ReleaseIntermediateOperand(result.tag);
  3722. result.tag := TypeDescriptorAdr(resultingType);
  3723. IF ~newObjectFile THEN
  3724. IntermediateCode.MakeMemory(result.tag,addressType);
  3725. END;
  3726. ELSIF IsDelegate(resultingType) THEN
  3727. ReleaseIntermediateOperand(result.tag);
  3728. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3729. UseIntermediateOperand(result.tag);
  3730. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3731. ReleaseIntermediateOperand(result.tag);
  3732. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3733. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3734. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3735. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3736. (* finalize target array descriptor *)
  3737. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3738. (* write lengths and increments of target array for remaining dimensions *)
  3739. i := indexListSize;
  3740. WHILE indexDim < targetArrayDimensionality DO
  3741. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3742. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3743. ReleaseOperand(sourceLength);
  3744. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3745. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3746. ReleaseOperand(sourceIncrement);
  3747. INC(i); INC(indexDim);
  3748. END;
  3749. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3750. tmp := nil;
  3751. ELSE
  3752. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3753. END;
  3754. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3755. ReleaseIntermediateOperand(tmp);
  3756. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3757. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3758. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3759. ELSE
  3760. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3761. END;
  3762. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3763. ReleaseIntermediateOperand(tmp);
  3764. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3765. (* write dimensionality *)
  3766. IF targetArrayDimensionality # 0 THEN
  3767. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3768. END;
  3769. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3770. END;
  3771. ReleaseOperand(array);
  3772. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3773. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3774. END;
  3775. END MathIndexDesignator;
  3776. (* TENTATIVE *)
  3777. PROCEDURE DumpOperand(operand: Operand);
  3778. BEGIN
  3779. D.Log.String(" op = ");
  3780. IntermediateCode.DumpOperand(D.Log, operand.op );
  3781. D.Log.Ln;
  3782. D.Log.String(" tag = ");
  3783. IntermediateCode.DumpOperand(D.Log, operand.tag );
  3784. D.Log.Ln;
  3785. D.Log.String(" extra = ");
  3786. IntermediateCode.DumpOperand(D.Log, operand.extra );
  3787. D.Log.Ln;
  3788. D.Log.Update
  3789. END DumpOperand;
  3790. (* get the length of an array , trying to make use of static information *)
  3791. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3792. VAR res: IntermediateCode.Operand; size: LONGINT;
  3793. BEGIN
  3794. type := type.resolved;
  3795. IF type IS SyntaxTree.ArrayType THEN
  3796. WITH type: SyntaxTree.ArrayType DO
  3797. IF type.form = SyntaxTree.Static THEN
  3798. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3799. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3800. Evaluate(type.length, op);
  3801. ReleaseIntermediateOperand(op.tag);
  3802. RETURN op.op;*)
  3803. ELSE
  3804. res := tag;
  3805. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3806. IntermediateCode.MakeMemory(res,addressType);
  3807. UseIntermediateOperand(res);
  3808. RETURN res
  3809. END
  3810. END;
  3811. ELSE
  3812. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3813. RETURN IntermediateCode.Immediate(addressType,size);
  3814. END;
  3815. END ArrayLength;
  3816. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3817. BEGIN
  3818. ReleaseIntermediateOperand(res);
  3819. IF IsImmediate(x) & IsImmediate(y) THEN
  3820. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3821. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3822. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3823. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3824. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3825. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3826. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3827. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3828. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3829. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3830. UseIntermediateOperand(res);
  3831. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3832. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3833. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3834. UseIntermediateOperand(res);
  3835. ELSE
  3836. IF ~ReusableRegister(res) THEN
  3837. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3838. ELSE
  3839. UseIntermediateOperand(res);
  3840. END;
  3841. IF IsImmediate(x) & (x.intValue = 0) THEN
  3842. Emit(Mov(position,res,y))
  3843. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3844. Emit(Mov(position,res,x))
  3845. ELSE
  3846. Emit(Add(position,res, x, y));
  3847. END;
  3848. END;
  3849. END AddInt;
  3850. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3851. BEGIN
  3852. ReleaseIntermediateOperand(res);
  3853. IF IsImmediate(x) & IsImmediate(y) THEN
  3854. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3855. ELSE
  3856. IF ~ReusableRegister(res) THEN
  3857. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3858. ELSE UseIntermediateOperand(res);
  3859. END;
  3860. IF IsImmediate(x) & (x.intValue = 1) THEN
  3861. Emit(Mov(position,res,y))
  3862. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3863. Emit(Mov(position,res,x))
  3864. ELSE
  3865. Emit(Mul(position,res, x, y));
  3866. END;
  3867. END;
  3868. END MulInt;
  3869. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3870. BEGIN
  3871. ReleaseIntermediateOperand(res);
  3872. IF IsImmediate(x) & IsImmediate(y) THEN
  3873. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3874. ELSE
  3875. IF ~ReusableRegister(res) THEN
  3876. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3877. ELSE UseIntermediateOperand(res);
  3878. END;
  3879. IF IsImmediate(x) & (x.intValue = 1) THEN
  3880. Emit(Mov(position,res,y))
  3881. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3882. Emit(Mov(position,res,x))
  3883. ELSE
  3884. Emit(Div(position,res, x, y));
  3885. END;
  3886. END;
  3887. END DivInt;
  3888. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3889. VAR length,res: IntermediateCode.Operand; type: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3890. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3891. BEGIN
  3892. type := x.left.type.resolved;
  3893. IF type IS SyntaxTree.StringType THEN
  3894. atype := SyntaxTree.NewArrayType(-1, NIL, SyntaxTree.Static);
  3895. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3896. atype.SetLength(Global.NewIntegerValue(system,-1, type(SyntaxTree.StringType).length));
  3897. type := atype;
  3898. x.left.SetType(type);
  3899. END;
  3900. IntermediateCode.InitImmediate(res,addressType,0);
  3901. maxDim := x.parameters.Length()-1;
  3902. FOR i := 0 TO maxDim DO
  3903. e := x.parameters.GetExpression(i);
  3904. Evaluate(e,index);
  3905. Convert(index.op,addressType);
  3906. AddInt(res, res, index.op);
  3907. IF i = 0 THEN
  3908. (*
  3909. ReuseCopy(res, index.op);
  3910. *)
  3911. Designate(x.left,array);
  3912. type := x.left.type.resolved;
  3913. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3914. Dereference(array, type, FALSE);
  3915. END;
  3916. (*
  3917. ELSE AddInt(res, res, index.op);
  3918. *)
  3919. END;
  3920. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  3921. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  3922. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  3923. BoundCheck(index.op, length);
  3924. END;
  3925. ReleaseIntermediateOperand(length);
  3926. END;
  3927. ReleaseOperand(index);
  3928. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3929. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  3930. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3931. MulInt(res,res,length);
  3932. END;
  3933. ReleaseIntermediateOperand(length);
  3934. END;
  3935. IF (type IS SyntaxTree.ArrayType) THEN
  3936. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  3937. size := StaticSize(system, type);
  3938. IF size # 1 THEN
  3939. length := IntermediateCode.Immediate(addressType,size);
  3940. MulInt(res,res,length);
  3941. END;
  3942. ELSE
  3943. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  3944. IF size # 1 THEN
  3945. length := IntermediateCode.Immediate(addressType,size);
  3946. MulInt(res,res,length);
  3947. END;
  3948. END;
  3949. END;
  3950. AddInt(res,res,array.op);
  3951. InitOperand(result,ModeReference);
  3952. result.op := res;
  3953. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  3954. ReleaseIntermediateOperand(result.tag);
  3955. result.tag := TypeDescriptorAdr(type);
  3956. IF ~newObjectFile THEN
  3957. IntermediateCode.MakeMemory(result.tag,addressType);
  3958. END
  3959. ELSIF IsDelegate(type) THEN
  3960. ReleaseIntermediateOperand(result.tag);
  3961. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3962. UseIntermediateOperand(result.tag);
  3963. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3964. ReleaseIntermediateOperand(result.tag);
  3965. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  3966. ELSIF (type IS SyntaxTree.ArrayType) THEN
  3967. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  3968. END;
  3969. ReleaseOperand(array);
  3970. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  3971. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3972. END;
  3973. END IndexDesignator;
  3974. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  3975. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  3976. BEGIN
  3977. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  3978. dest := destination; destination := emptyOperand;
  3979. type := x.left.type.resolved;
  3980. IF type IS SyntaxTree.MathArrayType THEN
  3981. MathIndexDesignator(x);
  3982. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  3983. IndexDesignator(x);
  3984. END;
  3985. destination := dest;
  3986. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  3987. END VisitIndexDesignator;
  3988. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  3989. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  3990. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  3991. procedure: SyntaxTree.Procedure;
  3992. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  3993. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  3994. BEGIN
  3995. variable := GetTemporaryVariable(expression.left.type, FALSE);
  3996. parameters := expression.parameters;
  3997. moduleName := "FoxArrayBase";
  3998. procedureName := "CopyDescriptor";
  3999. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4000. SaveRegisters();ReleaseUsedRegisters(saved);
  4001. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4002. IF procedure = NIL THEN
  4003. s := "procedure ";
  4004. Strings.Append(s,moduleName);
  4005. Strings.Append(s,".");
  4006. Strings.Append(s,procedureName);
  4007. Strings.Append(s," not present");
  4008. Error(position,s);
  4009. ELSE
  4010. (* push address of temporary variable *)
  4011. Symbol(variable,destOperand);
  4012. Emit(Push(position,destOperand.op));
  4013. ReleaseOperand(destOperand);
  4014. (* push src *)
  4015. Evaluate(expression.left,srcOperand);
  4016. (*
  4017. Dereference(srcOperand,expression.type.resolved);
  4018. Emit(Push(position,srcOperand.tag));
  4019. *)
  4020. Emit(Push(position,srcOperand.op));
  4021. ReleaseOperand(srcOperand);
  4022. tensorFound := FALSE;
  4023. FOR i := 0 TO parameters.Length()-1 DO
  4024. e := parameters.GetExpression(i);
  4025. IF e IS SyntaxTree.TensorRangeExpression THEN
  4026. tensorFound := TRUE;
  4027. ELSIF e IS SyntaxTree.RangeExpression THEN
  4028. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4029. ELSE
  4030. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4031. END;
  4032. END;
  4033. Emit(Push(position,IntermediateCode.Immediate(int32,prefixIndices)));
  4034. Emit(Push(position,IntermediateCode.Immediate(int32,prefixRanges)));
  4035. Emit(Push(position,IntermediateCode.Immediate(int32,suffixIndices)));
  4036. Emit(Push(position,IntermediateCode.Immediate(int32,suffixRanges)));
  4037. StaticCallOperand(procOp,procedure);
  4038. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  4039. ReleaseOperand(procOp);
  4040. END;
  4041. RestoreRegisters(saved);
  4042. END;
  4043. RETURN variable
  4044. END PrepareTensorDescriptor;
  4045. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4046. VAR
  4047. type, descriptorType, baseType: SyntaxTree.Type;
  4048. operand, tmpOperand, variableOp, variable2Op: Operand;
  4049. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4050. variable, variable2: SyntaxTree.Variable;
  4051. dim, i, size: LONGINT;
  4052. (* TODO: needed? *)
  4053. oldArrayDestinationTag: IntermediateCode.Operand;
  4054. oldArrayDestinationDimension: LONGINT;
  4055. position: LONGINT;
  4056. saved: RegisterEntry;
  4057. arrayFlags: SET;
  4058. m, n: LONGINT;
  4059. PROCEDURE Pass(op: IntermediateCode.Operand);
  4060. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4061. BEGIN
  4062. IF numberRegister >= 0 THEN
  4063. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  4064. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4065. Emit(Mov(position,parameterRegister, op));
  4066. ELSE
  4067. Emit(Push(position,op))
  4068. END
  4069. END Pass;
  4070. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4071. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4072. BEGIN
  4073. formalType := formalType.resolved; actualType := actualType.resolved;
  4074. IF IsOpenArray(formalType)THEN
  4075. IF actualType IS SyntaxTree.StringType THEN
  4076. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4077. RETURN;
  4078. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4079. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4080. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4081. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4082. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4083. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4084. ELSE
  4085. tmp := baseReg;
  4086. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4087. IntermediateCode.MakeMemory(tmp,addressType);
  4088. Pass((tmp));
  4089. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4090. END;
  4091. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4092. END;
  4093. END PushArrayLens;
  4094. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4095. BEGIN
  4096. CASE size OF
  4097. |2: INCL(flags,Size2Flag);
  4098. |3: INCL(flags,Size3Flag);
  4099. |4: INCL(flags,Size4Flag);
  4100. |5: INCL(flags,Size5Flag);
  4101. |6: INCL(flags,Size6Flag);
  4102. |7: INCL(flags,Size7Flag);
  4103. |8: INCL(flags,Size8Flag);
  4104. END;
  4105. END SetSmallArraySizeFlag;
  4106. BEGIN
  4107. IF Trace THEN TraceEnter("PushParameter") END;
  4108. position := expression.position;
  4109. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4110. type := expression.type.resolved;
  4111. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4112. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4113. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4114. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4115. );
  4116. (* TODO: needed? *)
  4117. oldArrayDestinationTag := arrayDestinationTag;
  4118. oldArrayDestinationDimension := arrayDestinationDimension;
  4119. IF IsArrayOfSystemByte(parameter.type) THEN
  4120. Designate(expression,operand);
  4121. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4122. ReleaseIntermediateOperand(operand.tag);
  4123. operand.tag := tmp;
  4124. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4125. Pass((operand.tag));
  4126. END;
  4127. Pass((operand.op));
  4128. ELSIF IsOpenArray(parameter.type) THEN
  4129. Designate(expression,operand);
  4130. baseReg := operand.tag;
  4131. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4132. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4133. END;
  4134. Pass((operand.op)); (* address of the array *)
  4135. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4136. (* case 1 *)
  4137. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4138. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4139. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4140. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4141. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4142. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4143. arrayDestinationTag := sp;
  4144. (* case 1b *)
  4145. IF expression IS SyntaxTree.IndexDesignator THEN
  4146. (*
  4147. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4148. descriptorType := GetMathArrayDescriptorType(dim);
  4149. variable := GetTemporaryVariable(descriptorType,expression.position);
  4150. Symbol(variable,variableOp);
  4151. arrayDestinationTag := variableOp.op;
  4152. *)
  4153. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4154. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4155. arrayDestinationDimension := dim;
  4156. Designate(expression,operand);
  4157. (* case 1a *)
  4158. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4159. Designate(expression,operand);
  4160. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4161. i := 0;
  4162. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4163. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4164. INC(i);
  4165. END;
  4166. type := expression.type.resolved;
  4167. WHILE (i<dim) DO (* remaining static dimensions *)
  4168. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4169. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4170. ReleaseOperand(tmpOperand);
  4171. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4172. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4173. ReleaseOperand(tmpOperand);
  4174. INC(i);
  4175. END;
  4176. dimOp := IntermediateCode.Immediate(addressType,dim);
  4177. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4178. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4179. (* case 1d *)
  4180. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4181. Designate(expression,operand);
  4182. Dereference(operand,type.resolved,FALSE);
  4183. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4184. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4185. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4186. (* case 1f *)
  4187. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4188. Designate(expression,operand);
  4189. FOR i := 0 TO dim-1 DO
  4190. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4191. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4192. ReleaseOperand(tmpOperand);
  4193. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4194. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4195. ReleaseOperand(tmpOperand);
  4196. END;
  4197. (*******
  4198. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4199. *)
  4200. arrayFlags := {StaticFlag};
  4201. IF dim = 1 THEN
  4202. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4203. ReleaseOperand(tmpOperand);
  4204. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4205. m := LONGINT(tmpOperand.op.intValue);
  4206. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4207. ELSIF dim = 2 THEN
  4208. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4209. ReleaseOperand(tmpOperand);
  4210. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4211. m := LONGINT(tmpOperand.op.intValue);
  4212. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4213. ReleaseOperand(tmpOperand);
  4214. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4215. n := LONGINT(tmpOperand.op.intValue);
  4216. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4217. INCL(arrayFlags,SmallMatrixFlag);
  4218. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4219. END;
  4220. END;
  4221. (*******)
  4222. dimOp := IntermediateCode.Immediate(addressType,dim);
  4223. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4224. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4225. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4226. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4227. baseType := SemanticChecker.ArrayBase(type,dim);
  4228. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4229. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4230. ELSE HALT(100);
  4231. END;
  4232. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4233. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4234. (* case 2b *)
  4235. IF expression IS SyntaxTree.IndexDesignator THEN
  4236. descriptorType := GetMathArrayDescriptorType(dim);
  4237. variable := GetTemporaryVariable(descriptorType, FALSE);
  4238. Symbol(variable,variableOp);
  4239. arrayDestinationTag := variableOp.op;
  4240. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4241. arrayDestinationDimension := dim;
  4242. NeedDescriptor := TRUE;
  4243. Designate(expression,operand);
  4244. Pass((operand.tag));
  4245. NeedDescriptor := FALSE;
  4246. (* case 2a *)
  4247. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4248. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4249. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4250. INC(i);
  4251. END;
  4252. IF i = dim THEN
  4253. Designate(expression,operand);
  4254. Pass((operand.tag));
  4255. ELSE (* open-static *)
  4256. type := expression.type.resolved;
  4257. descriptorType := GetMathArrayDescriptorType(dim);
  4258. variable := GetTemporaryVariable(descriptorType, FALSE);
  4259. Symbol(variable,variableOp);
  4260. arrayDestinationTag := variableOp.op;
  4261. Designate(expression,operand);
  4262. FOR i := 0 TO dim-1 DO
  4263. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4264. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4265. ReleaseOperand(tmpOperand);
  4266. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4267. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4268. ReleaseOperand(tmpOperand);
  4269. END;
  4270. dimOp := IntermediateCode.Immediate(addressType,dim);
  4271. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4272. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4273. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4274. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4275. baseType := SemanticChecker.ArrayBase(type,dim);
  4276. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4277. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4278. Pass((arrayDestinationTag));
  4279. END;
  4280. (* case 2d *)
  4281. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4282. Designate(expression,operand);
  4283. Dereference(operand,type.resolved,FALSE);
  4284. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4285. Pass((operand.tag));
  4286. (* case 2f *)
  4287. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4288. descriptorType := GetMathArrayDescriptorType(dim);
  4289. variable := GetTemporaryVariable(descriptorType, FALSE);
  4290. Symbol(variable,variableOp);
  4291. arrayDestinationTag := variableOp.op;
  4292. Designate(expression,operand);
  4293. FOR i := 0 TO dim-1 DO
  4294. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4295. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4296. ReleaseOperand(tmpOperand);
  4297. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4298. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4299. ReleaseOperand(tmpOperand);
  4300. END;
  4301. (*
  4302. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4303. *)
  4304. arrayFlags := {StaticFlag};
  4305. IF dim = 1 THEN
  4306. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4307. ReleaseOperand(tmpOperand);
  4308. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4309. m := LONGINT(tmpOperand.op.intValue);
  4310. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4311. ELSIF dim = 2 THEN
  4312. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4313. ReleaseOperand(tmpOperand);
  4314. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4315. m := LONGINT(tmpOperand.op.intValue);
  4316. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4317. ReleaseOperand(tmpOperand);
  4318. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4319. n := LONGINT(tmpOperand.op.intValue);
  4320. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4321. INCL(arrayFlags,SmallMatrixFlag);
  4322. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4323. END;
  4324. END;
  4325. (*******)
  4326. dimOp := IntermediateCode.Immediate(addressType,dim);
  4327. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4328. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4329. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4330. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4331. baseType := SemanticChecker.ArrayBase(type,dim);
  4332. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4333. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4334. Pass((arrayDestinationTag));
  4335. ELSE HALT(100);
  4336. END;
  4337. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4338. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4339. (* case 3b *)
  4340. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4341. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4342. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4343. Symbol(variable,variableOp);
  4344. LoadValue(variableOp,system.addressType);
  4345. ELSE
  4346. descriptorType := GetMathArrayDescriptorType(dim);
  4347. variable := GetTemporaryVariable(descriptorType, FALSE);
  4348. Symbol(variable,variableOp);
  4349. END;
  4350. arrayDestinationTag := variableOp.op;
  4351. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4352. arrayDestinationDimension := 0;
  4353. Designate(expression,operand);
  4354. Pass((operand.tag));
  4355. (* case 3a *)
  4356. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4357. i := 0;
  4358. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4359. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4360. INC(i);
  4361. END;
  4362. IF i = dim THEN
  4363. Designate(expression,operand);
  4364. Pass((operand.tag));
  4365. ELSE (* open-static *)
  4366. type := expression.type.resolved;
  4367. descriptorType := GetMathArrayDescriptorType(dim);
  4368. variable := GetTemporaryVariable(descriptorType, FALSE);
  4369. Symbol(variable,variableOp);
  4370. arrayDestinationTag := variableOp.op;
  4371. Designate(expression,operand);
  4372. FOR i := 0 TO dim-1 DO
  4373. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4374. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4375. ReleaseOperand(tmpOperand);
  4376. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4377. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4378. ReleaseOperand(tmpOperand);
  4379. END;
  4380. dimOp := IntermediateCode.Immediate(addressType,dim);
  4381. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4382. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4383. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4384. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4385. baseType := SemanticChecker.ArrayBase(type,dim);
  4386. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4387. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4388. Pass((arrayDestinationTag));
  4389. END;
  4390. (* case 3d *)
  4391. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4392. Designate(expression,operand);
  4393. Dereference(operand,type.resolved,FALSE);
  4394. (*
  4395. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4396. *)
  4397. Pass((operand.tag));
  4398. (* case 3f *)
  4399. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4400. descriptorType := GetMathArrayDescriptorType(dim);
  4401. variable := GetTemporaryVariable(descriptorType, FALSE);
  4402. Symbol(variable,variableOp);
  4403. arrayDestinationTag := variableOp.op;
  4404. Designate(expression,operand);
  4405. IF operand.op.type.length >1 THEN (* vector register *)
  4406. variable2 := GetTemporaryVariable(type, FALSE);
  4407. Symbol(variable2, variable2Op);
  4408. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4409. Emit(Mov(position,tmp, operand.op));
  4410. ReleaseOperand(operand);
  4411. Symbol(variable2, operand);
  4412. END;
  4413. FOR i := 0 TO dim-1 DO
  4414. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4415. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4416. ReleaseOperand(tmpOperand);
  4417. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4418. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4419. ReleaseOperand(tmpOperand);
  4420. END;
  4421. dimOp := IntermediateCode.Immediate(addressType,dim);
  4422. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4423. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4424. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4425. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4426. baseType := SemanticChecker.ArrayBase(type,dim);
  4427. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4428. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4429. Pass((arrayDestinationTag));
  4430. ELSE HALT(100);
  4431. END;
  4432. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4433. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4434. (* case 4b *)
  4435. IF (expression IS SyntaxTree.IndexDesignator) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4436. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4437. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4438. Symbol(variable,variableOp);
  4439. LoadValue(variableOp,system.addressType);
  4440. ELSE
  4441. descriptorType := GetMathArrayDescriptorType(dim);
  4442. variable := GetTemporaryVariable(descriptorType, FALSE);
  4443. Symbol(variable,variableOp);
  4444. END;
  4445. arrayDestinationTag := variableOp.op;
  4446. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4447. arrayDestinationDimension := 0;
  4448. Designate(expression,operand);
  4449. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4450. Symbol(variable,variableOp);
  4451. ELSE
  4452. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4453. Symbol(variable,variableOp);
  4454. MakeMemory(tmp,variableOp.op,addressType,0);
  4455. Emit(Mov(position,tmp,operand.tag));
  4456. ReleaseIntermediateOperand(tmp);
  4457. END;
  4458. Pass((variableOp.op));
  4459. ReleaseOperand(variableOp);
  4460. (* case 4a *)
  4461. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4462. i := 0;
  4463. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4464. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4465. INC(i);
  4466. END;
  4467. IF i = dim THEN
  4468. Designate(expression,operand);
  4469. arrayDestinationTag := operand.tag;
  4470. ELSE (* open-static *)
  4471. type := expression.type.resolved;
  4472. descriptorType := GetMathArrayDescriptorType(dim);
  4473. variable := GetTemporaryVariable(descriptorType, FALSE);
  4474. Symbol(variable,variableOp);
  4475. arrayDestinationTag := variableOp.op;
  4476. Designate(expression,operand);
  4477. FOR i := 0 TO dim-1 DO
  4478. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4479. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4480. ReleaseOperand(tmpOperand);
  4481. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4482. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4483. ReleaseOperand(tmpOperand);
  4484. END;
  4485. dimOp := IntermediateCode.Immediate(addressType,dim);
  4486. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4487. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4488. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4489. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4490. baseType := SemanticChecker.ArrayBase(type,dim);
  4491. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4492. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4493. END;
  4494. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4495. Symbol(variable,variableOp);
  4496. MakeMemory(tmp,variableOp.op,addressType,0);
  4497. Emit(Mov(position,tmp,arrayDestinationTag));
  4498. ReleaseIntermediateOperand(tmp);
  4499. Pass((variableOp.op));
  4500. ReleaseOperand(variableOp);
  4501. (* case 4d *)
  4502. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4503. Designate(expression,operand);
  4504. (*
  4505. Dereference(operand,type.resolved,FALSE);
  4506. *)
  4507. (*
  4508. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4509. *)
  4510. Pass((operand.op));
  4511. (* case 4f *)
  4512. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4513. descriptorType := GetMathArrayDescriptorType(dim);
  4514. variable := GetTemporaryVariable(descriptorType, FALSE);
  4515. Symbol(variable,variableOp);
  4516. arrayDestinationTag := variableOp.op;
  4517. Designate(expression,operand);
  4518. FOR i := 0 TO dim-1 DO
  4519. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4520. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4521. ReleaseOperand(tmpOperand);
  4522. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4523. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4524. ReleaseOperand(tmpOperand);
  4525. END;
  4526. dimOp := IntermediateCode.Immediate(addressType,dim);
  4527. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4528. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4529. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4530. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4531. baseType := SemanticChecker.ArrayBase(type,dim);
  4532. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4533. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4534. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4535. Symbol(variable,variableOp);
  4536. MakeMemory(tmp,variableOp.op,addressType,0);
  4537. Emit(Mov(position,tmp,arrayDestinationTag));
  4538. ReleaseIntermediateOperand(tmp);
  4539. Pass((variableOp.op));
  4540. ReleaseOperand(variableOp);
  4541. ELSE HALT(100);
  4542. END;
  4543. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4544. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4545. Designate(expression,operand);
  4546. IF operand.op.type.length > 1 THEN
  4547. Emit(Push(position, operand.op));
  4548. ReleaseOperand(operand);
  4549. ELSE
  4550. size := system.SizeOf(type);
  4551. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4552. size := ToMemoryUnits(system,size);
  4553. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4554. arrayDestinationTag := sp;
  4555. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4556. END;
  4557. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4558. Designate(expression,operand);
  4559. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4560. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4561. Symbol(variable,variableOp);
  4562. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4563. Emit(Mov(position,tmp,operand.op));
  4564. Emit(Push(position,variableOp.op));
  4565. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4566. Pass((operand.op));
  4567. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4568. END;
  4569. ELSE HALT(200)
  4570. END;
  4571. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4572. IF parameter.kind = SyntaxTree.VarParameter THEN
  4573. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4574. Designate(expression, operand);
  4575. Pass((operand.op));
  4576. ELSE
  4577. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4578. Evaluate(expression, operand);
  4579. Pass((operand.extra)); (* step *)
  4580. Pass((operand.tag)); (* last *)
  4581. Pass((operand.op)) (* first *)
  4582. END
  4583. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4584. IF parameter.kind = SyntaxTree.VarParameter THEN
  4585. Designate(expression, operand);
  4586. Pass((operand.op));
  4587. ELSE
  4588. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4589. Evaluate(expression, operand);
  4590. Pass((operand.tag)); (* real part *)
  4591. Pass((operand.op)) (* imaginary part *)
  4592. END
  4593. ELSE
  4594. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4595. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4596. Designate(expression,operand);
  4597. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4598. (* stack allocation *)
  4599. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4600. (*! parameter alignment to be discussed ... *)
  4601. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4602. size := type(SyntaxTree.StringType).length;
  4603. END;
  4604. IF backend.cooperative & parameter.NeedsTrace() THEN
  4605. dst := NewRegisterOperand (addressType);
  4606. Emit(Mov(position,dst, sp));
  4607. IntermediateCode.InitImmediate(null, byteType, 0);
  4608. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4609. ReleaseIntermediateOperand(dst);
  4610. SaveRegisters();ReleaseUsedRegisters(saved);
  4611. (* register dst has been freed before SaveRegisters already *)
  4612. CallAssignMethod(dst, operand.op, parameter.type);
  4613. RestoreRegisters(saved);
  4614. END;
  4615. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4616. ELSIF IsOpenArray(parameter.type) THEN
  4617. Designate(expression,operand);
  4618. baseReg := operand.tag;
  4619. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4620. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4621. END;
  4622. Pass((operand.op)); (* address of the array *)
  4623. ELSIF IsDelegate(parameter.type) THEN
  4624. Evaluate(expression,operand);
  4625. IF backend.cooperative & parameter.NeedsTrace() THEN
  4626. Emit(Push(position, nil));
  4627. dst := NewRegisterOperand (addressType);
  4628. Emit(Mov(position,dst, sp));
  4629. ReleaseIntermediateOperand(dst);
  4630. SaveRegisters();ReleaseUsedRegisters(saved);
  4631. Emit(Push(position, dst));
  4632. (* register dst has been freed before SaveRegisters already *)
  4633. Emit(Push(position, operand.tag));
  4634. CallThis(position,"GarbageCollector","Assign",2);
  4635. RestoreRegisters(saved);
  4636. ELSE
  4637. Pass((operand.tag));
  4638. END;
  4639. Pass((operand.op));
  4640. ELSE
  4641. Evaluate(expression,operand);
  4642. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4643. Emit(Push(position, nil));
  4644. dst := NewRegisterOperand (addressType);
  4645. Emit(Mov(position,dst, sp));
  4646. ReleaseIntermediateOperand(dst);
  4647. SaveRegisters();ReleaseUsedRegisters(saved);
  4648. Emit(Push(position, dst));
  4649. (* register dst has been freed before SaveRegisters already *)
  4650. Emit(Push(position, operand.op));
  4651. CallThis(position,"GarbageCollector","Assign",2);
  4652. RestoreRegisters(saved);
  4653. ELSE
  4654. Pass((operand.op));
  4655. END;
  4656. END;
  4657. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4658. Evaluate(expression,operand);
  4659. Pass((operand.op));
  4660. ELSE (* var parameter *)
  4661. Designate(expression,operand);
  4662. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4663. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4664. Pass((operand.tag));
  4665. END;
  4666. END;
  4667. Pass((operand.op));
  4668. END;
  4669. END;
  4670. (* TODO: needed? *)
  4671. arrayDestinationTag := oldArrayDestinationTag;
  4672. arrayDestinationDimension := oldArrayDestinationDimension;
  4673. IF needsParameterBackup THEN
  4674. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4675. ReuseCopy(parameterBackup, operand.op)
  4676. END;
  4677. ReleaseOperand(operand);
  4678. IF Trace THEN TraceExit("PushParameter") END;
  4679. END PushParameter;
  4680. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4681. VAR prevConditional: BOOLEAN;
  4682. BEGIN
  4683. prevConditional := conditional;
  4684. conditional := FALSE;
  4685. IF (x.result # NIL) & ( x.result IS SyntaxTree.SymbolDesignator) & (x.result(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) & (x.result(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).useRegister) THEN
  4686. Expression(x.result); (* use register *)
  4687. END;
  4688. Statement(x.statement);
  4689. conditional := prevConditional;
  4690. IF x.result # NIL THEN Expression(x.result) END;
  4691. IF (x.result # NIL) & (x.result IS SyntaxTree.SymbolDesignator) & (x.result(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) & (x.result(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).useRegister) THEN
  4692. ReleaseIntermediateOperand(result.op);
  4693. END;
  4694. END VisitStatementDesignator;
  4695. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4696. VAR
  4697. procedure: SyntaxTree.Procedure;
  4698. procedureType: SyntaxTree.ProcedureType;
  4699. wasInline: BOOLEAN;
  4700. actualParameters: SyntaxTree.ExpressionList;
  4701. formalParameter: SyntaxTree.Parameter;
  4702. actualParameter: SyntaxTree.Expression;
  4703. i: LONGINT;
  4704. localVariable: SyntaxTree.Variable;
  4705. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4706. src, dest: Operand;
  4707. prevInlineExit : Label;
  4708. prevMapper: SymbolMapper;
  4709. tooComplex: BOOLEAN;
  4710. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4711. BEGIN
  4712. IF e = NIL THEN RETURN TRUE
  4713. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4714. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4715. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4716. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4717. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4718. ELSE RETURN FALSE
  4719. END;
  4720. END SimpleExpression;
  4721. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4722. BEGIN
  4723. RETURN checker.CanPassInRegister(type)
  4724. END FitsInRegister;
  4725. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4726. VAR
  4727. variable: SyntaxTree.Variable;
  4728. variableDesignator: SyntaxTree.Designator;
  4729. BEGIN
  4730. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type));
  4731. variableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4732. variableDesignator.SetType(type);
  4733. RETURN variableDesignator
  4734. END GetTemp;
  4735. BEGIN
  4736. wasInline := currentIsInline;
  4737. prevInlineExit := currentInlineExit;
  4738. prevMapper := currentMapper;
  4739. currentInlineExit := NewLabel();
  4740. tooComplex := FALSE;
  4741. NEW(currentMapper);
  4742. currentIsInline := TRUE;
  4743. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4744. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4745. formalParameter := procedureType.firstParameter;
  4746. actualParameters := x.parameters;
  4747. i := 0;
  4748. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4749. actualParameter := actualParameters.GetExpression(i);
  4750. IF actualParameter.resolved # NIL THEN
  4751. actualParameter := actualParameter.resolved
  4752. END;
  4753. (*
  4754. if expression is simple and can be passed immediately
  4755. or if type fits in register then we can proceed
  4756. otherwise we escape to ordinary procedure call.
  4757. *)
  4758. (* cases where the expression can be mapped identically *)
  4759. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4760. currentMapper.Add(formalParameter, actualParameter, NIL);
  4761. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4762. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4763. (*
  4764. Assign(variableDesignator, actualParameter);
  4765. *)
  4766. Evaluate(actualParameter, src);
  4767. Designate(variableDesignator, dest);
  4768. Emit(Mov(x.position, dest.op, src.op));
  4769. ReleaseOperand(dest);
  4770. ReleaseOperand(src);
  4771. currentMapper.Add(formalParameter, variableDesignator, NIL);
  4772. ELSE tooComplex := TRUE
  4773. END;
  4774. (*
  4775. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4776. currentMapper.Add(formalParameter, actualParameter, NIL);
  4777. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4778. variableDesignator := GetTemp(system.addressType, FALSE);
  4779. Designate(actualParameter, src);
  4780. Designate(variableDesignator, dest);
  4781. IntermediateCode.MakeMemory(dest.op,addressType);
  4782. Emit(Mov(x.position, dest.op, src.op));
  4783. ReleaseOperand(dest);
  4784. IF src.tag.mode # IntermediateCode.Undefined THEN
  4785. tagDesignator := GetTemp(system.addressType, FALSE);
  4786. Designate(tagDesignator, dest);
  4787. IntermediateCode.MakeMemory(dest.op,addressType);
  4788. Emit(Mov(x.position, dest.op, src.op));
  4789. END;
  4790. ReleaseOperand(dest); ReleaseOperand(src);
  4791. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4792. END;
  4793. *)
  4794. formalParameter := formalParameter.nextParameter;
  4795. INC(i);
  4796. END;
  4797. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4798. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4799. currentMapper.Add(NIL, returnDesignator, NIL);
  4800. END;
  4801. localVariable := procedure.procedureScope.firstVariable;
  4802. WHILE ~tooComplex & (localVariable # NIL) DO
  4803. variableDesignator := GetTemp(localVariable.type, FALSE);
  4804. currentMapper.Add(localVariable, variableDesignator, NIL);
  4805. localVariable := localVariable.nextVariable;
  4806. END;
  4807. IF ~tooComplex THEN
  4808. VisitStatementBlock(procedure.procedureScope.body);
  4809. SetLabel(currentInlineExit);
  4810. IF procedureType.returnType # NIL THEN
  4811. Designate(returnDesignator, result);
  4812. IF conditional THEN
  4813. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4814. ValueToCondition(result)
  4815. END;
  4816. END;
  4817. END;
  4818. currentMapper := prevMapper;
  4819. currentInlineExit := prevInlineExit;
  4820. currentIsInline := wasInline;
  4821. RETURN ~tooComplex
  4822. END InlineProcedureCall;
  4823. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4824. VAR
  4825. parameters: SyntaxTree.ExpressionList;
  4826. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4827. designator: SyntaxTree.Designator;
  4828. procedureType: SyntaxTree.ProcedureType;
  4829. formalParameter: SyntaxTree.Parameter;
  4830. operand, returnValue: Operand;
  4831. reg, size, mask, dest: IntermediateCode.Operand;
  4832. saved: RegisterEntry;
  4833. symbol: SyntaxTree.Symbol;
  4834. variable: SyntaxTree.Variable;
  4835. i, parametersSize, returnTypeSize : LONGINT;
  4836. structuredReturnType: BOOLEAN;
  4837. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4838. tempVariableDesignator: SyntaxTree.Designator;
  4839. gap, alignment: LONGINT; (*fld*)
  4840. (* TODO: remove unnecessary backup variables *)
  4841. oldResult: Operand;
  4842. oldCurrentScope: SyntaxTree.Scope;
  4843. oldArrayDestinationTag: IntermediateCode.Operand;
  4844. oldArrayDestinationDimension: LONGINT;
  4845. oldConstantDeclaration: SyntaxTree.Symbol;
  4846. oldDestination: IntermediateCode.Operand;
  4847. oldCurrentLoop: Label;
  4848. oldConditional: BOOLEAN;
  4849. oldTrueLabel, oldFalseLabel: Label;
  4850. oldLocked: BOOLEAN;
  4851. usedRegisters,oldUsedRegisters: RegisterEntry;
  4852. return: IntermediateCode.Operand;
  4853. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  4854. arg: IntermediateCode.Operand;
  4855. dummy: IntermediateCode.Operand;
  4856. recordType: SyntaxTree.RecordType;
  4857. operatorSelectionProcedureOperand: Operand;
  4858. operatorSelectionProcedure: SyntaxTree.Procedure;
  4859. fingerPrint: SyntaxTree.FingerPrint;
  4860. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  4861. identifierNumber: LONGINT;
  4862. parameterRegister: Backend.Registers;
  4863. parameterRegisters: LONGINT;
  4864. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  4865. procedure: SyntaxTree.Procedure;
  4866. PROCEDURE BackupGlobalState;
  4867. BEGIN
  4868. oldResult := result;
  4869. oldCurrentScope := currentScope;
  4870. oldArrayDestinationTag := arrayDestinationTag;
  4871. oldArrayDestinationDimension := arrayDestinationDimension;
  4872. oldConstantDeclaration := constantDeclaration;
  4873. oldDestination := destination;
  4874. oldCurrentLoop := currentLoop;
  4875. oldConditional := conditional;
  4876. oldTrueLabel := trueLabel;
  4877. oldFalseLabel := falseLabel;
  4878. oldLocked := locked;
  4879. oldUsedRegisters := usedRegisters
  4880. END BackupGlobalState;
  4881. PROCEDURE RestoreGlobalState;
  4882. BEGIN
  4883. result := oldResult;
  4884. currentScope := oldCurrentScope;
  4885. arrayDestinationTag := oldArrayDestinationTag;
  4886. arrayDestinationDimension := oldArrayDestinationDimension;
  4887. constantDeclaration := oldConstantDeclaration;
  4888. destination := oldDestination;
  4889. currentLoop := oldCurrentLoop;
  4890. conditional := oldConditional;
  4891. trueLabel := oldTrueLabel;
  4892. falseLabel := oldFalseLabel;
  4893. locked := oldLocked;
  4894. usedRegisters := oldUsedRegisters
  4895. END RestoreGlobalState;
  4896. (** do preparations before parameter push for array-structured object types (ASOTs):
  4897. if ASOT is passed as VAR parameter:
  4898. - allocate temporary variable of math array type
  4899. - copy contents of ASOT to be passed to temporary variable
  4900. - use temporary variable as the actual parameter instead
  4901. - create and store a write-back call in a list (an index operator call that writes the contents of the temp. variable back into the ASOT)
  4902. **)
  4903. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  4904. VAR
  4905. expression: SyntaxTree.Expression;
  4906. BEGIN
  4907. IF actualParameter IS SyntaxTree.Designator THEN
  4908. designator := actualParameter(SyntaxTree.Designator);
  4909. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  4910. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  4911. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  4912. ASSERT(checker # NIL);
  4913. checker.SetCurrentScope(currentScope);
  4914. (* allocate temporary variable *)
  4915. ASSERT(actualParameter.type # NIL);
  4916. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  4917. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4918. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4919. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4920. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  4921. ASSERT(tempVariableDesignator.type # NIL);
  4922. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  4923. (* copy math array stored in actual parameter to temporary variable *)
  4924. BackupGlobalState;
  4925. AssignMathArray(tempVariableDesignator, actualParameter);
  4926. RestoreGlobalState;
  4927. (* use temporary variable as actual parameter instead of the original one *)
  4928. actualParameter := tempVariableDesignator;
  4929. (* create write-back call and store it in linked list *)
  4930. (* create new list entry *)
  4931. IF firstWriteBackCall = NIL THEN
  4932. NEW(firstWriteBackCall);
  4933. currentWriteBackCall := firstWriteBackCall
  4934. ELSE
  4935. ASSERT(currentWriteBackCall # NIL);
  4936. NEW(currentWriteBackCall.next);
  4937. currentWriteBackCall := currentWriteBackCall.next
  4938. END;
  4939. expression := checker.NewIndexOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4940. ASSERT(expression.type = NIL);
  4941. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4942. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  4943. (* prepare writeback for any other "normal" indexer *)
  4944. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4945. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4946. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4947. Assign(tempVariableDesignator, actualParameter);
  4948. actualParameter := tempVariableDesignator;
  4949. IF firstWriteBackCall = NIL THEN
  4950. NEW(firstWriteBackCall);
  4951. currentWriteBackCall := firstWriteBackCall
  4952. ELSE
  4953. ASSERT(currentWriteBackCall # NIL);
  4954. NEW(currentWriteBackCall.next);
  4955. currentWriteBackCall := currentWriteBackCall.next
  4956. END;
  4957. expression := checker.NewObjectOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4958. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4959. END
  4960. END
  4961. END PrepareParameter;
  4962. BEGIN
  4963. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  4964. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  4965. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4966. IF procedure.isOberonInline & (procedure.scope.ownerModule = module.module) THEN
  4967. IF InlineProcedureCall(x) THEN
  4968. RETURN
  4969. ELSE
  4970. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  4971. END
  4972. END;
  4973. END;
  4974. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4975. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  4976. dest := destination; destination := emptyOperand;
  4977. SaveRegisters();ReleaseUsedRegisters(saved);
  4978. parameters := x.parameters;
  4979. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  4980. (* an operator is called *)
  4981. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4982. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  4983. (* check if a dynamic operator call should be performed *)
  4984. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  4985. ELSE
  4986. isCallOfDynamicOperator := FALSE
  4987. END;
  4988. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  4989. Emit(Push(position, ap));
  4990. END;
  4991. alignment := procedureType.stackAlignment;
  4992. IF alignment > 1 THEN
  4993. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4994. Emit(Mov(position,reg, sp));
  4995. gap := ParametersSize(system, procedureType, FALSE) + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  4996. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  4997. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  4998. Emit(And(position,sp, sp, mask));
  4999. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5000. Emit(Push(position,reg));
  5001. (*
  5002. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  5003. Emit(Mov(position,mem,reg));
  5004. *)
  5005. ReleaseIntermediateOperand(reg);
  5006. END;
  5007. IF (procedureType.callingConvention = SyntaxTree.DarwinCCallingConvention) & (system.addressSize = 32) THEN
  5008. (* align stack to 16-byte boundary *)
  5009. IntermediateCode.InitImmediate(mask,addressType,-16);
  5010. Emit(And(position,sp, sp, mask))
  5011. END;
  5012. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5013. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5014. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5015. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5016. ELSE
  5017. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5018. END;
  5019. Evaluate(x.left, operand);
  5020. IF symbol IS SyntaxTree.Procedure THEN
  5021. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5022. Emit(Push(position,operand.tag));
  5023. ELSIF (procedureType.isDelegate) THEN
  5024. Emit(Push(position,operand.tag));
  5025. END;
  5026. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5027. IF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5028. Emit(Push(position,operand.tag));
  5029. END;
  5030. ELSE HALT(200);
  5031. END;
  5032. ReleaseIntermediateOperand(operand.tag);
  5033. operand.tag := emptyOperand;
  5034. (* determine if a structured return type is needed *)
  5035. structuredReturnType := StructuredReturnType(procedureType);
  5036. IF structuredReturnType THEN
  5037. IF resultDesignator # NIL THEN
  5038. d := resultDesignator;
  5039. ELSE
  5040. variable := GetTemporaryVariable(procedureType.returnType, FALSE);
  5041. variable.SetUntraced(procedureType.hasUntracedReturn);
  5042. d := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  5043. d.SetType(variable.type);
  5044. END;
  5045. IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5046. Designate(d,returnValue);
  5047. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5048. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5049. Emit(Push(position,size));
  5050. Emit(Push(position,returnValue.op));
  5051. ReleaseOperand(returnValue);
  5052. ELSE
  5053. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  5054. END;
  5055. END;
  5056. firstWriteBackCall := NIL; (* reset write-back call list *)
  5057. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  5058. parameterRegister := backend.GetParameterRegisters(procedureType.callingConvention);
  5059. IF parameterRegister = NIL THEN parameterRegisters := 0
  5060. ELSE parameterRegisters := LEN(parameterRegister)
  5061. END;
  5062. passByRegister := parameterRegisters > 0;
  5063. registerNumber := 0;
  5064. formalParameter := procedureType.lastParameter;
  5065. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5066. actualParameter := parameters.GetExpression(i);
  5067. PrepareParameter(actualParameter, formalParameter);
  5068. IF passByRegister & (i < parameterRegisters) THEN
  5069. IF ~PassInRegister(formalParameter) THEN
  5070. Error(actualParameter.position,"cannot be passed by register")
  5071. ELSE
  5072. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,parameterRegister[i]);
  5073. END;
  5074. INC(registerNumber);
  5075. ELSE
  5076. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5077. END;
  5078. formalParameter := formalParameter.prevParameter;
  5079. END;
  5080. IF passByRegister & (registerNumber > 0) & ~SysvABI(procedureType.callingConvention) THEN
  5081. stackSize := ToMemoryUnits(system,parameterRegisters*addressType.sizeInBits);
  5082. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5083. END;
  5084. ELSE
  5085. hasDynamicOperands := FALSE;
  5086. formalParameter := procedureType.firstParameter;
  5087. FOR i := 0 TO parameters.Length() - 1 DO
  5088. actualParameter := parameters.GetExpression(i);
  5089. IF formalParameter # NIL THEN (* TENTATIVE *)
  5090. PrepareParameter(actualParameter, formalParameter);
  5091. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5092. ASSERT(i < 2);
  5093. hasDynamicOperands := TRUE;
  5094. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  5095. ELSE
  5096. IF passByRegister & (registerNumber > 0) THEN
  5097. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5098. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5099. END;
  5100. passByRegister := FALSE;
  5101. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5102. END;
  5103. formalParameter := formalParameter.nextParameter;
  5104. END;
  5105. END;
  5106. END;
  5107. IF symbol IS SyntaxTree.Procedure THEN
  5108. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5109. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5110. Emit(Push(position,reg));
  5111. ReleaseIntermediateOperand(reg);
  5112. END;
  5113. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5114. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5115. parametersSize := ParametersSize(system,procedureType,FALSE);
  5116. END;
  5117. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5118. (*
  5119. dynamic operator overloading:
  5120. first push parameters, regularly:
  5121. [self]
  5122. par1
  5123. par2
  5124. then push parameters for GetOperator
  5125. identifier
  5126. ptr1
  5127. tag
  5128. ptr2
  5129. tag
  5130. call GetOperatorRuntimeProc
  5131. call Operator
  5132. *)
  5133. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5134. (* push ID *)
  5135. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5136. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5137. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5138. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5139. formalParameter := procedureType.firstParameter;
  5140. FOR i := 0 TO parameters.Length() - 1 DO
  5141. IF formalParameter.access # SyntaxTree.Hidden THEN
  5142. ASSERT(i < 2);
  5143. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5144. (* push pointer *)
  5145. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5146. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5147. (* add dereference *)
  5148. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5149. (*! better: do refer to stack above than using parameter backups !!*)
  5150. ReleaseIntermediateOperand(parameterBackups[i]);
  5151. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5152. END;
  5153. Emit(Push(position,parameterBackups[i]));
  5154. ReleaseIntermediateOperand(parameterBackups[i]);
  5155. (* push typetag *)
  5156. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5157. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5158. arg := TypeDescriptorAdr(recordType);
  5159. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5160. Emit(Push(position,arg));
  5161. ELSE
  5162. (* push 'NonPointer' *)
  5163. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5164. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5165. (* push fingerprint *)
  5166. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5167. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5168. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow))) (* TODO: push the type's fingerprint *)
  5169. END
  5170. END;
  5171. formalParameter := formalParameter.nextParameter
  5172. END;
  5173. (* for unary operators: complete the information for the second parameter *)
  5174. IF procedureType.numberParameters < 2 THEN
  5175. (* push 'NonPointer' *)
  5176. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5177. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5178. (* push 'NoType' *)
  5179. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5180. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5181. END;
  5182. (* call operator selection procedure *)
  5183. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5184. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5185. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  5186. ReleaseOperand(operatorSelectionProcedureOperand);
  5187. (* use the address that the operator selection procedure returned as the target address of the call *)
  5188. InitOperand(operand, ModeValue);
  5189. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5190. Emit(Result(position,operand.op))
  5191. END
  5192. END;
  5193. ReleaseParameterRegisters();
  5194. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR SysvABI(procedureType.callingConvention) THEN
  5195. Emit(Call(position,operand.op,0));
  5196. ELSE
  5197. Emit(Call(position,operand.op,parametersSize));
  5198. END;
  5199. ReleaseOperand(operand);
  5200. IF procedureType.noReturn THEN
  5201. EmitTrap(position,NoReturnTrap);
  5202. END;
  5203. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5204. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5205. Emit(Result(position,return));
  5206. END;
  5207. (* === return parameter space === *)
  5208. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & passByRegister THEN
  5209. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5210. IF parametersSize < 32 THEN
  5211. (* allocated space for all parameter registers *)
  5212. parametersSize := 32
  5213. END;
  5214. size := IntermediateCode.Immediate(addressType,parametersSize);
  5215. Emit(Add(position,sp,sp,size))
  5216. END;
  5217. IF SysvABI(procedureType.callingConvention) THEN
  5218. IF passByRegister THEN
  5219. IF parameters.Length() > parameterRegisters THEN
  5220. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5221. ELSE
  5222. parametersSize := 0
  5223. END;
  5224. ELSE
  5225. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits)
  5226. END;
  5227. IF parametersSize > 0 THEN
  5228. size := IntermediateCode.Immediate(addressType,parametersSize);
  5229. Emit(Add(position,sp,sp,size))
  5230. END;
  5231. END;
  5232. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5233. IF structuredReturnType THEN
  5234. (* stack pointer rewinding done by callee
  5235. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5236. Emit(Add(position,sp,sp,size));
  5237. *)
  5238. RestoreRegisters(saved);
  5239. InitOperand(result,ModeReference);
  5240. Symbol(variable,result);
  5241. ELSE
  5242. RestoreRegisters(saved);
  5243. InitOperand(result,ModeValue);
  5244. result.op := return;
  5245. END;
  5246. END;
  5247. IF alignment > 1 THEN
  5248. Emit(Pop(position,sp));
  5249. END;
  5250. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5251. Emit(Pop(position, ap));
  5252. END;
  5253. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5254. ValueToCondition(result);
  5255. END;
  5256. destination := dest;
  5257. (* perform all write-back calls in the list *)
  5258. BackupGlobalState;
  5259. currentWriteBackCall := firstWriteBackCall;
  5260. WHILE currentWriteBackCall # NIL DO
  5261. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5262. currentWriteBackCall := currentWriteBackCall.next
  5263. END;
  5264. RestoreGlobalState;
  5265. (* TENATIVE *)
  5266. (*
  5267. IF isOperatorCall THEN
  5268. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5269. END;
  5270. *)
  5271. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5272. END VisitProcedureCallDesignator;
  5273. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5274. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5275. td: SyntaxTree.Symbol;
  5276. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5277. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5278. BEGIN
  5279. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5280. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5281. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5282. variable.SetType(system.anyType);
  5283. scope.AddVariable(variable);
  5284. hiddenPointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5285. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5286. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5287. typeDeclaration.SetScope(module.module.moduleScope);
  5288. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5289. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5290. END;
  5291. RETURN hiddenPointerType;
  5292. END GetHiddenPointerType;
  5293. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5294. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5295. BEGIN
  5296. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5297. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5298. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Procedure"));
  5299. variable.SetType(SyntaxTree.NewProcedureType(-1,NIL));
  5300. scope.AddVariable(variable);
  5301. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5302. variable.SetType(system.anyType);
  5303. scope.AddVariable(variable);
  5304. delegatePointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5305. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@Delegate"));
  5306. typeDeclaration.SetDeclaredType(delegatePointerType);
  5307. typeDeclaration.SetScope(module.module.moduleScope);
  5308. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5309. delegatePointerType.SetState(SyntaxTree.Resolved);
  5310. END;
  5311. RETURN delegatePointerType
  5312. END GetDelegateType;
  5313. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5314. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5315. such as in VAR a: RECORD ... END;
  5316. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5317. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5318. *)
  5319. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5320. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5321. BEGIN (* no code emission *)
  5322. source := NIL;
  5323. x := x.resolved;
  5324. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5325. x := GetHiddenPointerType();
  5326. ELSIF IsDelegate(x) THEN
  5327. x := GetDelegateType();
  5328. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5329. ELSE HALT(200);
  5330. END;
  5331. td := x.typeDeclaration;
  5332. IF td = NIL THEN
  5333. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5334. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5335. ASSERT(td # NIL);
  5336. END;
  5337. IF newObjectFile THEN
  5338. GetCodeSectionNameForSymbol(td,name);
  5339. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5340. meta.CheckTypeDeclaration(x);
  5341. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5342. ELSE
  5343. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5344. END;
  5345. IF backend.cooperative OR meta.simple THEN
  5346. offset := 0;
  5347. ELSE
  5348. IF x IS SyntaxTree.CellType THEN
  5349. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5350. IF baseRecord = NIL THEN
  5351. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5352. ELSE
  5353. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5354. END;
  5355. ELSE
  5356. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5357. END;
  5358. END;
  5359. ELSE
  5360. offset := 0;
  5361. source := module.allSections.FindBySymbol(td); (*TODO*)
  5362. IF source = NIL THEN
  5363. null := 0;
  5364. GetCodeSectionNameForSymbol(td,name);
  5365. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  5366. Basic.SuffixSegmentedName (name, module.module.name);
  5367. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5368. IntermediateCode.InitImmediate(op,addressType,0);
  5369. source(IntermediateCode.Section).Emit(Data(position,op));
  5370. source.SetReferenced(FALSE)
  5371. ELSE
  5372. name := source.name;
  5373. END;
  5374. END;
  5375. RETURN td
  5376. END GetBackendType;
  5377. BEGIN
  5378. (*td := t.typeDeclaration;*)
  5379. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5380. (*
  5381. IF t IS SyntaxTree.PointerType THEN
  5382. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5383. ELSE
  5384. source := GetBackendType(t);
  5385. END;
  5386. *)
  5387. IF newObjectFile THEN
  5388. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5389. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5390. IntermediateCode.SetOffset(res,offset);
  5391. ELSE
  5392. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5393. END;
  5394. (*
  5395. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5396. make memory should be used when tag is used, not earlier
  5397. *)
  5398. RETURN res
  5399. END TypeDescriptorAdr;
  5400. (*
  5401. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5402. VAR result: IntermediateCode.Operand;
  5403. BEGIN
  5404. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5405. operand.tag := TypeDescriptorAdr(operand.type);
  5406. IntermediateCode.MakeMemory(operand.tag,addressType);
  5407. UseIntermediateOperand(operand.tag);
  5408. END;
  5409. END MakeTypeTag;
  5410. *)
  5411. PROCEDURE ProfilerInit;
  5412. VAR reg: IntermediateCode.Operand;
  5413. BEGIN
  5414. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5415. Emit(Call(position,reg,0));
  5416. END ProfilerInit;
  5417. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5418. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5419. BEGIN
  5420. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5421. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5422. THEN
  5423. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5424. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5425. Emit(Push(position,reg));
  5426. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5427. Emit(Push(position,reg));
  5428. StaticCallOperand(result,procedure);
  5429. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5430. ReleaseOperand(result);
  5431. END;
  5432. END ProfilerEnterExit;
  5433. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5434. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5435. BEGIN
  5436. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5437. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5438. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5439. profileInit.Emit(Push(position,reg));
  5440. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5441. profileInit.Emit(Push(position,reg));
  5442. NEW(string, LEN(name)); COPY(name, string^);
  5443. sv := SyntaxTree.NewStringValue(-1,string);
  5444. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5445. sv.SetType(type);
  5446. Designate(sv,result);
  5447. profileInit.Emit(Push(position,result.tag));
  5448. profileInit.Emit(Push(position,result.op));
  5449. StaticCallOperand(result,procedure);
  5450. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5451. ReleaseOperand(result);
  5452. END;
  5453. END ProfilerAddProcedure;
  5454. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5455. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5456. BEGIN
  5457. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5458. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5459. profileInit.Emit(Push(position,reg));
  5460. profileInitPatchPosition := profileInit.pc;
  5461. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5462. NEW(string, LEN(name)); COPY(name, string^);
  5463. sv := SyntaxTree.NewStringValue(-1,string);
  5464. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5465. sv.SetType(type);
  5466. Designate(sv,result);
  5467. profileInit.Emit(Push(position,result.tag));
  5468. profileInit.Emit(Push(position,result.op));
  5469. StaticCallOperand(result,procedure);
  5470. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5471. ReleaseOperand(result);
  5472. END;
  5473. END ProfilerAddModule;
  5474. PROCEDURE ProfilerPatchInit;
  5475. VAR reg: IntermediateCode.Operand;
  5476. BEGIN
  5477. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5478. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5479. EmitLeave(profileInit,position,0);
  5480. profileInit.Emit(Exit(position,0,0));
  5481. END ProfilerPatchInit;
  5482. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5483. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5484. VAR
  5485. id: LONGINT;
  5486. leftType, rightType: SyntaxTree.Type;
  5487. procedureType: SyntaxTree.ProcedureType;
  5488. runtimeProcedure: SyntaxTree.Procedure;
  5489. runtimeProcedureOperand, operatorOperand: Operand;
  5490. kind: SET;
  5491. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5492. VAR
  5493. arg: IntermediateCode.Operand;
  5494. recordType: SyntaxTree.RecordType;
  5495. fingerPrint: SyntaxTree.FingerPrint;
  5496. BEGIN
  5497. IF type = NIL THEN
  5498. (* no type: push 'NoType' *)
  5499. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5500. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5501. ELSIF IsStrictlyPointerToRecord(type) THEN
  5502. (* pointer to record type: push typetag *)
  5503. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5504. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5505. arg := TypeDescriptorAdr(recordType);
  5506. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5507. ELSE
  5508. (* non-pointer to record type: push fingerprint *)
  5509. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5510. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5511. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow)
  5512. END;
  5513. operatorInitializationCodeSection.Emit(Push(position,arg))
  5514. END PushTypeInfo;
  5515. BEGIN
  5516. ASSERT(operatorInitializationCodeSection # NIL);
  5517. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5518. procedureType := operator.type(SyntaxTree.ProcedureType);
  5519. (* determine types *)
  5520. leftType := procedureType.firstParameter.type;
  5521. IF procedureType.numberParameters = 2 THEN
  5522. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5523. rightType := procedureType.firstParameter.nextParameter.type;
  5524. ELSE
  5525. rightType := NIL
  5526. END;
  5527. (* determine operator kind *)
  5528. IF IsStrictlyPointerToRecord(leftType) THEN
  5529. kind := {LhsIsPointer}
  5530. ELSE
  5531. kind := {}
  5532. END;
  5533. IF IsStrictlyPointerToRecord(rightType) THEN
  5534. kind := kind + {RhsIsPointer}
  5535. END;
  5536. IF kind # {} THEN (* TODO: to be removed later on *)
  5537. (* at least one of the types is a pointer to record *)
  5538. (* emit a code that registers this specific operator in the runtime *)
  5539. dump := operatorInitializationCodeSection.comments;
  5540. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5541. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5542. (* push ID *)
  5543. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5544. id := Global.GetSymbol(module.module.case, operator.name);
  5545. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5546. (* push kind *)
  5547. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5548. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5549. (* push type infos *)
  5550. PushTypeInfo(leftType);
  5551. PushTypeInfo(rightType);
  5552. (* push operator address *)
  5553. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5554. StaticCallOperand(operatorOperand, operator);
  5555. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5556. ReleaseOperand(operatorOperand);
  5557. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5558. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5559. ReleaseOperand(runtimeProcedureOperand)
  5560. END
  5561. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5562. END
  5563. END RegisterDynamicOperator;
  5564. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: LONGINT);
  5565. VAR
  5566. traceModule: SyntaxTree.Module;
  5567. procedure: SyntaxTree.Procedure;
  5568. procedureVariable: SyntaxTree.Variable;
  5569. s,msg: Basic.MessageString;
  5570. res: Operand;
  5571. i: LONGINT;
  5572. sv: SyntaxTree.StringValue;
  5573. type: SyntaxTree.Type;
  5574. recordType: SyntaxTree.RecordType;
  5575. printout: Printout.Printer;
  5576. stringWriter: Streams.StringWriter;
  5577. expression: SyntaxTree.Expression;
  5578. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5579. BEGIN
  5580. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5581. IF procedure = NIL THEN
  5582. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5583. END;
  5584. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5585. s := "procedure ";
  5586. Strings.Append(s,backend.traceModuleName);
  5587. Strings.Append(s,".");
  5588. Strings.Append(s,procedureName);
  5589. Strings.Append(s," not present");
  5590. Error(position,s);
  5591. RETURN FALSE
  5592. ELSE
  5593. RETURN TRUE
  5594. END;
  5595. END GetProcedure;
  5596. PROCEDURE CallProcedure;
  5597. VAR size: LONGINT;
  5598. BEGIN
  5599. IF procedure # NIL THEN
  5600. StaticCallOperand(result,procedure);
  5601. size := ProcedureParametersSize(system,procedure);
  5602. ELSE
  5603. Symbol(procedureVariable, result);
  5604. LoadValue(result, procedureVariable.type.resolved);
  5605. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5606. END;
  5607. Emit(Call(position,result.op,size));
  5608. END CallProcedure;
  5609. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5610. VAR res: Operand; string: SyntaxTree.String;
  5611. BEGIN
  5612. IF GetProcedure("String") THEN
  5613. NEW(string, LEN(s)); COPY(s, string^);
  5614. sv := SyntaxTree.NewStringValue(-1,string);
  5615. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  5616. sv.SetType(type);
  5617. Designate(sv,res);
  5618. Emit(Push(position,res.tag));
  5619. Emit(Push(position,res.op));
  5620. ReleaseOperand(res);
  5621. CallProcedure;
  5622. END;
  5623. END String;
  5624. PROCEDURE Integer(op: IntermediateCode.Operand);
  5625. BEGIN
  5626. IF GetProcedure("Int") THEN
  5627. Emit(Push(position,op));
  5628. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5629. CallProcedure;
  5630. END;
  5631. END Integer;
  5632. PROCEDURE Float(op: IntermediateCode.Operand);
  5633. BEGIN
  5634. IF GetProcedure("HIntHex") THEN
  5635. Emit(Push(position,op));
  5636. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5637. CallProcedure;
  5638. END;
  5639. END Float;
  5640. PROCEDURE Set(op: IntermediateCode.Operand);
  5641. BEGIN
  5642. IF GetProcedure("Set") THEN
  5643. Emit(Push(position,op));
  5644. (*
  5645. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5646. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5647. *)
  5648. CallProcedure;
  5649. END;
  5650. END Set;
  5651. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5652. BEGIN
  5653. IF GetProcedure("Boolean") THEN
  5654. Emit(Push(position,op));
  5655. CallProcedure;
  5656. END;
  5657. END Boolean;
  5658. PROCEDURE Char(op: IntermediateCode.Operand);
  5659. BEGIN
  5660. IF GetProcedure("Char") THEN
  5661. Emit(Push(position,op));
  5662. CallProcedure;
  5663. END;
  5664. END Char;
  5665. PROCEDURE Address(op: IntermediateCode.Operand);
  5666. BEGIN
  5667. IF GetProcedure("Address") THEN
  5668. Emit(Push(position,op));
  5669. CallProcedure;
  5670. END;
  5671. END Address;
  5672. PROCEDURE StringOperand(op,tag: IntermediateCode.Operand);
  5673. BEGIN
  5674. IF GetProcedure("String") THEN
  5675. Emit(Push(position,tag));
  5676. Emit(Push(position,op));
  5677. CallProcedure;
  5678. END;
  5679. END StringOperand;
  5680. PROCEDURE Ln;
  5681. BEGIN
  5682. IF GetProcedure("Ln") THEN
  5683. CallProcedure;
  5684. END;
  5685. END Ln;
  5686. BEGIN
  5687. IF backend.traceModuleName = "" THEN RETURN END;
  5688. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5689. IF GetProcedure("Enter") THEN
  5690. CallProcedure
  5691. END;
  5692. NEW(stringWriter,LEN(s));
  5693. FOR i := 0 TO x.Length()-1 DO
  5694. msg := "";
  5695. expression := x.GetExpression(i);
  5696. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5697. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5698. ELSE
  5699. Global.GetModuleName(module.module, s);
  5700. END;
  5701. IF i = 0 THEN
  5702. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos,1);
  5703. stringWriter.String(":");
  5704. END;
  5705. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5706. IF ~(expression IS SyntaxTree.StringValue) THEN
  5707. printout.Expression(expression);
  5708. stringWriter.Get(s);
  5709. Strings.Append(msg,s);
  5710. Strings.Append(msg,"= ");
  5711. ELSE stringWriter.Get(s); (* remove from string writer *)
  5712. Strings.Append(msg, s);
  5713. END;
  5714. String(msg);
  5715. IF SemanticChecker.IsStringType(expression.type) THEN
  5716. Designate(expression,res);
  5717. StringOperand(res.op,res.tag);
  5718. ELSE
  5719. Evaluate(expression,res);
  5720. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5721. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5722. Convert(res.op,int64);
  5723. END;
  5724. Integer(res.op);
  5725. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5726. Boolean(res.op);
  5727. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5728. Set(res.op);
  5729. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5730. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5731. Convert(res.op,float64);
  5732. END;
  5733. Float(res.op);
  5734. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5735. Char(res.op);
  5736. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5737. Address(res.op);String("H");
  5738. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5739. Address(res.op);String("H");
  5740. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5741. Address(res.op);String("H");
  5742. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5743. Address(res.op);String("H");
  5744. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5745. String("NIL");
  5746. ELSE HALT(200);
  5747. END;
  5748. END;
  5749. ReleaseOperand(res);
  5750. String("; ");
  5751. END;
  5752. IF GetProcedure("Exit") THEN
  5753. CallProcedure
  5754. ELSE
  5755. Ln;
  5756. END;
  5757. END;
  5758. END SystemTrace;
  5759. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5760. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5761. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5762. BEGIN
  5763. type := type.resolved;
  5764. IF type IS SyntaxTree.RecordType THEN
  5765. WITH type: SyntaxTree.RecordType DO
  5766. baseType := type.baseType;
  5767. IF baseType # NIL THEN
  5768. baseType := baseType.resolved;
  5769. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5770. InitFields(baseType,adr,offset);
  5771. END;
  5772. variable := type.recordScope.firstVariable;
  5773. WHILE variable # NIL DO
  5774. IF variable.initializer # NIL THEN
  5775. Evaluate(variable.initializer,initializerOp);
  5776. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5777. Emit(Mov(position,mem,initializerOp.op));
  5778. ReleaseOperand(initializerOp);
  5779. ReleaseIntermediateOperand(mem);
  5780. END;
  5781. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5782. variable := variable.nextVariable
  5783. END;
  5784. END;
  5785. ELSIF (type IS SyntaxTree.ArrayType) THEN
  5786. WITH type: SyntaxTree.ArrayType DO
  5787. IF type.form = SyntaxTree.Static THEN
  5788. baseType := type.arrayBase;
  5789. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5790. FOR i := 0 TO type.staticLength-1 DO
  5791. InitFields(baseType,adr,offset+i*size);
  5792. END;
  5793. END;
  5794. END;
  5795. ELSIF type IS SyntaxTree.MathArrayType THEN
  5796. WITH type: SyntaxTree.MathArrayType DO
  5797. IF type.form = SyntaxTree.Open THEN
  5798. dim := DynamicDim(type);
  5799. imm := IntermediateCode.Immediate(addressType,dim);
  5800. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  5801. baseType := SemanticChecker.ArrayBase(type,dim);
  5802. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  5803. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  5804. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  5805. ReleaseIntermediateOperand(imm);
  5806. (* flags remain empty (=0) for open array *)
  5807. ELSIF type.form = SyntaxTree.Static THEN
  5808. baseType := type.arrayBase;
  5809. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5810. ASSERT(type.staticLength < 1024*1024*1024);
  5811. FOR i := 0 TO type.staticLength-1 DO
  5812. InitFields(baseType,adr,offset+i*size);
  5813. END;
  5814. END;
  5815. END;
  5816. END;
  5817. END InitFields;
  5818. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable);
  5819. VAR type: SyntaxTree.Type; operand: Operand; tmp: IntermediateCode.Operand; reference: SyntaxTree.Expression;
  5820. BEGIN
  5821. type := variable.type.resolved;
  5822. IF (type IS SyntaxTree.MathArrayType) THEN
  5823. WITH type: SyntaxTree.MathArrayType DO
  5824. IF type.form = SyntaxTree.Open THEN
  5825. Symbol(variable,operand);
  5826. InitFields(type, operand.tag,0);
  5827. ELSIF type.form = SyntaxTree.Tensor THEN
  5828. Symbol(variable, operand);
  5829. MakeMemory(tmp,operand.op,addressType,0);
  5830. ReleaseOperand(operand);
  5831. Emit(Mov(position,tmp, nil ) );
  5832. ReleaseIntermediateOperand(tmp);
  5833. END;
  5834. END;
  5835. ELSE
  5836. Symbol(variable,operand);
  5837. IF variable.initializer # NIL THEN
  5838. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  5839. reference.SetType(variable.type.resolved);
  5840. reference.SetAssignable(TRUE);
  5841. Assign(reference,variable.initializer);
  5842. END;
  5843. InitFields(type, operand.op,0);
  5844. ReleaseOperand(operand);
  5845. END;
  5846. END InitVariable;
  5847. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  5848. VAR end: Label;
  5849. BEGIN
  5850. IF type.form = SyntaxTree.Tensor THEN
  5851. InitOperand(result,ModeValue);
  5852. ReuseCopy(result.op,base);
  5853. end := NewLabel();
  5854. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  5855. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  5856. SetLabel(end);
  5857. Convert(result.op,int32);
  5858. ELSE
  5859. InitOperand(result,ModeValue);
  5860. IntermediateCode.InitImmediate(result.op, int32, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  5861. END
  5862. END MathArrayDim;
  5863. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  5864. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  5865. BEGIN
  5866. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5867. MakeMemory(mem,base,addressType,offset);
  5868. Emit(Mov(position,mem,value));
  5869. ReleaseIntermediateOperand(mem);
  5870. END PutMathArrayField;
  5871. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  5872. VAR mem: IntermediateCode.Operand;
  5873. BEGIN
  5874. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5875. MakeMemory(mem,base,addressType,offset);
  5876. Emit(Mov(position,mem,value));
  5877. ReleaseIntermediateOperand(mem);
  5878. END PutMathArrayFieldOffset;
  5879. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  5880. BEGIN
  5881. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  5882. MakeMemory(value,base,addressType,offset);
  5883. END GetMathArrayField;
  5884. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  5885. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  5886. BEGIN
  5887. IF incr THEN
  5888. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  5889. ELSE
  5890. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  5891. END;
  5892. IF dim.mode=IntermediateCode.ModeImmediate THEN
  5893. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  5894. ELSE
  5895. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5896. Emit(Mov(position,reg,dim));
  5897. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  5898. Emit(Add(position,reg,reg,base));
  5899. MakeMemory(mem, reg, addressType, offset);
  5900. ReleaseIntermediateOperand(reg);
  5901. Emit(Mov(position,mem,value));
  5902. ReleaseIntermediateOperand(mem);
  5903. END;
  5904. END PutMathArrayLenOrIncr;
  5905. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  5906. BEGIN
  5907. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  5908. END PutMathArrayLength;
  5909. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  5910. BEGIN
  5911. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  5912. END PutMathArrayIncrement;
  5913. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5914. BEGIN
  5915. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  5916. END GetMathArrayIncrement;
  5917. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5918. BEGIN
  5919. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  5920. END GetMathArrayLength;
  5921. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5922. VAR dimOp: IntermediateCode.Operand;
  5923. BEGIN
  5924. dimOp := IntermediateCode.Immediate(int32, dim);
  5925. GetMathArrayLength(type, operand, dimOp, check, result);
  5926. END GetMathArrayLengthAt;
  5927. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5928. VAR dimOp: IntermediateCode.Operand;
  5929. BEGIN
  5930. dimOp := IntermediateCode.Immediate(int32, dim);
  5931. GetMathArrayIncrement(type, operand, dimOp, check, result);
  5932. END GetMathArrayIncrementAt;
  5933. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  5934. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5935. offset: LONGINT;
  5936. BEGIN
  5937. IF increment THEN
  5938. offset := MathIncrOffset;
  5939. ELSE
  5940. offset := MathLenOffset;
  5941. END;
  5942. INC(offset,operand.dimOffset*2);
  5943. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  5944. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  5945. END;
  5946. (* static dimension *)
  5947. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5948. IF check & (type.form = SyntaxTree.Tensor) THEN
  5949. DimensionCheck(operand.tag,dim,BrltL);
  5950. END;
  5951. val := SHORT(dim.intValue);
  5952. IF type.form # SyntaxTree.Tensor THEN
  5953. t := SemanticChecker.ArrayBase(type,val);
  5954. type := t.resolved(SyntaxTree.MathArrayType);
  5955. IF type.form = SyntaxTree.Static THEN
  5956. IF increment THEN
  5957. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  5958. ELSE
  5959. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5960. END;
  5961. InitOperand(result,ModeValue);
  5962. result.op := res;
  5963. RETURN;
  5964. END;
  5965. END;
  5966. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  5967. MakeMemory(res,operand.tag,addressType,offset);
  5968. (*
  5969. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5970. *)
  5971. InitOperand(result,ModeValue);
  5972. result.op := res;
  5973. ELSE
  5974. Convert(dim,addressType);
  5975. IF check THEN
  5976. IF type.form = SyntaxTree.Tensor THEN
  5977. DimensionCheck(operand.tag,dim,BrltL);
  5978. ELSIF isUnchecked THEN (* do nothing *)
  5979. ELSE
  5980. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5981. END;
  5982. END;
  5983. end := NewLabel(); next := NIL;
  5984. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5985. Emit(Mov(position,res,dim));
  5986. Convert(res,int32);
  5987. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5988. WHILE t IS SyntaxTree.MathArrayType DO
  5989. type := t(SyntaxTree.MathArrayType);
  5990. IF type.form = SyntaxTree.Static THEN
  5991. imm := IntermediateCode.Immediate(int32,val);
  5992. next := NewLabel();
  5993. BrneL(next,imm,res);
  5994. IF increment THEN
  5995. imm := IntermediateCode.Immediate(int32,ToMemoryUnits(system,type.staticIncrementInBits));
  5996. ELSE
  5997. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5998. END;
  5999. Emit(MovReplace(position,res,imm));
  6000. BrL(end);
  6001. ELSE hasDynamicPart := TRUE;
  6002. END;
  6003. t := type.arrayBase.resolved;
  6004. val := val + 1;
  6005. IF next # NIL THEN SetLabel(next) END;
  6006. END;
  6007. IF hasDynamicPart THEN
  6008. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6009. Emit(Mov(position,res2,dim));
  6010. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6011. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6012. Emit(Add(position,res2,res2,imm));
  6013. Emit(Add(position,res2,res2,operand.tag));
  6014. IntermediateCode.MakeMemory(res2,int32);
  6015. Emit(MovReplace(position,res,res2));
  6016. ReleaseIntermediateOperand(res2);
  6017. END;
  6018. SetLabel(end);
  6019. Convert(res,int32);
  6020. InitOperand(result,ModeValue);
  6021. result.op := res;
  6022. END;
  6023. END MathArrayLenOrIncr;
  6024. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6025. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6026. offset: LONGINT;
  6027. BEGIN
  6028. offset := operand.dimOffset+DynamicDim(type)-1;
  6029. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6030. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6031. val := SHORT(dim.intValue);
  6032. t := SemanticChecker.ArrayBase(type,val);
  6033. type := t.resolved(SyntaxTree.ArrayType);
  6034. IF type.form = SyntaxTree.Static THEN
  6035. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6036. ELSE
  6037. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6038. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6039. END;
  6040. UseIntermediateOperand(res);
  6041. InitOperand(result,ModeValue);
  6042. result.op := res;
  6043. ELSE
  6044. Convert(dim,addressType);
  6045. IF ~isUnchecked THEN
  6046. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6047. END;
  6048. end := NewLabel(); next := NIL;
  6049. (* ReuseCopy(dim,res); *)
  6050. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6051. Emit(Mov(position,res,dim));
  6052. Convert(res,int32);
  6053. Convert(res,int32);
  6054. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6055. WHILE t IS SyntaxTree.ArrayType DO
  6056. type := t(SyntaxTree.ArrayType);
  6057. IF type.form = SyntaxTree.Static THEN
  6058. imm := IntermediateCode.Immediate(int32,val);
  6059. next := NewLabel();
  6060. BrneL(next,imm,res);
  6061. imm := IntermediateCode.Immediate(int32,type.staticLength);
  6062. Emit(MovReplace(position,res,imm));
  6063. BrL(end);
  6064. ELSE hasDynamicPart := TRUE;
  6065. END;
  6066. t := type.arrayBase.resolved;
  6067. val := val + 1;
  6068. IF next # NIL THEN SetLabel(next) END;
  6069. END;
  6070. IF hasDynamicPart THEN
  6071. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6072. Convert(res2,addressType);
  6073. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6074. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6075. Emit(Sub(position,res2,imm,res2));
  6076. Emit(Add(position,res2,res2,operand.tag));
  6077. IntermediateCode.MakeMemory(res2,int32);
  6078. Emit(MovReplace(position,res,res2));
  6079. ReleaseIntermediateOperand(res2);
  6080. END;
  6081. SetLabel(end);
  6082. Convert(res,int32);
  6083. InitOperand(result,ModeValue);
  6084. result.op := res;
  6085. END;
  6086. END ArrayLen;
  6087. (**
  6088. create a temporary variable in current scope
  6089. **)
  6090. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN): SyntaxTree.Variable;
  6091. VAR name: SyntaxTree.Identifier; string: SyntaxTree.IdentifierString ; variable: SyntaxTree.Variable;
  6092. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6093. BEGIN
  6094. IF ~register THEN
  6095. variable := temporaries.GetFreeVariable(type, index);
  6096. ELSE
  6097. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6098. END;
  6099. scope := currentScope;
  6100. IF variable = NIL THEN
  6101. COPY("@hiddenIRVar",string);
  6102. Basic.AppendNumber(string,index);
  6103. name := SyntaxTree.NewIdentifier(string);
  6104. variable := SyntaxTree.NewVariable(Diagnostics.Invalid,name);
  6105. variable.SetType(type);
  6106. variable.SetAccess(SyntaxTree.Hidden);
  6107. IF ~register THEN
  6108. temporaries.AddVariable(variable);
  6109. IF scope.lastVariable # NIL THEN
  6110. offset := scope.lastVariable.offsetInBits;
  6111. ELSE
  6112. offset := 0;
  6113. END;
  6114. DEC(offset,system.SizeOf(variable.type));
  6115. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6116. variable(SyntaxTree.Variable).SetOffset(offset);
  6117. scope.AddVariable(variable(SyntaxTree.Variable));
  6118. scope.EnterSymbol(variable, duplicate);
  6119. ASSERT(~duplicate);
  6120. InitVariable(variable(SyntaxTree.Variable));
  6121. ELSE
  6122. variable.SetUseRegister(TRUE);
  6123. variable(SyntaxTree.Variable).SetOffset(0);
  6124. END;
  6125. ELSE
  6126. InitVariable(variable(SyntaxTree.Variable));
  6127. (*
  6128. ASSERT(variable.type.resolved = type.resolved)
  6129. *)
  6130. END;
  6131. RETURN variable(SyntaxTree.Variable)
  6132. END GetTemporaryVariable;
  6133. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6134. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6135. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6136. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6137. i: LONGINT; duplicate: BOOLEAN;
  6138. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6139. VAR variable: SyntaxTree.Variable;
  6140. BEGIN
  6141. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier(name));
  6142. variable.SetType(type);
  6143. recordScope.AddVariable(variable);
  6144. END AddVariable;
  6145. BEGIN
  6146. name := "@ArrayDescriptor";
  6147. Basic.AppendNumber(name,dimensions);
  6148. identifier := SyntaxTree.NewIdentifier(name);
  6149. parentScope := module.module.moduleScope;
  6150. symbol := parentScope.FindSymbol(identifier);
  6151. IF symbol # NIL THEN
  6152. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6153. type := typeDeclaration.declaredType;
  6154. ELSE
  6155. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier(name));
  6156. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6157. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6158. recordType := SyntaxTree.NewRecordType( -1, parentScope, recordScope);
  6159. recordType.SetTypeDeclaration(typeDeclaration);
  6160. recordType.SetState(SyntaxTree.Resolved);
  6161. typeDeclaration.SetDeclaredType(recordType);
  6162. AddVariable("@ptr",system.anyType);
  6163. AddVariable("@adr",system.addressType);
  6164. AddVariable("@flags",system.addressType);
  6165. AddVariable("@dim",system.addressType);
  6166. AddVariable("@elementSize",system.addressType);
  6167. FOR i := 0 TO dimensions-1 DO
  6168. name := "@len";
  6169. Basic.AppendNumber(name,i);
  6170. AddVariable(name,system.addressType);
  6171. name := "@incr";
  6172. Basic.AppendNumber(name,i);
  6173. AddVariable(name,system.addressType);
  6174. END;
  6175. parentScope.AddTypeDeclaration(typeDeclaration);
  6176. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6177. ASSERT(~duplicate);
  6178. type := recordType;
  6179. END;
  6180. RETURN type
  6181. END GetMathArrayDescriptorType;
  6182. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6183. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6184. BEGIN
  6185. type := GetMathArrayDescriptorType(dimensions);
  6186. Emit(Push(position,op.op));
  6187. (* push type descriptor *)
  6188. reg := TypeDescriptorAdr(type);
  6189. IF ~newObjectFile THEN
  6190. IntermediateCode.MakeMemory(reg,addressType);
  6191. END;
  6192. Emit(Push(position,reg));
  6193. ReleaseIntermediateOperand(reg);
  6194. (* push realtime flag: false by default *)
  6195. Emit(Push(position,false));
  6196. CallThis(position,"Heaps","NewRec",3);
  6197. END NewMathArrayDescriptor;
  6198. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6199. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6200. BEGIN
  6201. NEW(string, LEN(s)); COPY(s, string^);
  6202. sv := SyntaxTree.NewStringValue(-1,string);
  6203. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  6204. sv.SetType(type);
  6205. Designate(sv,res);
  6206. Emit(Push(position,res.tag));
  6207. Emit(Push(position,res.op));
  6208. ReleaseOperand(res);
  6209. END PushConstString;
  6210. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6211. BEGIN
  6212. IF b THEN
  6213. Emit(Push(-1, true));
  6214. ELSE
  6215. Emit(Push(-1, false));
  6216. END;
  6217. END PushConstBoolean;
  6218. PROCEDURE PushConstSet(v: SET);
  6219. VAR value: SyntaxTree.Value; op: Operand;
  6220. BEGIN
  6221. value := SyntaxTree.NewSetValue(-1, v);
  6222. value.SetType(system.setType);
  6223. Evaluate(value, op);
  6224. Emit(Push(-1, op.op));
  6225. ReleaseOperand(op);
  6226. END PushConstSet;
  6227. PROCEDURE PushConstInteger(v: LONGINT);
  6228. VAR value: SyntaxTree.Value; op: Operand;
  6229. BEGIN
  6230. value := SyntaxTree.NewIntegerValue(-1, v);
  6231. value.SetType(system.longintType);
  6232. Evaluate(value, op);
  6233. Emit(Push(-1, op.op));
  6234. ReleaseOperand(op);
  6235. END PushConstInteger;
  6236. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6237. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6238. section: IntermediateCode.Section;
  6239. BEGIN
  6240. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6241. Global.GetSymbolSegmentedName(symbol, name);
  6242. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6243. procedure := SyntaxTree.NewProcedure(-1, SyntaxTree.NewIdentifier(""), procedureScope);
  6244. procedure.SetScope(moduleScope);
  6245. procedure.SetType(SyntaxTree.NewProcedureType(-1,scope));
  6246. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6247. procedure.SetAccess(SyntaxTree.Hidden);
  6248. currentScope := procedureScope;
  6249. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6250. EmitEnter(section, -1,NIL,0,0,0);
  6251. RETURN section;
  6252. END OpenInitializer;
  6253. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6254. BEGIN
  6255. EmitLeave(section, 0, 0 );
  6256. Emit(Exit(-1,ToMemoryUnits(system,addressType.sizeInBits),0));
  6257. section := prev;
  6258. END CloseInitializer;
  6259. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6260. VAR name: SyntaxTree.IdentifierString;
  6261. variable: SyntaxTree.Variable;
  6262. type: SyntaxTree.Type;
  6263. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6264. BEGIN
  6265. InitOperand(op,ModeReference);
  6266. op.op := fp;
  6267. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6268. Dereference(op, x, FALSE);
  6269. result := op;
  6270. Symbol(symbol, op);
  6271. END Field;
  6272. PROCEDURE Direction(direction: LONGINT): SET;
  6273. BEGIN
  6274. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6275. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6276. ELSE HALT(100);
  6277. END;
  6278. END Direction;
  6279. PROCEDURE AddPortProperty(port: SyntaxTree.Variable; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6280. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6281. BEGIN
  6282. Field(port, op);
  6283. ToMemory(op.op,addressType,0);
  6284. Emit(Push(-1, op.op));
  6285. ReleaseOperand(op);
  6286. Basic.GetString(modifier.identifier, name);
  6287. PushConstString(name);
  6288. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6289. ASSERT(SemanticChecker.IsStringType(value.type));
  6290. Designate(value, op);
  6291. Emit(Push(modifier.position, op.tag));
  6292. Emit(Push(modifier.position, op.op));
  6293. ReleaseOperand(op);
  6294. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6295. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6296. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6297. Evaluate(value, op);
  6298. Emit(Push(modifier.position, op.op));
  6299. ReleaseOperand(op);
  6300. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6301. ELSE
  6302. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6303. END;
  6304. END AddPortProperty;
  6305. PROCEDURE AddPortProperties(variable: SyntaxTree.Variable);
  6306. VAR modifier: SyntaxTree.Modifier;
  6307. BEGIN
  6308. modifier := variable.modifiers;
  6309. WHILE modifier # NIL DO
  6310. AddPortProperty(variable,modifier, modifier.expression);
  6311. modifier := modifier.nextModifier;
  6312. END;
  6313. END AddPortProperties;
  6314. PROCEDURE Variable(name: ARRAY OF CHAR; variable: SyntaxTree.Variable);
  6315. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6316. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6317. PROCEDURE PushLens(type: SyntaxTree.Type);
  6318. BEGIN
  6319. IF IsSemiDynamicArray(type) THEN
  6320. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6321. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6322. Emit(Push(-1, op.op));
  6323. ReleaseOperand(op);
  6324. INC(dim);
  6325. ELSIF IsStaticArray(type) THEN
  6326. len := len * type(SyntaxTree.ArrayType).staticLength;
  6327. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6328. INC(dim);
  6329. ELSE
  6330. baseType := type;
  6331. END;
  6332. END PushLens;
  6333. BEGIN
  6334. (* cell *)
  6335. IF variable.type IS SyntaxTree.ArrayType THEN
  6336. type := variable.type;
  6337. dim := 0;
  6338. len := 1;
  6339. PushLens(type);
  6340. portType := baseType.resolved(SyntaxTree.PortType);
  6341. ELSE
  6342. portType := variable.type(SyntaxTree.PortType);
  6343. END;
  6344. PushSelfPointer();
  6345. (* port / array of ports *)
  6346. IF IsStaticArray(type) THEN
  6347. PushConstInteger(len);
  6348. END;
  6349. Field(variable, op);
  6350. (*left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6351. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(x);
  6352. d := SyntaxTree.NewSymbolDesignator(-1, left, variable); d.SetType(variable.type);
  6353. Designate(d, op);*)
  6354. Emit(Push(-1, op.op));
  6355. ReleaseOperand(op);
  6356. (* name *)
  6357. PushConstString(name);
  6358. (* inout *)
  6359. PushConstSet(Direction(portType.direction));
  6360. (* width *)
  6361. PushConstInteger(portType.sizeInBits);
  6362. IF variable.type IS SyntaxTree.PortType THEN
  6363. CallThis(variable.position,"ActiveCellsRuntime","AddPort",6);
  6364. AddPortProperties(variable);
  6365. ELSIF IsStaticArray(type)THEN
  6366. CallThis(variable.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6367. ELSIF IsSemiDynamicArray(type) THEN
  6368. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6369. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6370. Emit(Add(position,reg, sp, size));
  6371. (* dim *)
  6372. PushConstInteger(dim);
  6373. (* len array *)
  6374. Emit(Push(position, reg));
  6375. ReleaseIntermediateOperand(reg);
  6376. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6377. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6378. Emit(Add(position, sp,sp, size));
  6379. ELSE
  6380. HALT(100);
  6381. END;
  6382. END Variable;
  6383. BEGIN
  6384. IF backend.cellsAreObjects THEN
  6385. variable := x.cellScope.firstVariable;
  6386. WHILE (variable # NIL) DO
  6387. type := variable.type.resolved;
  6388. WHILE (type IS SyntaxTree.ArrayType) DO
  6389. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6390. END;
  6391. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6392. Global.GetSymbolNameInScope(variable,x.cellScope,name);
  6393. Variable(name,variable);
  6394. END;
  6395. variable := variable.nextVariable;
  6396. END;
  6397. ELSE HALT(200)
  6398. END;
  6399. (*prevActiveCellsScope := currentActiveCellsScope;*)
  6400. (*
  6401. x.typeDeclaration.GetName(componentName);
  6402. instanceType := currentActiveCellsScope.NewType(componentName); (*backend.cification.NewType(componentName);*)
  6403. IF HasValue(x.modifiers,Global.StringDataMemorySize,dataMemorySize) THEN
  6404. instanceType.SetDataMemorySize(dataMemorySize);
  6405. END;
  6406. IF HasValue(x.modifiers,Global.StringCodeMemorySize,codeMemorySize) THEN
  6407. instanceType.SetInstructionMemorySize(codeMemorySize)
  6408. END;
  6409. IF HasFlag(x.modifiers, Global.StringVector) THEN
  6410. instanceType.AddCapability(ActiveCells.VectorCapability)
  6411. END;
  6412. IF HasFlag(x.modifiers, Global.StringTRMS) THEN
  6413. instanceType.AddCapability(ActiveCells.TRMSCapability)
  6414. END;
  6415. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN
  6416. instanceType.AddCapability(ActiveCells.FloatingPointCapability)
  6417. END;
  6418. AddDevices(instanceType, x);
  6419. *)
  6420. (*
  6421. IF x.isCellNet THEN
  6422. IF HasValue(x.modifiers,Global.StringFrequencyDivider,value) THEN backend.activeCellsSpecification.SetFrequencyDivider(value) END;
  6423. END;
  6424. *)
  6425. (*currentActiveCellsScope := instanceType;*)
  6426. (*
  6427. parameter := x.firstParameter;
  6428. portIndex := 0;
  6429. WHILE parameter # NIL DO
  6430. parameter.GetName(parameterName);
  6431. parameterType := parameter.type.resolved;
  6432. Parameter(parameterName, parameterType);
  6433. (*
  6434. IF SemanticChecker.IsStaticArray(parameterType,parameterType,len) THEN
  6435. ParameterArray(parameterType);
  6436. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6437. FOR i := 0 TO len-1 DO
  6438. COPY(parameterName,name);
  6439. AppendIndex(name,i);
  6440. port := instanceType.NewPort(name,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6441. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6442. INC(portIndex);
  6443. END;
  6444. ELSE
  6445. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6446. port := instanceType.NewPort(parameterName,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6447. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6448. INC(portIndex);
  6449. END;
  6450. *)
  6451. parameter := parameter.nextParameter;
  6452. END;
  6453. *)
  6454. (*
  6455. Scope(x.cellScope);
  6456. currentActiveCellsScope := prevActiveCellsScope;
  6457. AddModules(instanceType,x.cellScope);
  6458. *)
  6459. END AddPorts;
  6460. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6461. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6462. BEGIN
  6463. Symbol(cell,op);
  6464. ToMemory(op.op,addressType,0);
  6465. Emit(Push(position,op.op));
  6466. ReleaseOperand(op);
  6467. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6468. PushConstString(name);
  6469. IF (value # NIL) THEN
  6470. ASSERT(
  6471. SemanticChecker.IsStringType(property.type)
  6472. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6473. OR (property.type.resolved IS SyntaxTree.FloatType)
  6474. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6475. OR (property.type.resolved IS SyntaxTree.SetType)
  6476. );
  6477. left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6478. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(cellType);
  6479. d := SyntaxTree.NewSymbolDesignator(-1, left, property); d.SetType(property.type);
  6480. Designate(d, op);
  6481. IF SemanticChecker.IsStringType(property.type) THEN
  6482. Emit(Push(-1, op.tag))
  6483. END;
  6484. Emit(Push(-1, op.op));
  6485. ReleaseOperand(op);
  6486. END;
  6487. IF value = NIL THEN
  6488. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6489. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6490. ASSERT(SemanticChecker.IsStringType(value.type));
  6491. Designate(value, op);
  6492. Emit(Push(property.position, op.tag));
  6493. Emit(Push(property.position, op.op));
  6494. ReleaseOperand(op);
  6495. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6496. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6497. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6498. Evaluate(value, op);
  6499. Emit(Push(property.position, op.op));
  6500. ReleaseOperand(op);
  6501. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6502. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6503. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6504. Evaluate(value, op);
  6505. Emit(Push(property.position, op.op));
  6506. ReleaseOperand(op);
  6507. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6508. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6509. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6510. Evaluate(value, op);
  6511. Emit(Push(property.position, op.op));
  6512. ReleaseOperand(op);
  6513. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6514. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6515. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6516. Evaluate(value, op);
  6517. Emit(Push(property.position, op.op));
  6518. ReleaseOperand(op);
  6519. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6520. ELSE
  6521. HALT(200);
  6522. END;
  6523. END AddProperty;
  6524. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6525. VAR symbol: SyntaxTree.Symbol;
  6526. BEGIN
  6527. WHILE modifier # NIL DO
  6528. symbol := cellType.cellScope.FindSymbol(modifier.identifier);
  6529. IF (symbol # NIL) & (symbol IS SyntaxTree.Property) THEN
  6530. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6531. ELSE
  6532. (*! move this check to checker *)
  6533. Error(modifier.position, "undefined property");
  6534. END;
  6535. modifier := modifier.nextModifier;
  6536. END;
  6537. END AddModifiers;
  6538. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6539. VAR last: SyntaxTree.Modifier;
  6540. BEGIN
  6541. IF to = NIL THEN
  6542. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6543. ELSE
  6544. last := to;
  6545. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6546. last := last.nextModifier;
  6547. END;
  6548. IF last.identifier # this.identifier THEN
  6549. ASSERT(last.nextModifier = NIL);
  6550. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6551. END;
  6552. END;
  6553. END AppendModifier;
  6554. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6555. BEGIN
  6556. WHILE this # NIL DO
  6557. AppendModifier(to, this);
  6558. this := this.nextModifier;
  6559. END;
  6560. END AppendModifiers;
  6561. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6562. VAR base: SyntaxTree.Type;
  6563. BEGIN
  6564. AppendModifiers(to, c.modifiers);
  6565. base := c.GetBaseValueType();
  6566. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6567. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6568. END;
  6569. END AppendCellTypeModifiers;
  6570. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6571. VAR op: Operand;
  6572. BEGIN
  6573. Evaluate(p, op);
  6574. Emit(Push(p.position, op.op));
  6575. ReleaseOperand(op);
  6576. (*
  6577. WHILE (p # NIL) & ~(p.type.resolved IS SyntaxTree.CellType) DO
  6578. p := p(SyntaxTree.Designator).left;
  6579. END;
  6580. IF p # NIL THEN
  6581. Evaluate(p, op);
  6582. Emit(Push(p.position, op.op));
  6583. ReleaseOperand(op);
  6584. ELSE
  6585. Emit(Push(-1, nil));
  6586. END;
  6587. *)
  6588. END PushPort;
  6589. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6590. VAR
  6591. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6592. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6593. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6594. tmp:IntermediateCode.Operand;
  6595. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6596. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6597. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6598. dest: IntermediateCode.Operand;
  6599. staticLength: LONGINT; itype: IntermediateCode.Type;
  6600. convert,isTensor: BOOLEAN;
  6601. recordType: SyntaxTree.RecordType;
  6602. baseType: SyntaxTree.Type;
  6603. flags: SET;
  6604. left: SyntaxTree.Expression;
  6605. call: SyntaxTree.Designator;
  6606. procedure: SyntaxTree.Procedure;
  6607. temporaryVariable: SyntaxTree.Variable;
  6608. dummy: IntermediateCode.Operand;
  6609. customBuiltin: SyntaxTree.CustomBuiltin;
  6610. isVarPar: ARRAY 3 OF BOOLEAN;
  6611. callsection: Sections.Section;
  6612. segmentedName: Basic.SegmentedName;
  6613. needsTrace: BOOLEAN;
  6614. n: ARRAY 256 OF CHAR;
  6615. modifier: SyntaxTree.Modifier;
  6616. previous, init: IntermediateCode.Section;
  6617. prevScope: SyntaxTree.Scope;
  6618. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6619. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6620. priority: IntermediateCode.Operand;
  6621. op,callop: Operand;
  6622. BEGIN
  6623. IF type = NIL THEN RETURN END;
  6624. type := type.resolved;
  6625. IF type IS SyntaxTree.PointerType THEN
  6626. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6627. END;
  6628. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6629. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6630. recordScope := type(SyntaxTree.RecordType).recordScope;
  6631. IF recordScope.bodyProcedure # NIL THEN
  6632. procedure := recordScope.bodyProcedure;
  6633. body := procedure.procedureScope.body;
  6634. Emit(Push(position,self));
  6635. IF body.isActive THEN
  6636. StaticCallOperand(callop,procedure);
  6637. Emit(Push(position,callop.op));
  6638. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6639. Convert(priority,sizeType);
  6640. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6641. END;
  6642. Emit(Push(position,priority));
  6643. ReleaseIntermediateOperand(priority);
  6644. IF backend.cooperative THEN
  6645. Emit(Push(position,self));
  6646. CallThis(position,"Activities","Create",3)
  6647. ELSE
  6648. flags := 0;
  6649. IF body.isSafe THEN
  6650. flags := 1;
  6651. END;
  6652. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6653. Emit(Push(position,self));
  6654. CallThis(position,"Objects","CreateProcess",4)
  6655. END;
  6656. ELSE
  6657. Emit(Push(position,self));
  6658. StaticCallOperand(callop,procedure);
  6659. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6660. END;
  6661. Emit(Pop(position,self));
  6662. END;
  6663. END CallBodies;
  6664. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6665. BEGIN
  6666. actualType := actualType.resolved;
  6667. IF actualType IS SyntaxTree.StringType THEN
  6668. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6669. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6670. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6671. ELSE
  6672. tmp := op.tag;
  6673. IntermediateCode.MakeMemory(tmp,addressType);
  6674. Emit(Push(position,tmp));
  6675. END;
  6676. Emit(Push(position,op.op))
  6677. END PushString;
  6678. PROCEDURE PushTD(type: SyntaxTree.Type);
  6679. VAR op: IntermediateCode.Operand;
  6680. BEGIN
  6681. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6682. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6683. ELSE
  6684. IF type.resolved IS SyntaxTree.PointerType THEN
  6685. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6686. END;
  6687. op := TypeDescriptorAdr(type.resolved);
  6688. IF ~newObjectFile THEN
  6689. IntermediateCode.MakeMemory(op,addressType);
  6690. END;
  6691. Emit(Push(position,op));
  6692. END
  6693. END PushTD;
  6694. BEGIN
  6695. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6696. dest := destination; destination := emptyOperand;
  6697. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6698. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6699. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6700. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6701. CASE x.id OF
  6702. (* ---- COPY ----- *)
  6703. |Global.Copy:
  6704. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6705. (* ---- EXCL, INCL----- *)
  6706. |Global.Excl,Global.Incl:
  6707. Evaluate(p0,s0);
  6708. Evaluate(p1,s1);
  6709. Convert(s1.op,setType);
  6710. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6711. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6712. END;
  6713. ReuseCopy(res,s0.op);
  6714. ReleaseOperand(s0);
  6715. Reuse1(tmp,s1.op);
  6716. ReleaseOperand(s1);
  6717. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6718. IF x.id = Global.Excl THEN
  6719. Emit(Not(position,tmp,tmp));
  6720. Emit(And(position,res,res,tmp));
  6721. ELSE
  6722. Emit(Or(position,res,res,tmp));
  6723. END;
  6724. ReleaseIntermediateOperand(tmp);
  6725. Designate(p0,s0);
  6726. ToMemory(s0.op,setType,0);
  6727. Emit(Mov(position,s0.op,res));
  6728. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6729. (* ---- DISPOSE ----- *)
  6730. |Global.Dispose:
  6731. Designate(p0,s0);
  6732. Emit(Push(position,s0.op));
  6733. ReleaseOperand(s0);
  6734. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6735. (* ---- GETPROCEDURE ----- *)
  6736. |Global.GetProcedure:
  6737. Designate(p0,s0);
  6738. PushString(s0,p0.type);
  6739. Designate(p1,s1);
  6740. PushString(s1,p1.type);
  6741. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6742. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6743. ELSE PushTD(procedureType.firstParameter.type)
  6744. END;
  6745. PushTD(procedureType.returnType);
  6746. Designate(p2,s2);
  6747. Emit(Push(position,s2.op));
  6748. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6749. CallThis(position,"Modules","GetProcedure", 7);
  6750. (* ---- ASH, LSH, ROT ----- *)
  6751. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6752. Evaluate(p0,s0);
  6753. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6754. (* make unsigned arguments in order to produced a logical shift *)
  6755. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6756. convert:= TRUE;
  6757. itype := s0.op.type;
  6758. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6759. Convert(s0.op,itype);
  6760. ELSE
  6761. convert := FALSE;
  6762. END;
  6763. END;
  6764. Evaluate(p1,s1);
  6765. IF IsIntegerConstant(p1,hint) THEN
  6766. ReuseCopy(reg,s0.op);
  6767. IF hint > 0 THEN
  6768. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6769. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6770. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6771. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  6772. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  6773. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  6774. END;
  6775. ELSIF hint < 0 THEN
  6776. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  6777. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  6778. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  6779. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  6780. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  6781. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  6782. END;
  6783. END;
  6784. ReleaseOperand(s0); ReleaseOperand(s1);
  6785. ELSE
  6786. exit := NewLabel();
  6787. end := NewLabel();
  6788. ReuseCopy(reg,s0.op);
  6789. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  6790. Reuse1(tmp,s1.op);
  6791. Emit(Neg(position,tmp,s1.op));
  6792. Convert(tmp,s1.op.type);
  6793. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  6794. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  6795. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  6796. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  6797. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  6798. END;
  6799. ReleaseIntermediateOperand(tmp);
  6800. BrL(end);
  6801. SetLabel(exit);
  6802. ReuseCopy(tmp,s1.op);
  6803. Convert(tmp,s1.op.type);
  6804. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  6805. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  6806. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  6807. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  6808. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  6809. END;
  6810. ReleaseIntermediateOperand(tmp);
  6811. SetLabel(end);
  6812. ReleaseOperand(s0); ReleaseOperand(s1);
  6813. END;
  6814. InitOperand(result,ModeValue);
  6815. IF convert THEN
  6816. itype := reg.type;
  6817. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  6818. Convert(reg,itype);
  6819. END;
  6820. result.op := reg;
  6821. (* ---- CAP ----- *)
  6822. |Global.Cap:
  6823. Evaluate(p0,result);
  6824. ReuseCopy(reg,result.op);
  6825. ReleaseIntermediateOperand(result.op);
  6826. ignore := NewLabel();
  6827. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  6828. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  6829. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  6830. SetLabel(ignore);
  6831. result.op := reg;
  6832. (* ---- CHR ----- *)
  6833. |Global.Chr, Global.Chr32:
  6834. Evaluate(p0,result);
  6835. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6836. |Global.Entier, Global.EntierH:
  6837. Evaluate(p0,result);
  6838. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6839. (* ---- MIN and MAX ----- *)
  6840. |Global.Max,Global.Min:
  6841. Evaluate(p0,s0);
  6842. Evaluate(p1,s1);
  6843. Reuse2(res,s0.op,s1.op);
  6844. else := NewLabel();
  6845. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  6846. ELSE BrltL(else,s1.op,s0.op) END;
  6847. Emit(Mov(position,res,s0.op));
  6848. ReleaseOperand(s0);
  6849. end := NewLabel();
  6850. BrL(end);
  6851. SetLabel(else);
  6852. Emit(MovReplace(position,res,s1.op));
  6853. SetLabel(end);
  6854. ReleaseOperand(s1);
  6855. InitOperand(result,ModeValue);
  6856. result.op := res;
  6857. (* ---- ODD ----- *)
  6858. |Global.Odd:
  6859. IF ~conditional THEN
  6860. ConditionToValue(x)
  6861. ELSE
  6862. Evaluate(p0,result);
  6863. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6864. Reuse1(res,result.op);
  6865. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  6866. ReleaseIntermediateOperand(result.op);
  6867. result.op := res;
  6868. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  6869. ReleaseOperand(result);
  6870. BrL(falseLabel);
  6871. END;
  6872. (* ---- ORD ----- *)
  6873. |Global.Ord, Global.Ord32:
  6874. Evaluate(p0,result);
  6875. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6876. (* ---- SHORT, LONG ----- *)
  6877. |Global.Short, Global.Long:
  6878. Evaluate(p0,result);
  6879. IF x.type IS SyntaxTree.ComplexType THEN
  6880. componentType := x.type(SyntaxTree.ComplexType).componentType;
  6881. Convert(result.op, IntermediateCode.GetType(system, componentType));
  6882. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  6883. ELSE
  6884. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6885. END
  6886. (* ---- HALT, SYSTEM.HALT----- *)
  6887. |Global.Halt, Global.systemHalt:
  6888. val := p0.resolved(SyntaxTree.IntegerValue).value;
  6889. EmitTrap (position, val);
  6890. (* ---- ASSERT ----- *)
  6891. |Global.Assert:
  6892. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  6893. trueL := NewLabel();
  6894. falseL := NewLabel();
  6895. Condition(p0,trueL,falseL);
  6896. IF p1 = NIL THEN val := AssertTrap
  6897. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  6898. END;
  6899. SetLabel(falseL);
  6900. EmitTrap(position,val);
  6901. SetLabel(trueL);
  6902. END;
  6903. (*
  6904. Emit(TrapC(result.op,val);
  6905. *)
  6906. (* ---- INC, DEC----- *)
  6907. |Global.Inc,Global.Dec:
  6908. Expression(p0); adr := result.op;
  6909. LoadValue(result,p0.type); l := result;
  6910. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6911. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  6912. END;
  6913. IF x.id = Global.Inc THEN
  6914. Emit(Add(position,l.op,l.op,r.op));
  6915. ELSE
  6916. Emit(Sub(position,l.op,l.op,r.op));
  6917. END;
  6918. ReleaseOperand(l); ReleaseOperand(r);
  6919. (* ---- LEN ----- *)
  6920. |Global.Len: (* dynamic length, static length done by checker *)
  6921. Designate(p0,operand);
  6922. IF p1 = NIL THEN
  6923. InitOperand(l,ModeValue);
  6924. l.op := IntermediateCode.Immediate(int32,0);
  6925. ELSE
  6926. Evaluate(p1,l);
  6927. END;
  6928. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  6929. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  6930. Dereference(operand, p0.type.resolved, FALSE);
  6931. END;
  6932. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  6933. ReleaseOperand(operand); ReleaseOperand(l);
  6934. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  6935. ASSERT(p1 # NIL);
  6936. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  6937. Dereference(operand,p0.type.resolved,FALSE);
  6938. END;
  6939. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  6940. ReleaseOperand(operand); ReleaseOperand(l);
  6941. ELSE HALT(100);
  6942. END;
  6943. Convert(result.op,IntermediateCode.GetType(system, x.type));
  6944. (* ---- FIRST ---- *)
  6945. |Global.First:
  6946. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6947. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  6948. ELSE
  6949. Designate(p0, result)
  6950. END
  6951. (* ---- LAST ---- *)
  6952. |Global.Last:
  6953. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6954. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  6955. ELSE
  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(system.longintType)))
  6963. END
  6964. (* ---- STEP ---- *)
  6965. |Global.Step:
  6966. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6967. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  6968. ELSE
  6969. Designate(p0, result);
  6970. (* make sure result.op is a register *)
  6971. tmp := result.op;
  6972. ReuseCopy(result.op, result.op);
  6973. ReleaseIntermediateOperand(tmp);
  6974. (* add offset to result.op *)
  6975. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6976. END
  6977. (* ---- RE ---- *)
  6978. |Global.Re:
  6979. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  6980. Designate(p0, result)
  6981. ELSE
  6982. Evaluate(p0, result)
  6983. END
  6984. (* ---- IM ---- *)
  6985. |Global.Im:
  6986. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  6987. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  6988. Designate(p0, result);
  6989. (* make sure result.op is a register *)
  6990. tmp := result.op;
  6991. ReuseCopy(result.op, result.op);
  6992. ReleaseIntermediateOperand(tmp);
  6993. (* add offset to result.op *)
  6994. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  6995. (* ---- ABS ----- *)
  6996. |Global.Abs:
  6997. Evaluate(p0,operand);
  6998. type := p0.type.resolved;
  6999. InitOperand(result,ModeValue);
  7000. Reuse1a(result.op,operand.op,dest);
  7001. Emit(Abs(position,result.op,operand.op));
  7002. ReleaseOperand(operand);
  7003. (* ---- WAIT ----- *)
  7004. |Global.Wait:
  7005. Evaluate(p0,operand);
  7006. Emit(Push(position,operand.op));
  7007. ReleaseOperand(operand);
  7008. CallThis(position,"Activities","Wait", 1);
  7009. (* ---- NEW ----- *)
  7010. |Global.New:
  7011. (*! the following code is only correct for "standard" Oberon calling convention *)
  7012. type := p0.type.resolved;
  7013. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7014. THEN
  7015. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7016. IF backend.cooperative THEN
  7017. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7018. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7019. IF recordType.isObject THEN
  7020. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7021. IF recordType.IsActive() THEN
  7022. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7023. END;
  7024. IF recordType.IsProtected() THEN
  7025. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7026. END;
  7027. ELSE
  7028. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7029. END;
  7030. END;
  7031. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7032. CallThis(position,"Runtime","New", 1);
  7033. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7034. Emit(Result(position, pointer));
  7035. exit := NewLabel();
  7036. BreqL(exit,pointer,nil);
  7037. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7038. GetRecordTypeName (recordType,name);
  7039. IF ~recordType.isObject THEN
  7040. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7041. END;
  7042. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7043. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7044. IF recordType.isObject THEN
  7045. IF recordType.IsProtected() THEN
  7046. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7047. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7048. END;
  7049. IF recordType.IsActive() THEN
  7050. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7051. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7052. END;
  7053. END;
  7054. END;
  7055. (* initialize fields *)
  7056. IF type(SyntaxTree.PointerType).isPlain THEN
  7057. size := 0;
  7058. ELSIF recordType.isObject THEN
  7059. size := BaseObjectTypeSize;
  7060. ELSE
  7061. size := BaseRecordTypeSize;
  7062. END;
  7063. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7064. (* call initializer *)
  7065. constructor := GetConstructor(recordType);
  7066. IF constructor # NIL THEN
  7067. (*! should be unified with ProcedureCallDesignator *)
  7068. Emit(Push(position,pointer));
  7069. ReleaseIntermediateOperand(pointer);
  7070. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7071. FOR i := 1 TO x.parameters.Length()-1 DO
  7072. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7073. formalParameter := formalParameter.nextParameter;
  7074. END;
  7075. (* static call of the constructor *)
  7076. GetCodeSectionNameForSymbol(constructor,name);
  7077. ASSERT(~constructor.isInline);
  7078. IF constructor.scope.ownerModule # module.module THEN
  7079. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7080. ELSE
  7081. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7082. END;
  7083. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7084. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7085. Emit(Pop(position,pointer));
  7086. END;
  7087. (* call bodies *)
  7088. CallBodies(pointer,p0.type);
  7089. SetLabel(exit);
  7090. needsTrace := p0.NeedsTrace();
  7091. IF needsTrace THEN ModifyAssignments(true) END;
  7092. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7093. Emit(Push(position, pointer));
  7094. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7095. Emit(Pop(position, pointer));
  7096. END;
  7097. Designate(p0,l);
  7098. IF needsTrace THEN
  7099. CallAssignPointer(l.op, pointer);
  7100. ELSE
  7101. ToMemory(l.op,addressType,0);
  7102. Emit(Mov(position,l.op,pointer));
  7103. END;
  7104. ReleaseIntermediateOperand(pointer);
  7105. ReleaseOperand(l);
  7106. IF needsTrace THEN ModifyAssignments(false) END;
  7107. ELSE
  7108. temporaryVariable := GetTemporaryVariable(type, FALSE);
  7109. IF temporaryVariable # NIL THEN
  7110. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7111. ELSE
  7112. Designate(p0,l);
  7113. END;
  7114. (* l.op contains address of pointer to record *)
  7115. Emit(Push(position,l.op)); (* address for use after syscall *)
  7116. Emit(Push(position,l.op));
  7117. ReleaseOperand(l);
  7118. (* push type descriptor *)
  7119. reg := TypeDescriptorAdr(recordType);
  7120. IF ~newObjectFile THEN
  7121. IntermediateCode.MakeMemory(reg,addressType);
  7122. END;
  7123. Emit(Push(position,reg));
  7124. ReleaseIntermediateOperand(reg);
  7125. (* push realtime flag *)
  7126. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7127. ELSE Emit(Push(position,false));
  7128. END;
  7129. CallThis(position,"Heaps","NewRec", 3);
  7130. (* check allocation success, if not successful then do not call initializers and bodies *)
  7131. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7132. Emit(Pop(position,pointer));
  7133. MakeMemory(reg,pointer,addressType,0);
  7134. ReleaseIntermediateOperand(pointer);
  7135. pointer := reg;
  7136. exit := NewLabel();
  7137. BreqL(exit,pointer,nil);
  7138. Emit(Push(position,pointer));
  7139. (* initialize fields *)
  7140. InitFields(recordType, pointer,0);
  7141. (* call initializer *)
  7142. constructor := GetConstructor(recordType);
  7143. IF constructor # NIL THEN
  7144. (*! should be unified with ProcedureCallDesignator *)
  7145. Emit(Push(position,pointer));
  7146. ReleaseIntermediateOperand(pointer);
  7147. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7148. FOR i := 1 TO x.parameters.Length()-1 DO
  7149. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7150. formalParameter := formalParameter.nextParameter;
  7151. END;
  7152. (* static call of the constructor *)
  7153. GetCodeSectionNameForSymbol(constructor,name);
  7154. ASSERT(~constructor.isInline);
  7155. IF constructor.scope.ownerModule # module.module THEN
  7156. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7157. ELSE
  7158. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7159. END;
  7160. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7161. ELSE
  7162. ReleaseIntermediateOperand(pointer);
  7163. END;
  7164. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7165. Emit(Pop(position,pointer));
  7166. IF temporaryVariable # NIL THEN
  7167. Designate(p0,l);
  7168. ToMemory(l.op,addressType,0);
  7169. Emit(Mov(position,l.op,pointer));
  7170. ReleaseOperand(l);
  7171. result.tag := emptyOperand;
  7172. END;
  7173. (* call bodies *)
  7174. CallBodies(pointer,p0.type);
  7175. ReleaseIntermediateOperand(pointer);
  7176. IF temporaryVariable # NIL THEN
  7177. end := NewLabel();
  7178. BrL(end);
  7179. SetLabel(exit);
  7180. Designate(p0,l);
  7181. ToMemory(l.op,addressType,0);
  7182. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7183. ReleaseOperand(l);
  7184. SetLabel(end);
  7185. ELSE
  7186. SetLabel(exit);
  7187. END;
  7188. END;
  7189. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7190. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7191. dim := 0;
  7192. IF p1 # NIL THEN
  7193. FOR i := 1 TO x.parameters.Length()-1 DO
  7194. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7195. parameter := x.parameters.GetExpression(i);
  7196. Evaluate(parameter,r);
  7197. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7198. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7199. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7200. END;
  7201. Emit(Push(position,r.op));
  7202. IF i=1 THEN
  7203. ReuseCopy(reg,r.op);
  7204. ELSE
  7205. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7206. END;
  7207. ReleaseOperand(r);
  7208. INC(dim);
  7209. END;
  7210. Convert(reg,addressType);
  7211. ELSE
  7212. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7213. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7214. END;
  7215. openDim := dim;
  7216. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7217. IF backend.cooperative THEN
  7218. size := ToMemoryUnits(system,system.SizeOf(type));
  7219. WHILE type IS SyntaxTree.ArrayType DO
  7220. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7221. END;
  7222. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7223. IF (size # 1) THEN
  7224. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7225. END;
  7226. Emit(Push(position,reg));
  7227. size := ToMemoryUnits(system,system.SizeOf(type));
  7228. IF (size # 1) THEN
  7229. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7230. END;
  7231. Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));
  7232. Emit(Push(position,reg));
  7233. ReleaseIntermediateOperand(reg);
  7234. CallThis(position,"Runtime","New", 1);
  7235. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7236. Emit(Result(position, pointer));
  7237. exit := NewLabel();
  7238. else := NewLabel();
  7239. BreqL(else,pointer,nil);
  7240. IF ~type.hasPointers THEN
  7241. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7242. ELSIF type IS SyntaxTree.RecordType THEN
  7243. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7244. ELSIF type IS SyntaxTree.ProcedureType THEN
  7245. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7246. ELSE
  7247. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7248. END;
  7249. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7250. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7251. 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))));
  7252. IF type IS SyntaxTree.RecordType THEN
  7253. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7254. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7255. ELSE
  7256. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7257. END;
  7258. i := openDim;
  7259. WHILE i > 0 DO
  7260. DEC (i);
  7261. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7262. END;
  7263. needsTrace := p0.NeedsTrace();
  7264. IF needsTrace THEN ModifyAssignments(true) END;
  7265. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7266. Emit(Push(position, pointer));
  7267. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7268. Emit(Pop(position, pointer));
  7269. END;
  7270. Designate(p0,l);
  7271. IF needsTrace THEN
  7272. CallAssignPointer(l.op, pointer);
  7273. ModifyAssignments(false);
  7274. ELSE
  7275. ToMemory(l.op,addressType,0);
  7276. Emit(Mov(position,l.op,pointer));
  7277. END;
  7278. ReleaseIntermediateOperand(pointer);
  7279. ReleaseOperand(l);
  7280. BrL(exit);
  7281. SetLabel(else);
  7282. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7283. Designate(p0,l);
  7284. IF needsTrace THEN
  7285. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7286. ELSE
  7287. ToMemory(l.op,addressType,0);
  7288. Emit(Mov(position,l.op,pointer));
  7289. END;
  7290. ReleaseOperand(l);
  7291. SetLabel(exit);
  7292. ELSE
  7293. (*! the following code is only correct for "standard" Oberon calling convention *)
  7294. IF SemanticChecker.ContainsPointer(type) THEN
  7295. IF type IS SyntaxTree.ArrayType THEN
  7296. staticLength := 1;
  7297. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7298. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7299. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7300. END;
  7301. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7302. Emit(Mul(position,reg,reg,tmp));
  7303. END;
  7304. Designate(p0,l);
  7305. IF openDim > 0 THEN
  7306. Emit(Push(position,l.op)); (* address for use after syscall *)
  7307. END;
  7308. Emit(Push(position,l.op)); (* address *)
  7309. ReleaseOperand(l);
  7310. tmp := TypeDescriptorAdr(type);
  7311. IF ~newObjectFile THEN
  7312. IntermediateCode.MakeMemory(tmp,addressType);
  7313. END;
  7314. Emit(Push(position,tmp)); (* type descriptor *)
  7315. ReleaseIntermediateOperand(tmp);
  7316. Emit(Push(position,reg)); (* number Elements *)
  7317. ReleaseIntermediateOperand(reg);
  7318. tmp := IntermediateCode.Immediate(addressType,dim);
  7319. Emit(Push(position,tmp)); (* dimensions *)
  7320. (* push realtime flag *)
  7321. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7322. ELSE Emit(Push(position,false));
  7323. END;
  7324. CallThis(position,"Heaps","NewArr",5)
  7325. ELSE
  7326. size := ToMemoryUnits(system,system.SizeOf(type));
  7327. IF (size # 1) THEN
  7328. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7329. END;
  7330. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7331. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7332. Emit(Add(position,reg,reg,tmp));
  7333. Designate(p0,l);
  7334. IF openDim >0 THEN
  7335. Emit(Push(position,l.op)); (* address for use after syscall *)
  7336. END;
  7337. Emit(Push(position,l.op)); (* address for syscall *)
  7338. ReleaseOperand(l); (* pointer address *)
  7339. Emit(Push(position,reg)); (* size *)
  7340. ReleaseIntermediateOperand(reg);
  7341. (* push realtime flag *)
  7342. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7343. ELSE Emit(Push(position,false));
  7344. END;
  7345. CallThis(position,"Heaps","NewSys", 3)
  7346. END;
  7347. IF openDim > 0 THEN
  7348. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7349. Emit(Pop(position,adr));
  7350. ToMemory(adr,addressType,0);
  7351. ReuseCopy(tmp,adr);
  7352. ReleaseIntermediateOperand(adr);
  7353. adr := tmp;
  7354. else := NewLabel();
  7355. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7356. i := openDim-1;
  7357. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7358. WHILE (i >= 0) DO
  7359. Emit(Pop(position,reg));
  7360. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7361. Emit(Mov(position,res,reg));
  7362. DEC(i);
  7363. END;
  7364. ReleaseIntermediateOperand(adr);
  7365. ReleaseIntermediateOperand(reg);
  7366. exit := NewLabel();
  7367. BrL(exit);
  7368. SetLabel(else);
  7369. (* else part: array could not be allocated *)
  7370. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7371. Emit(Add(position,sp,sp,tmp));
  7372. SetLabel(exit);
  7373. END;
  7374. END;
  7375. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7376. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7377. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7378. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7379. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7380. left.SetType(procedure.type);
  7381. formalParameter := procedureType.firstParameter;
  7382. (* push array to allocate *)
  7383. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7384. formalParameter :=formalParameter.nextParameter;
  7385. (* push length array *)
  7386. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7387. (* push size *)
  7388. type := t0;
  7389. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7390. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7391. END;
  7392. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7393. Emit(Push(position,tmp));
  7394. (* *)
  7395. IF SemanticChecker.ContainsPointer(type) THEN
  7396. tmp := TypeDescriptorAdr(type);
  7397. IF ~newObjectFile THEN
  7398. IntermediateCode.MakeMemory(tmp,addressType);
  7399. END;
  7400. ELSE
  7401. tmp := IntermediateCode.Immediate(addressType, 0);
  7402. END;
  7403. Emit(Push(position,tmp)); (* type descriptor *)
  7404. StaticCallOperand(result,procedure);
  7405. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7406. ReleaseOperand(result);
  7407. END;
  7408. (*
  7409. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7410. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7411. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7412. *)
  7413. ELSE
  7414. dim := 0;
  7415. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7416. (* generate geometry descriptor *)
  7417. Designate(p0,l);
  7418. NewMathArrayDescriptor(l, x.parameters.Length()-1);
  7419. ReleaseOperand(l);
  7420. isTensor := TRUE;
  7421. ELSE
  7422. isTensor := FALSE;
  7423. END;
  7424. FOR i := 1 TO x.parameters.Length()-1 DO
  7425. IF ~isTensor THEN
  7426. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7427. END;
  7428. parameter := x.parameters.GetExpression(i);
  7429. Evaluate(parameter,r);
  7430. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7431. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7432. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7433. END;
  7434. Emit(Push(position,r.op));
  7435. IF i=1 THEN
  7436. ReuseCopy(reg,r.op);
  7437. ELSE
  7438. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7439. END;
  7440. ReleaseOperand(r);
  7441. INC(dim);
  7442. END;
  7443. Convert(reg,addressType);
  7444. openDim := dim;
  7445. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7446. (*! the following code is only correct for "standard" Oberon calling convention *)
  7447. IF SemanticChecker.ContainsPointer(SemanticChecker.ArrayBase(type,MAX(LONGINT))) THEN
  7448. t := type;
  7449. IF ~isTensor & (t IS SyntaxTree.MathArrayType) THEN
  7450. staticLength := 1;
  7451. WHILE (t IS SyntaxTree.MathArrayType) DO (* static array *)
  7452. staticLength := staticLength * t(SyntaxTree.MathArrayType).staticLength;
  7453. t := t(SyntaxTree.MathArrayType).arrayBase.resolved;
  7454. END;
  7455. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7456. Emit(Mul(position,reg,reg,tmp));
  7457. END;
  7458. Designate(p0,l);
  7459. IF isTensor THEN
  7460. Dereference(l,type,FALSE);
  7461. t := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7462. END;
  7463. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7464. Emit(Push(position,l.tag)); (* address *)
  7465. ReleaseOperand(l);
  7466. tmp := TypeDescriptorAdr(t);
  7467. IF ~newObjectFile THEN
  7468. IntermediateCode.MakeMemory(tmp,addressType);
  7469. END;
  7470. Emit(Push(position,tmp)); (* type descriptor *)
  7471. ReleaseIntermediateOperand(tmp);
  7472. Emit(Push(position,reg)); (* number Elements *)
  7473. ReleaseIntermediateOperand(reg);
  7474. tmp := IntermediateCode.Immediate(addressType,0);
  7475. Emit(Push(position,tmp)); (* dimensions = 0, we control dimensions in the geometry descriptor *)
  7476. (* push realtime flag: false by default *)
  7477. Emit(Push(position,false));
  7478. CallThis(position,"Heaps","NewArr",5);
  7479. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7480. Emit(Pop(position,adr));
  7481. GetMathArrayField(tmp,adr,MathPtrOffset);
  7482. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7483. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrDataArrayOffset))));
  7484. PutMathArrayField(adr,reg,MathAdrOffset);
  7485. ReleaseIntermediateOperand(tmp);
  7486. ReleaseIntermediateOperand(reg);
  7487. ELSE
  7488. IF isTensor THEN
  7489. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT))));
  7490. ELSE
  7491. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim)));
  7492. END;
  7493. IF (size # 1) THEN
  7494. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7495. END;
  7496. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset));
  7497. Emit(Add(position,reg,reg,tmp));
  7498. Designate(p0,l);
  7499. IF isTensor THEN
  7500. Dereference(l,type,FALSE);
  7501. END;
  7502. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7503. Emit(Push(position,l.tag)); (* address for syscall *)
  7504. ReleaseOperand(l); (* pointer address *)
  7505. Emit(Push(position,reg)); (* size *)
  7506. ReleaseIntermediateOperand(reg);
  7507. (* push realtime flag: false by default *)
  7508. Emit(Push(position,false));
  7509. CallThis(position,"Heaps","NewSys",3);
  7510. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7511. Emit(Pop(position,adr));
  7512. GetMathArrayField(tmp,adr,MathPtrOffset);
  7513. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7514. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset))));
  7515. PutMathArrayField(adr,reg,MathAdrOffset);
  7516. ReleaseIntermediateOperand(tmp);
  7517. ReleaseIntermediateOperand(reg);
  7518. END;
  7519. flags := {};
  7520. IntermediateCode.InitImmediate(tmp,addressType,SYSTEM.VAL(LONGINT,flags));
  7521. PutMathArrayField(adr,tmp,MathFlagsOffset);
  7522. IntermediateCode.InitImmediate(tmp,addressType,openDim);
  7523. PutMathArrayField(adr,tmp,MathDimOffset);
  7524. else := NewLabel();
  7525. BreqL(else,IntermediateCode.Memory(addressType,adr,0),IntermediateCode.Immediate(addressType,0));
  7526. i := openDim-1;
  7527. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7528. IF isTensor THEN
  7529. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT)))));
  7530. ELSE
  7531. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim))));
  7532. END;
  7533. PutMathArrayField(adr,tmp,MathElementSizeOffset);
  7534. WHILE (i >= 0) DO
  7535. Emit(Pop(position,reg));
  7536. PutMathArrayLength(adr,reg,i);
  7537. PutMathArrayIncrement(adr,tmp,i);
  7538. IF i > 0 THEN
  7539. IF i=openDim-1 THEN
  7540. ReuseCopy(tmp,tmp);
  7541. END;
  7542. Emit(Mul(position,tmp,tmp,reg));
  7543. END;
  7544. DEC(i);
  7545. END;
  7546. ReleaseIntermediateOperand(adr);
  7547. ReleaseIntermediateOperand(reg);
  7548. ReleaseIntermediateOperand(tmp);
  7549. exit := NewLabel();
  7550. BrL(exit);
  7551. SetLabel(else);
  7552. (* else part: array could not be allocated *)
  7553. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7554. Emit(Add(position,sp,sp,tmp));
  7555. SetLabel(exit);
  7556. END;
  7557. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7558. THEN
  7559. IF ~backend.cellsAreObjects THEN RETURN END;
  7560. IF InCellScope(currentScope) THEN
  7561. PushSelfPointer()
  7562. ELSE
  7563. Emit(Push(position, nil));
  7564. END;
  7565. (* push temp address *)
  7566. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7567. temporaryVariable := GetTemporaryVariable(type, FALSE);
  7568. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7569. (* l.op contains address of pointer to record *)
  7570. Emit(Push(position,l.op)); (* address for use after syscall *)
  7571. ReleaseOperand(l);
  7572. (* push type descriptor *)
  7573. reg := TypeDescriptorAdr(baseType);
  7574. IF ~newObjectFile THEN
  7575. IntermediateCode.MakeMemory(reg,addressType);
  7576. END;
  7577. Emit(Push(position,reg));
  7578. ReleaseIntermediateOperand(reg);
  7579. (* push name *)
  7580. (*Global.GetSymbolName(p0, n);*)
  7581. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7582. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7583. ELSE
  7584. Global.GetModuleName(module.module, n);
  7585. END;
  7586. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position);
  7587. (*type.typeDeclaration.GetName(n);*)
  7588. PushConstString(n);
  7589. (* push cellnet boolean *)
  7590. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7591. (* push engine boolean *)
  7592. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7593. (* allocate *)
  7594. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7595. (* add capabilities *)
  7596. modifier := p0(SyntaxTree.Designator).modifiers;
  7597. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7598. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7599. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7600. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7601. END;
  7602. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7603. (*
  7604. modifier := baseType(SyntaxTree.CellType).modifiers;
  7605. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7606. modifier := p0(SyntaxTree.Designator).modifiers;
  7607. *)
  7608. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7609. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7610. (* l.op contains address of pointer to record *)
  7611. ToMemory(l.op,addressType,0);
  7612. (* l.op contains value of pointer to record *)
  7613. Emit(Push(position,l.op)); (* address for use after syscall *)
  7614. ReleaseOperand(l);
  7615. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7616. prevScope := currentScope;
  7617. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7618. previous := section;
  7619. section := init;
  7620. (* add ports *)
  7621. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7622. CloseInitializer(previous);
  7623. currentScope := prevScope;
  7624. Symbol(temporaryVariable,l);
  7625. ToMemory(l.op,addressType,0);
  7626. Emit(Push(position,l.op));
  7627. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7628. (*
  7629. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7630. IF constructor # NIL THEN
  7631. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7632. FOR i := 1 TO x.parameters.Length()-1 DO
  7633. p := x.parameters.GetExpression(i);
  7634. Global.GetSymbolName(parameter,name);
  7635. Evaluate(p, value);
  7636. ASSERT(value.type # NIL);
  7637. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7638. par := instance.AddParameter(name);
  7639. par.SetInteger(value.integer);
  7640. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7641. par := instance.AddParameter(name);
  7642. par.SetBoolean(value.boolean);
  7643. ELSE Error(x.position,NotYetImplemented)
  7644. END;
  7645. parameter := parameter.nextParameter
  7646. END;
  7647. END;
  7648. *)
  7649. (* call initializer *)
  7650. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7651. IF constructor # NIL THEN
  7652. (*! should be unified with ProcedureCallDesignator *)
  7653. IF backend.cellsAreObjects THEN
  7654. Symbol(temporaryVariable,l);
  7655. ToMemory(l.op,addressType,0);
  7656. Emit(Push(position,l.op));
  7657. ReleaseOperand(l);
  7658. END;
  7659. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7660. FOR i := 1 TO x.parameters.Length()-1 DO
  7661. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7662. formalParameter := formalParameter.nextParameter;
  7663. END;
  7664. (* static call of the constructor *)
  7665. Global.GetSymbolSegmentedName(constructor,name);
  7666. ASSERT(~constructor.isInline);
  7667. IF constructor.scope.ownerModule # module.module THEN
  7668. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7669. ELSE
  7670. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7671. END;
  7672. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7673. (*ELSE
  7674. ReleaseIntermediateOperand(pointer);*)
  7675. END;
  7676. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7677. ToMemory(l.op, addressType, 0);
  7678. Designate(p0,s0);
  7679. ToMemory(s0.op,addressType,0);
  7680. Emit(Mov(position,s0.op,l.op));
  7681. ReleaseOperand(l);
  7682. ReleaseOperand(s0);
  7683. result.tag := emptyOperand;
  7684. (* start *)
  7685. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7686. (* push cell *)
  7687. Symbol(temporaryVariable, l);
  7688. ToMemory(l.op,addressType,0);
  7689. Emit(Push(-1,l.op));
  7690. (* push delegate *)
  7691. Emit(Push(-1,l.op));
  7692. ReleaseOperand(l);
  7693. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7694. Emit(Push(position, s1.op));
  7695. ReleaseOperand(s1);
  7696. CallThis(position,"ActiveCellsRuntime","Start",3);
  7697. END;
  7698. (*IF temporaryVariable # NIL THEN
  7699. end := NewLabel();
  7700. BrL(end);
  7701. SetLabel(exit);
  7702. Designate(p0,l);
  7703. ToMemory(l.op,addressType,0);
  7704. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7705. ReleaseOperand(l);
  7706. SetLabel(end);
  7707. ELSE
  7708. SetLabel(exit);
  7709. END;
  7710. *)
  7711. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7712. ELSE (* no pointer to record, no pointer to array *)
  7713. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7714. (* ignore new statement *)
  7715. Warning(p0.position, "cannot run on final hardware");
  7716. ELSE
  7717. HALT(200);
  7718. END;
  7719. END;
  7720. (* ---- ADDRESSOF----- *)
  7721. |Global.systemAdr:
  7722. Designate(p0,s0);
  7723. s0.mode := ModeValue;
  7724. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7725. ReleaseIntermediateOperand(s0.op);
  7726. s0.op := s0.tag;
  7727. IntermediateCode.InitOperand(s0.tag);
  7728. END;
  7729. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7730. result := s0;
  7731. (* ---- BIT ----- *)
  7732. |Global.systemBit:
  7733. Evaluate(p0,s0);
  7734. ToMemory(s0.op,addressType,0);
  7735. ReuseCopy(res,s0.op);
  7736. ReleaseOperand(s0);
  7737. Evaluate(p1,s1);
  7738. Emit(Ror(position,res,res,s1.op));
  7739. ReleaseOperand(s1);
  7740. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7741. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7742. IF ~conditional THEN
  7743. InitOperand(result,ModeValue); result.op := res;
  7744. ELSE
  7745. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7746. BrL(falseLabel);
  7747. ReleaseIntermediateOperand(res);
  7748. END;
  7749. (* --- MSK ----*)
  7750. |Global.systemMsk:
  7751. Evaluate(p0,s0);
  7752. Evaluate(p1,s1);
  7753. ReuseCopy(res,s0.op);
  7754. ReleaseOperand(s0);
  7755. Emit(And(position,res,res,s1.op));
  7756. ReleaseOperand(s1);
  7757. InitOperand(result,ModeValue);
  7758. result.op := res;
  7759. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  7760. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  7761. Evaluate(p0,s0);
  7762. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  7763. ReleaseOperand(s0);
  7764. InitOperand(result,ModeValue);
  7765. result.op := res;
  7766. (* ---- SYSTEM.GetStackPointer ----- *)
  7767. |Global.systemGetStackPointer:
  7768. InitOperand(result,ModeValue);
  7769. result.op := sp;
  7770. (* ---- SYSTEM.GetFramePointer ----- *)
  7771. |Global.systemGetFramePointer:
  7772. InitOperand(result,ModeValue);
  7773. result.op := fp;
  7774. (* ---- SYSTEM.GetActivity ----- *)
  7775. |Global.systemGetActivity:
  7776. ASSERT(backend.cooperative);
  7777. InitOperand(result,ModeValue);
  7778. result.op := ap;
  7779. (* ---- SYSTEM.SetStackPointer ----- *)
  7780. |Global.systemSetStackPointer:
  7781. Evaluate(p0,s0); (* *)
  7782. Emit(Mov(position,sp,s0.op));
  7783. ReleaseOperand(s0);
  7784. (* ---- SYSTEM.SetFramePointer ----- *)
  7785. |Global.systemSetFramePointer:
  7786. Evaluate(p0,s0); (* *)
  7787. Emit(Mov(position,fp,s0.op));
  7788. ReleaseOperand(s0);
  7789. (* ---- SYSTEM.Activity ----- *)
  7790. |Global.systemSetActivity:
  7791. ASSERT(backend.cooperative);
  7792. Evaluate(p0,s0); (* *)
  7793. Emit(Mov(position,ap,s0.op));
  7794. ReleaseOperand(s0);
  7795. (* ---- SYSTEM.VAL ----- *)
  7796. |Global.systemVal:
  7797. Expression(p1);
  7798. s1 := result;
  7799. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7800. IF s1.mode = ModeReference THEN
  7801. (* nothing to be done if not record type, just take over new type *)
  7802. IF (type IS SyntaxTree.RecordType) THEN
  7803. ReleaseIntermediateOperand(s1.tag);
  7804. s1.tag := TypeDescriptorAdr(type);
  7805. IF ~newObjectFile THEN
  7806. IntermediateCode.MakeMemory(s1.tag,addressType);
  7807. END;
  7808. UseIntermediateOperand(s1.tag);
  7809. END;
  7810. result := s1;
  7811. ELSE (* copy over result to different type, may not use convert *)
  7812. itype := IntermediateCode.GetType(system,type);
  7813. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  7814. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  7815. Emit(Mov(position,s0.op,s1.op));
  7816. ReleaseOperand(s1);
  7817. InitOperand(result,ModeValue);
  7818. result.op := s0.op;
  7819. ELSE (* different size, must convert *)
  7820. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  7821. Convert(s1.op, IntermediateCode.GetType(system,type));
  7822. result := s1;
  7823. END;
  7824. END;
  7825. (* ---- SYSTEM.GET ----- *)
  7826. |Global.systemGet:
  7827. Evaluate(p0,s0); (* adr *)
  7828. Designate(p1,s1); (* variable *)
  7829. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  7830. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  7831. Emit(Mov(position,s1.op,s0.op));
  7832. ReleaseOperand(s1);
  7833. ReleaseOperand(s0);
  7834. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  7835. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  7836. Evaluate(p0,s0); (* *)
  7837. Evaluate(p1,s1); (* variable *)
  7838. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  7839. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  7840. (* real part *)
  7841. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  7842. Emit(Mov(position,res, s1.op));
  7843. ReleaseIntermediateOperand(res);
  7844. (* imaginary part *)
  7845. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  7846. Emit(Mov(position,res, s1.tag));
  7847. ReleaseIntermediateOperand(res);
  7848. ReleaseOperand(s1);
  7849. ReleaseOperand(s0);
  7850. ELSE
  7851. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  7852. ReleaseOperand(s0);
  7853. Emit(Mov(position,res,s1.op));
  7854. ReleaseIntermediateOperand(res);
  7855. ReleaseOperand(s1);
  7856. END;
  7857. (* ---- SYSTEM.MOVE ----- *)
  7858. |Global.systemMove:
  7859. Evaluate(p0,s0);
  7860. Evaluate(p1,s1);
  7861. Evaluate(p2,s2);
  7862. Emit(Copy(position,s1.op,s0.op,s2.op));
  7863. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7864. (* ---- SYSTEM.NEW ----- *)
  7865. |Global.systemNew:
  7866. Designate(p0,s0);
  7867. Emit(Push(position,s0.op));
  7868. ReleaseOperand(s0);
  7869. Evaluate(p1,s1);
  7870. Emit(Push(position,s1.op));
  7871. ReleaseOperand(s1);
  7872. (* push realtime flag: false by default *)
  7873. Emit(Push(position,false));
  7874. CallThis(position,"Heaps","NewSys",3);
  7875. (* ---- SYSTEM.CALL ----- *)
  7876. |Global.systemRef:
  7877. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  7878. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  7879. s0.mode := ModeValue;
  7880. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  7881. result := s0
  7882. (* ---- INCR ----- *)
  7883. |Global.Incr:
  7884. Designate(p0,operand);
  7885. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7886. Dereference(operand,p0.type.resolved,FALSE);
  7887. END;
  7888. ASSERT(p1 # NIL);
  7889. Evaluate(p1,l);
  7890. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  7891. ReleaseOperand(operand); ReleaseOperand(l);
  7892. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7893. (* ---- SUM ----- *)
  7894. |Global.Sum: HALT(200);
  7895. (* ---- ALL ----- *)
  7896. |Global.All: HALT(200);
  7897. (* ---- CAS ----- *)
  7898. |Global.Cas:
  7899. needsTrace := p0.NeedsTrace();
  7900. IF needsTrace THEN ModifyAssignments(true) END;
  7901. Designate(p0,s0);
  7902. Evaluate(p1,s1);
  7903. Evaluate(p2,s2);
  7904. IF needsTrace THEN
  7905. Emit(Push(position, s0.op));
  7906. Emit(Push(position, s1.op));
  7907. Emit(Push(position, s2.op));
  7908. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  7909. ELSE
  7910. Emit(Cas(position,s0.op,s1.op,s2.op));
  7911. END;
  7912. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7913. IF needsTrace THEN ModifyAssignments(false) END;
  7914. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7915. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  7916. IF conditional THEN
  7917. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7918. BrL(falseLabel);
  7919. ReleaseIntermediateOperand(res);
  7920. END;
  7921. (* ---- DIM ----- *)
  7922. |Global.Dim:
  7923. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  7924. Designate(p0,s0);
  7925. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7926. Dereference(s0,p0.type.resolved,FALSE);
  7927. END;
  7928. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  7929. ReleaseOperand(s0);
  7930. (* ---- RESHAPE ----- *)
  7931. |Global.Reshape:
  7932. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  7933. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7934. left.SetType(procedure.type);
  7935. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  7936. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  7937. END;
  7938. (* ---- SYSTEM.TYPECODE ----- *)
  7939. |Global.systemTypeCode:
  7940. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7941. IF type.resolved IS SyntaxTree.PointerType THEN
  7942. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7943. END;
  7944. result.op := TypeDescriptorAdr(type);
  7945. IF ~newObjectFile THEN
  7946. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  7947. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  7948. END;
  7949. result.mode := ModeValue;
  7950. (* ---- SYSTEM.TRACE ----- *)
  7951. |Global.systemTrace:
  7952. SystemTrace(x.parameters, x.position);
  7953. (* ----- CONNECT ------*)
  7954. |Global.Connect:
  7955. IF backend.cellsAreObjects THEN
  7956. PushPort(p0);
  7957. PushPort(p1);
  7958. IF p2 # NIL THEN
  7959. Evaluate(p2, s2);
  7960. Emit(Push(p2.position, s2.op));
  7961. ReleaseOperand(s2);
  7962. ELSE
  7963. Emit(Push(-1, IntermediateCode.Immediate(int32, -1)));
  7964. END;
  7965. CallThis(position,"ActiveCellsRuntime","Connect",3);
  7966. ELSE
  7967. Warning(x.position, "cannot run on final hardware");
  7968. END;
  7969. (* ----- DELEGATE ------*)
  7970. |Global.Delegate:
  7971. IF backend.cellsAreObjects THEN
  7972. PushPort(p0);
  7973. PushPort(p1);
  7974. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  7975. ELSE
  7976. Warning(x.position, "cannot run on final hardware");
  7977. END;
  7978. (* ----- SEND ------*)
  7979. |Global.Send:
  7980. Evaluate(p0,s0);
  7981. Evaluate(p1,s1);
  7982. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7983. Emit(Push(position,s0.op));
  7984. Emit(Push(position,s1.op));
  7985. (*
  7986. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7987. *)
  7988. IF ~backend.cellsAreObjects THEN
  7989. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  7990. END;
  7991. ReleaseOperand(s0);
  7992. ReleaseOperand(s1);
  7993. IF backend.cellsAreObjects THEN
  7994. CallThis(position,"ActiveCellsRuntime","Send",2);
  7995. ELSE
  7996. CallThis(position,ChannelModuleName,"Send",2);
  7997. END;
  7998. (* ----- RECEIVE ------*)
  7999. |Global.Receive:
  8000. Evaluate(p0,s0);
  8001. Emit(Push(position,s0.op));
  8002. Designate(p1,s1);
  8003. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8004. Emit(Push(position,s1.op));
  8005. IF p2 # NIL THEN
  8006. Designate(p2,s2);
  8007. Emit(Push(position,s2.op));
  8008. END;
  8009. (*
  8010. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8011. *)
  8012. IF ~backend.cellsAreObjects THEN
  8013. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8014. END;
  8015. ReleaseOperand(s0);
  8016. ReleaseOperand(s1);
  8017. ReleaseOperand(s2);
  8018. IF backend.cellsAreObjects THEN
  8019. IF p2 = NIL THEN
  8020. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8021. ELSE
  8022. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8023. END;
  8024. ELSE
  8025. IF p2 = NIL THEN
  8026. CallThis(position,ChannelModuleName,"Receive",2)
  8027. ELSE
  8028. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8029. END;
  8030. END;
  8031. | Global.systemSpecial:
  8032. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8033. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8034. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8035. (* determine if parameters are of the VAR kind *)
  8036. ASSERT(x.parameters.Length() <= 3);
  8037. formalParameter := procedureType.firstParameter;
  8038. FOR i := 0 TO x.parameters.Length() - 1 DO
  8039. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8040. formalParameter := formalParameter.nextParameter
  8041. END;
  8042. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8043. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8044. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8045. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8046. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8047. IF procedureType.returnType # NIL THEN
  8048. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8049. Emit(Result(position, res));
  8050. (*InitOperand(result,ModeValue);
  8051. result.op := res;
  8052. *)
  8053. IF ~conditional THEN
  8054. InitOperand(result,ModeValue); result.op := res;
  8055. ELSE
  8056. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8057. BrL(falseLabel);
  8058. ReleaseIntermediateOperand(res);
  8059. END;
  8060. END
  8061. ELSE (* function not yet implemented *)
  8062. Error(position,"not yet implemented");
  8063. END;
  8064. destination := dest;
  8065. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8066. END VisitBuiltinCallDesignator;
  8067. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  8068. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8069. BEGIN
  8070. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8071. dest := destination; destination := emptyOperand;
  8072. Expression(x.left);
  8073. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8074. ELSIF isUnchecked THEN (* no check *)
  8075. ELSE
  8076. trueL := NewLabel();
  8077. falseL := NewLabel();
  8078. IF IsPointerToRecord(x.left.type,recordType) THEN
  8079. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8080. Emit(Mov(position,tag, result.op));
  8081. IF result.mode # ModeValue THEN
  8082. ptr := tag;
  8083. IntermediateCode.MakeMemory(ptr,addressType);
  8084. Emit(Mov(position,tag, ptr));
  8085. END;
  8086. IF ~backend.cooperative THEN
  8087. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8088. END;
  8089. IntermediateCode.MakeMemory(tag,addressType);
  8090. ELSE
  8091. tag := result.tag;
  8092. END;
  8093. TypeTest(tag,x.type,trueL,falseL);
  8094. ReleaseIntermediateOperand(tag);
  8095. SetLabel(falseL);
  8096. EmitTrap(position,TypeCheckTrap);
  8097. SetLabel(trueL);
  8098. END;
  8099. destination := dest;
  8100. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8101. END VisitTypeGuardDesignator;
  8102. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8103. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8104. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8105. VAR label: Label; pc: LONGINT;
  8106. BEGIN
  8107. IF backend.cooperative & ~isUnchecked THEN
  8108. pc := section.pc;
  8109. label := NewLabel();
  8110. BrneL(label, operand.op, nil);
  8111. EmitTrap(position, NilPointerTrap);
  8112. SetLabel(label);
  8113. INC(statCoopNilCheck, section.pc - pc);
  8114. END;
  8115. END NilCheck;
  8116. BEGIN
  8117. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8118. ReuseCopy(dereferenced,operand.op);
  8119. ReleaseOperand(operand);
  8120. operand.mode := ModeReference;
  8121. operand.op := dereferenced;
  8122. operand.tag := dereferenced;
  8123. UseIntermediateOperand(operand.tag);
  8124. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8125. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8126. ReleaseIntermediateOperand(operand.tag);
  8127. operand.tag := TypeDescriptorAdr(type);
  8128. IF ~newObjectFile THEN
  8129. IntermediateCode.MakeMemory(operand.tag,addressType);
  8130. END;
  8131. ELSE
  8132. IF ~backend.cooperative THEN
  8133. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8134. END;
  8135. IntermediateCode.MakeMemory(operand.tag,addressType);
  8136. END;
  8137. NilCheck(operand.op);
  8138. ELSIF type IS SyntaxTree.ArrayType THEN
  8139. IF isUnsafe THEN
  8140. NilCheck(operand.op);
  8141. ReleaseIntermediateOperand(operand.tag);
  8142. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8143. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8144. ELSE
  8145. operand.tag := emptyOperand;
  8146. END;
  8147. ELSE
  8148. NilCheck(operand.op);
  8149. IF backend.cooperative THEN
  8150. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8151. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8152. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8153. ELSE
  8154. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8155. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8156. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8157. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8158. END;
  8159. END;
  8160. ELSIF type IS SyntaxTree.MathArrayType THEN
  8161. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8162. IntermediateCode.MakeMemory(operand.op,addressType);
  8163. ELSE HALT(100);
  8164. END;
  8165. END Dereference;
  8166. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  8167. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8168. BEGIN
  8169. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8170. dest := destination; destination := emptyOperand;
  8171. Evaluate(x.left,d);
  8172. type := x.type.resolved;
  8173. prevIsUnchecked := isUnchecked;
  8174. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8175. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8176. END;
  8177. Dereference(d,type,IsUnsafePointer(x.left.type));
  8178. isUnchecked := prevIsUnchecked;
  8179. result := d;
  8180. 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
  8181. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8182. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8183. END;
  8184. END;
  8185. destination := dest;
  8186. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8187. END VisitDereferenceDesignator;
  8188. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  8189. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8190. BEGIN
  8191. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8192. dest := destination; destination := emptyOperand;
  8193. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8194. tag := result.op;
  8195. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8196. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8197. StaticCallOperand(result,procedure.super);
  8198. ReleaseIntermediateOperand(result.tag);
  8199. UseIntermediateOperand(tag); (* necessary ? *)
  8200. result.tag := tag;
  8201. destination := dest;
  8202. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8203. END VisitSupercallDesignator;
  8204. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  8205. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8206. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8207. name: Basic.SegmentedName;
  8208. BEGIN
  8209. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8210. dest := destination; destination := emptyOperand;
  8211. scope := currentScope;
  8212. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8213. scope := scope.outerScope;
  8214. END;
  8215. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8216. IF newObjectFile THEN
  8217. moduleSection := meta.ModuleSection();
  8218. IF backend.cooperative THEN
  8219. moduleOffset := 0;
  8220. ELSE
  8221. moduleOffset := moduleSection.pc;
  8222. END;
  8223. result.mode := ModeValue;
  8224. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8225. ELSE
  8226. Symbol(moduleSelf,result);
  8227. IntermediateCode.MakeMemory(result.op,addressType);
  8228. END
  8229. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8230. result.mode := ModeValue;
  8231. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8232. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8233. ELSE
  8234. GetBaseRegister(basereg,currentScope,scope);
  8235. InitOperand(result,ModeReference);
  8236. result.op := basereg;
  8237. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  8238. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  8239. IF backend.cooperative THEN
  8240. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8241. END;
  8242. (* tag must be loaded when dereferencing SELF pointer *)
  8243. END;
  8244. destination := dest;
  8245. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8246. END VisitSelfDesignator;
  8247. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  8248. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8249. BEGIN
  8250. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8251. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8252. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8253. parameter := procedureType.returnParameter;
  8254. VisitParameter(parameter);
  8255. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8256. END VisitResultDesignator;
  8257. (** values *)
  8258. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  8259. BEGIN
  8260. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8261. IF conditional THEN
  8262. IF x.value THEN BrL(trueLabel)
  8263. ELSE BrL(falseLabel)
  8264. END;
  8265. ELSE
  8266. InitOperand(result,ModeValue);
  8267. IF x.value THEN result.op := true ELSE result.op := false END;
  8268. END;
  8269. END VisitBooleanValue;
  8270. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8271. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8272. BEGIN
  8273. Global.GetModuleSegmentedName(module.module, name);
  8274. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8275. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE);
  8276. RETURN section
  8277. END GetDataSection;
  8278. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8279. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8280. BEGIN
  8281. type := vop.type;
  8282. data := GetDataSection();
  8283. pc := EnterImmediate(data,vop);
  8284. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8285. IntermediateCode.MakeMemory(vop, type);
  8286. END GetImmediateMem;
  8287. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  8288. BEGIN
  8289. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8290. InitOperand(result,ModeValue);
  8291. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8292. IF ~supportedImmediate(result.op) &~inData THEN
  8293. GetImmediateMem(result.op)
  8294. END;
  8295. END VisitIntegerValue;
  8296. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  8297. BEGIN
  8298. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8299. InitOperand(result,ModeValue);
  8300. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8301. END VisitCharacterValue;
  8302. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  8303. BEGIN
  8304. IF Trace THEN TraceEnter("VisitSetValue") END;
  8305. InitOperand(result,ModeValue);
  8306. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8307. END VisitSetValue;
  8308. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  8309. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8310. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8311. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8312. BEGIN
  8313. numberElements := x.elements.Length();
  8314. FOR i := 0 TO numberElements-1 DO
  8315. expression := x.elements.GetExpression(i);
  8316. IF expression IS SyntaxTree.MathArrayExpression THEN
  8317. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8318. ELSE
  8319. inData := TRUE;
  8320. Evaluate(expression,op);
  8321. irv.Emit(Data(position,op.op));
  8322. inData := FALSE;
  8323. ReleaseOperand(op);
  8324. END;
  8325. END;
  8326. END RecursiveData;
  8327. BEGIN
  8328. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8329. IF ~TryConstantDeclaration() THEN
  8330. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8331. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8332. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8333. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8334. ELSE
  8335. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8336. END;
  8337. RecursiveData(x.array);
  8338. InitOperand(result,ModeReference);
  8339. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8340. END
  8341. END VisitMathArrayValue;
  8342. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8343. VAR constant: Sections.Section;
  8344. BEGIN
  8345. IF constantDeclaration = NIL THEN
  8346. RETURN FALSE
  8347. ELSE
  8348. (* Is a constant in this module: did we generate it already? *)
  8349. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8350. IF constant # NIL THEN
  8351. InitOperand(result,ModeReference);
  8352. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8353. RETURN TRUE;
  8354. END;
  8355. END;
  8356. RETURN FALSE
  8357. END TryConstantDeclaration;
  8358. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  8359. BEGIN
  8360. constantDeclaration := x;
  8361. x.value.resolved.Accept(SELF);
  8362. END VisitConstant;
  8363. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  8364. BEGIN
  8365. IF Trace THEN TraceEnter("VisitRealValue") END;
  8366. InitOperand(result,ModeValue);
  8367. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8368. END VisitRealValue;
  8369. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  8370. VAR
  8371. componentType: SyntaxTree.Type;
  8372. BEGIN
  8373. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8374. ASSERT(x.type IS SyntaxTree.ComplexType);
  8375. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8376. InitOperand(result,ModeValue);
  8377. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8378. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8379. END VisitComplexValue;
  8380. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  8381. VAR i: LONGINT; name: Basic.SegmentedName;
  8382. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8383. BEGIN
  8384. IF Trace THEN TraceEnter("VisitStringValue") END;
  8385. IF ~TryConstantDeclaration() THEN
  8386. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8387. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8388. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8389. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8390. ELSE
  8391. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8392. END;
  8393. FOR i := 0 TO x.length-1 DO
  8394. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8395. irv.Emit(Data(position,op));
  8396. END;
  8397. InitOperand(result,ModeReference);
  8398. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8399. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8400. END
  8401. END VisitStringValue;
  8402. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8403. BEGIN
  8404. IF Trace THEN TraceEnter("VisitNilValue") END;
  8405. InitOperand(result,ModeValue);
  8406. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8407. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8408. END VisitNilValue;
  8409. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8410. BEGIN
  8411. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8412. InitOperand(result,ModeValue);
  8413. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8414. END VisitEnumerationValue;
  8415. (** symbols *)
  8416. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8417. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8418. END VisitImport;
  8419. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8420. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8421. BEGIN
  8422. IF scope # baseScope THEN
  8423. (* left := [fp+8] *)
  8424. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8425. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8426. ReuseCopy(left,right);
  8427. ReleaseIntermediateOperand(right);
  8428. scope := scope.outerScope; DEC(level);
  8429. (* { left := [left+8] } *)
  8430. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8431. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8432. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8433. Emit(Mov(position,left,right));
  8434. scope := scope.outerScope; DEC(level);
  8435. END;
  8436. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8437. result := left;
  8438. ELSE
  8439. result := fp;
  8440. END;
  8441. END GetBaseRegister;
  8442. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8443. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8444. BEGIN
  8445. IF Trace THEN TraceEnter("VisitVariable"); END;
  8446. type := x.type.resolved;
  8447. IF (x.useRegister) THEN
  8448. InitOperand(result, ModeValue);
  8449. IF x.registerNumber < 0 THEN
  8450. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8451. reg := x.registerNumber;
  8452. ELSE
  8453. reg := registerUsageCount.Map(x.registerNumber);
  8454. UseRegister(reg);
  8455. END;
  8456. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8457. ELSIF x.externalName # NIL THEN
  8458. InitOperand(result,ModeReference);
  8459. Basic.ToSegmentedName(x.externalName^, name);
  8460. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8461. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8462. InitOperand(result,ModeReference);
  8463. GetBaseRegister(result.op,currentScope,x.scope);
  8464. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8465. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8466. InitOperand(result,ModeReference);
  8467. GetCodeSectionNameForSymbol(x,name);
  8468. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8469. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8470. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8471. InitOperand(result,ModeReference);
  8472. GetCodeSectionNameForSymbol(x,name);
  8473. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8474. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8475. ELSE (* field, left designator must have been emitted *)
  8476. ASSERT(result.mode = ModeReference);
  8477. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8478. ReuseCopy(temp,result.op);
  8479. ReleaseIntermediateOperand(result.op);
  8480. result.op := temp;
  8481. END;
  8482. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8483. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8484. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8485. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8486. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8487. END;
  8488. END;
  8489. END;
  8490. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8491. ValueToCondition(result);
  8492. ELSIF type IS SyntaxTree.ProcedureType THEN
  8493. ReleaseIntermediateOperand(result.tag);
  8494. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8495. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8496. UseIntermediateOperand(result.tag);
  8497. ELSE
  8498. result.tag := nil; (* nil *)
  8499. END;
  8500. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8501. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8502. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8503. ReleaseIntermediateOperand(result.tag);
  8504. Global.GetSymbolSegmentedName(x,name);
  8505. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8506. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8507. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8508. ELSE
  8509. END;
  8510. ELSE
  8511. ReleaseIntermediateOperand(result.tag);
  8512. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8513. END;
  8514. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8515. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8516. ReleaseIntermediateOperand(result.tag);
  8517. result.tag := result.op;
  8518. UseIntermediateOperand(result.tag);
  8519. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8520. IntermediateCode.MakeMemory(result.op,addressType);
  8521. END;
  8522. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8523. ReleaseIntermediateOperand(result.tag);
  8524. result.tag := TypeDescriptorAdr(type);
  8525. IF ~newObjectFile THEN
  8526. IntermediateCode.MakeMemory(result.tag,addressType);
  8527. END;
  8528. UseIntermediateOperand(result.tag);
  8529. (* tag for pointer type computed not here but during dereferencing *)
  8530. END;
  8531. IF Trace THEN TraceExit("VisitVariable") END;
  8532. END VisitVariable;
  8533. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8534. BEGIN
  8535. VisitVariable(property);
  8536. END VisitProperty;
  8537. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8538. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8539. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT;
  8540. BEGIN
  8541. type := x.type.resolved;
  8542. IF Trace THEN TraceEnter("VisitParameter") END;
  8543. IF x.ownerType IS SyntaxTree.CellType THEN
  8544. ptype := x.type.resolved;
  8545. IF ptype IS SyntaxTree.ArrayType THEN ptype := ptype(SyntaxTree.ArrayType).arrayBase.resolved END;
  8546. IF ~(ptype IS SyntaxTree.PortType) THEN
  8547. InitOperand(result,ModeReference);
  8548. GetCodeSectionNameForSymbol(x,name);
  8549. symbol := NewSection(module.allSections, Sections.ConstSection, name,x,commentPrintout # NIL);
  8550. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol),0);
  8551. RETURN
  8552. ELSE
  8553. InitOperand(result, ModeValue);
  8554. parameter := x.ownerType(SyntaxTree.CellType).firstParameter;
  8555. adr := 0;
  8556. WHILE parameter # x DO
  8557. parameterType := parameter.type;
  8558. inc := 1;
  8559. WHILE SemanticChecker.IsStaticArray(parameterType, parameterType, len) DO inc := inc * len END;
  8560. INC(adr, inc);
  8561. parameter := parameter.nextParameter
  8562. END;
  8563. IntermediateCode.InitImmediate(result.op,addressType,adr);
  8564. RETURN
  8565. END;
  8566. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8567. InitOperand(result,ModeReference);
  8568. GetCodeSectionNameForSymbol(x,name);
  8569. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8570. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8571. RETURN
  8572. ELSE
  8573. GetBaseRegister(basereg,currentScope,x.scope);
  8574. InitOperand(result,ModeReference);
  8575. result.op := basereg;
  8576. END;
  8577. IF IsOpenArray(type) THEN
  8578. result.tag := basereg;
  8579. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8580. IntermediateCode.MakeMemory(result.op,addressType);
  8581. IF Global.IsOberonProcedure(x.ownerType) THEN
  8582. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8583. UseIntermediateOperand(result.tag);
  8584. ELSE
  8585. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8586. END;
  8587. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8588. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8589. ELSIF IsStaticArray(type) THEN
  8590. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8591. IntermediateCode.MakeMemory(result.op,addressType);
  8592. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8593. ELSIF type IS SyntaxTree.MathArrayType THEN
  8594. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8595. WITH type: SyntaxTree.MathArrayType DO
  8596. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8597. IF type.form = SyntaxTree.Tensor THEN
  8598. ELSIF type.form = SyntaxTree.Open THEN
  8599. result.tag := result.op;
  8600. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8601. IntermediateCode.MakeMemory(result.op,addressType);
  8602. UseIntermediateOperand(result.tag);
  8603. ELSIF type.form = SyntaxTree.Static THEN
  8604. IF x.kind = SyntaxTree.ConstParameter THEN
  8605. IntermediateCode.MakeMemory(result.op,addressType);
  8606. END;
  8607. ELSE HALT(100)
  8608. END;
  8609. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8610. IF type.form = SyntaxTree.Tensor THEN
  8611. ToMemory(result.op,addressType,0);
  8612. ELSIF type.form = SyntaxTree.Open THEN
  8613. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8614. ReuseCopy(result.tag, mem);
  8615. ReleaseIntermediateOperand(mem);
  8616. ReleaseIntermediateOperand(result.op);
  8617. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8618. ELSIF type.form = SyntaxTree.Static THEN
  8619. IntermediateCode.MakeMemory(result.op,addressType);
  8620. ELSE HALT(100)
  8621. END;
  8622. ELSE HALT(100)
  8623. END;
  8624. END;
  8625. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8626. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8627. IntermediateCode.MakeMemory(result.op,addressType);
  8628. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8629. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8630. END;
  8631. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8632. ValueToCondition(result);
  8633. ELSIF type IS SyntaxTree.ProcedureType THEN
  8634. ReleaseIntermediateOperand(result.tag);
  8635. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8636. IF x.kind = SyntaxTree.VarParameter THEN
  8637. ReuseCopy(result.tag,result.op);
  8638. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8639. IntermediateCode.MakeMemory(result.tag,addressType);
  8640. ELSE
  8641. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8642. UseIntermediateOperand(result.tag);
  8643. END;
  8644. ELSE
  8645. result.tag := nil;
  8646. END;
  8647. (* tag for pointer type computed not here but during dereferencing *)
  8648. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) THEN
  8649. ReleaseIntermediateOperand(result.tag);
  8650. result.tag := basereg;
  8651. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8652. IntermediateCode.MakeMemory(result.tag,addressType);
  8653. UseIntermediateOperand(result.tag);
  8654. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind = SyntaxTree.ValueParameter) THEN
  8655. ReleaseIntermediateOperand(result.tag);
  8656. result.tag := TypeDescriptorAdr(type);
  8657. IF ~newObjectFile THEN
  8658. IntermediateCode.MakeMemory(result.tag,addressType);
  8659. END;
  8660. UseIntermediateOperand(result.tag);
  8661. END;
  8662. IF Trace THEN TraceExit("VisitParameter") END;
  8663. END VisitParameter;
  8664. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8665. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8666. BEGIN
  8667. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8668. (* left.p: left already emitted *)
  8669. tag := result.op; (* value of pointer to left *)
  8670. (* get type desc *)
  8671. tmp := result.tag;
  8672. IntermediateCode.MakeMemory(tmp,addressType);
  8673. (* get method adr *)
  8674. Reuse1(reg,tmp);
  8675. ReleaseIntermediateOperand(tmp);
  8676. IF backend.cooperative THEN
  8677. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8678. WHILE recordType.baseType # NIL DO
  8679. recordType := recordType.GetBaseRecord ();
  8680. END;
  8681. GetRecordTypeName (recordType,name);
  8682. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8683. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8684. offset := 0;
  8685. ELSE
  8686. offset := 2;
  8687. END;
  8688. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8689. ELSE
  8690. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8691. END;
  8692. InitOperand(operand,ModeReference);
  8693. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8694. operand.op := reg;
  8695. operand.tag := tag;
  8696. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8697. END DynamicCallOperand;
  8698. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8699. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8700. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8701. BEGIN
  8702. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8703. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8704. tag := operand.op;
  8705. ReleaseIntermediateOperand(operand.tag);
  8706. ELSE tag := nil
  8707. END;
  8708. IF x.isInline THEN
  8709. sectionType := Sections.InlineCodeSection;
  8710. ELSE
  8711. sectionType := Sections.CodeSection;
  8712. END;
  8713. IF x.externalName # NIL THEN
  8714. Basic.ToSegmentedName(x.externalName^, name);
  8715. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8716. ELSE
  8717. GetCodeSectionNameForSymbol(x, name);
  8718. IF (x.scope.ownerModule = module.module) THEN
  8719. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8720. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8721. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8722. IF source.pc = 0 THEN (* no code yet *)
  8723. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8724. END;
  8725. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8726. bits := x.procedureScope.body.code.inlineCode;
  8727. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8728. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8729. binary.CopyBits(bits, 0, bits.GetSize());
  8730. source.SetResolved(binary);
  8731. ELSE
  8732. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8733. END;
  8734. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8735. END;
  8736. InitOperand(operand,ModeValue);
  8737. operand.op := reg;
  8738. operand.tag := tag;
  8739. IF Trace THEN TraceExit("StaticCallOperand") END;
  8740. END StaticCallOperand;
  8741. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8742. (* handle expressions of the form designator.procedure or procedure *)
  8743. BEGIN
  8744. IF Trace THEN TraceEnter("VisitProcedure") END;
  8745. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) THEN
  8746. DynamicCallOperand(result,x);
  8747. ELSIF x.isInline THEN
  8748. StaticCallOperand(result,x);
  8749. ELSE
  8750. StaticCallOperand(result,x);
  8751. END;
  8752. IF Trace THEN TraceExit("VisitProcedure") END;
  8753. END VisitProcedure;
  8754. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  8755. BEGIN
  8756. VisitProcedure(x);
  8757. END VisitOperator;
  8758. (** statements *)
  8759. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  8760. BEGIN
  8761. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  8762. Expression(x.call);
  8763. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  8764. ReleaseOperand(result)
  8765. END;
  8766. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  8767. END VisitProcedureCallStatement;
  8768. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  8769. VAR leftType, rightType: SyntaxTree.MathArrayType;
  8770. leftBase, rightBase: SyntaxTree.Type;
  8771. procedureName,s: SyntaxTree.IdentifierString;
  8772. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  8773. size: LONGINT; rightKind: LONGINT;
  8774. dummy: IntermediateCode.Operand;
  8775. CONST moduleName = "FoxArrayBase";
  8776. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  8777. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  8778. BEGIN
  8779. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  8780. IF base IS SyntaxTree.MathArrayType THEN
  8781. base := OpenArray(base(SyntaxTree.MathArrayType));
  8782. END;
  8783. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  8784. result.SetArrayBase(base);
  8785. RETURN result
  8786. END OpenArray;
  8787. BEGIN
  8788. IF AddImport(moduleName,arrayBase,TRUE) THEN
  8789. SaveRegisters();ReleaseUsedRegisters(saved);
  8790. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  8791. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  8792. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  8793. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  8794. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  8795. IF leftType.form = SyntaxTree.Tensor THEN
  8796. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  8797. ELSIF leftType.form = SyntaxTree.Open THEN
  8798. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  8799. ELSIF leftType.form = SyntaxTree.Static THEN
  8800. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  8801. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  8802. END;
  8803. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  8804. IF procedure = NIL THEN
  8805. s := "Instruction not supported on target, emulation procedure ";
  8806. Strings.Append(s,moduleName);
  8807. Strings.Append(s,".");
  8808. Strings.Append(s,procedureName);
  8809. Strings.Append(s," not present");
  8810. Error(position,s);
  8811. ELSE
  8812. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  8813. parameter.SetType(leftType);
  8814. parameter.SetAccess(SyntaxTree.Internal);
  8815. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8816. parameter.SetKind(rightKind);
  8817. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8818. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  8819. Emit(Push(position,IntermediateCode.Immediate(int32,size)));
  8820. StaticCallOperand(result,procedure);
  8821. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  8822. ReleaseOperand(result);
  8823. END;
  8824. RestoreRegisters(saved);
  8825. END;
  8826. END AssignMathArray;
  8827. VAR modifyAssignmentCounter := 0: LONGINT;
  8828. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  8829. VAR processor,mem,dst: IntermediateCode.Operand;
  8830. BEGIN
  8831. IF value.intValue = true.intValue THEN
  8832. INC(modifyAssignmentCounter);
  8833. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  8834. modifyAssignmentsPC := section.pc;
  8835. ELSE
  8836. DEC(modifyAssignmentCounter);
  8837. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  8838. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  8839. END;
  8840. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  8841. dst := NewRegisterOperand (addressType);
  8842. Emit(Mov(position,dst, processor));
  8843. IntermediateCode.InitMemory(mem,bool, dst, 0);
  8844. Emit(Mov(position,mem, value));
  8845. ReleaseIntermediateOperand(dst);
  8846. END ModifyAssignments;
  8847. PROCEDURE CopySize(left: SyntaxTree.Expression): IntermediateCode.Operand;
  8848. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8849. BEGIN
  8850. type := left.type.resolved;
  8851. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  8852. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  8853. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  8854. IF procedureType.returnParameter = parameter THEN
  8855. RETURN IntermediateCode.Memory(addressType, fp, ToMemoryUnits(system, parameter.offsetInBits + system.addressSize));
  8856. END;
  8857. END;
  8858. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  8859. END CopySize;
  8860. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  8861. VAR
  8862. leftO, rightO: Operand;
  8863. mem, sizeOp: IntermediateCode.Operand;
  8864. leftType, rightType, componentType: SyntaxTree.Type;
  8865. size: LONGINT;
  8866. parameters: SyntaxTree.ExpressionList;
  8867. procedure: SyntaxTree.Procedure;
  8868. call: SyntaxTree.ProcedureCallDesignator;
  8869. designator: SyntaxTree.Designator;
  8870. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  8871. VAR procedureType: SyntaxTree.ProcedureType;
  8872. BEGIN
  8873. IF ReturnedAsParameter(right.type) THEN
  8874. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  8875. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  8876. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  8877. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  8878. WITH right: SyntaxTree.BuiltinCallDesignator DO
  8879. IF right.id = Global.Reshape THEN RETURN TRUE
  8880. END;
  8881. END;
  8882. END;
  8883. END;
  8884. RETURN FALSE
  8885. END CanPassAsResultParameter;
  8886. BEGIN
  8887. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  8888. leftType := left.type.resolved; rightType:= right.type.resolved;
  8889. IF backend.cooperative & left.NeedsTrace() THEN
  8890. ModifyAssignments(true);
  8891. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  8892. Designate(right, rightO);
  8893. Designate(left, leftO);
  8894. ASSERT(leftO.mode = ModeReference);
  8895. TransferToRegister(leftO.op, leftO.op);
  8896. TransferToRegister(rightO.op, rightO.op);
  8897. Emit(Push(position, leftO.op));
  8898. Emit(Push(position, rightO.op));
  8899. CallAssignMethod(leftO.op, rightO.op, left.type);
  8900. Emit(Pop(position, rightO.op));
  8901. Emit(Pop(position, leftO.op));
  8902. sizeOp := CopySize(left);
  8903. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8904. ReleaseOperand(leftO);
  8905. ReleaseOperand(rightO);
  8906. ELSE
  8907. Evaluate(right,rightO);
  8908. Designate(left,leftO);
  8909. ASSERT(leftO.mode = ModeReference);
  8910. IF (leftType IS SyntaxTree.ProcedureType) THEN
  8911. (* copy procedure address first *)
  8912. MakeMemory(mem,leftO.op,addressType,0);
  8913. Emit(Mov(position,mem,rightO.op));
  8914. ReleaseIntermediateOperand(mem);
  8915. (* copy pointer address *)
  8916. IntermediateCode.MakeAddress(leftO.tag, addressType);
  8917. CallAssignPointer(leftO.tag, rightO.tag);
  8918. ELSE
  8919. ASSERT(system.SizeOf(left.type) = system.addressSize);
  8920. CallAssignPointer(leftO.op, rightO.op);
  8921. END;
  8922. ReleaseOperand(leftO);
  8923. ReleaseOperand(rightO);
  8924. END;
  8925. ModifyAssignments(false);
  8926. RETURN;
  8927. END;
  8928. IF CanPassAsResultParameter(right) THEN
  8929. procedureResultDesignator := left(SyntaxTree.Designator);
  8930. Expression(right);
  8931. procedureResultDesignator := NIL;
  8932. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  8933. (* left <-- ALIAS OF right: zerocopy *)
  8934. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  8935. designator := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid, NIL, procedure);
  8936. designator.SetType(procedure.type);
  8937. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  8938. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  8939. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8940. END;
  8941. ELSIF leftType IS SyntaxTree.RangeType THEN
  8942. (* LHS is of array range type *)
  8943. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  8944. Evaluate(right, rightO);
  8945. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  8946. (* first *)
  8947. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 0);
  8948. Emit(Mov(position,mem, rightO.op));
  8949. ReleaseIntermediateOperand(mem);
  8950. (* last *)
  8951. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8952. Emit(Mov(position,mem, rightO.tag));
  8953. ReleaseIntermediateOperand(mem);
  8954. (* step *)
  8955. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8956. Emit(Mov(position,mem, rightO.extra));
  8957. ReleaseIntermediateOperand(mem);
  8958. ReleaseOperand(rightO);
  8959. ReleaseOperand(leftO)
  8960. ELSIF leftType IS SyntaxTree.ComplexType THEN
  8961. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  8962. Evaluate(right, rightO);
  8963. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  8964. componentType := leftType(SyntaxTree.ComplexType).componentType;
  8965. (* real part *)
  8966. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  8967. Emit(Mov(position,mem, rightO.op));
  8968. ReleaseIntermediateOperand(mem);
  8969. (* imaginary part *)
  8970. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8971. Emit(Mov(position,mem, rightO.tag));
  8972. ReleaseIntermediateOperand(mem);
  8973. ReleaseOperand(rightO);
  8974. ReleaseOperand(leftO)
  8975. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  8976. OR (leftType IS SyntaxTree.PortType) THEN
  8977. (* rightO := leftO;*)
  8978. Evaluate(right,rightO);
  8979. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  8980. Designate(left,leftO);
  8981. IF leftO.mode = ModeReference THEN
  8982. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  8983. destination := mem;
  8984. ELSE
  8985. destination := leftO.op;
  8986. END;
  8987. ReleaseOperand(leftO);
  8988. IF destination.mode # IntermediateCode.Undefined THEN
  8989. Emit(Mov(position,destination,rightO.op));
  8990. END;
  8991. ReleaseOperand(rightO);
  8992. ReleaseIntermediateOperand(mem);
  8993. IntermediateCode.InitOperand(destination);
  8994. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  8995. Evaluate(right,rightO);
  8996. Designate(left,leftO);
  8997. MakeMemory(mem,leftO.op,addressType,0);
  8998. Emit(Mov(position,mem,rightO.op));
  8999. ReleaseIntermediateOperand(mem);
  9000. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9001. (* delegate *)
  9002. (*
  9003. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9004. *)
  9005. Emit(Mov(position,leftO.tag,rightO.tag));
  9006. END;
  9007. ReleaseOperand(leftO);
  9008. ReleaseOperand(rightO);
  9009. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9010. Designate(right,rightO);
  9011. Designate(left,leftO);
  9012. sizeOp := CopySize(left);
  9013. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9014. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9015. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9016. IF (rightType IS SyntaxTree.StringType) THEN
  9017. CopyString(left,right);
  9018. 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
  9019. Designate(right,rightO);
  9020. Designate(left,leftO);
  9021. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9022. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9023. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9024. ELSE
  9025. HALT(201)
  9026. END;
  9027. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9028. AssignMathArray(left,right);
  9029. ELSE
  9030. HALT(200);
  9031. END;
  9032. END Assign;
  9033. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  9034. BEGIN
  9035. IF Trace THEN TraceEnter("VisitAssignment") END;
  9036. Assign(x.left,x.right);
  9037. IF Trace THEN TraceExit("VisitAssignment") END;
  9038. END VisitAssignment;
  9039. PROCEDURE EmitCooperativeSwitch;
  9040. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9041. BEGIN
  9042. ASSERT (cooperativeSwitches);
  9043. pc := section.pc;
  9044. IF lastSwitchPC = section.pc THEN RETURN END;
  9045. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9046. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9047. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9048. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9049. INC(statCoopSwitch, section.pc - pc);
  9050. END EmitCooperativeSwitch;
  9051. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  9052. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9053. BEGIN
  9054. p0 := communication.left; p1 := communication.right;
  9055. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9056. Evaluate(p0,s0);
  9057. Evaluate(p1,s1);
  9058. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9059. Emit(Push(position,s0.op));
  9060. Emit(Push(position,s1.op));
  9061. (*
  9062. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9063. *)
  9064. IF ~backend.cellsAreObjects THEN
  9065. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9066. END;
  9067. ReleaseOperand(s0);
  9068. ReleaseOperand(s1);
  9069. IF backend.cellsAreObjects THEN
  9070. CallThis(position,"ActiveCellsRuntime","Send",2);
  9071. ELSE
  9072. CallThis(position,ChannelModuleName,"Send",2);
  9073. END;
  9074. (* ----- RECEIVE ------*)
  9075. ELSE
  9076. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9077. tmp := p0; p0 := p1; p1 := tmp;
  9078. END;
  9079. Evaluate(p0,s0);
  9080. Emit(Push(position,s0.op));
  9081. Designate(p1,s1);
  9082. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9083. Emit(Push(position,s1.op));
  9084. (*
  9085. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9086. *)
  9087. IF ~backend.cellsAreObjects THEN
  9088. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9089. END;
  9090. ReleaseOperand(s0);
  9091. ReleaseOperand(s1);
  9092. IF backend.cellsAreObjects THEN
  9093. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9094. ELSE
  9095. CallThis(position,ChannelModuleName,"Receive",2)
  9096. END;
  9097. END;
  9098. END VisitCommunicationStatement;
  9099. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  9100. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9101. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9102. VAR true, false: Label; condition, value: BOOLEAN;
  9103. BEGIN
  9104. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9105. IF condition THEN
  9106. true := NewLabel();
  9107. false := NewLabel();
  9108. Condition(if.condition,true,false);
  9109. SetLabel(true);
  9110. StatementSequence(if.statements);
  9111. BrL(end);
  9112. SetLabel(false);
  9113. ELSE
  9114. IF value THEN (* always true *)
  9115. escape := TRUE;
  9116. StatementSequence(if.statements);
  9117. (* no branch necessary -- rest skipped *)
  9118. END;
  9119. END;
  9120. END IfPart;
  9121. BEGIN
  9122. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9123. end := NewLabel();
  9124. elsifs := x.ElsifParts();
  9125. IfPart(x.ifPart);
  9126. FOR i := 0 TO elsifs-1 DO
  9127. IF ~escape THEN
  9128. elsif := x.GetElsifPart(i);
  9129. IfPart(elsif);
  9130. END;
  9131. END;
  9132. IF (x.elsePart # NIL) & ~escape THEN
  9133. StatementSequence(x.elsePart);
  9134. END;
  9135. SetLabel(end);
  9136. IF Trace THEN TraceExit("VisitIfStatement") END;
  9137. END VisitIfStatement;
  9138. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9139. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9140. BEGIN
  9141. (*IF x.variable.type.resolved = x.type.resolved THEN
  9142. (* always true, do nothing *)
  9143. ELSE*)
  9144. Designate(x.variable,res);
  9145. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9146. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9147. END;
  9148. trueL := NewLabel();
  9149. TypeTest(res.tag,x.type,trueL,falseL);
  9150. ReleaseOperand(res);
  9151. SetLabel(trueL);
  9152. StatementSequence(x.statements);
  9153. BrL(endL);
  9154. END WithPart;
  9155. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  9156. VAR endL,falseL: Label;i: LONGINT;
  9157. BEGIN
  9158. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9159. endL := NewLabel();
  9160. FOR i := 0 TO x.WithParts()-1 DO
  9161. falseL := NewLabel();
  9162. WithPart(x.GetWithPart(i),falseL,endL);
  9163. SetLabel(falseL);
  9164. END;
  9165. IF x.elsePart = NIL THEN
  9166. IF ~isUnchecked THEN
  9167. EmitTrap(position,WithTrap);
  9168. END;
  9169. ELSE
  9170. StatementSequence(x.elsePart)
  9171. END;
  9172. SetLabel(endL);
  9173. IF Trace THEN TraceExit("VisitWithStatement") END;
  9174. END VisitWithStatement;
  9175. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  9176. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9177. out,else: Label; label: Label;
  9178. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9179. symbol: SyntaxTree.Symbol;
  9180. BEGIN
  9181. (*! split case statement into if-elsif statements for large case label lists *)
  9182. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9183. size := x.max-x.min+1;
  9184. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9185. END;
  9186. Evaluate(x.variable,var);
  9187. ReuseCopy(tmp,var.op);
  9188. ReleaseIntermediateOperand(var.op);
  9189. var.op := tmp;
  9190. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9191. Convert(var.op,addressType);
  9192. size := x.max-x.min+1;
  9193. else := NewLabel();
  9194. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9195. (*
  9196. UniqueId(name,module.module,"case",caseId);
  9197. *)
  9198. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9199. Global.GetModuleSegmentedName(module.module, name);
  9200. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9201. symbol := SyntaxTree.NewSymbol(name[1]);
  9202. symbol.SetScope(moduleScope);
  9203. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9204. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9205. section.isCaseTable := TRUE;
  9206. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9207. ReuseCopy(res,var.op);
  9208. ReleaseOperand(var);
  9209. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9210. Emit(Add(position,res,res,jmp));
  9211. IntermediateCode.MakeMemory(res,addressType);
  9212. Emit(Br(position,res));
  9213. ReleaseIntermediateOperand(res);
  9214. out := NewLabel();
  9215. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9216. part := x.GetCasePart(i);
  9217. constant := part.firstConstant;
  9218. label := NewLabel();
  9219. SetLabel(label);
  9220. WHILE(constant # NIL) DO (* case labels for this case part *)
  9221. FOR j := constant.min TO constant.max DO
  9222. fixups[j-x.min] := label;
  9223. END;
  9224. constant := constant.next;
  9225. END;
  9226. StatementSequence(part.statements);
  9227. BrL(out);
  9228. END;
  9229. SetLabel(else);
  9230. FOR i := 0 TO size-1 DO
  9231. IF fixups[i] = NIL THEN
  9232. fixups[i] := else;
  9233. END;
  9234. END;
  9235. IF x.elsePart # NIL THEN
  9236. StatementSequence(x.elsePart);
  9237. ELSIF ~isUnchecked THEN
  9238. EmitTrap(position,CaseTrap);
  9239. END;
  9240. SetLabel(out);
  9241. FOR i := 0 TO size-1 DO
  9242. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9243. section.Emit(Data(position,op));
  9244. END;
  9245. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9246. END VisitCaseStatement;
  9247. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  9248. VAR start: Label; true,false: Label;
  9249. BEGIN
  9250. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9251. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9252. start := NewLabel();
  9253. true := NewLabel();
  9254. false := NewLabel();
  9255. SetLabel(start);
  9256. Condition(x.condition,true,false);
  9257. SetLabel(true);
  9258. StatementSequence(x.statements);
  9259. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9260. BrL(start);
  9261. SetLabel(false);
  9262. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9263. END VisitWhileStatement;
  9264. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  9265. VAR false,true: Label;
  9266. BEGIN
  9267. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9268. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9269. true := NewLabel();
  9270. false := NewLabel();
  9271. SetLabel(false);
  9272. StatementSequence(x.statements);
  9273. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9274. Condition(x.condition,true,false);
  9275. SetLabel(true);
  9276. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9277. END VisitRepeatStatement;
  9278. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  9279. VAR
  9280. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9281. temporaryVariable: SyntaxTree.Variable;
  9282. temporaryVariableDesignator : SyntaxTree.Designator;
  9283. BEGIN
  9284. IF Trace THEN TraceEnter("VisitForStatement") END;
  9285. true := NewLabel();
  9286. false := NewLabel();
  9287. start := NewLabel();
  9288. Assign(x.variable,x.from);
  9289. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE);
  9290. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, temporaryVariable);
  9291. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9292. Assign(temporaryVariableDesignator,x.to);
  9293. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9294. IF by > 0 THEN
  9295. cmp := Scanner.LessEqual
  9296. ELSE
  9297. cmp := Scanner.GreaterEqual
  9298. END;
  9299. binary := SyntaxTree.NewBinaryExpression(0,x.variable,temporaryVariableDesignator,cmp);
  9300. binary.SetType(system.booleanType);
  9301. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9302. SetLabel(start);
  9303. Condition(binary,true,false);
  9304. SetLabel(true);
  9305. StatementSequence(x.statements);
  9306. binary := SyntaxTree.NewBinaryExpression(0,x.variable,x.by,Scanner.Plus);
  9307. binary.SetType(x.variable.type);
  9308. Assign(x.variable,binary);
  9309. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9310. BrL(start);
  9311. SetLabel(false);
  9312. IF Trace THEN TraceExit("VisitForStatement") END;
  9313. END VisitForStatement;
  9314. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  9315. VAR prevLoop: Label;
  9316. BEGIN
  9317. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9318. prevLoop := currentLoop;
  9319. currentLoop := NewLabel();
  9320. StatementSequence(x.statements);
  9321. SetLabel(currentLoop);
  9322. currentLoop := prevLoop;
  9323. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9324. END VisitExitableBlock;
  9325. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  9326. VAR prevLoop,start: Label;
  9327. BEGIN
  9328. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9329. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9330. start := NewLabel();
  9331. prevLoop := currentLoop;
  9332. SetLabel(start);
  9333. currentLoop := NewLabel();
  9334. StatementSequence(x.statements);
  9335. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9336. BrL(start);
  9337. SetLabel(currentLoop);
  9338. currentLoop := prevLoop;
  9339. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9340. END VisitLoopStatement;
  9341. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  9342. VAR outer: SyntaxTree.Statement;
  9343. BEGIN
  9344. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9345. IF locked THEN (* r if we jump out of an exclusive block *)
  9346. outer := x.outer;
  9347. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9348. outer := outer.outer;
  9349. END;
  9350. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9351. Lock(FALSE);
  9352. END;
  9353. END;
  9354. BrL(currentLoop);
  9355. IF Trace THEN TraceExit("VisitExitStatement") END;
  9356. END VisitExitStatement;
  9357. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  9358. VAR
  9359. expression, parameterDesignator: SyntaxTree.Expression;
  9360. type, componentType: SyntaxTree.Type;
  9361. res, right: Operand;
  9362. left, mem, reg: IntermediateCode.Operand;
  9363. parameter: SyntaxTree.Parameter;
  9364. procedure: SyntaxTree.Procedure;
  9365. procedureType: SyntaxTree.ProcedureType;
  9366. returnTypeOffset: LONGINT;
  9367. delegate: BOOLEAN;
  9368. map: SymbolMap;
  9369. BEGIN
  9370. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9371. expression := x.returnValue;
  9372. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9373. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9374. IF currentIsInline THEN
  9375. IF expression # NIL THEN
  9376. map := currentMapper.Get(NIL);
  9377. IF map # NIL THEN
  9378. Assign(map.to, expression);
  9379. END;
  9380. END;
  9381. BrL(currentInlineExit);
  9382. RETURN;
  9383. END;
  9384. IF expression # NIL THEN
  9385. type := expression.type.resolved;
  9386. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9387. IF locked THEN Lock(FALSE) END;
  9388. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9389. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9390. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9391. (* return without structured return parameter *)
  9392. Evaluate(expression,res);
  9393. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9394. IF locked OR profile THEN
  9395. Emit(Push(position,res.op));
  9396. IF delegate THEN HALT(200) END;
  9397. ReleaseOperand(res);
  9398. IF locked THEN Lock(FALSE) END;
  9399. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9400. reg := NewRegisterOperand(res.op.type);
  9401. Emit(Pop(position,reg));
  9402. Emit(Return(position,reg));
  9403. ReleaseIntermediateOperand(reg);
  9404. ELSE
  9405. Emit(Return(position,res.op));
  9406. ReleaseOperand(res);
  9407. END;
  9408. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9409. THEN
  9410. (* return using structured return parameter *)
  9411. 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)
  9412. OR SemanticChecker.IsPointerType(type));
  9413. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9414. parameter :=procedureType.returnParameter;
  9415. ASSERT(parameter # NIL);
  9416. returnTypeOffset := parameter.offsetInBits;
  9417. (*
  9418. IF parameter# NIL THEN
  9419. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9420. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9421. ELSE
  9422. returnTypeOffset := system.offsetFirstParameter
  9423. END;
  9424. *)
  9425. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9426. IF type IS SyntaxTree.RangeType THEN
  9427. (* array range type *)
  9428. Evaluate(expression, right);
  9429. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 0);
  9430. Emit(Mov(position,mem, right.op)); (* first *)
  9431. ReleaseIntermediateOperand(mem);
  9432. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9433. Emit(Mov(position,mem, right.tag)); (* last *)
  9434. ReleaseIntermediateOperand(mem);
  9435. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9436. Emit(Mov(position,mem, right.extra)); (* step *)
  9437. ReleaseIntermediateOperand(mem);
  9438. ReleaseOperand(right);
  9439. ELSIF type IS SyntaxTree.ComplexType THEN
  9440. Evaluate(expression, right);
  9441. componentType := type(SyntaxTree.ComplexType).componentType;
  9442. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9443. Emit(Mov(position,mem, right.op)); (* real part *)
  9444. ReleaseIntermediateOperand(mem);
  9445. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9446. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9447. ReleaseIntermediateOperand(mem);
  9448. ReleaseOperand(right);
  9449. ELSE (* covers cases: pointer / record / array *)
  9450. parameter := procedureType.returnParameter;
  9451. checker.SetCurrentScope(currentScope);
  9452. ASSERT(parameter # NIL);
  9453. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9454. Assign(parameterDesignator,expression);
  9455. END;
  9456. ReleaseIntermediateOperand(left);
  9457. IF locked THEN Lock(FALSE) END;
  9458. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9459. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9460. parameter := procedureType.returnParameter;
  9461. checker.SetCurrentScope(currentScope);
  9462. IF parameter = NIL THEN
  9463. Error(procedure.position, "structured return of parameter of procedure not found");
  9464. ELSE
  9465. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9466. Assign(parameterDesignator,expression);
  9467. END;
  9468. IF locked THEN Lock(FALSE) END;
  9469. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9470. ELSE
  9471. HALT(200);
  9472. END;
  9473. ELSE
  9474. IF locked THEN Lock(FALSE) END;
  9475. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9476. END;
  9477. IF backend.cooperative THEN
  9478. BrL(exitLabel);
  9479. ELSE
  9480. EmitLeave(section, position,procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9481. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention));
  9482. END;
  9483. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9484. END VisitReturnStatement;
  9485. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9486. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9487. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9488. statements: SyntaxTree.StatementSequence;
  9489. name, suffix: SyntaxTree.IdentifierString;
  9490. BEGIN
  9491. Strings.IntToStr(awaitProcCounter,suffix);
  9492. Strings.Concat("@AwaitProcedure",suffix,name);
  9493. identifier := SyntaxTree.NewIdentifier(name);
  9494. INC(awaitProcCounter);
  9495. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9496. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9497. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9498. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9499. procedure.SetAccess(SyntaxTree.Hidden);
  9500. procedure.SetScope(currentScope);
  9501. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9502. procedureType.SetReturnType(system.booleanType);
  9503. procedure.SetType(procedureType);
  9504. body := SyntaxTree.NewBody(x.position,procedureScope);
  9505. procedureScope.SetBody(body);
  9506. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9507. returnStatement.SetReturnValue(x.condition);
  9508. statements := SyntaxTree.NewStatementSequence();
  9509. statements.AddStatement(returnStatement);
  9510. body.SetStatementSequence(statements);
  9511. currentScope.AddProcedure(procedure);
  9512. RETURN procedure
  9513. END MakeAwaitProcedure;
  9514. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9515. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9516. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9517. BEGIN
  9518. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9519. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9520. IF backend.cooperative THEN
  9521. start := NewLabel();
  9522. true := NewLabel();
  9523. false := NewLabel();
  9524. SetLabel(start);
  9525. Condition(x.condition,true,false);
  9526. SetLabel(false);
  9527. PushSelfPointer();
  9528. CallThis(position,"ExclusiveBlocks","Await",1);
  9529. BrL(start);
  9530. SetLabel(true);
  9531. PushSelfPointer();
  9532. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9533. ELSE
  9534. proc := MakeAwaitProcedure(x);
  9535. Emit(Push(position,fp));
  9536. GetCodeSectionNameForSymbol(proc,name);
  9537. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9538. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9539. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9540. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9541. Emit(Result(position,res));
  9542. (*
  9543. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9544. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9545. *)
  9546. InitOperand(result,ModeValue);
  9547. result.op := res;
  9548. label := NewLabel();
  9549. BreqL(label, result.op, SELF.true);
  9550. ReleaseOperand(result);
  9551. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9552. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9553. Emit(Push(position,res));
  9554. Emit(Push(position,fp));
  9555. PushSelfPointer();
  9556. Emit(Push(position,nil));
  9557. CallThis(position,"Objects","Await",4);
  9558. SetLabel(label);
  9559. END;
  9560. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9561. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9562. END VisitAwaitStatement;
  9563. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9564. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9565. BEGIN
  9566. FOR i := 0 TO x.Length() - 1 DO
  9567. statement := x.GetStatement( i );
  9568. Statement(statement);
  9569. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9570. END;
  9571. END StatementSequence;
  9572. PROCEDURE PushSelfPointer;
  9573. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9574. BEGIN
  9575. scope := currentScope;
  9576. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9577. scope := scope.outerScope;
  9578. END;
  9579. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9580. IF ~newObjectFile THEN
  9581. Symbol(moduleSelf,op);
  9582. IntermediateCode.MakeMemory(op.op,addressType);
  9583. ELSE
  9584. moduleSection := meta.ModuleSection();
  9585. IF backend.cooperative THEN
  9586. moduleOffset := 0;
  9587. ELSE
  9588. moduleOffset := moduleSection.pc;
  9589. END;
  9590. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9591. END;
  9592. ELSE
  9593. GetBaseRegister(op.op,currentScope,scope);
  9594. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  9595. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  9596. IF backend.cooperative THEN
  9597. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9598. END;
  9599. IntermediateCode.MakeMemory(op.op,addressType);
  9600. END;
  9601. Emit(Push(position,op.op));
  9602. ReleaseOperand(op);
  9603. END PushSelfPointer;
  9604. PROCEDURE Lock(lock: BOOLEAN);
  9605. BEGIN
  9606. IF Trace THEN TraceEnter("Lock") END;
  9607. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9608. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9609. ASSERT(modifyAssignmentCounter = 0);
  9610. IF dump # NIL THEN
  9611. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9612. dump.Ln;dump.Update;
  9613. END;
  9614. PushSelfPointer;
  9615. IF backend.cooperative THEN
  9616. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9617. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9618. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9619. END;
  9620. ELSE
  9621. Emit(Push(position,true));
  9622. IF lock THEN CallThis(position,"Objects","Lock",2)
  9623. ELSE CallThis(position,"Objects","Unlock",2);
  9624. END;
  9625. END;
  9626. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9627. IF Trace THEN TraceExit("Lock") END;
  9628. END Lock;
  9629. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9630. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9631. BEGIN
  9632. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9633. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9634. previouslyUnchecked := isUnchecked;
  9635. isUnchecked := isUnchecked OR x.isUnchecked;
  9636. previouslyCooperativeSwitches := cooperativeSwitches;
  9637. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9638. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9639. IF x.statements # NIL THEN
  9640. StatementSequence(x.statements);
  9641. END;
  9642. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9643. isUnchecked := previouslyUnchecked;
  9644. cooperativeSwitches := previouslyCooperativeSwitches;
  9645. IF Trace THEN TraceExit("VisitStatementBlock") END;
  9646. END VisitStatementBlock;
  9647. PROCEDURE VisitCode(x: SyntaxTree.Code);
  9648. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  9649. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  9650. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  9651. procedure: SyntaxTree.Procedure;
  9652. map: SymbolMap;
  9653. BEGIN
  9654. scope := currentScope;
  9655. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  9656. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9657. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9658. return := emptyOperand;
  9659. IF Trace THEN TraceEnter("VisitCode") END;
  9660. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  9661. NEW(in, x.inRules.Length());
  9662. FOR i := 0 TO LEN(in)-1 DO
  9663. statement := x.inRules.GetStatement(i);
  9664. WITH statement: SyntaxTree.Assignment DO
  9665. Evaluate(statement.right, operand);
  9666. result := operand.op;
  9667. NEW(str, 64);
  9668. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  9669. in[i] := result; IntermediateCode.SetString(in[i], str);
  9670. ReleaseIntermediateOperand(operand.tag);
  9671. END;
  9672. END;
  9673. ELSE in := NIL
  9674. END;
  9675. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  9676. NEW(out, x.outRules.Length());
  9677. FOR i := 0 TO LEN(out)-1 DO
  9678. statement := x.outRules.GetStatement(i);
  9679. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  9680. WITH statement: SyntaxTree.Assignment DO
  9681. Evaluate(statement.left, operand); (*?? or designate *)
  9682. result := operand.op;
  9683. NEW(str, 64);
  9684. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  9685. out[i] := result; IntermediateCode.SetString(out[i], str);
  9686. ReleaseIntermediateOperand(operand.tag);
  9687. |statement: SyntaxTree.ReturnStatement DO
  9688. NEW(str, 64);
  9689. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  9690. IF currentIsInline THEN
  9691. map := currentMapper.Get(NIL);
  9692. Evaluate(map.to, operand);
  9693. out[i] := operand.op;
  9694. ELSE
  9695. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9696. END;
  9697. IntermediateCode.SetString(out[i], str);
  9698. ReleaseIntermediateOperand(operand.tag);
  9699. return := out[i];
  9700. ELSE
  9701. END;
  9702. END;
  9703. ELSE out := NIL
  9704. END;
  9705. Emit(Asm(x.position,x.sourceCode, in, out));
  9706. IF in # NIL THEN
  9707. FOR i := 0 TO LEN(in)-1 DO
  9708. ReleaseIntermediateOperand(in[i]);
  9709. END;
  9710. END;
  9711. IF out # NIL THEN
  9712. FOR i := 0 TO LEN(out)-1 DO
  9713. WITH statement: SyntaxTree.Assignment DO
  9714. ReleaseIntermediateOperand(out[i]);
  9715. ELSE
  9716. IF currentIsInline THEN
  9717. ReleaseIntermediateOperand(out[i]);
  9718. END;
  9719. END;
  9720. statement := x.outRules.GetStatement(i);
  9721. END;
  9722. END;
  9723. IF return.mode # IntermediateCode.Undefined THEN
  9724. IF currentIsInline THEN
  9725. ELSIF ReturnedAsParameter(procedureType.returnType) THEN
  9726. Symbol(procedureType.returnParameter, par);
  9727. MakeMemory(mem, par.op, return.type, 0);
  9728. ReleaseOperand(par);
  9729. Emit(Mov(position, mem, return));
  9730. ReleaseIntermediateOperand(mem);
  9731. ELSE
  9732. Emit(Return(position,return));
  9733. END;
  9734. IF currentIsInline THEN RETURN END;
  9735. EmitLeave(section, position,procedureType(SyntaxTree.ProcedureType).callingConvention);
  9736. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,procedureType(SyntaxTree.ProcedureType).callingConvention));
  9737. ReleaseIntermediateOperand(return);
  9738. END;
  9739. IF Trace THEN TraceExit("VisitCode") END;
  9740. END VisitCode;
  9741. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  9742. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  9743. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  9744. const, call: IntermediateCode.Operand;
  9745. parameterDesignator: SyntaxTree.Expression;
  9746. saved: RegisterEntry;
  9747. name: Basic.SegmentedName;
  9748. BEGIN
  9749. IF Trace THEN TraceEnter("ParameterCopies") END;
  9750. parameter := x.firstParameter;
  9751. WHILE parameter # NIL DO
  9752. IF parameter.kind = SyntaxTree.ValueParameter THEN
  9753. type := parameter.type.resolved;
  9754. IF IsOpenArray(type) THEN
  9755. VisitParameter(parameter);
  9756. op := result;
  9757. IF backend.cooperative & parameter.NeedsTrace() THEN
  9758. length := GetArrayLength(type, op.tag);
  9759. size := NewRegisterOperand(addressType);
  9760. base := ArrayBaseType(type);
  9761. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  9762. Emit(Mul(position, size, length, const));
  9763. dst := NewRegisterOperand (addressType);
  9764. Emit(Mov(position, dst, size));
  9765. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9766. Emit(Sub(position,dst,sp,dst));
  9767. Emit(And(position,dst,dst,const));
  9768. Emit(Mov(position,sp,dst));
  9769. par := fp;
  9770. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9771. IntermediateCode.InitImmediate(null, byteType, 0);
  9772. Emit(Fill(position, dst, size, null));
  9773. ReleaseIntermediateOperand(dst);
  9774. ReleaseIntermediateOperand(length);
  9775. SaveRegisters();ReleaseUsedRegisters(saved);
  9776. (* register dst has been freed before SaveRegisters already *)
  9777. base := ArrayBaseType(type);
  9778. (* assign method of open array *)
  9779. IF base.IsRecordType() THEN
  9780. Emit (Push(position, length));
  9781. Emit (Push(position, dst));
  9782. Emit (Push(position, op.op));
  9783. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  9784. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  9785. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  9786. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  9787. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  9788. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  9789. Emit (Push(position,length));
  9790. Emit (Push(position, dst));
  9791. Emit (Push(position, length));
  9792. Emit (Push(position, op.op));
  9793. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  9794. ELSE
  9795. Emit (Push(position, length));
  9796. Emit (Push(position, dst));
  9797. Emit (Push(position, length));
  9798. Emit (Push(position, op.op));
  9799. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  9800. ASSERT(ArrayBaseType(type).IsPointer());
  9801. END;
  9802. RestoreRegisters(saved);
  9803. ELSE
  9804. temp := GetDynamicSize(type,op.tag);
  9805. ReuseCopy(size,temp);
  9806. ReleaseIntermediateOperand(temp);
  9807. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9808. Emit(Sub(position,size,sp,size));
  9809. Emit(And(position,size,size,const));
  9810. Emit(Mov(position,sp,size));
  9811. par := fp;
  9812. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9813. ReleaseIntermediateOperand(size);
  9814. size := GetDynamicSize(type,op.tag);
  9815. END;
  9816. Emit(Copy(position,sp,op.op,size));
  9817. ReleaseIntermediateOperand(size);
  9818. ReleaseOperand(op);
  9819. IntermediateCode.MakeMemory(par,addressType);
  9820. Emit(Mov(position,par,sp));
  9821. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  9822. checker.SetCurrentScope(currentScope);
  9823. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  9824. Assign(parameterDesignator,parameterDesignator);
  9825. END;
  9826. END;
  9827. parameter := parameter.nextParameter;
  9828. END;
  9829. IF Trace THEN TraceExit("ParameterCopies") END;
  9830. END ParameterCopies;
  9831. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  9832. VAR x: SyntaxTree.Variable;
  9833. BEGIN
  9834. x := scope.firstVariable;
  9835. WHILE x # NIL DO
  9836. InitVariable(x);
  9837. x := x.nextVariable;
  9838. END;
  9839. END InitVariables;
  9840. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  9841. BEGIN
  9842. IF (symbol # NIL) THEN
  9843. RETURN fingerPrinter.SymbolFP(symbol).shallow
  9844. ELSE
  9845. RETURN 0
  9846. END;
  9847. END GetFingerprint;
  9848. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  9849. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  9850. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  9851. saved: RegisterEntry;
  9852. BEGIN
  9853. IF Trace THEN TraceEnter("Body") END;
  9854. ReleaseUsedRegisters(saved); (* just in case ... *)
  9855. section := ir;
  9856. exitLabel := NewLabel ();
  9857. IF moduleBody THEN moduleBodySection := section END;
  9858. IF ir.comments # NIL THEN
  9859. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  9860. commentPrintout.SingleStatement(TRUE);
  9861. dump := ir.comments;
  9862. ELSE
  9863. commentPrintout := NIL;
  9864. dump := NIL;
  9865. END;
  9866. prevScope := currentScope;
  9867. currentScope := scope;
  9868. lastSwitchPC := 0;
  9869. cooperativeSwitches := backend.cooperative;
  9870. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9871. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9872. IF x # NIL THEN
  9873. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9874. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  9875. IF moduleBody THEN
  9876. ProfilerInit();
  9877. ELSE
  9878. Basic.SegmentedNameToString(ir.name, string);
  9879. ProfilerAddProcedure(numberProcedures,string);
  9880. ProfilerEnterExit(numberProcedures,TRUE);
  9881. END;
  9882. END;
  9883. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  9884. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  9885. END;
  9886. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  9887. IF moduleBody & ~newObjectFile THEN
  9888. InitVariables(moduleScope)
  9889. END;
  9890. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  9891. cellScope := scope.outerScope(SyntaxTree.CellScope);
  9892. IF procedure = cellScope.bodyProcedure THEN
  9893. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  9894. StaticCallOperand(op, cellScope.constructor);
  9895. Emit(Call(position,op.op,0));
  9896. END;
  9897. END;
  9898. END;
  9899. ParameterCopies(procedureType);
  9900. InitVariables(scope);
  9901. IF x.code = NIL THEN
  9902. VisitStatementBlock(x);
  9903. ELSE
  9904. VisitCode(x.code)
  9905. END;
  9906. IF x.finally # NIL THEN (*! mark finally block for object file *)
  9907. ir.SetFinally(ir.pc);
  9908. StatementSequence(x.finally)
  9909. END;
  9910. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  9911. IF ~backend.cooperative THEN
  9912. ProfilerEnterExit(numberProcedures,FALSE);
  9913. END;
  9914. INC(numberProcedures);
  9915. END;
  9916. END;
  9917. IF backend.cooperative THEN
  9918. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  9919. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  9920. ELSIF newObjectFile & moduleBody & ~suppressModuleRegistration & ~meta.simple THEN
  9921. (*! not required any more? check and delete!
  9922. PushSelfPointer();
  9923. CallThis(position,"Modules","SetInitialized",1);
  9924. *)
  9925. (*
  9926. SetLabel(end);
  9927. *)
  9928. END;
  9929. IF x # NIL THEN
  9930. SELF.position := x.position;
  9931. END;
  9932. CheckRegistersFree();
  9933. ASSERT(modifyAssignmentCounter = 0);
  9934. currentScope := prevScope;
  9935. IF Trace THEN TraceExit("Body") END;
  9936. END Body;
  9937. END ImplementationVisitor;
  9938. MetaDataGenerator=OBJECT
  9939. VAR
  9940. implementationVisitor: ImplementationVisitor;
  9941. declarationVisitor: DeclarationVisitor;
  9942. module: Sections.Module;
  9943. moduleName: ARRAY 128 OF CHAR;
  9944. moduleNamePool: Basic.HashTableInt;
  9945. moduleNamePoolSection: IntermediateCode.Section;
  9946. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  9947. MethodTableOffset: LONGINT; (* method table offset from zero *)
  9948. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  9949. TypeTags: LONGINT; (* type extension level support *)
  9950. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  9951. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  9952. BEGIN
  9953. IF implementationVisitor.backend.cooperative THEN
  9954. TypeTags := MAX(LONGINT);
  9955. BaseTypesTableOffset := 0;
  9956. MethodTableOffset := 2;
  9957. TypeRecordBaseOffset := 0;
  9958. ELSIF simple THEN
  9959. TypeTags := 3; (* only 3 extensions allowed *)
  9960. BaseTypesTableOffset := 1;
  9961. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  9962. TypeRecordBaseOffset := 0;
  9963. ELSE
  9964. TypeTags := 16;
  9965. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  9966. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  9967. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  9968. END;
  9969. SELF.simple := simple;
  9970. SELF.implementationVisitor := implementationVisitor;
  9971. SELF.declarationVisitor := declarationVisitor;
  9972. implementationVisitor.meta := SELF;
  9973. declarationVisitor.meta := SELF;
  9974. END InitMetaDataGenerator;
  9975. PROCEDURE SetModule(module: Sections.Module);
  9976. VAR namePoolOffset: LONGINT;
  9977. BEGIN
  9978. SELF.module := module;
  9979. Global.GetModuleName(module.module,moduleName);
  9980. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple THEN
  9981. NEW(moduleNamePool, 32);
  9982. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  9983. END;
  9984. END SetModule;
  9985. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  9986. BEGIN
  9987. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  9988. END GetTypeRecordBaseOffset;
  9989. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9990. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  9991. BEGIN
  9992. INC(dataAdrOffset,6);
  9993. Info(section,"headerAdr");
  9994. Address(section,0);
  9995. Info(section,"typeDesc");
  9996. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  9997. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  9998. NamedSymbol(section, name, symbol, 0, offset);
  9999. Info(section,"mark: LONGINT;");
  10000. Longint(section,-1);
  10001. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0);END;
  10002. Info(section,"dataAdr-: ADDRESS");
  10003. Symbol(section,section, dataAdrOffset,0);
  10004. Info(section,"size-: SIZE");
  10005. Address(section,0);
  10006. Info(section,"nextRealtime: HeapBlock;");
  10007. Address(section,0);
  10008. END HeapBlock;
  10009. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10010. VAR i: LONGINT;
  10011. BEGIN
  10012. INC(dataAdrOffset,14);
  10013. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10014. Info(section,"count*: LONGINT");
  10015. Longint(section,0);
  10016. Info(section,"locked*: BOOLEAN");
  10017. Longint(section,0);
  10018. Info(section,"awaitingLock*: ProcessQueue");
  10019. Address(section,0);
  10020. Address(section,0);
  10021. Info(section,"awaitingCond*: ProcessQueue");
  10022. Address(section,0);
  10023. Address(section,0);
  10024. Info(section,"lockedBy*: ANY");
  10025. Address(section,0);
  10026. Info(section,"lock*: ANY");
  10027. Address(section,0);
  10028. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10029. Longint(section,1);
  10030. FOR i := 2 TO 6 DO
  10031. Longint(section,0);
  10032. END;
  10033. END ProtectedHeapBlock;
  10034. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10035. BEGIN
  10036. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10037. END Info;
  10038. PROCEDURE Address(section: IntermediateCode.Section; value: LONGINT);
  10039. VAR op: IntermediateCode.Operand;
  10040. BEGIN
  10041. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10042. section.Emit(Data(-11,op));
  10043. END Address;
  10044. PROCEDURE Size(section: IntermediateCode.Section; value: LONGINT);
  10045. VAR op: IntermediateCode.Operand;
  10046. BEGIN
  10047. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10048. section.Emit(Data(-12,op));
  10049. END Size;
  10050. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  10051. VAR op: IntermediateCode.Operand;
  10052. BEGIN
  10053. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  10054. section.Emit(Data(-1,op));
  10055. END Set;
  10056. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10057. VAR op: IntermediateCode.Operand;
  10058. BEGIN
  10059. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10060. section.Emit(Data(-1,op));
  10061. END Longint;
  10062. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10063. VAR op,noOperand: IntermediateCode.Operand;
  10064. BEGIN
  10065. IntermediateCode.InitOperand(noOperand);
  10066. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10067. section.PatchOperands(pc,op,noOperand,noOperand);
  10068. END PatchAddress;
  10069. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10070. VAR op,noOperand: IntermediateCode.Operand;
  10071. BEGIN
  10072. IntermediateCode.InitOperand(noOperand);
  10073. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10074. section.PatchOperands(pc,op,noOperand,noOperand);
  10075. END PatchSize;
  10076. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10077. VAR op,noOperand: IntermediateCode.Operand;
  10078. BEGIN
  10079. IntermediateCode.InitOperand(noOperand);
  10080. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10081. section.PatchOperands(pc,op,noOperand,noOperand);
  10082. END PatchLongint;
  10083. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10084. VAR op, noOperand: IntermediateCode.Operand;
  10085. BEGIN
  10086. IntermediateCode.InitOperand(noOperand);
  10087. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10088. section.PatchOperands(pc,op,noOperand,noOperand);
  10089. END PatchSymbol;
  10090. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10091. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10092. BEGIN
  10093. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10094. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10095. section.Emit(Data(-1,op));
  10096. END Boolean;
  10097. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10098. VAR op: IntermediateCode.Operand;
  10099. BEGIN
  10100. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10101. section.Emit(Data(-1,op));
  10102. END Char;
  10103. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10104. VAR i: LONGINT;
  10105. BEGIN
  10106. Info(section,str);
  10107. i := 0;
  10108. WHILE(str[i] # 0X) DO
  10109. Char(section,str[i]);
  10110. INC(i);
  10111. END;
  10112. Char(section,0X);
  10113. END String;
  10114. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10115. VAR op: IntermediateCode.Operand;
  10116. BEGIN
  10117. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10118. IntermediateCode.SetOffset(op,realOffset);
  10119. section.Emit(Data(-1,op));
  10120. END NamedSymbol;
  10121. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10122. BEGIN
  10123. IF symbol= NIL THEN
  10124. Address( section, realOffset);
  10125. ASSERT(virtualOffset = 0);
  10126. ELSE
  10127. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10128. END;
  10129. END Symbol;
  10130. (* OutPointers delivers
  10131. {pointerOffset}
  10132. *)
  10133. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10134. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type;
  10135. BEGIN
  10136. type := type.resolved;
  10137. IF type IS SyntaxTree.AnyType THEN
  10138. Symbol(section, symbol, 0, (offset ));
  10139. INC(numberPointers);
  10140. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10141. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10142. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10143. ELSIF type IS SyntaxTree.PointerType THEN
  10144. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10145. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10146. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10147. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10148. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10149. ELSIF (type IS SyntaxTree.RecordType) THEN
  10150. (* never treat a record like a pointer, even if the pointer field is set! *)
  10151. WITH type: SyntaxTree.RecordType DO
  10152. base := type.GetBaseRecord();
  10153. IF base # NIL THEN
  10154. Pointers(offset,symbol,section, base,numberPointers);
  10155. END;
  10156. variable := type.recordScope.firstVariable;
  10157. WHILE(variable # NIL) DO
  10158. IF ~(variable.untraced) THEN
  10159. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10160. END;
  10161. variable := variable.nextVariable;
  10162. END;
  10163. END;
  10164. ELSIF (type IS SyntaxTree.CellType) THEN
  10165. WITH type: SyntaxTree.CellType DO
  10166. base := type.GetBaseRecord();
  10167. IF base # NIL THEN
  10168. Pointers(offset,symbol,section, base,numberPointers);
  10169. END;
  10170. variable := type.cellScope.firstVariable;
  10171. WHILE(variable # NIL) DO
  10172. IF ~(variable.untraced) THEN
  10173. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10174. END;
  10175. variable := variable.nextVariable;
  10176. END;
  10177. END;
  10178. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10179. WITH type: SyntaxTree.ArrayType DO
  10180. IF type.form= SyntaxTree.Static THEN
  10181. n := type.staticLength;
  10182. base := type.arrayBase.resolved;
  10183. WHILE(base IS SyntaxTree.ArrayType) DO
  10184. type := base(SyntaxTree.ArrayType);
  10185. n := n* type.staticLength;
  10186. base := type.arrayBase.resolved;
  10187. END;
  10188. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10189. IF SemanticChecker.ContainsPointer(base) THEN
  10190. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10191. FOR i := 0 TO n-1 DO
  10192. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10193. END;
  10194. END;
  10195. ELSE
  10196. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10197. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10198. END;
  10199. END;
  10200. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10201. WITH type: SyntaxTree.MathArrayType DO
  10202. IF type.form = SyntaxTree.Static THEN
  10203. n := type.staticLength;
  10204. base := type.arrayBase.resolved;
  10205. WHILE(base IS SyntaxTree.MathArrayType) DO
  10206. type := base(SyntaxTree.MathArrayType);
  10207. n := n* type.staticLength;
  10208. base := type.arrayBase.resolved;
  10209. END;
  10210. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10211. IF SemanticChecker.ContainsPointer(base) THEN
  10212. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10213. FOR i := 0 TO n-1 DO
  10214. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10215. END;
  10216. END;
  10217. ELSE
  10218. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10219. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10220. END
  10221. END;
  10222. (* ELSE no pointers in type *)
  10223. END;
  10224. END Pointers;
  10225. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10226. VAR position,i: LONGINT; ch: CHAR;
  10227. BEGIN
  10228. IF pool.Has(index) THEN
  10229. RETURN pool.GetInt(index)
  10230. ELSE
  10231. position := source.pc;
  10232. pool.PutInt(index, position);
  10233. Info(source, name);
  10234. i := 0;
  10235. REPEAT
  10236. ch := name[i]; INC(i);
  10237. Char( source, ch);
  10238. UNTIL ch = 0X;
  10239. END;
  10240. RETURN position;
  10241. END EnterDynamicName;
  10242. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10243. VAR name: Basic.SectionName; position: LONGINT;
  10244. BEGIN
  10245. IF pool.Has(index) THEN
  10246. RETURN pool.GetInt(index)
  10247. ELSE
  10248. StringPool.GetString(index, name);
  10249. position := EnterDynamicName(source,name,index, pool);
  10250. END;
  10251. RETURN position;
  10252. END DynamicName;
  10253. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10254. VAR name: ARRAY 128 OF CHAR; section: IntermediateCode.Section; pooledName: Basic.SegmentedName;
  10255. BEGIN
  10256. COPY(moduleName,name);
  10257. Strings.Append(name,suffix);
  10258. Basic.ToSegmentedName(name, pooledName);
  10259. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName, NIL,TRUE);
  10260. IF implementationVisitor.backend.cooperative THEN
  10261. Info(section, "TypeDescriptor");
  10262. Basic.ToSegmentedName("BaseTypes.Array", pooledName);
  10263. NamedSymbol(section, pooledName,NIL, 0, 0);
  10264. BasePointer(section);
  10265. offset := 0;
  10266. ELSE
  10267. HeapBlock(mName,typeName,section,2);
  10268. Info(section, "HeapBlock");
  10269. (*
  10270. Symbol(section,section,2,0);
  10271. *)
  10272. Address(section,0); (* empty such that GC does not go on traversing *)
  10273. Info(section, "TypeDescriptor");
  10274. Address(section,0);
  10275. offset := section.pc;
  10276. END;
  10277. RETURN section
  10278. END Block;
  10279. PROCEDURE Array(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR);
  10280. VAR name: Basic.SegmentedName;
  10281. BEGIN
  10282. Info(source,"ArrayHeader");
  10283. IF implementationVisitor.backend.cooperative THEN
  10284. sizePC := source.pc;
  10285. Address(source,0);
  10286. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10287. IF baseType # "" THEN
  10288. Basic.ToSegmentedName(baseType, name);
  10289. NamedSymbol(source, name,NIL, 0, 0);
  10290. ELSE
  10291. Address(source,0);
  10292. END;
  10293. Address(source,0);
  10294. ELSE
  10295. Address(source,0);
  10296. Address(source,0);
  10297. Address(source,0);
  10298. sizePC := source.pc;
  10299. Address(source,0);
  10300. Info(source,"array data");
  10301. END;
  10302. END Array;
  10303. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10304. BEGIN
  10305. IF implementationVisitor.backend.cooperative THEN
  10306. PatchSize(section, pc, size);
  10307. PatchSize(section, pc + 3, size);
  10308. ELSE
  10309. PatchSize(section, pc, size);
  10310. END;
  10311. END PatchArray;
  10312. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10313. VAR
  10314. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10315. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10316. poolMap: Basic.HashTableInt;
  10317. namePool: IntermediateCode.Section;
  10318. namePoolOffset: LONGINT;
  10319. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10320. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10321. BEGIN
  10322. Basic.SegmentedNameToString(s1.name,n1);
  10323. Basic.SegmentedNameToString(s2.name,n2);
  10324. index := 0;
  10325. ch1 := n1[index];
  10326. ch2 := n2[index];
  10327. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10328. INC(index);
  10329. ch1 := n1[index];
  10330. ch2 := n2[index];
  10331. END;
  10332. RETURN ch1 < ch2;
  10333. END Compare;
  10334. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10335. VAR
  10336. i, j: LONGINT;
  10337. x, t: Sections.Section;
  10338. BEGIN
  10339. IF lo < hi THEN
  10340. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10341. WHILE i <= j DO
  10342. WHILE Compare(list[i], x) DO INC(i) END;
  10343. WHILE Compare(x, list[j]) DO DEC(j) END;
  10344. IF i <= j THEN
  10345. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10346. INC(i); DEC(j)
  10347. END
  10348. END;
  10349. IF lo < j THEN QuickSort(list, lo, j) END;
  10350. IF i < hi THEN QuickSort(list, i, hi) END
  10351. END;
  10352. END QuickSort;
  10353. (*
  10354. ExportDesc* = RECORD
  10355. fp*: ADDRESS;
  10356. name* {UNTRACED}: DynamicName;
  10357. adr*: ADDRESS;
  10358. exports*: LONGINT;
  10359. dsc* {UNTRACED}: ExportArray
  10360. END;
  10361. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10362. *)
  10363. PROCEDURE ExportDesc2(
  10364. source: IntermediateCode.Section;
  10365. namePool: IntermediateCode.Section;
  10366. fingerPrinter: FingerPrinter.FingerPrinter;
  10367. symbol: Sections.Section;
  10368. name: StringPool.Index;
  10369. VAR patchAdr: LONGINT
  10370. ): BOOLEAN;
  10371. VAR fingerPrint: SyntaxTree.FingerPrint;
  10372. BEGIN
  10373. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10374. & (symbol.type # Sections.InlineCodeSection)
  10375. THEN
  10376. *)
  10377. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10378. & (symbol.type # Sections.InlineCodeSection))
  10379. THEN
  10380. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10381. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10382. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10383. Longint(source,fingerPrint.shallow);
  10384. ELSE
  10385. Longint(source, 0);
  10386. END;
  10387. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  10388. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10389. Symbol(source, symbol,0,0);
  10390. patchAdr := source.pc;
  10391. Longint(source, 0);
  10392. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  10393. Address(source,0);
  10394. END;
  10395. RETURN TRUE
  10396. ELSE
  10397. RETURN FALSE
  10398. END;
  10399. END ExportDesc2;
  10400. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10401. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10402. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10403. sym: Sections.Section; ignore: LONGINT; symbol: Sections.Section;
  10404. nextPatch: LONGINT;
  10405. TYPE
  10406. Scope = RECORD
  10407. elements: LONGINT;
  10408. gelements: LONGINT;
  10409. section: IntermediateCode.Section;
  10410. patchAdr: LONGINT;
  10411. arraySizePC: LONGINT;
  10412. beginPC: LONGINT; (* current scope start pc *)
  10413. END;
  10414. BEGIN
  10415. Basic.InitSegmentedName(prev);
  10416. olevel := -1;
  10417. scopes[0].section := source;
  10418. scopes[0].arraySizePC := MIN(LONGINT);
  10419. FOR s := 0 TO LEN(sections)-1 DO
  10420. symbol := sections[s];
  10421. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10422. this := sections[s].name;
  10423. level := 0;
  10424. WHILE (this[level] > 0) DO
  10425. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10426. INC(level);
  10427. END;
  10428. WHILE level < olevel DO
  10429. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10430. IF olevel > 0 THEN
  10431. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10432. nextPatch := scopes[olevel-1].patchAdr+1;
  10433. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10434. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10435. END;
  10436. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10437. DEC(olevel);
  10438. END;
  10439. IF (this[level] > 0) THEN
  10440. IF level > olevel THEN
  10441. (*TRACE("opening",level); *)
  10442. IF scopes[level].section = NIL THEN
  10443. arrayName := ".@ExportArray";
  10444. Strings.AppendInt(arrayName, level);
  10445. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,ignore);
  10446. Array(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc");
  10447. END;
  10448. scopes[level].beginPC := scopes[level].section.pc;
  10449. olevel := level;
  10450. scopes[olevel].elements := 0;
  10451. END;
  10452. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10453. sym := sections[s];
  10454. ELSE
  10455. sym := NIL;
  10456. END;
  10457. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10458. THEN
  10459. INC(scopes[olevel].elements);
  10460. END;
  10461. (*StringPool.GetString(this[level], name);*)
  10462. (*TRACE(level, name);*)
  10463. (* enter string in scope *)
  10464. INC(level);
  10465. END;
  10466. END;
  10467. Basic.SegmentedNameToString(this, name);
  10468. (*TRACE(level, "enter", name);*)
  10469. prev := this;
  10470. END;
  10471. END;
  10472. WHILE 0 <= olevel DO
  10473. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10474. IF olevel > 0 THEN
  10475. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10476. nextPatch := scopes[olevel-1].patchAdr+1;
  10477. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10478. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10479. END;
  10480. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10481. DEC(olevel);
  10482. END;
  10483. level := 0;
  10484. WHILE (level < LEN(scopes)) DO
  10485. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  10486. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10487. END;
  10488. INC(level);
  10489. END;
  10490. END Export;
  10491. BEGIN
  10492. NEW(fingerPrinter, module.system);
  10493. NEW(poolMap, 64);
  10494. (* 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 *)
  10495. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10496. NEW(sectionArray, module.allSections.Length());
  10497. FOR i := 0 TO module.allSections.Length() - 1 DO
  10498. section := module.allSections.GetSection(i);
  10499. sectionArray[i] := section;
  10500. END;
  10501. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10502. Export(sectionArray^);
  10503. END ExportDesc;
  10504. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10505. VAR
  10506. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10507. BEGIN
  10508. Info(source, "exception table offsets array descriptor");
  10509. size := 0;
  10510. Array(source,sizePC,"Modules.ExceptionTableEntry");
  10511. Info(source, "exception table content");
  10512. FOR i := 0 TO module.allSections.Length() - 1 DO
  10513. p := module.allSections.GetSection(i);
  10514. IF p.type = Sections.CodeSection THEN
  10515. finallyPC := p(IntermediateCode.Section).finally;
  10516. IF finallyPC>=0 THEN
  10517. Symbol( source, p, 0,0);
  10518. Symbol( source, p, finallyPC, 0);
  10519. Symbol( source, p, finallyPC,0);
  10520. INC(size);
  10521. END;
  10522. END
  10523. END;
  10524. PatchArray(source,sizePC,size);
  10525. END ExceptionArray;
  10526. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10527. VAR i: LONGINT; ch: CHAR;
  10528. BEGIN
  10529. i := 0;
  10530. REPEAT
  10531. ch := name[i]; INC(i);
  10532. Char( section, ch);
  10533. UNTIL ch = 0X;
  10534. WHILE i < 32 DO
  10535. Char( section, 0X); INC(i);
  10536. END;
  10537. END Name;
  10538. PROCEDURE References(section: IntermediateCode.Section);
  10539. CONST
  10540. rfDirect = 1X; rfIndirect = 3X;
  10541. rfStaticArray= 12X; rfDynamicArray=14X; rfOpenArray=15X;
  10542. rfByte = 1X; rfBoolean = 2X; rfChar8=3X; rfShortint=04X; rfInteger = 05X; rfLongint = 06X;
  10543. rfReal = 07X; rfLongreal = 08X; rfSet = 09X; rfDelegate = 0EX; rfString = 0FH; rfPointer = 0DX; rfHugeint = 10X;
  10544. rfChar16=11X; rfChar32=12X; rfAll=13X; rfSame=14X; rfRange=15X; rfRecord=16X; rfComplex = 17X; rfLongcomplex = 18X;
  10545. rfPort = 19X;
  10546. rfRecordPointer=1DX;
  10547. rfArrayFlag = 80X;
  10548. VAR
  10549. s: Sections.Section; sizePC, i, startPC, endPC: LONGINT;
  10550. PROCEDURE BaseType(type: SyntaxTree.Type): CHAR;
  10551. VAR char: CHAR;
  10552. BEGIN
  10553. IF type = NIL THEN char := rfLongint
  10554. ELSIF type IS SyntaxTree.ByteType THEN char := rfByte
  10555. ELSIF type IS SyntaxTree.BooleanType THEN char := rfBoolean
  10556. ELSIF type IS SyntaxTree.CharacterType THEN
  10557. IF type.sizeInBits = 8 THEN char := rfChar8
  10558. ELSIF type.sizeInBits = 16 THEN char := rfChar16
  10559. ELSIF type.sizeInBits = 32 THEN char := rfChar32
  10560. END;
  10561. ELSIF (type IS SyntaxTree.IntegerType) OR (type IS SyntaxTree.AddressType) OR (type IS SyntaxTree.SizeType) THEN
  10562. IF type.sizeInBits = 8 THEN char := rfShortint
  10563. ELSIF type.sizeInBits = 16 THEN char := rfInteger
  10564. ELSIF type.sizeInBits = 32 THEN char := rfLongint
  10565. ELSIF type.sizeInBits = 64 THEN char := rfHugeint
  10566. END;
  10567. ELSIF type IS SyntaxTree.SizeType THEN char := rfLongint
  10568. ELSIF type IS SyntaxTree.FloatType THEN
  10569. IF type.sizeInBits = 32 THEN char := rfReal
  10570. ELSIF type.sizeInBits = 64 THEN char := rfLongreal
  10571. END;
  10572. ELSIF type IS SyntaxTree.ComplexType THEN
  10573. IF type.sizeInBits = 64 THEN char := rfComplex
  10574. ELSIF type.sizeInBits = 128 THEN char := rfLongcomplex
  10575. END;
  10576. ELSIF type IS SyntaxTree.SetType THEN char := rfSet
  10577. ELSIF type IS SyntaxTree.AnyType THEN char := rfPointer
  10578. ELSIF type IS SyntaxTree.ObjectType THEN char := rfPointer
  10579. ELSIF type IS SyntaxTree.PointerType THEN char := rfPointer
  10580. ELSIF type IS SyntaxTree.ProcedureType THEN char := rfDelegate
  10581. ELSIF type IS SyntaxTree.RangeType THEN char := rfRange
  10582. ELSIF type IS SyntaxTree.PortType THEN char := rfPort
  10583. ELSE (*ASSERT(arrayOf);*) char := rfPointer; (*RETURN (* ARRAY OF unknown (record): do not write anything *)*)
  10584. END;
  10585. RETURN char
  10586. END BaseType;
  10587. PROCEDURE RecordType(type: SyntaxTree.RecordType);
  10588. VAR destination: Sections.Section;
  10589. BEGIN
  10590. destination := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10591. IF type.pointerType # NIL THEN
  10592. Char(section,rfRecordPointer)
  10593. ELSE
  10594. Char(section,rfRecord);
  10595. END;
  10596. IF destination = NIL THEN
  10597. Longint(section,0);
  10598. ELSE
  10599. Longint(section,destination.offset); (* used for ? *)
  10600. END;
  10601. END RecordType;
  10602. PROCEDURE StaticArrayLength(type: SyntaxTree.ArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10603. BEGIN
  10604. baseType := type.arrayBase.resolved;
  10605. IF type.form = SyntaxTree.Static THEN
  10606. IF baseType IS SyntaxTree.ArrayType THEN
  10607. RETURN type.staticLength * StaticArrayLength(baseType(SyntaxTree.ArrayType),baseType)
  10608. ELSE
  10609. RETURN type.staticLength
  10610. END
  10611. ELSE
  10612. RETURN 0
  10613. END;
  10614. END StaticArrayLength;
  10615. PROCEDURE ArrayType(type: SyntaxTree.ArrayType);
  10616. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10617. BEGIN
  10618. length := StaticArrayLength(type, baseType);
  10619. char := BaseType(baseType);
  10620. IF type.form # SyntaxTree.Open THEN
  10621. Char(section,CHR(ORD(char)+ORD(rfArrayFlag)));
  10622. Longint(section, length)
  10623. ELSE
  10624. length :=0;
  10625. (*length := 1+SemanticChecker.Dimension(type,{SyntaxTree.Open});*)
  10626. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10627. Longint(section, length)
  10628. END;
  10629. END ArrayType;
  10630. PROCEDURE StaticMathArrayLength(type: SyntaxTree.MathArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10631. BEGIN
  10632. baseType := type.arrayBase;
  10633. IF baseType # NIL THEN
  10634. baseType := baseType.resolved;
  10635. END;
  10636. IF type.form = SyntaxTree.Static THEN
  10637. IF (baseType # NIL) & (baseType IS SyntaxTree.MathArrayType) THEN
  10638. RETURN type.staticLength * StaticMathArrayLength(baseType(SyntaxTree.MathArrayType),baseType)
  10639. ELSE
  10640. RETURN type.staticLength
  10641. END
  10642. ELSE
  10643. RETURN 0
  10644. END;
  10645. END StaticMathArrayLength;
  10646. PROCEDURE MathArrayType(type: SyntaxTree.MathArrayType);
  10647. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10648. BEGIN
  10649. length := StaticMathArrayLength(type, baseType);
  10650. char := BaseType(baseType);
  10651. IF type.form = SyntaxTree.Open THEN
  10652. char := BaseType(module.system.addressType);
  10653. length := 5+2*SemanticChecker.Dimension(type,{SyntaxTree.Open});
  10654. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10655. Longint(section, length)
  10656. ELSIF type.form=SyntaxTree.Tensor THEN
  10657. char := BaseType(module.system.addressType);
  10658. Char(section, CHR(ORD(char)));
  10659. ELSE
  10660. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10661. Longint(section, length)
  10662. END;
  10663. END MathArrayType;
  10664. PROCEDURE Type(type: SyntaxTree.Type);
  10665. BEGIN
  10666. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10667. IF type IS SyntaxTree.BasicType THEN
  10668. Char(section, BaseType(type));
  10669. ELSIF type IS SyntaxTree.RecordType THEN
  10670. RecordType(type(SyntaxTree.RecordType));
  10671. ELSIF type IS SyntaxTree.ArrayType THEN
  10672. ArrayType(type(SyntaxTree.ArrayType))
  10673. ELSIF type IS SyntaxTree.EnumerationType THEN
  10674. Char(section, BaseType(module.system.longintType))
  10675. ELSIF type IS SyntaxTree.PointerType THEN
  10676. IF type(SyntaxTree.PointerType).pointerBase IS SyntaxTree.RecordType THEN
  10677. RecordType(type(SyntaxTree.PointerType).pointerBase(SyntaxTree.RecordType));
  10678. ELSE
  10679. Char(section, BaseType(type))
  10680. END;
  10681. ELSIF type IS SyntaxTree.ProcedureType THEN
  10682. Char(section, BaseType(type));
  10683. ELSIF type IS SyntaxTree.MathArrayType THEN
  10684. MathArrayType(type(SyntaxTree.MathArrayType));
  10685. ELSIF type IS SyntaxTree.CellType THEN
  10686. Char(section, BaseType(module.system.anyType));
  10687. ELSIF type IS SyntaxTree.PortType THEN
  10688. Char(section, rfPort);
  10689. ELSE HALT(200)
  10690. END;
  10691. END Type;
  10692. PROCEDURE WriteVariable(variable: SyntaxTree.Variable; indirect: BOOLEAN);
  10693. VAR name: ARRAY 256 OF CHAR;
  10694. BEGIN
  10695. IF variable.externalName # NIL THEN RETURN END;
  10696. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10697. variable.GetName(name);
  10698. Type(variable.type);
  10699. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10700. String(section,name);
  10701. END WriteVariable;
  10702. PROCEDURE WriteParameter(variable: SyntaxTree.Parameter; indirect: BOOLEAN);
  10703. VAR name: ARRAY 256 OF CHAR;
  10704. BEGIN
  10705. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10706. variable.GetName(name);
  10707. Type(variable.type);
  10708. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10709. variable.GetName(name);
  10710. String(section,name);
  10711. END WriteParameter;
  10712. PROCEDURE ReturnType(type: SyntaxTree.Type);
  10713. BEGIN
  10714. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10715. IF type IS SyntaxTree.ArrayType THEN
  10716. WITH type: SyntaxTree.ArrayType DO
  10717. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10718. ELSE Char(section,rfOpenArray)
  10719. END;
  10720. END
  10721. ELSIF type IS SyntaxTree.MathArrayType THEN
  10722. WITH type: SyntaxTree.MathArrayType DO
  10723. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10724. ELSE Char(section,rfOpenArray)
  10725. END;
  10726. END
  10727. ELSIF type IS SyntaxTree.RecordType THEN
  10728. Char(section,rfRecord);
  10729. ELSE
  10730. Char(section, BaseType(type));
  10731. END;
  10732. END ReturnType;
  10733. PROCEDURE Procedure(s: Sections.Section);
  10734. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10735. parameter: SyntaxTree.Parameter; variable: SyntaxTree.Variable;
  10736. segmentedName: Basic.SegmentedName;
  10737. name: ARRAY 256 OF CHAR;
  10738. BEGIN
  10739. procedure := s.symbol(SyntaxTree.Procedure); (*! check for variable or type symbol for object body *)
  10740. (*procedure.name,name);*)
  10741. implementationVisitor.GetCodeSectionNameForSymbolInScope(procedure,module.module.moduleScope, name);
  10742. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10743. Char(section,0F9X);
  10744. Symbol(section,s,0,0);
  10745. Symbol(section,s,s(IntermediateCode.Section).pc,0);
  10746. Longint(section,procedureType.numberParameters);
  10747. ReturnType(procedureType.returnType);
  10748. Longint(section,0); (*! level *)
  10749. Longint(section,0);
  10750. (*
  10751. IF procedure.scope IS SyntaxTree.RecordScope THEN (* add object name *)
  10752. record := procedure.scope(SyntaxTree.RecordScope).ownerRecord;
  10753. recordName := "";
  10754. IF record.pointerType # NIL THEN
  10755. DeclarationName(record.pointerType.typeDeclaration,recordName);
  10756. ELSE
  10757. DeclarationName(record.typeDeclaration,recordName);
  10758. END;
  10759. i := 0;
  10760. Info(section,recordName);
  10761. WHILE recordName[i] # 0X DO
  10762. Char(section,recordName[i]); INC(i);
  10763. INC(size);
  10764. END;
  10765. Char(section,".");
  10766. INC(size);
  10767. END;
  10768. *)
  10769. String(section,name);
  10770. parameter := procedureType.firstParameter;
  10771. WHILE(parameter # NIL) DO
  10772. WriteParameter(parameter,parameter.kind # SyntaxTree.ValueParameter); (*!treat exceptions !*)
  10773. parameter := parameter.nextParameter;
  10774. END;
  10775. variable := procedure.procedureScope.firstVariable;
  10776. WHILE(variable # NIL) DO
  10777. WriteVariable(variable,FALSE);
  10778. variable := variable.nextVariable;
  10779. END;
  10780. END Procedure;
  10781. PROCEDURE Scope(s: Sections.Section);
  10782. BEGIN
  10783. Char(section,0F8X);
  10784. Symbol(section,s,0,0); (* start *)
  10785. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  10786. String(section,"$$");
  10787. (* removed variables -- wrongly interpreted by Reflection
  10788. variable := module.module.moduleScope.firstVariable;
  10789. WHILE(variable # NIL) DO
  10790. WriteVariable(variable,FALSE);
  10791. variable := variable.nextVariable;
  10792. END;
  10793. *)
  10794. END Scope;
  10795. PROCEDURE ComputeSize(startPC, endPC: LONGINT): SIZE;
  10796. VAR result, i: LONGINT;
  10797. BEGIN
  10798. FOR i := startPC TO endPC -1 DO
  10799. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  10800. INC(result, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  10801. END;
  10802. RETURN result;
  10803. END ComputeSize;
  10804. BEGIN
  10805. Array(section,sizePC,"");
  10806. startPC := section.pc;
  10807. Char(section,0FFX); (* sign for trap writer *)
  10808. FOR i := 0 TO module.allSections.Length() - 1 DO
  10809. s := module.allSections.GetSection(i);
  10810. IF (s.type # Sections.InitCodeSection) & (s.symbol = module.module.moduleScope.bodyProcedure) THEN
  10811. Scope(s) (*! must be first procedure in ref section *)
  10812. END
  10813. END;
  10814. FOR i := 0 TO module.allSections.Length() - 1 DO
  10815. s := module.allSections.GetSection(i);
  10816. IF (s.symbol = module.module.moduleScope.bodyProcedure) THEN (* already done, see above *)
  10817. ELSIF (s.type # Sections.InitCodeSection) & (s.symbol # NIL) & (s.symbol IS SyntaxTree.Procedure) & ~s.symbol(SyntaxTree.Procedure).isInline THEN
  10818. Procedure(s)
  10819. END
  10820. END;
  10821. endPC := section.pc;
  10822. PatchArray(section,sizePC,ComputeSize(startPC, endPC));
  10823. END References;
  10824. (*
  10825. Command* = RECORD
  10826. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  10827. name*: Name; (* name of the procedure *)
  10828. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  10829. entryAdr* : ADDRESS; (* entry address of procedure *)
  10830. END;
  10831. *)
  10832. PROCEDURE CommandArray(source: IntermediateCode.Section);
  10833. VAR
  10834. p: Sections.Section; sizePC, numberCommands: LONGINT;
  10835. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10836. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  10837. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  10838. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  10839. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  10840. BEGIN
  10841. RETURN
  10842. (type = NIL) OR
  10843. (type.resolved IS SyntaxTree.RecordType) OR
  10844. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  10845. (type.resolved IS SyntaxTree.AnyType);
  10846. END TypeAllowed;
  10847. BEGIN
  10848. numberParameters := procedureType.numberParameters;
  10849. RETURN
  10850. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  10851. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  10852. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  10853. END GetProcedureAllowed;
  10854. PROCEDURE WriteType(type : SyntaxTree.Type);
  10855. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  10856. name: Basic.SegmentedName; offset: LONGINT;
  10857. BEGIN
  10858. IF type = NIL THEN
  10859. Address(source,0);
  10860. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  10861. Address(source,1);
  10862. ELSE
  10863. type := type.resolved;
  10864. IF type IS SyntaxTree.PointerType THEN
  10865. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  10866. END;
  10867. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  10868. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  10869. name[0] := typeDeclaration.name; name[1] := -1;
  10870. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10871. ASSERT(section # NIL);
  10872. ELSE
  10873. Global.GetSymbolSegmentedName(typeDeclaration,name);
  10874. (* TODO *)
  10875. section := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  10876. END;
  10877. IF implementationVisitor.backend.cooperative THEN
  10878. offset := 0;
  10879. ELSE
  10880. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  10881. END;
  10882. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  10883. END;
  10884. END WriteType;
  10885. BEGIN
  10886. Info(source, "command array descriptor");
  10887. Array(source,sizePC,"Modules.Command");
  10888. numberCommands := 0;
  10889. Info(source, "command array content");
  10890. FOR i := 0 TO module.allSections.Length() - 1 DO
  10891. p := module.allSections.GetSection(i);
  10892. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  10893. procedure := p.symbol(SyntaxTree.Procedure);
  10894. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10895. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  10896. procedure.GetName(name);
  10897. Name(source,name);
  10898. numberParameters := procedureType.numberParameters;
  10899. (* offset of type of first parameter *)
  10900. IF (numberParameters = 0 ) THEN WriteType(NIL)
  10901. ELSE WriteType(procedureType.firstParameter.type)
  10902. END;
  10903. (* offset of type of return parameter *)
  10904. WriteType(procedureType.returnType);
  10905. (* command name *)
  10906. (* command code offset *)
  10907. Symbol(source,p,0,0);
  10908. INC(numberCommands);
  10909. IF Trace THEN
  10910. D.Ln;
  10911. END;
  10912. END;
  10913. END
  10914. END;
  10915. PatchArray(source,sizePC,numberCommands);
  10916. END CommandArray;
  10917. (* to prevent from double import of different module aliases *)
  10918. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  10919. VAR i: SyntaxTree.Import;
  10920. BEGIN
  10921. i := module.module.moduleScope.firstImport;
  10922. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  10923. i := i.nextImport;
  10924. END;
  10925. RETURN i = import
  10926. END IsFirstDirectOccurence;
  10927. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  10928. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  10929. BEGIN
  10930. Array(source,pc,"");
  10931. Info(source, "import module array data");
  10932. IF implementationVisitor.backend.cooperative THEN
  10933. offset := 0;
  10934. ELSE
  10935. IF module.system.addressType.sizeInBits = 64 THEN
  10936. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  10937. ELSE
  10938. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  10939. END;
  10940. END;
  10941. import := module.module.moduleScope.firstImport;
  10942. numberImports := 0;
  10943. WHILE import # NIL DO
  10944. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  10945. Global.GetModuleSegmentedName(import.module,name);
  10946. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  10947. NamedSymbol(source, name, NIL, 0, offset);
  10948. INC(numberImports);
  10949. END;
  10950. import := import.nextImport
  10951. END;
  10952. PatchArray(source,pc,numberImports);
  10953. END ImportsArray;
  10954. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  10955. VAR
  10956. p: Sections.Section; sizePC, size, i: LONGINT;
  10957. BEGIN
  10958. Info(source, "Type info section");
  10959. size := 0;
  10960. Array(source,sizePC,"Modules.TypeDesc");
  10961. FOR i := 0 TO module.allSections.Length() - 1 DO
  10962. p := module.allSections.GetSection(i);
  10963. WITH p: IntermediateCode.Section DO
  10964. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  10965. Symbol(source,p,0,0);
  10966. INC(size);
  10967. END;
  10968. END
  10969. END;
  10970. PatchArray(source,sizePC,size);
  10971. END TypeInfoSection;
  10972. (*
  10973. ProcTableEntry* = RECORD
  10974. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  10975. noPtr*: LONGINT;
  10976. END;
  10977. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  10978. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  10979. *)
  10980. PROCEDURE PointersInProcTables(procArray, pointerArray: IntermediateCode.Section; VAR procArraySize, maxPointers: LONGINT);
  10981. VAR
  10982. destination: Sections.Section;
  10983. pointerArraySizePC, procArraySizePC, pointerArraySize, i: LONGINT;
  10984. PROCEDURE PointerOffsets(destination : IntermediateCode.Section);
  10985. VAR numberPointers: LONGINT; procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10986. variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; string: Basic.SectionName;
  10987. BEGIN
  10988. Info(procArray,"pcFrom");
  10989. Symbol(procArray,destination,0,0);
  10990. Info(procArray,"pcTo");
  10991. Symbol(procArray,destination,destination.pc,0);
  10992. Info(procArray,"pcStatementBegin");
  10993. Symbol(procArray,destination,destination.validPAFEnter,0);
  10994. Info(procArray,"pcStatementEnd");
  10995. Symbol(procArray,destination,destination.validPAFExit,0);
  10996. IF ~implementationVisitor.backend.cooperative THEN
  10997. Basic.SegmentedNameToString(destination.name, string);
  10998. Info(pointerArray,string);
  10999. procedure := destination.symbol(SyntaxTree.Procedure);
  11000. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11001. variable := procedure.procedureScope.firstVariable;
  11002. WHILE(variable # NIL) DO
  11003. IF ~(variable.untraced) THEN
  11004. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, pointerArray, variable.type, numberPointers);
  11005. END;
  11006. variable := variable.nextVariable
  11007. END;
  11008. parameter := procedureType.firstParameter;
  11009. WHILE(parameter # NIL) DO
  11010. IF ~(parameter.untraced) THEN
  11011. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, pointerArray, parameter.type, numberPointers);
  11012. END;
  11013. parameter := parameter.nextParameter;
  11014. END;
  11015. END;
  11016. Info(procArray,"numberPointers");
  11017. Longint(procArray,numberPointers);
  11018. IF numberPointers > maxPointers THEN maxPointers := numberPointers END;
  11019. INC(pointerArraySize, numberPointers);
  11020. END PointerOffsets;
  11021. BEGIN
  11022. maxPointers := 0;
  11023. Info(procArray, "proc array descriptor");
  11024. Address(procArray,0);
  11025. Address(procArray,0);
  11026. Address(procArray,0);
  11027. procArraySizePC := procArray.pc;
  11028. Address(procArray,0);
  11029. procArraySize := 0;
  11030. IF ~implementationVisitor.backend.cooperative THEN
  11031. Info(pointerArray, "pointer array descriptor");
  11032. Address(pointerArray,0);
  11033. Address(pointerArray,0);
  11034. Address(pointerArray,0);
  11035. pointerArraySizePC := pointerArray.pc;
  11036. Address(pointerArray,0);
  11037. pointerArraySize := 0;
  11038. END;
  11039. procArraySize := 0;
  11040. FOR i := 0 TO module.allSections.Length() - 1 DO
  11041. destination := module.allSections.GetSection(i);
  11042. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11043. PointerOffsets(destination(IntermediateCode.Section));
  11044. INC(procArraySize);
  11045. END
  11046. END;
  11047. PatchLongint(procArray,procArraySizePC,procArraySize);
  11048. IF ~implementationVisitor.backend.cooperative THEN
  11049. PatchLongint(pointerArray,pointerArraySizePC,pointerArraySize);
  11050. END;
  11051. END PointersInProcTables;
  11052. (*
  11053. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11054. VAR
  11055. next*: Module; (** once a module is published, all fields are read-only *)
  11056. name*: Name;
  11057. init, published: BOOLEAN;
  11058. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11059. sb*: ADDRESS; <- set to beginning of data section by loader
  11060. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11061. command*: POINTER TO ARRAY OF Command;
  11062. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11063. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11064. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11065. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11066. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11067. data*, code*: Bytes;
  11068. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11069. export*: ExportDesc;
  11070. term*: TerminationHandler;
  11071. exTable*: ExceptionTable;
  11072. noProcs*: LONGINT;
  11073. firstProc*: ADDRESS; <- done by loader
  11074. maxPtrs*: LONGINT;
  11075. crc*: LONGINT;
  11076. *)
  11077. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11078. BEGIN
  11079. Info(section, "cycle");
  11080. Size(section,0);
  11081. Info(section, "references");
  11082. Size(section,0);
  11083. Info(section, "nextMarked");
  11084. Address(section,0);
  11085. Info(section, "nextWatched");
  11086. Address(section,0);
  11087. END BasePointer;
  11088. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11089. BEGIN
  11090. BasePointer(section);
  11091. Info(section, "action");
  11092. Address(section,0);
  11093. Info(section, "monitor");
  11094. Address(section,0);
  11095. END BaseObject;
  11096. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  11097. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  11098. pooledName: Basic.SegmentedName;
  11099. symbol: SyntaxTree.Symbol;
  11100. BEGIN
  11101. Global.GetModuleName(module.module,name);
  11102. Strings.Append(name,".@Module.@Descriptor");
  11103. Basic.ToSegmentedName(name, pooledName);
  11104. descriptorSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  11105. Symbol(section,descriptorSection,0,0);
  11106. Info(descriptorSection, "descriptor");
  11107. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11108. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  11109. Address(descriptorSection,0);
  11110. Global.GetModuleName(module.module,name);
  11111. Strings.Append(name,".@Trace");
  11112. Basic.ToSegmentedName(name, pooledName);
  11113. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11114. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  11115. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11116. END ModuleDescriptor;
  11117. PROCEDURE ModuleSection(): IntermediateCode.Section;
  11118. VAR name: ARRAY 128 OF CHAR;
  11119. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  11120. symbol: SyntaxTree.Symbol;
  11121. BEGIN
  11122. Global.GetModuleName(module.module,name);
  11123. Strings.Append(name,".@Module");
  11124. Basic.ToSegmentedName(name, pooledName);
  11125. moduleSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  11126. moduleSection.SetExported(TRUE);
  11127. IF moduleSection.pc = 0 THEN
  11128. IF implementationVisitor.backend.cooperative THEN
  11129. Info(moduleSection, "descriptor");
  11130. ModuleDescriptor(moduleSection);
  11131. BaseObject(moduleSection);
  11132. implementationVisitor.CreateTraceModuleMethod(module.module);
  11133. ELSE
  11134. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  11135. Info(moduleSection, "HeapBlock");
  11136. Symbol(moduleSection,moduleSection,2,0);
  11137. Info(moduleSection, "TypeDescriptor");
  11138. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11139. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  11140. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  11141. END;
  11142. END;
  11143. RETURN moduleSection;
  11144. END ModuleSection;
  11145. PROCEDURE NewModuleInfo();
  11146. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11147. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11148. sectionName: Basic.SectionName;
  11149. CONST MPO=-40000000H;
  11150. BEGIN
  11151. (*
  11152. TypeDesc* = POINTER TO RECORD
  11153. descSize: LONGINT;
  11154. sentinel: LONGINT; (* = MPO-4 *)
  11155. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11156. flags*: SET;
  11157. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11158. name*: Name;
  11159. END;
  11160. *)
  11161. Global.GetSymbolSegmentedName(module.module,name);
  11162. Basic.AppendToSegmentedName(name,"@Info");
  11163. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11164. Info(source, "type info size"); Address(source, 3*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11165. Address(source,MPO-4);
  11166. Info(source, "type tag pointer");
  11167. Address( source,0);
  11168. Info(source, "type flags");
  11169. flags := {};
  11170. Set( source, flags);
  11171. Info(source, "pointer to module");
  11172. moduleSection := ModuleSection();
  11173. Symbol( source, moduleSection, moduleSection.pc,0);
  11174. Info(source, "type name");
  11175. i := 0;
  11176. sectionName := "@Self";
  11177. (*
  11178. Global.GetSymbolSegmentedName(td,name);
  11179. Basic.SegmentedNameToString(name, sectionName);
  11180. *)
  11181. Name(source,sectionName);
  11182. source.SetReferenced(FALSE);
  11183. ReflectVariables(source, module.module);
  11184. ReflectProcedures(source, module.module);
  11185. END NewModuleInfo;
  11186. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  11187. VAR
  11188. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  11189. typeInfoSection, procTableSection, ptrTableSection, referenceSection : IntermediateCode.Section;
  11190. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  11191. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, ptrTableSectionOffset, maxPointers, numberProcs,temp,
  11192. referenceSectionOffset : LONGINT;
  11193. BEGIN
  11194. NewModuleInfo();
  11195. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  11196. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  11197. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  11198. ImportsArray(importSection);
  11199. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  11200. CommandArray(commandsSection);
  11201. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  11202. ExceptionArray(exceptionSection);
  11203. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  11204. TypeInfoSection(typeInfoSection);
  11205. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  11206. References(referenceSection);
  11207. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  11208. IF ~implementationVisitor.backend.cooperative THEN
  11209. ptrTableSection := Block("Heaps","SystemBlockDesc",".@PtrTable",ptrTableSectionOffset);
  11210. ELSE
  11211. ptrTableSection := NIL;
  11212. END;
  11213. PointersInProcTables(procTableSection,ptrTableSection,numberProcs,maxPointers);
  11214. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  11215. Array(emptyArraySection,temp,"");
  11216. moduleSection := ModuleSection();
  11217. Info(moduleSection, "nextRoot*: RootObject");
  11218. Address(moduleSection,0);
  11219. Info(moduleSection, "next*: Module");
  11220. Address(moduleSection,0);
  11221. Info(moduleSection, "name*: Name");
  11222. Name(moduleSection,moduleName);
  11223. Info(moduleSection, "init, published: BOOLEAN");
  11224. Boolean(moduleSection,FALSE);
  11225. Boolean(moduleSection,FALSE);
  11226. Info(moduleSection,"filler"); (*! introduce alignment! *)
  11227. Boolean(moduleSection,FALSE);
  11228. Boolean(moduleSection,FALSE);
  11229. Info(moduleSection, "refcnt*: LONGINT");
  11230. Longint(moduleSection,0);
  11231. Info(moduleSection, "sb*: ADDRESS");
  11232. Address(moduleSection,0);
  11233. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  11234. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11235. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  11236. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  11237. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  11238. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  11239. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  11240. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  11241. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  11242. Symbol(moduleSection,importSection,emptyArraySectionOffset,0);
  11243. Info(moduleSection, "procTable*: ProcTable");
  11244. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  11245. Info(moduleSection, "ptrTable*: PtrTable");
  11246. IF ~implementationVisitor.backend.cooperative THEN
  11247. Symbol(moduleSection,ptrTableSection,ptrTableSectionOffset,0);
  11248. ELSE
  11249. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11250. END;
  11251. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  11252. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11253. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11254. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11255. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  11256. Info(moduleSection, "export*: ExportDesc");
  11257. ExportDesc(moduleSection);
  11258. Info(moduleSection, "term*: TerminationHandler");
  11259. Address(moduleSection,0);
  11260. Info(moduleSection, "exTable*: ExceptionTable");
  11261. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  11262. Info(moduleSection, "noProcs*: LONGINT");
  11263. Longint(moduleSection,numberProcs);
  11264. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END;
  11265. Info(moduleSection, "firstProc*: ADDRESS");
  11266. Address(moduleSection,0);
  11267. Info(moduleSection, "maxPtrs*: LONGINT");
  11268. Longint(moduleSection,maxPointers);
  11269. Info(moduleSection, "crc*: LONGINT");
  11270. Longint(moduleSection, 0); (*! must be implemented *)
  11271. Info(moduleSection, "body*: ADDRESS");
  11272. Symbol(moduleSection, bodyProc, 0,0);
  11273. IF implementationVisitor.backend.cooperative THEN
  11274. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  11275. Info(moduleSection, "monitor.owner");
  11276. Address(moduleSection,0);
  11277. Info(moduleSection, "monitor.nestingLevel");
  11278. Address(moduleSection,0);
  11279. Info(moduleSection, "monitor.blockedQueue");
  11280. Address(moduleSection,0); Address(moduleSection,0);
  11281. Info(moduleSection, "monitor.waitingQueue");
  11282. Address(moduleSection,0); Address(moduleSection,0);
  11283. Info(moduleSection, "monitor.waitingSentinel");
  11284. Address(moduleSection,0);
  11285. END;
  11286. END Module;
  11287. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  11288. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section;
  11289. BEGIN
  11290. Array(source,pc,"");
  11291. Info(source, "pointer offsets array data");
  11292. IF scope IS SyntaxTree.RecordScope THEN
  11293. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  11294. ELSIF scope IS SyntaxTree.CellScope THEN
  11295. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  11296. ELSIF scope IS SyntaxTree.ModuleScope THEN
  11297. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  11298. WHILE variable # NIL DO
  11299. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  11300. symbol := module.allSections.FindBySymbol(variable);
  11301. ASSERT(symbol # NIL);
  11302. Pointers(0,symbol, source,variable.type,numberPointers);
  11303. END;
  11304. variable := variable.nextVariable;
  11305. END;
  11306. END;
  11307. PatchArray(source,pc,numberPointers);
  11308. END PointerArray;
  11309. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  11310. VAR
  11311. name: Basic.SegmentedName;
  11312. section: IntermediateCode.Section;
  11313. BEGIN
  11314. ASSERT(implementationVisitor.newObjectFile);
  11315. Global.GetSymbolSegmentedName(symbol,name);
  11316. Basic.AppendToSegmentedName(name,suffix);
  11317. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11318. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  11319. Info(section, "HeapBlock");
  11320. Address(section,0); (* empty such that GC does not go on traversing *)
  11321. Info(section, suffix);
  11322. Address(section,0);
  11323. pc := section.pc;
  11324. RETURN section;
  11325. END SymbolSection;
  11326. PROCEDURE ReflectVariables(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11327. VAR type: SyntaxTree.Type; variable: SyntaxTree.Variable; pc: LONGINT; section: IntermediateCode.Section;
  11328. BEGIN
  11329. ASSERT(implementationVisitor.newObjectFile);
  11330. IF ~ReflectionSupport OR simple THEN variable := NIL
  11331. ELSIF symbol IS SyntaxTree.Module THEN
  11332. variable := symbol(SyntaxTree.Module).moduleScope.firstVariable;
  11333. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11334. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11335. IF type IS SyntaxTree.PointerType THEN
  11336. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11337. END;
  11338. IF type IS SyntaxTree.RecordType THEN
  11339. variable := type(SyntaxTree.RecordType).recordScope.firstVariable
  11340. ELSIF type IS SyntaxTree.CellType THEN
  11341. variable := type(SyntaxTree.CellType).cellScope.firstVariable;
  11342. END;
  11343. ELSIF symbol IS SyntaxTree.Procedure THEN
  11344. variable := symbol(SyntaxTree.Procedure).procedureScope.firstVariable;
  11345. END;
  11346. Info(in, "variables");
  11347. IF variable # NIL THEN
  11348. section := SymbolSection(symbol, "@Variables",pc);
  11349. VariableArray(section, variable);
  11350. Symbol(in, section, pc, 0);
  11351. ELSE
  11352. Address(in, 0);
  11353. END;
  11354. END ReflectVariables;
  11355. PROCEDURE ReflectProcedures(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11356. VAR type: SyntaxTree.Type; procedure: SyntaxTree.Procedure; pc: LONGINT; section: IntermediateCode.Section;
  11357. BEGIN
  11358. ASSERT(implementationVisitor.newObjectFile);
  11359. IF ~ReflectionSupport OR simple THEN procedure := NIL
  11360. ELSIF symbol IS SyntaxTree.Module THEN
  11361. procedure := symbol(SyntaxTree.Module).moduleScope.firstProcedure;
  11362. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11363. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11364. IF type IS SyntaxTree.PointerType THEN
  11365. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11366. END;
  11367. IF type IS SyntaxTree.RecordType THEN
  11368. procedure := type(SyntaxTree.RecordType).recordScope.firstProcedure
  11369. ELSIF type IS SyntaxTree.CellType THEN
  11370. procedure := type(SyntaxTree.CellType).cellScope.firstProcedure;
  11371. END;
  11372. ELSIF symbol IS SyntaxTree.Procedure THEN
  11373. procedure := symbol(SyntaxTree.Procedure).procedureScope.firstProcedure;
  11374. END;
  11375. Info(in, "procedures");
  11376. IF procedure # NIL THEN
  11377. section := SymbolSection(symbol, "@Procedures",pc);
  11378. ProcedureArray(section, procedure);
  11379. Symbol(in, section, pc, 0);
  11380. ELSE
  11381. Address(in, 0);
  11382. END;
  11383. END ReflectProcedures;
  11384. PROCEDURE VariableArray(source: IntermediateCode.Section; variable: SyntaxTree.Variable);
  11385. VAR pc, offset: LONGINT; tir: Sections.Section; size: LONGINT;
  11386. segmentedName, name: Basic.SegmentedName;
  11387. td: SyntaxTree.TypeDeclaration;
  11388. type: SyntaxTree.Type;
  11389. BEGIN
  11390. Array(source,pc,"Modules.FieldEntry");
  11391. Info(source, "FieldArray");
  11392. size :=0;
  11393. WHILE variable # NIL DO
  11394. Info(source,"name");
  11395. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, variable.name, moduleNamePool), 0); (* reference to dynamic name *)
  11396. type := variable.type.resolved;
  11397. Info(source,"offset");
  11398. IF variable.scope IS SyntaxTree.ModuleScope THEN
  11399. implementationVisitor.GetCodeSectionNameForSymbol(variable, name);
  11400. NamedSymbol(source, name,variable, 0,0);
  11401. ELSE
  11402. Size(source, ToMemoryUnits(module.system,variable.offsetInBits));
  11403. END;
  11404. Info(source,"type class");
  11405. IF type IS SyntaxTree.PointerType THEN
  11406. Size(source, 1);
  11407. ELSIF type IS SyntaxTree.RecordType THEN
  11408. Size(source, 2);
  11409. ELSIF type IS SyntaxTree.NumberType THEN
  11410. Size(source, 3);
  11411. ELSE
  11412. Size(source, 0);
  11413. END;
  11414. Info(source, "type desc");
  11415. IF type IS SyntaxTree.RecordType THEN
  11416. td := type(SyntaxTree.RecordType).typeDeclaration;
  11417. Global.GetSymbolSegmentedName(td,segmentedName);
  11418. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11419. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11420. ELSE
  11421. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11422. END;
  11423. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11424. Symbol(source, tir, 0, offset);
  11425. ELSE
  11426. Address(source, 0);
  11427. END;
  11428. Info(source,"flags");
  11429. Set(source, {});
  11430. variable := variable.nextVariable;
  11431. INC(size);
  11432. END;
  11433. PatchArray(source,pc,size);
  11434. END VariableArray;
  11435. PROCEDURE ProcedureArray(source: IntermediateCode.Section; procedure: SyntaxTree.Procedure);
  11436. VAR pc: LONGINT; size: LONGINT;
  11437. segmentedName: Basic.SegmentedName;
  11438. BEGIN
  11439. Array(source,pc,"Modules.ProcedureEntry");
  11440. Info(source, "ProcedureArray");
  11441. size :=0;
  11442. WHILE procedure # NIL DO
  11443. Info(source,"name");
  11444. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, procedure.name, moduleNamePool), 0); (* reference to dynamic name *)
  11445. implementationVisitor.GetCodeSectionNameForSymbol(procedure, segmentedName);
  11446. NamedSymbol(source, segmentedName, procedure, 0 , 0);
  11447. (* size *)
  11448. Size(source, 0);
  11449. (* parameters *)
  11450. Address(source, 0);
  11451. (* variables *)
  11452. ReflectVariables(source, procedure);
  11453. ReflectProcedures(source, procedure);
  11454. (* return type entry *)
  11455. Address(source, 0);
  11456. Address(source, 0);
  11457. procedure := procedure.nextProcedure;
  11458. INC(size);
  11459. END;
  11460. PatchArray(source,pc,size);
  11461. END ProcedureArray;
  11462. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  11463. VAR recordType: SyntaxTree.RecordType;
  11464. tir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  11465. section: Sections.Section; cellType: SyntaxTree.CellType;
  11466. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): Sections.Section;
  11467. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11468. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11469. sectionName: Basic.SectionName;
  11470. CONST MPO=-40000000H;
  11471. BEGIN
  11472. (*
  11473. TypeDesc* = POINTER TO RECORD
  11474. descSize: LONGINT;
  11475. sentinel: LONGINT; (* = MPO-4 *)
  11476. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11477. flags*: SET;
  11478. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11479. name*: Name;
  11480. END;
  11481. *)
  11482. (* source := module.sections.FindByName(...) *)
  11483. Global.GetSymbolSegmentedName(td,name);
  11484. Basic.AppendToSegmentedName(name,"@Info");
  11485. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11486. Info(source, "type info size"); Address(source, 3*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11487. Address(source,MPO-4);
  11488. Info(source, "type tag pointer");
  11489. Symbol( source, tag, offset, 0);
  11490. Info(source, "type flags");
  11491. flags := {};
  11492. IF isProtected THEN INCL(flags,31) END;
  11493. Set( source, flags);
  11494. Info(source, "pointer to module");
  11495. moduleSection := ModuleSection();
  11496. Symbol( source, moduleSection, moduleSection.pc,0);
  11497. Info(source, "type name");
  11498. i := 0;
  11499. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  11500. (*
  11501. Global.GetSymbolSegmentedName(td,name);
  11502. Basic.SegmentedNameToString(name, sectionName);
  11503. *)
  11504. Name(source,sectionName);
  11505. source.SetReferenced(FALSE);
  11506. ReflectVariables(source, td);
  11507. ReflectProcedures(source, td);
  11508. RETURN source;
  11509. END NewTypeDescriptorInfo;
  11510. PROCEDURE NewTypeDescriptor;
  11511. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  11512. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  11513. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  11514. numberPointers: LONGINT; padding, i: LONGINT;
  11515. CONST MPO=-40000000H;
  11516. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  11517. VAR i: LONGINT;
  11518. PROCEDURE Td(record: SyntaxTree.RecordType);
  11519. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  11520. BEGIN
  11521. IF record # NIL THEN
  11522. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  11523. baseTD := record.typeDeclaration;
  11524. Global.GetSymbolSegmentedName(baseTD,name);
  11525. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11526. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11527. ELSE
  11528. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11529. END;
  11530. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  11531. Symbol(source, tir, 0, offset);
  11532. IF reverse THEN Td(record.GetBaseRecord()) END;
  11533. END;
  11534. END Td;
  11535. BEGIN
  11536. Info(source, "tag table");
  11537. baseRecord := recordType;
  11538. i := 0;
  11539. WHILE baseRecord # NIL DO
  11540. INC(i);
  11541. baseRecord := baseRecord.GetBaseRecord();
  11542. END;
  11543. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  11544. IF ~reverse THEN Td(recordType) END;
  11545. WHILE i < size DO
  11546. Address(source,0);
  11547. INC(i);
  11548. END;
  11549. IF reverse THEN Td(recordType) END;
  11550. END TdTable;
  11551. PROCEDURE MethodTable(reverse: BOOLEAN);
  11552. VAR i,methods: LONGINT;
  11553. BEGIN
  11554. Info(source, "method table");
  11555. IF recordType # NIL THEN
  11556. methods := recordType.recordScope.numberMethods;
  11557. IF reverse THEN
  11558. FOR i := methods-1 TO 0 BY -1 DO
  11559. procedure := recordType.recordScope.FindMethod(i);
  11560. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  11561. NamedSymbol(source, name,procedure, 0,0);
  11562. END;
  11563. ELSE
  11564. FOR i := 0 TO methods-1 DO
  11565. procedure := recordType.recordScope.FindMethod(i);
  11566. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  11567. NamedSymbol(source, name,procedure, 0,0);
  11568. END;
  11569. END;
  11570. END;
  11571. END MethodTable;
  11572. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  11573. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  11574. BEGIN
  11575. Info(source, "method table");
  11576. baseRecord := recordType;
  11577. WHILE baseRecord.baseType # NIL DO
  11578. baseRecord := baseRecord.GetBaseRecord ();
  11579. END;
  11580. GetRecordTypeName (baseRecord, name);
  11581. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  11582. IF name = stackFrame THEN
  11583. start := 0;
  11584. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  11585. baseRecord := recordType;
  11586. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  11587. baseRecord := baseRecord.GetBaseRecord ();
  11588. END;
  11589. IF baseRecord # NIL THEN
  11590. GetRecordTypeName (baseRecord, name);
  11591. IF pointer & ~baseRecord.isObject THEN
  11592. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11593. END;
  11594. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  11595. ELSIF recordType.isObject THEN
  11596. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  11597. ELSIF pointer THEN
  11598. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  11599. ELSE
  11600. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  11601. END;
  11602. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11603. Symbol(source, tir, 0, 0);
  11604. start := 0;
  11605. baseRecord := recordType;
  11606. WHILE (baseRecord # NIL) DO
  11607. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  11608. baseRecord := baseRecord.GetBaseRecord ();
  11609. END;
  11610. ELSE
  11611. (* explicit trace method: *)
  11612. procedure := recordType.recordScope.FindMethod(0);
  11613. IF ~procedure.isFinalizer THEN
  11614. Global.GetSymbolSegmentedName(procedure, name);
  11615. NamedSymbol(source, name,procedure, 0,0);
  11616. END;
  11617. start := 1;
  11618. END;
  11619. IF (name # stackFrame) & recordType.isObject THEN
  11620. baseRecord := recordType;
  11621. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  11622. baseRecord := baseRecord.GetBaseRecord ();
  11623. END;
  11624. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  11625. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  11626. ELSE
  11627. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  11628. END;
  11629. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11630. Symbol(source, tir, 0, 0);
  11631. END;
  11632. methods := recordType.recordScope.numberMethods;
  11633. FOR i := start TO methods-1 DO
  11634. procedure := recordType.recordScope.FindMethod(i);
  11635. IF ~procedure.isFinalizer THEN
  11636. Global.GetSymbolSegmentedName(procedure, name);
  11637. NamedSymbol(source, name,procedure, 0,0);
  11638. END;
  11639. END;
  11640. END CooperativeMethodTable;
  11641. BEGIN
  11642. Global.GetSymbolSegmentedName(td,name);
  11643. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  11644. source.SetExported(IsExported(td));
  11645. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  11646. IF implementationVisitor.backend.cooperative THEN
  11647. base := NIL;
  11648. baseRecord := recordType.GetBaseRecord();
  11649. IF baseRecord # NIL THEN
  11650. baseTD := baseRecord.typeDeclaration;
  11651. END;
  11652. IF ~recordType.isObject THEN
  11653. Info(source, "parent");
  11654. IF baseRecord # NIL THEN
  11655. Global.GetSymbolSegmentedName(baseTD,name);
  11656. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11657. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11658. ELSE
  11659. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11660. END;
  11661. Symbol(source, tir, 0, 0);
  11662. ELSE
  11663. Address(source,0);
  11664. END;
  11665. Info(source, "record size");
  11666. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11667. source.SetReferenced(FALSE);
  11668. CooperativeMethodTable(FALSE);
  11669. base := source;
  11670. Global.GetSymbolSegmentedName(td,name);
  11671. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11672. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11673. source.SetExported(IsExported(td));
  11674. source.SetReferenced(FALSE);
  11675. END;
  11676. Info(source, "parent");
  11677. IF baseRecord # NIL THEN
  11678. Global.GetSymbolSegmentedName(baseTD,name);
  11679. sym := baseTD;
  11680. IF ~recordType.isObject THEN
  11681. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11682. sym := NIL;
  11683. END;
  11684. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11685. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11686. ELSE
  11687. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11688. END;
  11689. Symbol(source, tir, 0, 0);
  11690. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  11691. Address(source,0);
  11692. ELSE
  11693. IF recordType.isObject THEN
  11694. Basic.ToSegmentedName ("BaseTypes.Object",name);
  11695. ELSE
  11696. Basic.ToSegmentedName ("BaseTypes.Record",name);
  11697. END;
  11698. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11699. Symbol(source, tir, 0, 0);
  11700. END;
  11701. Info(source, "base record descriptor");
  11702. Symbol(source, base, 0, 0);
  11703. CooperativeMethodTable(TRUE);
  11704. source.SetReferenced(FALSE);
  11705. IF recordType.hasPointers THEN
  11706. IF ~HasExplicitTraceMethod (recordType) THEN
  11707. implementationVisitor.CreateTraceMethod(recordType);
  11708. END;
  11709. implementationVisitor.CreateResetProcedure(recordType);
  11710. implementationVisitor.CreateAssignProcedure(recordType);
  11711. END;
  11712. ELSIF ~simple THEN
  11713. (*
  11714. MethodEnd = MPO
  11715. ---
  11716. methods (# methods)
  11717. ---
  11718. tags (16)
  11719. ---
  11720. TypeDesc = TypeInfoAdr
  11721. ---
  11722. td adr ---> rec size
  11723. ----
  11724. pointer offsets
  11725. ----
  11726. (padding)
  11727. -----
  11728. empty [2 addresses aligned]
  11729. empty
  11730. empty
  11731. numPtrs
  11732. ---
  11733. pointer offsets
  11734. ---
  11735. *)
  11736. Info(source, "MethodEnd = MPO");
  11737. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  11738. source(IntermediateCode.Section).Emit(Data(-1,op));
  11739. MethodTable(TRUE);
  11740. TdTable(TypeTags, TRUE);
  11741. Info(source, "type descriptor info pointer");
  11742. Symbol(source, NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected()),0,0);
  11743. IF (cellType # NIL) THEN
  11744. IF cellType.sizeInBits < 0 THEN
  11745. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  11746. END;
  11747. Info(source, "cell size");
  11748. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  11749. ELSE
  11750. Info(source, "record size");
  11751. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11752. END;
  11753. Info(source, "pointer offsets pointer");
  11754. padding := 1- source.pc MOD 2;
  11755. Symbol(source, source, source.pc+1+padding,0);
  11756. IF padding >0 THEN
  11757. Info(source, "padding");
  11758. FOR i := 1 TO padding DO Address(source,0) END;
  11759. END;
  11760. IF cellType # NIL THEN
  11761. PointerArray(source, cellType.cellScope, numberPointers);
  11762. ELSE
  11763. PointerArray(source, recordType.recordScope, numberPointers);
  11764. END;
  11765. ELSE
  11766. (*
  11767. simple:
  11768. td adr --> size
  11769. tag(1)
  11770. tag(2)
  11771. tag(3)
  11772. methods ->
  11773. *)
  11774. Info(source, "record size");
  11775. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11776. TdTable(TypeTags, FALSE);
  11777. MethodTable(FALSE);
  11778. source.SetReferenced(FALSE);
  11779. END;
  11780. END NewTypeDescriptor;
  11781. BEGIN
  11782. x := x.resolved;
  11783. IF (x IS SyntaxTree.PointerType) THEN
  11784. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  11785. END;
  11786. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  11787. recordType := x(SyntaxTree.RecordType);
  11788. td := x.typeDeclaration;
  11789. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  11790. ASSERT(td # NIL);
  11791. section := module.allSections.FindBySymbol(td); (* TODO *)
  11792. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11793. IF implementationVisitor.newObjectFile THEN
  11794. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11795. NewTypeDescriptor
  11796. END;
  11797. ELSE
  11798. (* data section in intermediate code *)
  11799. Global.GetSymbolSegmentedName(td,name);
  11800. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  11801. Basic.SuffixSegmentedName (name, module.module.name);
  11802. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  11803. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  11804. tir.Emit(Data(-1,op));
  11805. END;
  11806. END;
  11807. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  11808. cellType := x(SyntaxTree.CellType);
  11809. td := x.typeDeclaration;
  11810. section := module.allSections.FindBySymbol(td); (* TODO *)
  11811. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11812. IF implementationVisitor.newObjectFile THEN
  11813. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11814. NewTypeDescriptor
  11815. END;
  11816. END;
  11817. END;
  11818. END
  11819. END CheckTypeDeclaration
  11820. END MetaDataGenerator;
  11821. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  11822. VAR
  11823. trace-: BOOLEAN;
  11824. traceString-: SyntaxTree.IdentifierString;
  11825. traceModuleName-: SyntaxTree.IdentifierString;
  11826. newObjectFile-: BOOLEAN;
  11827. profile-: BOOLEAN;
  11828. noRuntimeChecks: BOOLEAN;
  11829. simpleMetaData-: BOOLEAN;
  11830. noAsserts: BOOLEAN;
  11831. optimize-: BOOLEAN;
  11832. cooperative-: BOOLEAN;
  11833. preregisterStatic-: BOOLEAN;
  11834. dump-: Basic.Writer;
  11835. cellsAreObjects: BOOLEAN;
  11836. PROCEDURE &InitIntermediateBackend*;
  11837. BEGIN
  11838. simpleMetaData := FALSE;
  11839. newObjectFile := FALSE;
  11840. InitBackend;
  11841. SetRuntimeModuleName(DefaultRuntimeModuleName);
  11842. SetTraceModuleName(DefaultTraceModuleName);
  11843. END InitIntermediateBackend;
  11844. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  11845. VAR
  11846. declarationVisitor: DeclarationVisitor;
  11847. implementationVisitor: ImplementationVisitor;
  11848. module: Sections.Module;
  11849. name, platformName: SyntaxTree.IdentifierString;
  11850. meta: MetaDataGenerator;
  11851. BEGIN
  11852. ResetError;
  11853. Global.GetSymbolName(x,name);
  11854. NEW(module,x,system); (* backend structures *)
  11855. Global.GetModuleName(x, name);
  11856. module.SetModuleName(name);
  11857. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  11858. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  11859. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  11860. declarationVisitor.Module(x,module);
  11861. IF newObjectFile & ~meta.simple THEN
  11862. meta.Module(implementationVisitor.moduleBodySection);
  11863. END;
  11864. GetDescription(platformName);
  11865. module.SetPlatformName(platformName);
  11866. RETURN module
  11867. END GenerateIntermediate;
  11868. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  11869. BEGIN RETURN TRUE
  11870. END SupportedImmediate;
  11871. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  11872. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  11873. END ProcessSyntaxTreeModule;
  11874. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  11875. VAR
  11876. result: Sections.Module;
  11877. traceName: Basic.MessageString;
  11878. BEGIN
  11879. ASSERT(intermediateCodeModule IS Sections.Module);
  11880. result := intermediateCodeModule(Sections.Module);
  11881. IF trace THEN
  11882. traceName := "intermediate code trace: ";
  11883. Strings.Append(traceName,traceString);
  11884. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  11885. IF (traceString="") OR (traceString="*") THEN
  11886. result.Dump(dump);
  11887. dump.Update
  11888. ELSE
  11889. Sections.DumpFiltered(dump, result, traceString);
  11890. END
  11891. END;
  11892. RETURN result
  11893. END ProcessIntermediateCodeModule;
  11894. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  11895. BEGIN instructionSet := "Intermediate";
  11896. END GetDescription;
  11897. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  11898. BEGIN
  11899. SELF.newObjectFile := newObjectFile;
  11900. SELF.simpleMetaData := simpleMetaData;
  11901. END SetNewObjectFile;
  11902. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  11903. BEGIN COPY(name, traceModuleName)
  11904. END SetTraceModuleName;
  11905. PROCEDURE DefineOptions(options: Options.Options);
  11906. BEGIN
  11907. DefineOptions^(options);
  11908. options.Add(0X,"trace",Options.String);
  11909. options.Add(0X,"runtime",Options.String);
  11910. options.Add(0X,"newObjectFile",Options.Flag);
  11911. options.Add(0X,"traceModule",Options.String);
  11912. options.Add(0X,"profile",Options.Flag);
  11913. options.Add(0X,"noRuntimeChecks",Options.Flag);
  11914. options.Add(0X,"noAsserts",Options.Flag);
  11915. options.Add(0X,"metaData",Options.String);
  11916. options.Add('o',"optimize", Options.Flag);
  11917. options.Add(0X,"preregisterStatic", Options.Flag);
  11918. options.Add(0X,"cellsAreObjects", Options.Flag);
  11919. END DefineOptions;
  11920. PROCEDURE GetOptions(options: Options.Options);
  11921. VAR name,string: SyntaxTree.IdentifierString;
  11922. BEGIN
  11923. GetOptions^(options);
  11924. trace := options.GetString("trace",traceString);
  11925. profile := options.GetFlag("profile");
  11926. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  11927. noAsserts := options.GetFlag("noAsserts");
  11928. cooperative := options.GetFlag("cooperative");
  11929. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  11930. IF cooperative THEN
  11931. SetRuntimeModuleName("CPU") END
  11932. END;
  11933. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  11934. simpleMetaData := TRUE
  11935. END;
  11936. IF options.GetString("metaData",string) THEN
  11937. IF string = "simple" THEN simpleMetaData := TRUE
  11938. ELSIF string ="full" THEN simpleMetaData := FALSE
  11939. END;
  11940. END;
  11941. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  11942. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  11943. optimize := options.GetFlag("optimize");
  11944. preregisterStatic := options.GetFlag("preregisterStatic");
  11945. cellsAreObjects := options.GetFlag("cellsAreObjects");
  11946. END GetOptions;
  11947. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  11948. BEGIN RETURN SymbolFileFormat.Get()
  11949. END DefaultSymbolFileFormat;
  11950. END IntermediateBackend;
  11951. (* ----------------------------------- register allocation ------------------------------------- *)
  11952. (* register mapping scheme
  11953. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  11954. spill offset
  11955. part(n) --> ticket <--> physical register
  11956. spill offset
  11957. *)
  11958. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  11959. emptyOperand: IntermediateCode.Operand;
  11960. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  11961. statCoopResetVariables: LONGINT;
  11962. statCoopModifyAssignments: LONGINT;
  11963. modifyAssignmentsPC : LONGINT;
  11964. statCoopNilCheck: LONGINT;
  11965. statCoopSwitch: LONGINT;
  11966. statCoopAssignProcedure: LONGINT;
  11967. statCoopTraceMethod: LONGINT;
  11968. statCoopResetProcedure: LONGINT;
  11969. statCoopTraceModule: LONGINT;
  11970. PROCEDURE ResetStatistics*;
  11971. BEGIN
  11972. statCoopResetVariables := 0;
  11973. statCoopModifyAssignments := 0;
  11974. statCoopNilCheck:= 0;
  11975. statCoopSwitch:= 0;
  11976. statCoopAssignProcedure:= 0;
  11977. statCoopTraceMethod:= 0;
  11978. statCoopResetProcedure:= 0;
  11979. statCoopTraceModule:= 0;
  11980. END ResetStatistics;
  11981. PROCEDURE Statistics*;
  11982. BEGIN
  11983. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  11984. TRACE(statCoopNilCheck, statCoopSwitch);
  11985. TRACE(statCoopAssignProcedure,
  11986. statCoopTraceMethod,
  11987. statCoopResetProcedure,
  11988. statCoopTraceModule)
  11989. END Statistics;
  11990. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  11991. VAR h: LONGINT;
  11992. BEGIN
  11993. WHILE b # 0 DO
  11994. h := a MOD b;
  11995. a := b;
  11996. b := h;
  11997. END;
  11998. RETURN a
  11999. END GCD;
  12000. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12001. BEGIN
  12002. RETURN a*b DIV GCD(a,b)
  12003. END SCM;
  12004. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12005. BEGIN
  12006. (*TRACE(a,b);*)
  12007. IF a = 0 THEN RETURN b
  12008. ELSIF b = 0 THEN RETURN a
  12009. ELSE RETURN SCM(a,b)
  12010. END;
  12011. END CommonAlignment;
  12012. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  12013. BEGIN
  12014. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12015. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12016. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  12017. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12018. 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)
  12019. END
  12020. END PassBySingleReference;
  12021. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  12022. BEGIN
  12023. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  12024. END PassInRegister;
  12025. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12026. VAR new: RegisterEntry;
  12027. BEGIN
  12028. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12029. IF queue = NIL THEN
  12030. queue := new
  12031. ELSE
  12032. new.next := queue;
  12033. IF queue#NIL THEN queue.prev := new END;
  12034. queue := new
  12035. END;
  12036. END AddRegisterEntry;
  12037. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12038. VAR this: RegisterEntry;
  12039. BEGIN
  12040. this := queue;
  12041. WHILE (this # NIL) & (this.register # register) DO
  12042. this := this.next;
  12043. END;
  12044. IF this = NIL THEN
  12045. RETURN FALSE
  12046. END;
  12047. ASSERT(this # NIL);
  12048. IF this = queue THEN queue := queue.next END;
  12049. IF this.prev # NIL THEN this.prev.next := this.next END;
  12050. IF this.next # NIL THEN this.next.prev := this.prev END;
  12051. RETURN TRUE
  12052. END RemoveRegisterEntry;
  12053. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12054. BEGIN ASSERT(cond);
  12055. END Assert;
  12056. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12057. BEGIN
  12058. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12059. END ReusableRegister;
  12060. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12061. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12062. BEGIN
  12063. procedure := moduleScope.bodyProcedure;
  12064. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12065. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12066. procedure := SyntaxTree.NewProcedure(-1,Global.ModuleBodyName, procedureScope);
  12067. procedure.SetScope(moduleScope);
  12068. procedure.SetType(SyntaxTree.NewProcedureType(-1,moduleScope));
  12069. procedure.SetAccess(SyntaxTree.Hidden);
  12070. moduleScope.SetBodyProcedure(procedure);
  12071. moduleScope.AddProcedure(procedure);
  12072. procedureScope.SetBody(SyntaxTree.NewBody(-1,procedureScope)); (* empty body *)
  12073. END;
  12074. END EnsureBodyProcedure;
  12075. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12076. VAR import: SyntaxTree.Import;
  12077. selfName: SyntaxTree.IdentifierString;
  12078. module: SyntaxTree.Module;
  12079. BEGIN
  12080. scope.ownerModule.GetName(selfName);
  12081. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12082. module := scope.ownerModule
  12083. ELSE
  12084. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12085. IF import = NIL THEN
  12086. RETURN NIL
  12087. ELSIF import.module = NIL THEN
  12088. RETURN NIL
  12089. ELSE module := import.module
  12090. END;
  12091. END;
  12092. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12093. END GetSymbol;
  12094. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12095. BEGIN
  12096. op.mode := mode;
  12097. IntermediateCode.InitOperand(op.op);
  12098. IntermediateCode.InitOperand(op.tag);
  12099. IntermediateCode.InitOperand(op.extra);
  12100. op.dimOffset := 0;
  12101. END InitOperand;
  12102. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12103. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12104. BEGIN RETURN IntermediateCode.GetType(system, type)
  12105. END GetType;
  12106. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12107. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12108. BEGIN
  12109. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12110. (*
  12111. UniqueId(name,module,name,adr);
  12112. *)
  12113. constant := SyntaxTree.NewConstant(-1,SyntaxTree.NewIdentifier(name));
  12114. constant.SetValue(value);
  12115. constant.SetAccess(SyntaxTree.Hidden);
  12116. module.moduleScope.AddConstant(constant);
  12117. constant.SetScope(module.moduleScope);
  12118. RETURN constant
  12119. END BuildConstant;
  12120. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12121. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12122. BEGIN
  12123. variable := scope.firstVariable;
  12124. WHILE variable # NIL DO
  12125. IF variable.NeedsTrace() THEN
  12126. RETURN TRUE;
  12127. END;
  12128. variable := variable.nextVariable;
  12129. END;
  12130. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12131. WHILE parameter # NIL DO
  12132. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12133. RETURN TRUE;
  12134. END;
  12135. parameter := parameter.nextParameter;
  12136. END;
  12137. RETURN FALSE;
  12138. END HasPointers;
  12139. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12140. BEGIN RETURN (parameter.kind = SyntaxTree.VarParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ((parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType));
  12141. END IsVariableParameter;
  12142. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12143. VAR parameter: SyntaxTree.Parameter;
  12144. BEGIN
  12145. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12146. WHILE parameter # NIL DO
  12147. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12148. IF parameter.movable THEN RETURN TRUE END;
  12149. parameter := parameter.nextParameter;
  12150. END;
  12151. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12152. END HasVariableParameters;
  12153. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12154. BEGIN
  12155. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12156. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12157. END HasExplicitTraceMethod;
  12158. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12159. BEGIN
  12160. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12161. IF (expression IS SyntaxTree.IntegerValue) THEN
  12162. val := expression(SyntaxTree.IntegerValue).value;
  12163. RETURN TRUE
  12164. ELSE
  12165. RETURN FALSE
  12166. END;
  12167. END IsIntegerConstant;
  12168. PROCEDURE PowerOf2(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12169. BEGIN
  12170. IF val <= 0 THEN RETURN FALSE END;
  12171. exp := 0;
  12172. WHILE ~ODD(val) DO
  12173. val := val DIV 2;
  12174. INC(exp)
  12175. END;
  12176. RETURN val = 1
  12177. END PowerOf2;
  12178. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12179. VAR procedure: SyntaxTree.Procedure;
  12180. BEGIN
  12181. procedure := record.recordScope.constructor;
  12182. IF procedure = NIL THEN
  12183. record := record.GetBaseRecord();
  12184. IF record # NIL THEN
  12185. procedure := GetConstructor(record)
  12186. END;
  12187. END;
  12188. RETURN procedure;
  12189. END GetConstructor;
  12190. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12191. BEGIN
  12192. value := SHORT(op.intValue);
  12193. RETURN op.mode = IntermediateCode.ModeImmediate;
  12194. END IsIntegerImmediate;
  12195. (** whether a type strictily is a pointer to record or object type
  12196. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12197. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12198. BEGIN
  12199. IF type = NIL THEN
  12200. RETURN FALSE
  12201. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  12202. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  12203. ELSE
  12204. RETURN FALSE
  12205. END
  12206. END IsStrictlyPointerToRecord;
  12207. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  12208. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  12209. END IsUnsafePointer;
  12210. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  12211. BEGIN type := type.resolved;
  12212. IF type IS SyntaxTree.PointerType THEN
  12213. type := type(SyntaxTree.PointerType).pointerBase;
  12214. type := type.resolved;
  12215. IF type IS SyntaxTree.RecordType THEN
  12216. recordType := type(SyntaxTree.RecordType);
  12217. RETURN TRUE
  12218. ELSE
  12219. RETURN FALSE
  12220. END
  12221. ELSIF type IS SyntaxTree.RecordType THEN
  12222. recordType := type(SyntaxTree.RecordType);
  12223. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  12224. ELSIF type IS SyntaxTree.ObjectType THEN
  12225. RETURN TRUE
  12226. ELSIF type IS SyntaxTree.AnyType THEN
  12227. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  12228. ELSE
  12229. RETURN FALSE
  12230. END;
  12231. END IsPointerToRecord;
  12232. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  12233. BEGIN
  12234. type := type.resolved;
  12235. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  12236. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  12237. END IsArrayOfSystemByte;
  12238. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  12239. BEGIN
  12240. IF type = NIL THEN RETURN FALSE END;
  12241. type := type.resolved;
  12242. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  12243. END IsOpenArray;
  12244. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  12245. BEGIN
  12246. IF type = NIL THEN RETURN FALSE END;
  12247. type := type.resolved;
  12248. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  12249. END IsSemiDynamicArray;
  12250. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  12251. BEGIN
  12252. IF type = NIL THEN RETURN FALSE END;
  12253. type := type.resolved;
  12254. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  12255. END IsStaticArray;
  12256. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12257. VAR size: LONGINT;
  12258. BEGIN
  12259. size := 1;
  12260. WHILE (IsStaticArray(type)) DO
  12261. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  12262. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12263. END;
  12264. RETURN size;
  12265. END StaticArrayNumElements;
  12266. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12267. BEGIN
  12268. WHILE (IsStaticArray(type)) DO
  12269. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12270. END;
  12271. RETURN type;
  12272. END StaticArrayBaseType;
  12273. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12274. BEGIN
  12275. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  12276. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12277. END;
  12278. RETURN type;
  12279. END ArrayBaseType;
  12280. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  12281. BEGIN
  12282. IF type = NIL THEN RETURN FALSE END;
  12283. type := type.resolved;
  12284. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  12285. END IsDelegate;
  12286. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  12287. VAR i: LONGINT;
  12288. BEGIN
  12289. i := 0; type := type.resolved;
  12290. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12291. INC(i);
  12292. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  12293. END;
  12294. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12295. INC(i);
  12296. type := type(SyntaxTree.MathArrayType).arrayBase;
  12297. IF type # NIL THEN type := type.resolved END;
  12298. END;
  12299. RETURN i
  12300. END DynamicDim;
  12301. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  12302. BEGIN
  12303. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12304. type := type(SyntaxTree.ArrayType).arrayBase;
  12305. END;
  12306. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12307. type := type(SyntaxTree.MathArrayType).arrayBase;
  12308. END;
  12309. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  12310. END StaticSize;
  12311. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  12312. BEGIN
  12313. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  12314. END IsImmediate;
  12315. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  12316. BEGIN
  12317. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  12318. END IsAddress;
  12319. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  12320. BEGIN
  12321. RETURN (x.mode = IntermediateCode.ModeRegister);
  12322. END IsRegister;
  12323. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  12324. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  12325. BEGIN
  12326. typeDeclaration := recordType.typeDeclaration;
  12327. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12328. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12329. END GetRecordTypeName;
  12330. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  12331. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  12332. BEGIN
  12333. parSize := 0;
  12334. IF StructuredReturnType(procedureType) THEN
  12335. parameter := procedureType.returnParameter;
  12336. INC(parSize,system.SizeOfParameter(parameter));
  12337. parSize := parSize + (-parSize) MOD system.addressSize;
  12338. END;
  12339. parameter :=procedureType.lastParameter;
  12340. WHILE (parameter # NIL) DO
  12341. INC(parSize,system.SizeOfParameter(parameter));
  12342. parSize := parSize + (-parSize) MOD system.addressSize;
  12343. parameter := parameter.prevParameter;
  12344. END;
  12345. IF procedureType.isDelegate THEN INC(parSize,system.addressSize) END; (* method => self pointer *)
  12346. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  12347. RETURN ToMemoryUnits(system,parSize)
  12348. END ParametersSize;
  12349. PROCEDURE ReturnedAsParameter(type: SyntaxTree.Type): BOOLEAN;
  12350. BEGIN
  12351. IF type = NIL THEN RETURN FALSE
  12352. ELSE
  12353. type := type.resolved;
  12354. RETURN (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR (type IS SyntaxTree.ProcedureType) OR SemanticChecker.IsPointerType(type)
  12355. OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.MathArrayType);
  12356. END
  12357. END ReturnedAsParameter;
  12358. PROCEDURE StructuredReturnType(procedureType: SyntaxTree.ProcedureType): BOOLEAN;
  12359. BEGIN
  12360. RETURN (procedureType # NIL) & (procedureType.callingConvention=SyntaxTree.OberonCallingConvention) & ReturnedAsParameter(procedureType.returnType);
  12361. END StructuredReturnType;
  12362. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  12363. BEGIN
  12364. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  12365. END IsNested;
  12366. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  12367. BEGIN
  12368. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  12369. scope := scope.outerScope;
  12370. END;
  12371. RETURN scope # NIL;
  12372. END InCellScope;
  12373. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  12374. BEGIN
  12375. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  12376. RETURN 0
  12377. ELSE
  12378. *)
  12379. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  12380. (*END;*)
  12381. END ProcedureParametersSize;
  12382. PROCEDURE ToMemoryUnits*(system: Global.System; size: LONGINT): LONGINT;
  12383. VAR dataUnit: LONGINT;
  12384. BEGIN dataUnit := system.dataUnit;
  12385. ASSERT(size MOD system.dataUnit = 0);
  12386. RETURN size DIV system.dataUnit
  12387. END ToMemoryUnits;
  12388. PROCEDURE Get*(): Backend.Backend;
  12389. VAR backend: IntermediateBackend;
  12390. BEGIN NEW(backend); RETURN backend
  12391. END Get;
  12392. PROCEDURE Nop(position: LONGINT):IntermediateCode.Instruction;
  12393. VAR instruction: IntermediateCode.Instruction;
  12394. BEGIN
  12395. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  12396. RETURN instruction
  12397. END Nop;
  12398. PROCEDURE Mov(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12399. VAR instruction: IntermediateCode.Instruction;
  12400. BEGIN
  12401. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  12402. RETURN instruction
  12403. END Mov;
  12404. (* like Mov but ensures that no new register will be allocated for dest *)
  12405. PROCEDURE MovReplace(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12406. VAR instruction: IntermediateCode.Instruction;
  12407. BEGIN
  12408. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  12409. RETURN instruction
  12410. END MovReplace;
  12411. PROCEDURE Conv(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12412. VAR instruction: IntermediateCode.Instruction;
  12413. BEGIN
  12414. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  12415. RETURN instruction
  12416. END Conv;
  12417. PROCEDURE SysvABI( cc: LONGINT ): BOOLEAN;
  12418. BEGIN
  12419. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention})
  12420. END SysvABI;
  12421. PROCEDURE SysvABIorWINAPI( cc: LONGINT ): BOOLEAN;
  12422. BEGIN
  12423. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention, SyntaxTree.WinAPICallingConvention})
  12424. END SysvABIorWINAPI;
  12425. PROCEDURE Call*(position: LONGINT;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  12426. VAR instruction: IntermediateCode.Instruction;
  12427. BEGIN
  12428. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  12429. RETURN instruction
  12430. END Call;
  12431. PROCEDURE Exit(position: LONGINT;pcOffset: LONGINT; callingConvention: LONGINT): IntermediateCode.Instruction;
  12432. VAR op1, op2: IntermediateCode.Operand;
  12433. VAR instruction: IntermediateCode.Instruction;
  12434. BEGIN
  12435. IntermediateCode.InitNumber(op1,pcOffset);
  12436. IntermediateCode.InitNumber(op2,callingConvention);
  12437. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,emptyOperand);
  12438. RETURN instruction
  12439. END Exit;
  12440. PROCEDURE Return(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12441. VAR instruction: IntermediateCode.Instruction;
  12442. BEGIN
  12443. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  12444. RETURN instruction
  12445. END Return;
  12446. PROCEDURE Result*(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12447. VAR instruction: IntermediateCode.Instruction;
  12448. BEGIN
  12449. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  12450. RETURN instruction
  12451. END Result;
  12452. PROCEDURE Trap(position: LONGINT;nr: LONGINT): IntermediateCode.Instruction;
  12453. VAR op1: IntermediateCode.Operand;
  12454. VAR instruction: IntermediateCode.Instruction;
  12455. BEGIN
  12456. IntermediateCode.InitNumber(op1,nr);
  12457. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  12458. RETURN instruction
  12459. END Trap;
  12460. PROCEDURE Br(position: LONGINT;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  12461. VAR instruction: IntermediateCode.Instruction;
  12462. BEGIN
  12463. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  12464. RETURN instruction
  12465. END Br;
  12466. PROCEDURE Breq(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12467. VAR instruction: IntermediateCode.Instruction;
  12468. BEGIN
  12469. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  12470. RETURN instruction
  12471. END Breq;
  12472. PROCEDURE Brne(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12473. VAR instruction: IntermediateCode.Instruction;
  12474. BEGIN
  12475. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  12476. RETURN instruction
  12477. END Brne;
  12478. PROCEDURE Brge(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12479. VAR instruction: IntermediateCode.Instruction;
  12480. BEGIN
  12481. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  12482. RETURN instruction
  12483. END Brge;
  12484. PROCEDURE Brlt(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12485. VAR instruction: IntermediateCode.Instruction;
  12486. BEGIN
  12487. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  12488. RETURN instruction
  12489. END Brlt;
  12490. PROCEDURE Pop*(position: LONGINT;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  12491. VAR instruction: IntermediateCode.Instruction;
  12492. BEGIN
  12493. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  12494. RETURN instruction
  12495. END Pop;
  12496. PROCEDURE Push*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12497. VAR instruction: IntermediateCode.Instruction;
  12498. BEGIN
  12499. ASSERT(op.mode # IntermediateCode.Undefined);
  12500. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  12501. RETURN instruction
  12502. END Push;
  12503. PROCEDURE Neg(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12504. VAR instruction: IntermediateCode.Instruction;
  12505. BEGIN
  12506. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  12507. RETURN instruction
  12508. END Neg;
  12509. PROCEDURE Not(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12510. VAR instruction: IntermediateCode.Instruction;
  12511. BEGIN
  12512. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  12513. RETURN instruction
  12514. END Not;
  12515. PROCEDURE Abs(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12516. VAR instruction: IntermediateCode.Instruction;
  12517. BEGIN
  12518. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  12519. RETURN instruction
  12520. END Abs;
  12521. PROCEDURE Mul(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12522. VAR instruction: IntermediateCode.Instruction;
  12523. BEGIN
  12524. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  12525. RETURN instruction
  12526. END Mul;
  12527. PROCEDURE Div(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12528. VAR instruction: IntermediateCode.Instruction;
  12529. BEGIN
  12530. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  12531. RETURN instruction
  12532. END Div;
  12533. PROCEDURE Mod(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12534. VAR instruction: IntermediateCode.Instruction;
  12535. BEGIN
  12536. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  12537. RETURN instruction
  12538. END Mod;
  12539. PROCEDURE Sub(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12540. VAR instruction: IntermediateCode.Instruction;
  12541. BEGIN
  12542. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  12543. RETURN instruction
  12544. END Sub;
  12545. PROCEDURE Add(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12546. VAR instruction: IntermediateCode.Instruction;
  12547. BEGIN
  12548. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  12549. RETURN instruction
  12550. END Add;
  12551. PROCEDURE And(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12552. VAR instruction: IntermediateCode.Instruction;
  12553. BEGIN
  12554. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  12555. RETURN instruction
  12556. END And;
  12557. PROCEDURE Or(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12558. VAR instruction: IntermediateCode.Instruction;
  12559. BEGIN
  12560. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  12561. RETURN instruction
  12562. END Or;
  12563. PROCEDURE Xor(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12564. VAR instruction: IntermediateCode.Instruction;
  12565. BEGIN
  12566. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  12567. RETURN instruction
  12568. END Xor;
  12569. PROCEDURE Shl(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12570. VAR instruction: IntermediateCode.Instruction;
  12571. BEGIN
  12572. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  12573. RETURN instruction
  12574. END Shl;
  12575. PROCEDURE Shr(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12576. VAR instruction: IntermediateCode.Instruction;
  12577. BEGIN
  12578. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  12579. RETURN instruction
  12580. END Shr;
  12581. PROCEDURE Rol(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12582. VAR instruction: IntermediateCode.Instruction;
  12583. BEGIN
  12584. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  12585. RETURN instruction
  12586. END Rol;
  12587. PROCEDURE Ror(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12588. VAR instruction: IntermediateCode.Instruction;
  12589. BEGIN
  12590. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  12591. RETURN instruction
  12592. END Ror;
  12593. PROCEDURE Cas(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12594. VAR instruction: IntermediateCode.Instruction;
  12595. BEGIN
  12596. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  12597. RETURN instruction
  12598. END Cas;
  12599. PROCEDURE Copy(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12600. VAR instruction: IntermediateCode.Instruction;
  12601. BEGIN
  12602. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  12603. RETURN instruction
  12604. END Copy;
  12605. PROCEDURE Fill(position: LONGINT;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  12606. VAR instruction: IntermediateCode.Instruction;
  12607. BEGIN
  12608. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  12609. RETURN instruction
  12610. END Fill;
  12611. PROCEDURE Asm(position: LONGINT;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  12612. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  12613. BEGIN
  12614. string := IntermediateCode.String(s);
  12615. IntermediateCode.SetIntValue(string,position); (* for error reporting *)
  12616. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  12617. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  12618. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  12619. RETURN instruction
  12620. END Asm;
  12621. PROCEDURE Data*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12622. VAR instruction: IntermediateCode.Instruction;
  12623. BEGIN
  12624. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  12625. RETURN instruction
  12626. END Data;
  12627. PROCEDURE SpecialInstruction(position: LONGINT;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  12628. VAR instruction: IntermediateCode.Instruction;
  12629. BEGIN
  12630. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  12631. IntermediateCode.SetSubType(instruction, subtype);
  12632. RETURN instruction
  12633. END SpecialInstruction;
  12634. PROCEDURE Reserve(position: LONGINT;units: LONGINT): IntermediateCode.Instruction;
  12635. VAR op1: IntermediateCode.Operand;
  12636. VAR instruction: IntermediateCode.Instruction;
  12637. BEGIN
  12638. (*! generate a warning if size exceeds a certain limit *)
  12639. (*
  12640. ASSERT(bytes < 1000000); (* sanity check *)
  12641. *)
  12642. ASSERT(0 <= units); (* sanity check *)
  12643. IntermediateCode.InitNumber(op1,units);
  12644. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  12645. RETURN instruction
  12646. END Reserve;
  12647. PROCEDURE LabelInstruction(position: LONGINT): IntermediateCode.Instruction;
  12648. VAR op1: IntermediateCode.Operand;
  12649. VAR instruction: IntermediateCode.Instruction;
  12650. BEGIN
  12651. IntermediateCode.InitNumber(op1,position);
  12652. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  12653. RETURN instruction
  12654. END LabelInstruction;
  12655. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  12656. VAR pc: LONGINT;
  12657. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  12658. BEGIN
  12659. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  12660. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  12661. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  12662. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  12663. IF instr.op1.type.form = IntermediateCode.Float THEN
  12664. RETURN instr.op1.floatValue = op.floatValue
  12665. ELSE
  12666. RETURN instr.op1.intValue = op.intValue
  12667. END;
  12668. END ProvidesValue;
  12669. BEGIN
  12670. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  12671. pc := 0;
  12672. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  12673. INC(pc);
  12674. END;
  12675. IF pc = data.pc THEN
  12676. data.Emit(Data(-1,vop));
  12677. END;
  12678. RETURN pc
  12679. END EnterImmediate;
  12680. PROCEDURE Init;
  12681. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  12682. BEGIN
  12683. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  12684. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  12685. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  12686. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  12687. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  12688. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  12689. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  12690. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  12691. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  12692. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  12693. IntermediateCode.InitOperand(emptyOperand);
  12694. FOR i := 0 TO NumberSystemCalls-1 DO
  12695. name := "@SystemCall";
  12696. Basic.AppendNumber(name,i);
  12697. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  12698. END;
  12699. END Init;
  12700. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  12701. BEGIN
  12702. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  12703. END IsExported;
  12704. BEGIN
  12705. Init;
  12706. END FoxIntermediateBackend.
  12707. Compiler.Compile FoxIntermediateBackend.Mod ~