FoxIntermediateBackend.Mod 575 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200620162026203620462056206620762086209621062116212621362146215621662176218621962206221622262236224622562266227622862296230623162326233623462356236623762386239624062416242624362446245624662476248624962506251625262536254625562566257625862596260626162626263626462656266626762686269627062716272627362746275627662776278627962806281628262836284628562866287628862896290629162926293629462956296629762986299630063016302630363046305630663076308630963106311631263136314631563166317631863196320632163226323632463256326632763286329633063316332633363346335633663376338633963406341634263436344634563466347634863496350635163526353635463556356635763586359636063616362636363646365636663676368636963706371637263736374637563766377637863796380638163826383638463856386638763886389639063916392639363946395639663976398639964006401640264036404640564066407640864096410641164126413641464156416641764186419642064216422642364246425642664276428642964306431643264336434643564366437643864396440644164426443644464456446644764486449645064516452645364546455645664576458645964606461646264636464646564666467646864696470647164726473647464756476647764786479648064816482648364846485648664876488648964906491649264936494649564966497649864996500650165026503650465056506650765086509651065116512651365146515651665176518651965206521652265236524652565266527652865296530653165326533653465356536653765386539654065416542654365446545654665476548654965506551655265536554655565566557655865596560656165626563656465656566656765686569657065716572657365746575657665776578657965806581658265836584658565866587658865896590659165926593659465956596659765986599660066016602660366046605660666076608660966106611661266136614661566166617661866196620662166226623662466256626662766286629663066316632663366346635663666376638663966406641664266436644664566466647664866496650665166526653665466556656665766586659666066616662666366646665666666676668666966706671667266736674667566766677667866796680668166826683668466856686668766886689669066916692669366946695669666976698669967006701670267036704670567066707670867096710671167126713671467156716671767186719672067216722672367246725672667276728672967306731673267336734673567366737673867396740674167426743674467456746674767486749675067516752675367546755675667576758675967606761676267636764676567666767676867696770677167726773677467756776677767786779678067816782678367846785678667876788678967906791679267936794679567966797679867996800680168026803680468056806680768086809681068116812681368146815681668176818681968206821682268236824682568266827682868296830683168326833683468356836683768386839684068416842684368446845684668476848684968506851685268536854685568566857685868596860686168626863686468656866686768686869687068716872687368746875687668776878687968806881688268836884688568866887688868896890689168926893689468956896689768986899690069016902690369046905690669076908690969106911691269136914691569166917691869196920692169226923692469256926692769286929693069316932693369346935693669376938693969406941694269436944694569466947694869496950695169526953695469556956695769586959696069616962696369646965696669676968696969706971697269736974697569766977697869796980698169826983698469856986698769886989699069916992699369946995699669976998699970007001700270037004700570067007700870097010701170127013701470157016701770187019702070217022702370247025702670277028702970307031703270337034703570367037703870397040704170427043704470457046704770487049705070517052705370547055705670577058705970607061706270637064706570667067706870697070707170727073707470757076707770787079708070817082708370847085708670877088708970907091709270937094709570967097709870997100710171027103710471057106710771087109711071117112711371147115711671177118711971207121712271237124712571267127712871297130713171327133713471357136713771387139714071417142714371447145714671477148714971507151715271537154715571567157715871597160716171627163716471657166716771687169717071717172717371747175717671777178717971807181718271837184718571867187718871897190719171927193719471957196719771987199720072017202720372047205720672077208720972107211721272137214721572167217721872197220722172227223722472257226722772287229723072317232723372347235723672377238723972407241724272437244724572467247724872497250725172527253725472557256725772587259726072617262726372647265726672677268726972707271727272737274727572767277727872797280728172827283728472857286728772887289729072917292729372947295729672977298729973007301730273037304730573067307730873097310731173127313731473157316731773187319732073217322732373247325732673277328732973307331733273337334733573367337733873397340734173427343734473457346734773487349735073517352735373547355735673577358735973607361736273637364736573667367736873697370737173727373737473757376737773787379738073817382738373847385738673877388738973907391739273937394739573967397739873997400740174027403740474057406740774087409741074117412741374147415741674177418741974207421742274237424742574267427742874297430743174327433743474357436743774387439744074417442744374447445744674477448744974507451745274537454745574567457745874597460746174627463746474657466746774687469747074717472747374747475747674777478747974807481748274837484748574867487748874897490749174927493749474957496749774987499750075017502750375047505750675077508750975107511751275137514751575167517751875197520752175227523752475257526752775287529753075317532753375347535753675377538753975407541754275437544754575467547754875497550755175527553755475557556755775587559756075617562756375647565756675677568756975707571757275737574757575767577757875797580758175827583758475857586758775887589759075917592759375947595759675977598759976007601760276037604760576067607760876097610761176127613761476157616761776187619762076217622762376247625762676277628762976307631763276337634763576367637763876397640764176427643764476457646764776487649765076517652765376547655765676577658765976607661766276637664766576667667766876697670767176727673767476757676767776787679768076817682768376847685768676877688768976907691769276937694769576967697769876997700770177027703770477057706770777087709771077117712771377147715771677177718771977207721772277237724772577267727772877297730773177327733773477357736773777387739774077417742774377447745774677477748774977507751775277537754775577567757775877597760776177627763776477657766776777687769777077717772777377747775777677777778777977807781778277837784778577867787778877897790779177927793779477957796779777987799780078017802780378047805780678077808780978107811781278137814781578167817781878197820782178227823782478257826782778287829783078317832783378347835783678377838783978407841784278437844784578467847784878497850785178527853785478557856785778587859786078617862786378647865786678677868786978707871787278737874787578767877787878797880788178827883788478857886788778887889789078917892789378947895789678977898789979007901790279037904790579067907790879097910791179127913791479157916791779187919792079217922792379247925792679277928792979307931793279337934793579367937793879397940794179427943794479457946794779487949795079517952795379547955795679577958795979607961796279637964796579667967796879697970797179727973797479757976797779787979798079817982798379847985798679877988798979907991799279937994799579967997799879998000800180028003800480058006800780088009801080118012801380148015801680178018801980208021802280238024802580268027802880298030803180328033803480358036803780388039804080418042804380448045804680478048804980508051805280538054805580568057805880598060806180628063806480658066806780688069807080718072807380748075807680778078807980808081808280838084808580868087808880898090809180928093809480958096809780988099810081018102810381048105810681078108810981108111811281138114811581168117811881198120812181228123812481258126812781288129813081318132813381348135813681378138813981408141814281438144814581468147814881498150815181528153815481558156815781588159816081618162816381648165816681678168816981708171817281738174817581768177817881798180818181828183818481858186818781888189819081918192819381948195819681978198819982008201820282038204820582068207820882098210821182128213821482158216821782188219822082218222822382248225822682278228822982308231823282338234823582368237823882398240824182428243824482458246824782488249825082518252825382548255825682578258825982608261826282638264826582668267826882698270827182728273827482758276827782788279828082818282828382848285828682878288828982908291829282938294829582968297829882998300830183028303830483058306830783088309831083118312831383148315831683178318831983208321832283238324832583268327832883298330833183328333833483358336833783388339834083418342834383448345834683478348834983508351835283538354835583568357835883598360836183628363836483658366836783688369837083718372837383748375837683778378837983808381838283838384838583868387838883898390839183928393839483958396839783988399840084018402840384048405840684078408840984108411841284138414841584168417841884198420842184228423842484258426842784288429843084318432843384348435843684378438843984408441844284438444844584468447844884498450845184528453845484558456845784588459846084618462846384648465846684678468846984708471847284738474847584768477847884798480848184828483848484858486848784888489849084918492849384948495849684978498849985008501850285038504850585068507850885098510851185128513851485158516851785188519852085218522852385248525852685278528852985308531853285338534853585368537853885398540854185428543854485458546854785488549855085518552855385548555855685578558855985608561856285638564856585668567856885698570857185728573857485758576857785788579858085818582858385848585858685878588858985908591859285938594859585968597859885998600860186028603860486058606860786088609861086118612861386148615861686178618861986208621862286238624862586268627862886298630863186328633863486358636863786388639864086418642864386448645864686478648864986508651865286538654865586568657865886598660866186628663866486658666866786688669867086718672867386748675867686778678867986808681868286838684868586868687868886898690869186928693869486958696869786988699870087018702870387048705870687078708870987108711871287138714871587168717871887198720872187228723872487258726872787288729873087318732873387348735873687378738873987408741874287438744874587468747874887498750875187528753875487558756875787588759876087618762876387648765876687678768876987708771877287738774877587768777877887798780878187828783878487858786878787888789879087918792879387948795879687978798879988008801880288038804880588068807880888098810881188128813881488158816881788188819882088218822882388248825882688278828882988308831883288338834883588368837883888398840884188428843884488458846884788488849885088518852885388548855885688578858885988608861886288638864886588668867886888698870887188728873887488758876887788788879888088818882888388848885888688878888888988908891889288938894889588968897889888998900890189028903890489058906890789088909891089118912891389148915891689178918891989208921892289238924892589268927892889298930893189328933893489358936893789388939894089418942894389448945894689478948894989508951895289538954895589568957895889598960896189628963896489658966896789688969897089718972897389748975897689778978897989808981898289838984898589868987898889898990899189928993899489958996899789988999900090019002900390049005900690079008900990109011901290139014901590169017901890199020902190229023902490259026902790289029903090319032903390349035903690379038903990409041904290439044904590469047904890499050905190529053905490559056905790589059906090619062906390649065906690679068906990709071907290739074907590769077907890799080908190829083908490859086908790889089909090919092909390949095909690979098909991009101910291039104910591069107910891099110911191129113911491159116911791189119912091219122912391249125912691279128912991309131913291339134913591369137913891399140914191429143914491459146914791489149915091519152915391549155915691579158915991609161916291639164916591669167916891699170917191729173917491759176917791789179918091819182918391849185918691879188918991909191919291939194919591969197919891999200920192029203920492059206920792089209921092119212921392149215921692179218921992209221922292239224922592269227922892299230923192329233923492359236923792389239924092419242924392449245924692479248924992509251925292539254925592569257925892599260926192629263926492659266926792689269927092719272927392749275927692779278927992809281928292839284928592869287928892899290929192929293929492959296929792989299930093019302930393049305930693079308930993109311931293139314931593169317931893199320932193229323932493259326932793289329933093319332933393349335933693379338933993409341934293439344934593469347934893499350935193529353935493559356935793589359936093619362936393649365936693679368936993709371937293739374937593769377937893799380938193829383938493859386938793889389939093919392939393949395939693979398939994009401940294039404940594069407940894099410941194129413941494159416941794189419942094219422942394249425942694279428942994309431943294339434943594369437943894399440944194429443944494459446944794489449945094519452945394549455945694579458945994609461946294639464946594669467946894699470947194729473947494759476947794789479948094819482948394849485948694879488948994909491949294939494949594969497949894999500950195029503950495059506950795089509951095119512951395149515951695179518951995209521952295239524952595269527952895299530953195329533953495359536953795389539954095419542954395449545954695479548954995509551955295539554955595569557955895599560956195629563956495659566956795689569957095719572957395749575957695779578957995809581958295839584958595869587958895899590959195929593959495959596959795989599960096019602960396049605960696079608960996109611961296139614961596169617961896199620962196229623962496259626962796289629963096319632963396349635963696379638963996409641964296439644964596469647964896499650965196529653965496559656965796589659966096619662966396649665966696679668966996709671967296739674967596769677967896799680968196829683968496859686968796889689969096919692969396949695969696979698969997009701970297039704970597069707970897099710971197129713971497159716971797189719972097219722972397249725972697279728972997309731973297339734973597369737973897399740974197429743974497459746974797489749975097519752975397549755975697579758975997609761976297639764976597669767976897699770977197729773977497759776977797789779978097819782978397849785978697879788978997909791979297939794979597969797979897999800980198029803980498059806980798089809981098119812981398149815981698179818981998209821982298239824982598269827982898299830983198329833983498359836983798389839984098419842984398449845984698479848984998509851985298539854985598569857985898599860986198629863986498659866986798689869987098719872987398749875987698779878987998809881988298839884988598869887988898899890989198929893989498959896989798989899990099019902990399049905990699079908990999109911991299139914991599169917991899199920992199229923992499259926992799289929993099319932993399349935993699379938993999409941994299439944994599469947994899499950995199529953995499559956995799589959996099619962996399649965996699679968996999709971997299739974997599769977997899799980998199829983998499859986998799889989999099919992999399949995999699979998999910000100011000210003100041000510006100071000810009100101001110012100131001410015100161001710018100191002010021100221002310024100251002610027100281002910030100311003210033100341003510036100371003810039100401004110042100431004410045100461004710048100491005010051100521005310054100551005610057100581005910060100611006210063100641006510066100671006810069100701007110072100731007410075100761007710078100791008010081100821008310084100851008610087100881008910090100911009210093100941009510096100971009810099101001010110102101031010410105101061010710108101091011010111101121011310114101151011610117101181011910120101211012210123101241012510126101271012810129101301013110132101331013410135101361013710138101391014010141101421014310144101451014610147101481014910150101511015210153101541015510156101571015810159101601016110162101631016410165101661016710168101691017010171101721017310174101751017610177101781017910180101811018210183101841018510186101871018810189101901019110192101931019410195101961019710198101991020010201102021020310204102051020610207102081020910210102111021210213102141021510216102171021810219102201022110222102231022410225102261022710228102291023010231102321023310234102351023610237102381023910240102411024210243102441024510246102471024810249102501025110252102531025410255102561025710258102591026010261102621026310264102651026610267102681026910270102711027210273102741027510276102771027810279102801028110282102831028410285102861028710288102891029010291102921029310294102951029610297102981029910300103011030210303103041030510306103071030810309103101031110312103131031410315103161031710318103191032010321103221032310324103251032610327103281032910330103311033210333103341033510336103371033810339103401034110342103431034410345103461034710348103491035010351103521035310354103551035610357103581035910360103611036210363103641036510366103671036810369103701037110372103731037410375103761037710378103791038010381103821038310384103851038610387103881038910390103911039210393103941039510396103971039810399104001040110402104031040410405104061040710408104091041010411104121041310414104151041610417104181041910420104211042210423104241042510426104271042810429104301043110432104331043410435104361043710438104391044010441104421044310444104451044610447104481044910450104511045210453104541045510456104571045810459104601046110462104631046410465104661046710468104691047010471104721047310474104751047610477104781047910480104811048210483104841048510486104871048810489104901049110492104931049410495104961049710498104991050010501105021050310504105051050610507105081050910510105111051210513105141051510516105171051810519105201052110522105231052410525105261052710528105291053010531105321053310534105351053610537105381053910540105411054210543105441054510546105471054810549105501055110552105531055410555105561055710558105591056010561105621056310564105651056610567105681056910570105711057210573105741057510576105771057810579105801058110582105831058410585105861058710588105891059010591105921059310594105951059610597105981059910600106011060210603106041060510606106071060810609106101061110612106131061410615106161061710618106191062010621106221062310624106251062610627106281062910630106311063210633106341063510636106371063810639106401064110642106431064410645106461064710648106491065010651106521065310654106551065610657106581065910660106611066210663106641066510666106671066810669106701067110672106731067410675106761067710678106791068010681106821068310684106851068610687106881068910690106911069210693106941069510696106971069810699107001070110702107031070410705107061070710708107091071010711107121071310714107151071610717107181071910720107211072210723107241072510726107271072810729107301073110732107331073410735107361073710738107391074010741107421074310744107451074610747107481074910750107511075210753107541075510756107571075810759107601076110762107631076410765107661076710768107691077010771107721077310774107751077610777107781077910780107811078210783107841078510786107871078810789107901079110792107931079410795107961079710798107991080010801108021080310804108051080610807108081080910810108111081210813108141081510816108171081810819108201082110822108231082410825108261082710828108291083010831108321083310834108351083610837108381083910840108411084210843108441084510846108471084810849108501085110852108531085410855108561085710858108591086010861108621086310864108651086610867108681086910870108711087210873108741087510876108771087810879108801088110882108831088410885108861088710888108891089010891108921089310894108951089610897108981089910900109011090210903109041090510906109071090810909109101091110912109131091410915109161091710918109191092010921109221092310924109251092610927109281092910930109311093210933109341093510936109371093810939109401094110942109431094410945109461094710948109491095010951109521095310954109551095610957109581095910960109611096210963109641096510966109671096810969109701097110972109731097410975109761097710978109791098010981109821098310984109851098610987109881098910990109911099210993109941099510996109971099810999110001100111002110031100411005110061100711008110091101011011110121101311014110151101611017110181101911020110211102211023110241102511026110271102811029110301103111032110331103411035110361103711038110391104011041110421104311044110451104611047110481104911050110511105211053110541105511056110571105811059110601106111062110631106411065110661106711068110691107011071110721107311074110751107611077110781107911080110811108211083110841108511086110871108811089110901109111092110931109411095110961109711098110991110011101111021110311104111051110611107111081110911110111111111211113111141111511116111171111811119111201112111122111231112411125111261112711128111291113011131111321113311134111351113611137111381113911140111411114211143111441114511146111471114811149111501115111152111531115411155111561115711158111591116011161111621116311164111651116611167111681116911170111711117211173111741117511176111771117811179111801118111182111831118411185111861118711188111891119011191111921119311194111951119611197111981119911200112011120211203112041120511206112071120811209112101121111212112131121411215112161121711218112191122011221112221122311224112251122611227112281122911230112311123211233112341123511236112371123811239112401124111242112431124411245112461124711248112491125011251112521125311254112551125611257112581125911260112611126211263112641126511266112671126811269112701127111272112731127411275112761127711278112791128011281112821128311284112851128611287112881128911290112911129211293112941129511296112971129811299113001130111302113031130411305113061130711308113091131011311113121131311314113151131611317113181131911320113211132211323113241132511326113271132811329113301133111332113331133411335113361133711338113391134011341113421134311344113451134611347113481134911350113511135211353113541135511356113571135811359113601136111362113631136411365113661136711368113691137011371113721137311374113751137611377113781137911380113811138211383113841138511386113871138811389113901139111392113931139411395113961139711398113991140011401114021140311404114051140611407114081140911410114111141211413114141141511416114171141811419114201142111422114231142411425114261142711428114291143011431114321143311434114351143611437114381143911440114411144211443114441144511446114471144811449114501145111452114531145411455114561145711458114591146011461114621146311464114651146611467114681146911470114711147211473114741147511476114771147811479114801148111482114831148411485114861148711488114891149011491114921149311494114951149611497114981149911500115011150211503115041150511506115071150811509115101151111512115131151411515115161151711518115191152011521115221152311524115251152611527115281152911530115311153211533115341153511536115371153811539115401154111542115431154411545115461154711548115491155011551115521155311554115551155611557115581155911560115611156211563115641156511566115671156811569115701157111572115731157411575115761157711578115791158011581115821158311584115851158611587115881158911590115911159211593115941159511596115971159811599116001160111602116031160411605116061160711608116091161011611116121161311614116151161611617116181161911620116211162211623116241162511626116271162811629116301163111632116331163411635116361163711638116391164011641116421164311644116451164611647116481164911650116511165211653116541165511656116571165811659116601166111662116631166411665116661166711668116691167011671116721167311674116751167611677116781167911680116811168211683116841168511686116871168811689116901169111692116931169411695116961169711698116991170011701117021170311704117051170611707117081170911710117111171211713117141171511716117171171811719117201172111722117231172411725117261172711728117291173011731117321173311734117351173611737117381173911740117411174211743117441174511746117471174811749117501175111752117531175411755117561175711758117591176011761117621176311764117651176611767117681176911770117711177211773117741177511776117771177811779117801178111782117831178411785117861178711788117891179011791117921179311794117951179611797117981179911800118011180211803118041180511806118071180811809118101181111812118131181411815118161181711818118191182011821118221182311824118251182611827118281182911830118311183211833118341183511836118371183811839118401184111842118431184411845118461184711848118491185011851118521185311854118551185611857118581185911860118611186211863118641186511866118671186811869118701187111872118731187411875118761187711878118791188011881118821188311884118851188611887118881188911890118911189211893118941189511896118971189811899119001190111902119031190411905119061190711908119091191011911119121191311914119151191611917119181191911920119211192211923119241192511926119271192811929119301193111932119331193411935119361193711938119391194011941119421194311944119451194611947119481194911950119511195211953119541195511956119571195811959119601196111962119631196411965119661196711968119691197011971119721197311974119751197611977119781197911980119811198211983119841198511986119871198811989119901199111992119931199411995119961199711998119991200012001120021200312004120051200612007120081200912010120111201212013120141201512016120171201812019120201202112022120231202412025120261202712028120291203012031120321203312034120351203612037120381203912040120411204212043120441204512046120471204812049120501205112052120531205412055120561205712058120591206012061120621206312064120651206612067120681206912070120711207212073120741207512076120771207812079120801208112082120831208412085120861208712088120891209012091120921209312094120951209612097120981209912100121011210212103121041210512106121071210812109121101211112112121131211412115121161211712118121191212012121121221212312124121251212612127121281212912130121311213212133121341213512136121371213812139121401214112142121431214412145121461214712148121491215012151121521215312154121551215612157121581215912160121611216212163121641216512166121671216812169121701217112172121731217412175121761217712178121791218012181121821218312184121851218612187121881218912190121911219212193121941219512196121971219812199122001220112202122031220412205122061220712208122091221012211122121221312214122151221612217122181221912220122211222212223122241222512226122271222812229122301223112232122331223412235122361223712238122391224012241122421224312244122451224612247122481224912250122511225212253122541225512256122571225812259122601226112262122631226412265122661226712268122691227012271122721227312274122751227612277122781227912280122811228212283122841228512286122871228812289122901229112292122931229412295122961229712298122991230012301123021230312304123051230612307123081230912310123111231212313123141231512316123171231812319123201232112322123231232412325123261232712328123291233012331123321233312334123351233612337123381233912340123411234212343123441234512346123471234812349123501235112352123531235412355123561235712358123591236012361123621236312364123651236612367123681236912370123711237212373123741237512376123771237812379123801238112382123831238412385123861238712388123891239012391123921239312394123951239612397123981239912400124011240212403124041240512406124071240812409124101241112412124131241412415124161241712418124191242012421124221242312424124251242612427124281242912430124311243212433124341243512436124371243812439124401244112442124431244412445124461244712448124491245012451124521245312454124551245612457124581245912460124611246212463124641246512466124671246812469124701247112472124731247412475124761247712478124791248012481124821248312484124851248612487124881248912490124911249212493124941249512496124971249812499125001250112502125031250412505125061250712508125091251012511125121251312514125151251612517125181251912520125211252212523125241252512526125271252812529125301253112532125331253412535125361253712538125391254012541125421254312544125451254612547125481254912550125511255212553125541255512556125571255812559125601256112562125631256412565125661256712568125691257012571125721257312574125751257612577125781257912580125811258212583125841258512586125871258812589125901259112592125931259412595125961259712598125991260012601126021260312604126051260612607126081260912610126111261212613126141261512616126171261812619126201262112622126231262412625126261262712628126291263012631126321263312634126351263612637126381263912640126411264212643126441264512646126471264812649126501265112652126531265412655126561265712658126591266012661126621266312664126651266612667126681266912670126711267212673126741267512676126771267812679126801268112682126831268412685126861268712688126891269012691126921269312694126951269612697126981269912700127011270212703127041270512706127071270812709127101271112712127131271412715127161271712718127191272012721127221272312724127251272612727127281272912730127311273212733127341273512736127371273812739127401274112742127431274412745127461274712748127491275012751127521275312754127551275612757127581275912760127611276212763127641276512766127671276812769127701277112772127731277412775127761277712778127791278012781127821278312784127851278612787127881278912790127911279212793127941279512796127971279812799128001280112802128031280412805128061280712808128091281012811128121281312814128151281612817128181281912820128211282212823128241282512826128271282812829128301283112832128331283412835128361283712838128391284012841128421284312844128451284612847128481284912850128511285212853128541285512856128571285812859128601286112862128631286412865128661286712868128691287012871128721287312874128751287612877128781287912880128811288212883128841288512886128871288812889128901289112892128931289412895128961289712898128991290012901129021290312904129051290612907129081290912910129111291212913129141291512916129171291812919129201292112922129231292412925129261292712928129291293012931129321293312934129351293612937129381293912940129411294212943129441294512946129471294812949129501295112952129531295412955129561295712958129591296012961129621296312964129651296612967129681296912970129711297212973129741297512976129771297812979129801298112982129831298412985129861298712988129891299012991129921299312994129951299612997129981299913000130011300213003130041300513006130071300813009130101301113012130131301413015130161301713018130191302013021130221302313024130251302613027130281302913030130311303213033130341303513036130371303813039130401304113042130431304413045130461304713048130491305013051130521305313054130551305613057130581305913060130611306213063130641306513066130671306813069130701307113072130731307413075130761307713078130791308013081130821308313084130851308613087130881308913090130911309213093130941309513096130971309813099131001310113102131031310413105131061310713108131091311013111131121311313114131151311613117131181311913120131211312213123131241312513126131271312813129131301313113132131331313413135131361313713138131391314013141131421314313144131451314613147131481314913150131511315213153131541315513156131571315813159131601316113162131631316413165131661316713168131691317013171131721317313174131751317613177131781317913180131811318213183131841318513186131871318813189131901319113192131931319413195131961319713198131991320013201132021320313204132051320613207132081320913210132111321213213132141321513216132171321813219132201322113222132231322413225132261322713228132291323013231132321323313234132351323613237132381323913240132411324213243132441324513246132471324813249132501325113252132531325413255132561325713258132591326013261132621326313264132651326613267132681326913270132711327213273132741327513276132771327813279132801328113282132831328413285132861328713288132891329013291132921329313294132951329613297132981329913300133011330213303133041330513306133071330813309133101331113312133131331413315133161331713318133191332013321133221332313324133251332613327133281332913330133311333213333133341333513336133371333813339133401334113342133431334413345133461334713348133491335013351133521335313354133551335613357133581335913360133611336213363133641336513366133671336813369133701337113372133731337413375133761337713378133791338013381133821338313384133851338613387133881338913390133911339213393133941339513396133971339813399134001340113402134031340413405134061340713408134091341013411134121341313414134151341613417134181341913420134211342213423134241342513426134271342813429134301343113432134331343413435134361343713438134391344013441134421344313444134451344613447134481344913450134511345213453134541345513456134571345813459134601346113462134631346413465134661346713468134691347013471134721347313474134751347613477134781347913480134811348213483134841348513486134871348813489134901349113492134931349413495134961349713498134991350013501135021350313504135051350613507135081350913510135111351213513135141351513516135171351813519135201352113522135231352413525135261352713528135291353013531135321353313534135351353613537135381353913540135411354213543135441354513546135471354813549135501355113552135531355413555135561355713558135591356013561135621356313564135651356613567135681356913570135711357213573135741357513576135771357813579135801358113582135831358413585135861358713588135891359013591135921359313594135951359613597135981359913600136011360213603136041360513606136071360813609136101361113612136131361413615136161361713618136191362013621136221362313624136251362613627136281362913630136311363213633136341363513636136371363813639136401364113642136431364413645136461364713648136491365013651136521365313654136551365613657136581365913660136611366213663136641366513666136671366813669136701367113672136731367413675136761367713678136791368013681136821368313684136851368613687136881368913690136911369213693136941369513696136971369813699137001370113702137031370413705137061370713708137091371013711137121371313714137151371613717137181371913720137211372213723137241372513726137271372813729137301373113732137331373413735137361373713738137391374013741137421374313744137451374613747137481374913750137511375213753137541375513756137571375813759137601376113762137631376413765137661376713768137691377013771137721377313774137751377613777137781377913780137811378213783137841378513786137871378813789137901379113792137931379413795137961379713798137991380013801138021380313804138051380613807138081380913810138111381213813138141381513816138171381813819138201382113822138231382413825138261382713828138291383013831138321383313834138351383613837138381383913840138411384213843138441384513846138471384813849138501385113852138531385413855138561385713858138591386013861138621386313864138651386613867138681386913870138711387213873138741387513876138771387813879138801388113882138831388413885138861388713888138891389013891138921389313894138951389613897138981389913900139011390213903139041390513906139071390813909139101391113912139131391413915139161391713918139191392013921139221392313924139251392613927139281392913930139311393213933139341393513936139371393813939139401394113942139431394413945139461394713948139491395013951139521395313954139551395613957139581395913960139611396213963139641396513966139671396813969139701397113972139731397413975139761397713978139791398013981139821398313984139851398613987139881398913990139911399213993139941399513996139971399813999140001400114002140031400414005140061400714008140091401014011140121401314014140151401614017140181401914020140211402214023140241402514026140271402814029140301403114032140331403414035140361403714038140391404014041140421404314044140451404614047140481404914050140511405214053140541405514056140571405814059140601406114062140631406414065140661406714068140691407014071140721407314074140751407614077140781407914080140811408214083140841408514086140871408814089140901409114092140931409414095140961409714098140991410014101141021410314104141051410614107141081410914110141111411214113141141411514116141171411814119141201412114122141231412414125141261412714128141291413014131141321413314134141351413614137141381413914140141411414214143141441414514146141471414814149141501415114152141531415414155141561415714158141591416014161141621416314164141651416614167141681416914170141711417214173141741417514176141771417814179141801418114182141831418414185141861418714188141891419014191141921419314194141951419614197141981419914200142011420214203142041420514206142071420814209142101421114212142131421414215142161421714218142191422014221142221422314224142251422614227142281422914230142311423214233142341423514236142371423814239142401424114242142431424414245142461424714248142491425014251142521425314254142551425614257142581425914260142611426214263142641426514266142671426814269142701427114272142731427414275142761427714278142791428014281142821428314284142851428614287142881428914290142911429214293142941429514296142971429814299143001430114302143031430414305143061430714308143091431014311143121431314314143151431614317143181431914320143211432214323143241432514326143271432814329143301433114332143331433414335143361433714338143391434014341143421434314344143451434614347143481434914350143511435214353143541435514356143571435814359143601436114362143631436414365143661436714368143691437014371143721437314374143751437614377143781437914380143811438214383143841438514386143871438814389143901439114392143931439414395143961439714398143991440014401144021440314404144051440614407144081440914410144111441214413144141441514416144171441814419144201442114422144231442414425144261442714428144291443014431144321443314434144351443614437144381443914440144411444214443144441444514446144471444814449144501445114452144531445414455144561445714458144591446014461144621446314464144651446614467144681446914470144711447214473144741447514476144771447814479144801448114482144831448414485144861448714488144891449014491144921449314494144951449614497144981449914500145011450214503145041450514506145071450814509145101451114512145131451414515145161451714518145191452014521145221452314524145251452614527145281452914530145311453214533145341453514536145371453814539145401454114542145431454414545145461454714548145491455014551145521455314554145551455614557145581455914560145611456214563145641456514566145671456814569145701457114572145731457414575145761457714578145791458014581145821458314584145851458614587145881458914590145911459214593145941459514596145971459814599146001460114602146031460414605146061460714608146091461014611146121461314614146151461614617146181461914620146211462214623146241462514626146271462814629146301463114632146331463414635146361463714638146391464014641146421464314644146451464614647146481464914650146511465214653146541465514656146571465814659146601466114662146631466414665146661466714668146691467014671146721467314674146751467614677146781467914680146811468214683146841468514686146871468814689146901469114692146931469414695146961469714698146991470014701147021470314704147051470614707147081470914710147111471214713147141471514716147171471814719147201472114722147231472414725147261472714728147291473014731147321473314734
  1. MODULE FoxIntermediateBackend; (** AUTHOR ""; PURPOSE ""; *)
  2. IMPORT Basic := FoxBasic, SyntaxTree := FoxSyntaxTree, SemanticChecker := FoxSemanticChecker, Backend := FoxBackend, Global := FoxGlobal,
  3. Scanner := FoxScanner, IntermediateCode := FoxIntermediateCode, Sections := FoxSections, BinaryCode := FoxBinaryCode, Printout := FoxPrintout,
  4. SYSTEM, Diagnostics, Strings, Options, Streams, Compiler, Formats := FoxFormats, SymbolFileFormat := FoxTextualSymbolFile, D := Debugging,
  5. FingerPrinter := FoxFingerPrinter, StringPool, CRC;
  6. CONST
  7. (* operand modes *)
  8. ModeUndefined = 0;
  9. ModeReference = 1;
  10. ModeValue = 2;
  11. (* heap data offsets *)
  12. ArrayDimTable = 3; (* dimension table in dyn arrays *)
  13. (* math array offsets *)
  14. MathPtrOffset=0;
  15. MathAdrOffset=1;
  16. MathFlagsOffset=2;
  17. MathDimOffset=3;
  18. MathElementSizeOffset=4;
  19. MathLenOffset=5;
  20. MathIncrOffset=6;
  21. SysDataArrayOffset* = 0; (* array offset in system bl ock, for 32 byte alignment *)
  22. ArrDataArrayOffset*= 16*8; (* 16 bytes array offset in array block, to be compatible with the GC scheme of POINTER TO ARRAY OF ... *)
  23. TensorFlag* = 0; (* flag indicating a tensor array *)
  24. RangeFlag* = 1; (* flag indicating a range, e.g. an array derived from A[..,..] *)
  25. StackFlag* = 2; (* flag indicates temporary result *)
  26. StaticFlag* = 1; (* flag indicating a static array, may not be reallocated *)
  27. (** compiler generated traps *)
  28. WithTrap* = 1; (* generated when a WITH statement fails *)
  29. CaseTrap* = 2; (* generated when a case statement without else block fails *)
  30. ReturnTrap* = 3;
  31. TypeEqualTrap* = 5;
  32. TypeCheckTrap* = 6;
  33. IndexCheckTrap* = 7; (* generated when index is out of bounds or range is invalid *)
  34. AssertTrap* = 8; (* generated when an assert fails *)
  35. ArraySizeTrap* = 9;
  36. ArrayFormTrap*=10; (* indicates that array cannot be (re-)allocated since shape, type or size does not match *)
  37. SetElementTrap*=11; (* indicates that a set element is out of MIN(SET)...MAX(SET) *)
  38. NegativeDivisorTrap*=12;
  39. NoReturnTrap*=16; (* indicates that a procedure marked no return did return *)
  40. NilPointerTrap*=17; (* indicates that a nil pointer was being dereferenced *)
  41. Trace = FALSE;
  42. TraceRegisterUsageCount=TRUE;
  43. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  44. (** system call numbers *)
  45. NumberSystemCalls* = 12;
  46. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  47. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  48. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  49. DefaultRuntimeModuleName ="Runtime";
  50. DefaultTraceModuleName ="KernelLog";
  51. ChannelModuleName = "Channels";
  52. NonPointer = -1; (* special pointer values *)
  53. NoType = 0; (* special type info values *)
  54. LhsIsPointer = 0; (* for the operator kind *)
  55. RhsIsPointer = 1;
  56. (* priority values, lower means higher priority *)
  57. EntryPriority=-4;
  58. FirstPriority=-3;
  59. InitPriority=-2;
  60. ExitPriority=-1;
  61. BasePointerTypeSize = 5;
  62. BaseArrayTypeSize = BasePointerTypeSize + 3;
  63. LengthOffset = BasePointerTypeSize + 0;
  64. DataOffset = BasePointerTypeSize + 1;
  65. DescriptorOffset = BasePointerTypeSize + 2;
  66. BaseRecordTypeSize = BasePointerTypeSize + 2;
  67. ActionOffset = BasePointerTypeSize + 0;
  68. MonitorOffset = BasePointerTypeSize + 1;
  69. BaseObjectTypeSize = BaseRecordTypeSize;
  70. ActionTypeSize = 3;
  71. MonitorTypeSize = 7;
  72. ProcessorOffset = BaseObjectTypeSize + 1;
  73. StackLimitOffset* = BaseObjectTypeSize + 3;
  74. QuantumOffset = BaseObjectTypeSize + 4;
  75. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  76. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  77. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  78. Size2Flag = 4; (* size = 2 *)
  79. Size3Flag = 5; (* size = 3 *)
  80. Size4Flag = 6; (* size = 4 *)
  81. Size5Flag = 7; (* size = 5 *)
  82. Size6Flag = 8; (* size = 6 *)
  83. Size7Flag = 9; (* size = 7 *)
  84. Size8Flag = 10; (* size = 8 *)
  85. ReflectionSupport = TRUE;
  86. (* Solution for identifying procedure descriptors on the stack and for being able to differentiate "old school" stack frames from the underlying operating system stack frames:
  87. push a procedure desriptor plus one to where the BP pointer would be located. The misalignment of the procedure descriptor makes it possible to identify that it is not
  88. a base pointer but a procedure descriptor. The base pointer itself is in such cases located at BP + address size.
  89. *)
  90. (* I am not 100% sure if it is necessary or not -- so I keep a flag to be able to re-enable this *)
  91. ProtectModulesPointers = FALSE;
  92. CreateProcedureDescInfo = TRUE;
  93. WarningDynamicLoading = FALSE;
  94. TYPE
  95. Position=SyntaxTree.Position;
  96. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  97. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  98. Operand = RECORD
  99. mode: SHORTINT;
  100. op: IntermediateCode.Operand;
  101. tag: IntermediateCode.Operand;
  102. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  103. dimOffset: LONGINT;
  104. END;
  105. Fixup= POINTER TO RECORD
  106. pc: LONGINT;
  107. nextFixup: Fixup;
  108. END;
  109. WriteBackCall = POINTER TO RECORD
  110. call: SyntaxTree.ProcedureCallDesignator;
  111. next: WriteBackCall;
  112. END;
  113. Label= OBJECT
  114. VAR
  115. fixups: Fixup;
  116. section: IntermediateCode.Section;
  117. pc: LONGINT;
  118. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  119. BEGIN
  120. SELF.section := section; pc := -1;
  121. END InitLabel;
  122. PROCEDURE Resolve(pc: LONGINT);
  123. VAR at: LONGINT;
  124. BEGIN
  125. SELF.pc := pc;
  126. WHILE(fixups # NIL) DO
  127. at := fixups.pc;
  128. section.PatchAddress(at,pc);
  129. fixups := fixups.nextFixup;
  130. END;
  131. END Resolve;
  132. PROCEDURE AddFixup(at: LONGINT);
  133. VAR fixup: Fixup;
  134. BEGIN
  135. ASSERT(pc=-1);
  136. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  137. END AddFixup;
  138. END Label;
  139. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  140. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  141. VAR
  142. backend: IntermediateBackend;
  143. implementationVisitor: ImplementationVisitor;
  144. meta: MetaDataGenerator;
  145. system: Global.System;
  146. currentScope: SyntaxTree.Scope;
  147. module: Sections.Module;
  148. moduleSelf: SyntaxTree.Variable;
  149. dump: BOOLEAN;
  150. forceModuleBody: BOOLEAN;
  151. addressType: IntermediateCode.Type;
  152. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  153. BEGIN
  154. currentScope := NIL; module := NIL; moduleSelf := NIL;
  155. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  156. SELF.dump := dump;
  157. SELF.backend := backend;
  158. SELF.forceModuleBody := forceModuleBody;
  159. addressType := IntermediateCode.GetType(system,system.addressType)
  160. END Init;
  161. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  162. BEGIN
  163. backend.Error(module.module.sourceName, position, Diagnostics.Invalid, s);
  164. END Error;
  165. PROCEDURE Type(x: SyntaxTree.Type);
  166. BEGIN
  167. x.Accept(SELF);
  168. END Type;
  169. (** types **)
  170. PROCEDURE VisitBasicType(x: SyntaxTree.BasicType);
  171. BEGIN (* no code emission *) END VisitBasicType;
  172. PROCEDURE VisitCharacterType(x: SyntaxTree.CharacterType);
  173. BEGIN (* no code emission *) END VisitCharacterType;
  174. PROCEDURE VisitIntegerType(x: SyntaxTree.IntegerType);
  175. BEGIN (* no code emission *) END VisitIntegerType;
  176. PROCEDURE VisitFloatType(x: SyntaxTree.FloatType);
  177. BEGIN (* no code emission *) END VisitFloatType;
  178. PROCEDURE VisitComplexType(x: SyntaxTree.ComplexType);
  179. BEGIN (* no code emission *) END VisitComplexType;
  180. PROCEDURE VisitQualifiedType(x: SyntaxTree.QualifiedType);
  181. VAR type: SyntaxTree.Type;
  182. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  183. type := x.resolved;
  184. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  185. meta.CheckTypeDeclaration(type);
  186. END;
  187. END VisitQualifiedType;
  188. PROCEDURE VisitStringType(x: SyntaxTree.StringType);
  189. BEGIN (* no code emission *) END VisitStringType;
  190. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  191. BEGIN (* no code emission *)
  192. END VisitArrayRangeType;
  193. PROCEDURE VisitArrayType(x: SyntaxTree.ArrayType);
  194. BEGIN (* no code emission *) END VisitArrayType;
  195. PROCEDURE VisitPortType(x: SyntaxTree.PortType);
  196. BEGIN (* no code emission *) END VisitPortType;
  197. PROCEDURE VisitMathArrayType(x: SyntaxTree.MathArrayType);
  198. BEGIN
  199. meta.CheckTypeDeclaration(x);
  200. END VisitMathArrayType;
  201. PROCEDURE VisitPointerType(x: SyntaxTree.PointerType);
  202. BEGIN
  203. meta.CheckTypeDeclaration(x);
  204. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  205. END VisitPointerType;
  206. PROCEDURE VisitRecordType(x: SyntaxTree.RecordType);
  207. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  208. BEGIN (* no code emission *)
  209. meta.CheckTypeDeclaration(x);
  210. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  211. IF x.pointerType.typeDeclaration # NIL THEN
  212. td := x.pointerType.typeDeclaration
  213. ELSE
  214. td := x.typeDeclaration
  215. END;
  216. Global.GetSymbolName(td,name);
  217. (* code section for object *)
  218. END;
  219. Scope(x.recordScope);
  220. END VisitRecordType;
  221. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  222. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  223. BEGIN
  224. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  225. WHILE (this # NIL) & (this.identifier# id) DO
  226. this := this.nextModifier;
  227. END;
  228. RETURN this # NIL
  229. END HasFlag;
  230. PROCEDURE VisitCellType(x: SyntaxTree.CellType);
  231. VAR port,adr: LONGINT; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  232. BEGIN
  233. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  234. capabilities := {};
  235. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  236. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  237. backend.SetCapabilities(capabilities);
  238. IF ~implementationVisitor.checker.SkipImplementation(x) THEN
  239. Scope(x.cellScope);
  240. END;
  241. END VisitCellType;
  242. PROCEDURE VisitProcedureType(x: SyntaxTree.ProcedureType);
  243. BEGIN (* no code emission *) END VisitProcedureType;
  244. PROCEDURE VisitEnumerationType(x: SyntaxTree.EnumerationType);
  245. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  246. END VisitEnumerationType;
  247. (* symbols *)
  248. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  249. BEGIN
  250. Procedure(x);
  251. END VisitProcedure;
  252. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  253. BEGIN
  254. Procedure(x);
  255. END VisitOperator;
  256. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  257. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, dim, i: LONGINT;
  258. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  259. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  260. BEGIN
  261. type := type.resolved;
  262. IF type IS SyntaxTree.RecordType THEN
  263. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  264. ELSIF (type IS SyntaxTree.ArrayType) THEN
  265. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  266. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  267. END;
  268. ELSIF type IS SyntaxTree.MathArrayType THEN
  269. WITH type: SyntaxTree.MathArrayType DO
  270. IF type.form = SyntaxTree.Open THEN
  271. RETURN TRUE
  272. ELSIF type.form = SyntaxTree.Static THEN
  273. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  274. END;
  275. END;
  276. END;
  277. RETURN FALSE
  278. END TypeNeedsInitialization;
  279. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  280. VAR variable: SyntaxTree.Variable;
  281. BEGIN
  282. variable := scope.firstVariable;
  283. WHILE variable # NIL DO
  284. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  285. IF variable.initializer # NIL THEN RETURN TRUE END;
  286. variable := variable.nextVariable;
  287. END;
  288. RETURN FALSE
  289. END ScopeNeedsInitialization;
  290. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset:LONGINT);
  291. VAR size: LONGINT;
  292. BEGIN
  293. size := offset - lastUpdated;
  294. IF size > 0 THEN
  295. irv.Emit(Reserve(x.position,size));
  296. END;
  297. irv.Emit(Data(x.position, op));
  298. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  299. END SingleInitialize;
  300. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset:LONGINT);
  301. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable; i: LONGINT; size:LONGINT;
  302. BEGIN
  303. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  304. WITH type: SyntaxTree.RecordType DO
  305. baseType := type.baseType;
  306. IF baseType # NIL THEN
  307. baseType := baseType.resolved;
  308. IF baseType IS SyntaxTree.PointerType THEN
  309. baseType := baseType(SyntaxTree.PointerType).pointerBase
  310. END;
  311. Initialize(baseType,NIL, offset);
  312. END;
  313. variable := type.recordScope.firstVariable;
  314. WHILE variable # NIL DO
  315. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  316. variable := variable.nextVariable
  317. END;
  318. | type: SyntaxTree.ArrayType DO
  319. IF type.form = SyntaxTree.Static THEN
  320. baseType := type.arrayBase;
  321. IF TypeNeedsInitialization(baseType) THEN
  322. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  323. FOR i := 0 TO type.staticLength-1 DO
  324. Initialize(baseType,NIL,offset+i*size);
  325. END;
  326. END;
  327. END;
  328. | type: SyntaxTree.MathArrayType DO
  329. IF type.form = SyntaxTree.Open THEN
  330. dim := DynamicDim(type);
  331. baseType := SemanticChecker.ArrayBase(type,dim);
  332. imm := IntermediateCode.Immediate(addressType,dim);
  333. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  334. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  335. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  336. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  337. (* flags remain empty (=0) for open array *)
  338. ELSIF type.form = SyntaxTree.Static THEN
  339. baseType := type.arrayBase;
  340. IF TypeNeedsInitialization(baseType) THEN
  341. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  342. ASSERT(type.staticLength < 1024*1024*1024);
  343. FOR i := 0 TO type.staticLength-1 DO
  344. Initialize(baseType,NIL,offset+i*size);
  345. END;
  346. END;
  347. END;
  348. ELSE
  349. IF initializer # NIL THEN
  350. implementationVisitor.Evaluate(initializer, op);
  351. SingleInitialize(op.op, offset);
  352. END;
  353. END;
  354. END Initialize;
  355. BEGIN
  356. IF x.externalName # NIL THEN RETURN END;
  357. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  358. (* code section for variable *)
  359. Global.GetSymbolSegmentedName(x,name);
  360. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  361. irv.SetExported(IsExported(x));
  362. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  363. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  364. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  365. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  366. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  367. FOR i := 0 TO DynamicDim(x.type)-1 DO
  368. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  369. END;
  370. ELSE
  371. lastUpdated:= 0;
  372. IF implementationVisitor.newObjectFile & ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  373. Initialize(x.type, x.initializer, 0);
  374. END;
  375. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  376. IF size > 0 THEN
  377. irv.Emit(Reserve(x.position,size));
  378. END;
  379. IF ~x.fixed THEN
  380. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  381. ELSE
  382. align := x.alignment;
  383. END;
  384. irv.SetPositionOrAlignment(x.fixed, align);
  385. meta.CheckTypeDeclaration(x.type);
  386. END;
  387. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  388. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  389. END;
  390. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  391. END VisitVariable;
  392. PROCEDURE VisitProperty(x: SyntaxTree.Property);
  393. BEGIN
  394. VisitVariable(x)
  395. END VisitProperty;
  396. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  397. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i, dim: LONGINT;
  398. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  399. BEGIN
  400. ASSERT(currentScope IS SyntaxTree.CellScope);
  401. Global.GetSymbolSegmentedName(x,name);
  402. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  403. irv.SetExported(IsExported(x));
  404. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  405. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  406. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  407. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  408. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  409. FOR i := 0 TO DynamicDim(x.type)-1 DO
  410. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  411. END;
  412. ELSE
  413. lastUpdated:= 0;
  414. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  415. IF size > 0 THEN
  416. irv.Emit(Reserve(x.position,size));
  417. END;
  418. IF ~x.fixed THEN
  419. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  420. ELSE
  421. align := x.alignment;
  422. END;
  423. irv.SetPositionOrAlignment(x.fixed, align);
  424. meta.CheckTypeDeclaration(x.type);
  425. END;
  426. END VisitParameter;
  427. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  428. BEGIN
  429. Type(x.declaredType); (* => code in objects *)
  430. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  431. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  432. END;
  433. END VisitTypeDeclaration;
  434. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  435. BEGIN
  436. IF (SyntaxTree.Public * x.access # {}) THEN
  437. implementationVisitor.VisitConstant(x);
  438. END;
  439. END VisitConstant;
  440. PROCEDURE Scope(x: SyntaxTree.Scope);
  441. VAR procedure: SyntaxTree.Procedure;
  442. constant: SyntaxTree.Constant;
  443. variable: SyntaxTree.Variable;
  444. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  445. cell: SyntaxTree.CellType;
  446. parameter: SyntaxTree.Parameter;
  447. property: SyntaxTree.Property;
  448. BEGIN
  449. prevScope := currentScope;
  450. currentScope := x;
  451. (* constants treated in implementation visitor *)
  452. WITH x: SyntaxTree.CellScope DO
  453. cell := x.ownerCell;
  454. parameter := cell.firstParameter;
  455. WHILE parameter # NIL DO
  456. VisitParameter(parameter);
  457. parameter := parameter.nextParameter;
  458. END;
  459. property := cell.firstProperty;
  460. WHILE property # NIL DO
  461. VisitProperty(property);
  462. property := property.nextProperty;
  463. END;
  464. ELSE
  465. END;
  466. typeDeclaration := x.firstTypeDeclaration;
  467. WHILE typeDeclaration # NIL DO
  468. VisitTypeDeclaration(typeDeclaration);
  469. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  470. END;
  471. variable := x.firstVariable;
  472. WHILE variable # NIL DO
  473. VisitVariable(variable);
  474. variable := variable.nextVariable;
  475. END;
  476. procedure := x.firstProcedure;
  477. WHILE procedure # NIL DO
  478. VisitProcedure(procedure);
  479. procedure := procedure.nextProcedure;
  480. END;
  481. constant := x.firstConstant;
  482. WHILE constant # NIL DO
  483. VisitConstant(constant);
  484. constant := constant.nextConstant;
  485. END;
  486. currentScope := prevScope;
  487. END Scope;
  488. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  489. VAR parameter: SyntaxTree.Parameter;
  490. BEGIN
  491. parameter := first;
  492. WHILE parameter # NIL DO
  493. VisitParameter(parameter);
  494. parameter := parameter.nextParameter;
  495. END;
  496. END Parameters;
  497. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  498. VAR scope: SyntaxTree.ProcedureScope;
  499. prevScope: SyntaxTree.Scope;
  500. inline, finalizer: BOOLEAN;
  501. procedureType: SyntaxTree.ProcedureType;
  502. pc: LONGINT;
  503. stackSize: LONGINT;
  504. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  505. null,size,src,dest,fp,res: IntermediateCode.Operand;
  506. cc: LONGINT;
  507. cellType: SyntaxTree.CellType;
  508. registerNumber: LONGINT;
  509. registerParameter: Backend.Registers;
  510. registerParameters: LONGINT;
  511. registerClass: IntermediateCode.RegisterClass;
  512. type: IntermediateCode.Type;
  513. formalParameter: SyntaxTree.Parameter;
  514. recordType: SyntaxTree.RecordType;
  515. isModuleBody: BOOLEAN;
  516. parametersSize: LONGINT;
  517. position: LONGINT;
  518. PROCEDURE Signature;
  519. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  520. BEGIN
  521. procedureType := x.type(SyntaxTree.ProcedureType);
  522. returnType := procedureType.returnType;
  523. IF returnType # NIL THEN
  524. meta.CheckTypeDeclaration(returnType)
  525. END;
  526. parameter := procedureType.firstParameter;
  527. WHILE parameter # NIL DO
  528. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  529. parameter := parameter.nextParameter;
  530. END;
  531. END Signature;
  532. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  533. VAR result: BOOLEAN;
  534. BEGIN
  535. result := FALSE;
  536. IF x = SyntaxTree.invalidExpression THEN
  537. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  538. result := TRUE;
  539. value := x.resolved(SyntaxTree.IntegerValue).value;
  540. ELSE
  541. Error(x.position,"expression is not an integer constant");
  542. END;
  543. RETURN result;
  544. END CheckIntegerValue;
  545. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  546. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  547. BEGIN
  548. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  549. WHILE (this # NIL) & (this.identifier # id) DO
  550. this := this.nextModifier;
  551. END;
  552. IF this # NIL THEN
  553. IF this.expression = NIL THEN
  554. Error(this.position,"expected expression value");
  555. ELSIF CheckIntegerValue(this.expression,value) THEN
  556. END;
  557. RETURN TRUE
  558. ELSE RETURN FALSE
  559. END;
  560. END HasValue;
  561. CONST DefaultDataMemorySize=512;
  562. BEGIN
  563. IF x.externalName # NIL THEN RETURN END;
  564. (*
  565. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  566. *)
  567. (* code section for this procedure *)
  568. position := x.position.start;
  569. scope := x.procedureScope;
  570. prevScope := currentScope;
  571. currentScope := scope;
  572. procedureType := x.type(SyntaxTree.ProcedureType);
  573. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  574. implementationVisitor.temporaries.Init;
  575. implementationVisitor.usedRegisters := NIL;
  576. implementationVisitor.registerUsageCount.Init;
  577. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  578. IF (scope.body # NIL) & (x.isInline) THEN
  579. inline := TRUE;
  580. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  581. ir.SetExported(IsExported(x));
  582. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  583. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  584. IF backend.cellsAreObjects THEN
  585. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  586. ir.SetExported(IsExported(x));
  587. ELSE
  588. RETURN; (* cellnet cannot be compiled for final static hardware *)
  589. END;
  590. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  591. inline := FALSE;
  592. AddBodyCallStub(x);
  593. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  594. ir.SetExported(IsExported(x));
  595. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  596. inline := FALSE;
  597. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  598. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := DefaultDataMemorySize END;
  599. AddBodyCallStub(x);
  600. AddStackAllocation(x,stackSize);
  601. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  602. ir.SetExported(IsExported(x));
  603. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  604. inline := FALSE;
  605. Parameters(procedureType.firstParameter);
  606. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  607. ir.SetExported(IsExported(x));
  608. ELSE
  609. inline := FALSE;
  610. IF x.isEntry OR x.isExit THEN
  611. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,x,dump);
  612. ir.SetExported(TRUE);
  613. IF x.isEntry THEN ir.SetPriority(EntryPriority) ELSE ir.SetPriority(ExitPriority) END;
  614. ELSE
  615. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  616. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  617. END;
  618. END;
  619. cc := procedureType.callingConvention;
  620. IF cc = SyntaxTree.WinAPICallingConvention THEN
  621. parametersSize := ProcedureParametersSize(backend.system,x);
  622. ELSE
  623. parametersSize := 0;
  624. END;
  625. IF scope.body # NIL THEN
  626. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  627. registerNumber := 0;
  628. IF ~inline THEN
  629. IF scope.lastVariable = NIL THEN
  630. stackSize := 0
  631. ELSE
  632. stackSize := scope.lastVariable.offsetInBits;
  633. IF stackSize <0 THEN stackSize := -stackSize END;
  634. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  635. END;
  636. (*
  637. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  638. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  639. *)
  640. (*
  641. ir.Emit(Nop(position)); (* placeholder for fill *)
  642. *)
  643. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  644. registerParameter := backend.GetParameterRegisters(procedureType.callingConvention);
  645. IF registerParameter = NIL THEN registerParameters := 0
  646. ELSE registerParameters := LEN(registerParameter)
  647. END;
  648. (* assumption: registers are passed left to right and left parameters are in registers *)
  649. formalParameter := procedureType.firstParameter;
  650. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  651. IF ~PassInRegister(formalParameter) THEN
  652. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  653. ELSE
  654. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, registerParameter[registerNumber]);
  655. IF formalParameter.type.IsRecordType() THEN
  656. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  657. type := addressType;
  658. ELSE
  659. type := GetType(system, formalParameter.type);
  660. END;
  661. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  662. IntermediateCode.InitMemory(dest,type,implementationVisitor.sp,ToMemoryUnits(system,formalParameter.offsetInBits - system.addressSize));
  663. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  664. implementationVisitor.ReleaseIntermediateOperand(src);
  665. INC(registerNumber);
  666. formalParameter := formalParameter.nextParameter;
  667. END;
  668. END;
  669. END;
  670. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  671. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  672. END;
  673. pc := ir.pc-1;
  674. END;
  675. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  676. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  677. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  678. IF scope.lastVariable # NIL THEN
  679. stackSize := scope.lastVariable.offsetInBits;
  680. IF stackSize <0 THEN stackSize := -stackSize END;
  681. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  682. END;
  683. END;
  684. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  685. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  686. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  687. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  688. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  689. ir.EmitAt(pc,Push(size));
  690. implementationVisitor.StaticCallOperand(result,procedure);
  691. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  692. END;
  693. *)
  694. END;
  695. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  696. IF stackSize > 0 THEN
  697. IF (stackSize MOD system.addressSize = 0) THEN
  698. null := IntermediateCode.Immediate(addressType,0);
  699. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  700. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  701. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  702. ELSE
  703. null := IntermediateCode.Immediate(int8,0);
  704. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  705. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  706. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  707. END;
  708. (*! should potentially be called by backend -- enter might initialize
  709. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  710. *)
  711. END;
  712. IF procedureType.callingConvention = SyntaxTree.WinAPICallingConvention THEN
  713. parametersSize := ProcedureParametersSize(backend.system,x);
  714. ELSE
  715. parametersSize := 0;
  716. END;
  717. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  718. finalizer := FALSE;
  719. IF backend.cooperative & x.isFinalizer THEN
  720. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  721. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  722. GetRecordTypeName(recordType,name);
  723. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  724. END;
  725. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  726. IF backend.cooperative THEN
  727. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  728. IF implementationVisitor.profile & ~isModuleBody THEN
  729. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  730. END;
  731. END;
  732. implementationVisitor.EmitLeave(ir, x.position,x,cc);
  733. IF finalizer THEN
  734. IF backend.hasLinkRegister THEN
  735. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  736. END;
  737. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  738. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  739. ir.Emit(Br(x.position,dest));
  740. ELSE
  741. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  742. END;
  743. ELSE
  744. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  745. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  746. END;
  747. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  748. IF backend.cooperative THEN
  749. IF HasPointers (scope) THEN
  750. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  751. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  752. ir.Emit(Result(x.position, res));
  753. ir.Emit(Push(x.position, res));
  754. implementationVisitor.ResetVariables(scope);
  755. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  756. ir.Emit(Pop(x.position, res));
  757. ir.Emit(Return(x.position, res));
  758. ELSE
  759. implementationVisitor.ResetVariables(scope);
  760. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  761. END;
  762. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  763. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  764. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  765. ir.Emit(Result(x.position, res));
  766. ir.Emit(Push(x.position, res));
  767. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  768. ir.Emit(Pop(x.position, res));
  769. ir.Emit(Return(x.position, res));
  770. ELSE
  771. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  772. END;
  773. END;
  774. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  775. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  776. ELSE
  777. ir.Emit(Nop(x.position));
  778. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  779. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  780. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  781. END;
  782. END;
  783. END
  784. END;
  785. ELSE (* force body for procedures *)
  786. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  787. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  788. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  789. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  790. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  791. END;
  792. Scope(scope);
  793. Signature;
  794. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  795. currentScope := prevScope;
  796. END Procedure;
  797. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  798. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  799. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  800. BEGIN
  801. ASSERT (bodyProcedure # NIL);
  802. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  803. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  804. procedure.SetScope(bodyProcedure.scope);
  805. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  806. procedure.SetAccess(SyntaxTree.Hidden);
  807. Global.GetSymbolSegmentedName (procedure,name);
  808. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  809. ir.SetExported(TRUE);
  810. ir.SetPriority(InitPriority);
  811. Global.GetSymbolSegmentedName (bodyProcedure,name);
  812. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  813. implementationVisitor.currentScope := module.module.moduleScope;
  814. implementationVisitor.section := ir;
  815. implementationVisitor.PushSelfPointer();
  816. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  817. ELSIF backend.preregisterStatic THEN
  818. implementationVisitor.currentScope := module.module.moduleScope;
  819. implementationVisitor.section := ir;
  820. implementationVisitor.PushSelfPointer();
  821. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  822. ELSE
  823. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  824. ir.Emit(Call(bodyProcedure.position,op, 0));
  825. END;
  826. END AddBodyCallStub;
  827. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  828. VAR name: Basic.SegmentedName;
  829. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  830. BEGIN
  831. Global.GetSymbolSegmentedName (symbol,name);
  832. Basic.RemoveSuffix(name);
  833. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  834. ir := implementationVisitor.NewSection(module.allSections,Sections.InitCodeSection,name,NIL,dump);
  835. ir.SetExported(TRUE);
  836. ir.SetPriority(FirstPriority);
  837. IntermediateCode.InitImmediate(op,addressType,initStack);
  838. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  839. END AddStackAllocation;
  840. (** entry function to visit a complete module *)
  841. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  842. VAR
  843. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  844. hasDynamicOperatorDeclarations: BOOLEAN;
  845. operator: SyntaxTree.Operator;
  846. import: SyntaxTree.Import;
  847. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  848. BEGIN
  849. type := type.resolved;
  850. IF type IS SyntaxTree.RecordType THEN
  851. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  852. ELSIF (type IS SyntaxTree.ArrayType) THEN
  853. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  854. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  855. END;
  856. ELSIF type IS SyntaxTree.MathArrayType THEN
  857. WITH type: SyntaxTree.MathArrayType DO
  858. IF type.form = SyntaxTree.Open THEN
  859. RETURN TRUE
  860. ELSIF type.form = SyntaxTree.Static THEN
  861. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  862. END;
  863. END;
  864. END;
  865. RETURN FALSE
  866. END TypeNeedsInitialization;
  867. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  868. VAR variable: SyntaxTree.Variable;
  869. BEGIN
  870. variable := scope.firstVariable;
  871. WHILE variable # NIL DO
  872. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  873. IF variable.initializer # NIL THEN RETURN TRUE END;
  874. variable := variable.nextVariable;
  875. END;
  876. RETURN FALSE
  877. END ScopeNeedsInitialization;
  878. BEGIN
  879. ASSERT(x # NIL); ASSERT(module # NIL);
  880. SELF.module := module;
  881. (* add import names to the generated Sections.Module *)
  882. import := x.moduleScope.firstImport;
  883. WHILE import # NIL DO
  884. import.module.GetName(idstr);
  885. module.imports.AddName(idstr);
  886. import := import.nextImport
  887. END;
  888. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  889. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  890. moduleSelf := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@moduleSelf"));
  891. moduleSelf.SetType(system.anyType);
  892. moduleSelf.SetScope(x.moduleScope);
  893. moduleSelf.SetUntraced(TRUE);
  894. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  895. ir.SetExported(TRUE);
  896. IntermediateCode.InitImmediate(op,addressType,0);
  897. ir.Emit(Data(Basic.invalidPosition,op));
  898. END;
  899. implementationVisitor.module := module;
  900. implementationVisitor.moduleScope := x.moduleScope;
  901. implementationVisitor.moduleSelf := moduleSelf;
  902. implementationVisitor.canBeLoaded := TRUE;
  903. meta.SetModule(module);
  904. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  905. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  906. END;
  907. IF backend.profile THEN
  908. EnsureBodyProcedure(x.moduleScope);
  909. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  910. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  911. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  912. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  913. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  914. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0,0);
  915. Global.GetModuleName(module.module,idstr);
  916. implementationVisitor.ProfilerAddModule(idstr);
  917. implementationVisitor.numberProcedures := 0;
  918. END;
  919. implementationVisitor.profile := backend.profile;
  920. (* check if there is at least one dynamic operator locally defined *)
  921. hasDynamicOperatorDeclarations := FALSE;
  922. operator := x.moduleScope.firstOperator;
  923. WHILE operator # NIL DO
  924. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  925. operator := operator.nextOperator
  926. END;
  927. (* add operator initialization code section *)
  928. IF hasDynamicOperatorDeclarations THEN
  929. EnsureBodyProcedure(x.moduleScope);
  930. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  931. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  932. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0,0);
  933. END;
  934. Scope(x.moduleScope);
  935. IF hasDynamicOperatorDeclarations THEN
  936. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  937. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  938. END;
  939. IF backend.profile THEN
  940. implementationVisitor.ProfilerPatchInit;
  941. END;
  942. END Module;
  943. END DeclarationVisitor;
  944. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  945. RegisterUsageCount*=OBJECT
  946. VAR used: UsedArray; count: LONGINT;
  947. PROCEDURE &Init;
  948. VAR i: LONGINT;
  949. BEGIN
  950. count := 0;
  951. IF used = NIL THEN NEW(used,64); END;
  952. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  953. END Init;
  954. PROCEDURE Grow;
  955. VAR new: UsedArray; size,i: LONGINT;
  956. BEGIN
  957. size := LEN(used)*2;
  958. NEW(new,size);
  959. FOR i := 0 TO LEN(used)-1 DO
  960. new[i].count := used[i].count;
  961. new[i].type := used[i].type;
  962. new[i].map := used[i].map
  963. END;
  964. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  965. used := new
  966. END Grow;
  967. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  968. BEGIN
  969. INC(count);
  970. IF count = LEN(used) THEN Grow END;
  971. used[count].type := type;
  972. used[count].class := class;
  973. used[count].map := count;
  974. RETURN count;
  975. END Next;
  976. PROCEDURE IncUse(register: LONGINT);
  977. BEGIN
  978. INC(used[register].count);
  979. (*
  980. IF (register = 1) & (count > 30) THEN
  981. D.TraceBack;
  982. END;
  983. *)
  984. END IncUse;
  985. PROCEDURE DecUse(register: LONGINT);
  986. BEGIN
  987. DEC(used[register].count);
  988. END DecUse;
  989. PROCEDURE Map(register: LONGINT): LONGINT;
  990. VAR map : LONGINT;
  991. BEGIN
  992. IF register > 0 THEN
  993. map := used[register].map;
  994. WHILE register # map DO register := map; map := used[register].map END;
  995. END;
  996. RETURN register
  997. END Map;
  998. PROCEDURE Use(register: LONGINT): LONGINT;
  999. BEGIN
  1000. IF register< LEN(used) THEN
  1001. RETURN used[register].count
  1002. ELSE
  1003. RETURN 0
  1004. END
  1005. END Use;
  1006. END RegisterUsageCount;
  1007. RegisterEntry = POINTER TO RECORD
  1008. prev,next: RegisterEntry;
  1009. register: LONGINT;
  1010. registerClass: IntermediateCode.RegisterClass;
  1011. type: IntermediateCode.Type;
  1012. END;
  1013. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1014. Variables = OBJECT (Basic.List)
  1015. VAR
  1016. inUse: VariableUse;
  1017. registerIndex: LONGINT;
  1018. nameIndex: LONGINT;
  1019. PROCEDURE & Init;
  1020. VAR i: LONGINT;
  1021. BEGIN
  1022. InitList(16);
  1023. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1024. registerIndex := 1024;
  1025. nameIndex := 0;
  1026. END Init;
  1027. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1028. VAR string: SyntaxTree.IdentifierString ;
  1029. BEGIN
  1030. COPY("@hiddenIRVar",string);
  1031. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1032. RETURN SyntaxTree.NewIdentifier(string);
  1033. END GetUID;
  1034. PROCEDURE GetUsage(VAR use: VariableUse);
  1035. BEGIN
  1036. use := inUse;
  1037. END GetUsage;
  1038. PROCEDURE SetUsage(CONST use: VariableUse);
  1039. BEGIN
  1040. inUse := use;
  1041. END SetUsage;
  1042. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1043. VAR any: ANY;
  1044. BEGIN
  1045. any := Get(i);;
  1046. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1047. END GetVariable;
  1048. PROCEDURE SetVariable(pos: LONGINT; v: SyntaxTree.Variable);
  1049. BEGIN
  1050. Set(pos, v);
  1051. END SetVariable;
  1052. PROCEDURE Occupy(pos: LONGINT);
  1053. BEGIN
  1054. INCL(inUse[pos DIV 32], pos MOD 32);
  1055. END Occupy;
  1056. PROCEDURE Occupied(pos: LONGINT): BOOLEAN;
  1057. BEGIN
  1058. RETURN (pos MOD 32) IN inUse[pos DIV 32];
  1059. END Occupied;
  1060. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1061. BEGIN
  1062. Occupy(Length());
  1063. Add(v);
  1064. END AddVariable;
  1065. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1066. BEGIN
  1067. t1 := t1.resolved;
  1068. t2 := t2.resolved;
  1069. RETURN t1.SameType(t2);
  1070. (*
  1071. the following needs testing
  1072. RETURN
  1073. (t1.SameType(t2))
  1074. OR
  1075. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1076. OR
  1077. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits = t2.sizeInBits)
  1078. OR
  1079. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1080. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1081. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1082. OR
  1083. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1084. (DynamicDim(t1) = DynamicDim(t2))
  1085. );
  1086. *)
  1087. END CompatibleType;
  1088. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1089. VAR var : SyntaxTree.Variable; i: LONGINT;
  1090. BEGIN
  1091. pos := Length();
  1092. FOR i := 0 TO pos-1 DO
  1093. IF ~(Occupied(i)) THEN
  1094. var := GetVariable(i);
  1095. IF CompatibleType(type, var.type) & (var.untraced = untraced) & ~(var.type.NeedsTrace()) THEN
  1096. pos := i;
  1097. Occupy(i);
  1098. RETURN var;
  1099. END;
  1100. END;
  1101. END;
  1102. RETURN NIL
  1103. END GetFreeVariable;
  1104. END Variables;
  1105. SymbolMap = POINTER TO RECORD
  1106. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1107. isAddress: BOOLEAN;
  1108. END;
  1109. SymbolMapper = OBJECT
  1110. VAR
  1111. first: SymbolMap;
  1112. PROCEDURE & Init;
  1113. BEGIN
  1114. first := NIL;
  1115. END Init;
  1116. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1117. VAR new: SymbolMap;
  1118. BEGIN
  1119. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1120. new.next := first; first := new;
  1121. END Add;
  1122. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1123. VAR s: SymbolMap;
  1124. BEGIN
  1125. s := first;
  1126. WHILE (s # NIL) & (s.this # this) DO
  1127. s := s.next
  1128. END;
  1129. RETURN s
  1130. END Get;
  1131. END SymbolMapper;
  1132. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1133. VAR
  1134. system: Global.System;
  1135. section: IntermediateCode.Section;
  1136. module: Sections.Module;
  1137. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1138. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1139. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1140. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1141. checker: SemanticChecker.Checker;
  1142. backend: IntermediateBackend;
  1143. meta: MetaDataGenerator;
  1144. position: Position;
  1145. moduleSelf: SyntaxTree.Variable;
  1146. (* variables for hand over of variables / temporary state *)
  1147. currentScope: SyntaxTree.Scope;
  1148. constantDeclaration : SyntaxTree.Symbol;
  1149. result: Operand; (* result of the most recent expression / statement *)
  1150. destination: IntermediateCode.Operand;
  1151. arrayDestinationTag: IntermediateCode.Operand;
  1152. arrayDestinationDimension:LONGINT;
  1153. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1154. conditional: BOOLEAN;
  1155. trueLabel, falseLabel, exitLabel: Label;
  1156. locked: BOOLEAN;
  1157. (*
  1158. usedRegisters: Registers;
  1159. *)
  1160. registerUsageCount: RegisterUsageCount;
  1161. usedRegisters: RegisterEntry;
  1162. (* useful operands and types *)
  1163. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1164. bool,addressType,setType, sizeType, lenType, byteType: IntermediateCode.Type;
  1165. commentPrintout: Printout.Printer;
  1166. dump: Streams.Writer;
  1167. tagsAvailable : BOOLEAN;
  1168. supportedInstruction: SupportedInstructionProcedure;
  1169. supportedImmediate: SupportedImmediateProcedure;
  1170. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1171. emitLabels: BOOLEAN;
  1172. runtimeModuleName : SyntaxTree.IdentifierString;
  1173. newObjectFile: BOOLEAN;
  1174. indexCounter: LONGINT;
  1175. profile: BOOLEAN;
  1176. profileId, profileInit: IntermediateCode.Section;
  1177. profileInitPatchPosition: LONGINT;
  1178. numberProcedures: LONGINT;
  1179. procedureResultDesignator : SyntaxTree.Designator;
  1180. operatorInitializationCodeSection: IntermediateCode.Section;
  1181. fingerPrinter: FingerPrinter.FingerPrinter;
  1182. temporaries: Variables;
  1183. canBeLoaded : BOOLEAN;
  1184. currentIsInline: BOOLEAN;
  1185. currentMapper: SymbolMapper;
  1186. currentInlineExit: Label;
  1187. moduleBodySection: IntermediateCode.Section;
  1188. NeedDescriptor : BOOLEAN;
  1189. cooperativeSwitches: BOOLEAN;
  1190. lastSwitchPC: LONGINT;
  1191. isUnchecked: BOOLEAN;
  1192. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1193. newObjectFile: BOOLEAN);
  1194. BEGIN
  1195. SELF.system := system;
  1196. SELF.runtimeModuleName := runtime;
  1197. currentScope := NIL;
  1198. hiddenPointerType := NIL;
  1199. delegatePointerType := NIL;
  1200. awaitProcCounter := 0;
  1201. labelId := 0; constId := 0; labelId := 0;
  1202. SELF.checker := checker;
  1203. SELF.backend := backend;
  1204. position := Basic.invalidPosition;
  1205. conditional := FALSE;
  1206. locked := FALSE;
  1207. InitOperand(result,ModeUndefined);
  1208. addressType := IntermediateCode.GetType(system,system.addressType);
  1209. setType := IntermediateCode.GetType(system,system.setType);
  1210. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1211. lenType := IntermediateCode.GetType(system, system.lenType);
  1212. byteType := IntermediateCode.GetType(system, system.byteType);
  1213. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1214. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1215. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1216. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1217. nil := IntermediateCode.Immediate(addressType,0);
  1218. one := IntermediateCode.Immediate(addressType,1);
  1219. IntermediateCode.InitOperand(destination);
  1220. tagsAvailable := TRUE;
  1221. supportedInstruction := supportedInstructionProcedure;
  1222. supportedImmediate := supportedImmediateProcedure;
  1223. inData := FALSE;
  1224. SELF.emitLabels := emitLabels;
  1225. IntermediateCode.InitOperand(arrayDestinationTag);
  1226. bool := IntermediateCode.GetType(system,system.booleanType);
  1227. IntermediateCode.InitImmediate(false,bool,0);
  1228. IntermediateCode.InitImmediate(true,bool,1);
  1229. SELF.newObjectFile := newObjectFile;
  1230. indexCounter := 0;
  1231. NEW(registerUsageCount);
  1232. usedRegisters := NIL;
  1233. procedureResultDesignator := NIL;
  1234. NEW(fingerPrinter);
  1235. NEW(temporaries);
  1236. currentIsInline := FALSE;
  1237. NeedDescriptor := FALSE;
  1238. isUnchecked := backend.noRuntimeChecks;
  1239. END Init;
  1240. TYPE Context = RECORD
  1241. section: IntermediateCode.Section;
  1242. registerUsageCount: RegisterUsageCount;
  1243. usedRegisters: RegisterEntry;
  1244. temporaries: Variables;
  1245. END;
  1246. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1247. VAR context: Context;
  1248. BEGIN
  1249. context.section := section;
  1250. context.registerUsageCount := registerUsageCount;
  1251. context.usedRegisters := usedRegisters;
  1252. section := new;
  1253. NEW(registerUsageCount);
  1254. NEW(temporaries);
  1255. usedRegisters := NIL;
  1256. RETURN context;
  1257. END SwitchContext;
  1258. PROCEDURE ReturnToContext(context: Context);
  1259. BEGIN
  1260. section := context.section;
  1261. registerUsageCount := context.registerUsageCount;
  1262. usedRegisters := context.usedRegisters;
  1263. temporaries := context.temporaries;
  1264. END ReturnToContext;
  1265. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1266. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1267. BEGIN
  1268. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1269. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1270. END;
  1271. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1272. section.SetExported(IsExported(syntaxTreeSymbol));
  1273. RETURN section
  1274. END NewSection;
  1275. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1276. VAR new: LONGINT;
  1277. BEGIN
  1278. new := registerUsageCount.Next(type,class);
  1279. UseRegister(new);
  1280. RETURN new
  1281. END AcquireRegister;
  1282. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1283. VAR
  1284. fingerPrint: SyntaxTree.FingerPrint;
  1285. fingerPrintString: ARRAY 32 OF CHAR;
  1286. BEGIN
  1287. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1288. string := "[";
  1289. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1290. Strings.Append(string, fingerPrintString);
  1291. Strings.Append(string, "]");
  1292. END GetFingerprintString;
  1293. (** get the name for the code section that represens a certain symbol
  1294. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1295. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1296. VAR string: ARRAY 32 OF CHAR;
  1297. BEGIN
  1298. Global.GetSymbolSegmentedName(symbol, name);
  1299. (* if the symbol is an operator, then append the fingerprint to the name *)
  1300. IF symbol IS SyntaxTree.Operator THEN
  1301. GetFingerprintString(symbol, string);
  1302. Basic.AppendToSegmentedName(name,string);
  1303. END
  1304. END GetCodeSectionNameForSymbol;
  1305. (** get the name for the code section that represens a certain symbol
  1306. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1307. PROCEDURE GetCodeSectionNameForSymbolInScope(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope; VAR name: ARRAY OF CHAR);
  1308. VAR string: ARRAY 32 OF CHAR;
  1309. BEGIN
  1310. Global.GetSymbolNameInScope(symbol, scope, name);
  1311. (* if the symbol is an operator, then append the fingerprint to the name *)
  1312. IF symbol IS SyntaxTree.Operator THEN
  1313. GetFingerprintString(symbol, string);
  1314. Strings.Append(name, string);
  1315. END
  1316. END GetCodeSectionNameForSymbolInScope;
  1317. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1318. BEGIN
  1319. IF dump # NIL THEN
  1320. dump.String("enter "); dump.String(s); dump.Ln;
  1321. END;
  1322. END TraceEnter;
  1323. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1324. BEGIN
  1325. IF dump # NIL THEN
  1326. dump.String("exit "); dump.String(s); dump.Ln;
  1327. END;
  1328. END TraceExit;
  1329. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1330. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1331. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1332. VAR i: LONGINT;
  1333. BEGIN
  1334. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1335. IF op.rule # NIL THEN
  1336. FOR i := 0 TO LEN(op.rule)-1 DO
  1337. CheckRegister(op.rule[i])
  1338. END;
  1339. END;
  1340. END CheckRegister;
  1341. BEGIN
  1342. CheckRegister(instruction.op1);
  1343. CheckRegister(instruction.op2);
  1344. CheckRegister(instruction.op3);
  1345. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1346. ELSE section.Emit(instruction);
  1347. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1348. END;
  1349. END Emit;
  1350. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1351. BEGIN
  1352. IF backend.cooperative THEN
  1353. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1354. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1355. ELSE
  1356. Emit(Trap(position,trapNo));
  1357. END;
  1358. END EmitTrap;
  1359. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1360. VAR name: Basic.SegmentedName;
  1361. VAR op1, op2, reg: IntermediateCode.Operand;
  1362. VAR call, nocall: Label;
  1363. VAR parametersSize: LONGINT;
  1364. VAR prevSection: IntermediateCode.Section;
  1365. VAR prevDump: Streams.Writer;
  1366. VAR body: SyntaxTree.Body;
  1367. VAR procedureType: SyntaxTree.ProcedureType;
  1368. BEGIN
  1369. IF procedure # NIL THEN
  1370. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1371. ELSE procedureType := NIL;
  1372. END;
  1373. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1374. prevSection := SELF.section;
  1375. SELF.section := section;
  1376. prevDump := dump;
  1377. dump := section.comments;
  1378. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1379. IF backend.hasLinkRegister THEN
  1380. Emit(Push(Basic.invalidPosition, lr));
  1381. END;
  1382. Emit(Push(Basic.invalidPosition,fp));
  1383. IF procedure # NIL THEN
  1384. body := procedure.procedureScope.body;
  1385. ELSE
  1386. body := NIL;
  1387. END;
  1388. IF backend.cooperative THEN
  1389. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1390. GetCodeSectionNameForSymbol(procedure, name);
  1391. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1392. ELSE
  1393. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1394. END;
  1395. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1396. IntermediateCode.AddOffset(op1, 1);
  1397. Emit(Push(Basic.invalidPosition,op1));
  1398. Emit(Mov(Basic.invalidPosition,fp, sp));
  1399. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1400. NEW(call, section);
  1401. NEW(nocall, section);
  1402. reg := NewRegisterOperand(addressType);
  1403. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1404. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1405. BrltL(call, sp, reg);
  1406. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1407. BrgeL(nocall, sp, op2);
  1408. call.Resolve(section.pc);
  1409. Emit(Push(Basic.invalidPosition, reg));
  1410. ReleaseIntermediateOperand(reg);
  1411. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1412. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1413. Emit(Push(Basic.invalidPosition, op2));
  1414. CallThis(position, "Activities","ExpandStack",2);
  1415. Emit(Result(Basic.invalidPosition, sp));
  1416. nocall.Resolve(section.pc);
  1417. END;
  1418. ELSE
  1419. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1420. Emit(Push(Basic.invalidPosition, one)) ;
  1421. procedureType.SetParametersOffset(1);
  1422. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1423. END;
  1424. Emit(Mov(Basic.invalidPosition, fp, sp));
  1425. END;
  1426. END;
  1427. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1428. SELF.section := prevSection;
  1429. dump := prevDump;
  1430. END EmitEnter;
  1431. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1432. VAR op1,op2: IntermediateCode.Operand;
  1433. VAR instruction: IntermediateCode.Instruction;
  1434. BEGIN
  1435. IntermediateCode.InitNumber(op1,callconv);
  1436. IntermediateCode.InitNumber(op2,varSize);
  1437. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1438. RETURN instruction
  1439. END Enter;
  1440. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1441. VAR op1: IntermediateCode.Operand;
  1442. VAR instruction: IntermediateCode.Instruction;
  1443. BEGIN
  1444. IntermediateCode.InitNumber(op1,callconv);
  1445. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1446. RETURN instruction
  1447. END Leave;
  1448. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1449. VAR prevSection: IntermediateCode.Section;
  1450. VAR op2, size: IntermediateCode.Operand;
  1451. VAR body: SyntaxTree.Body;
  1452. BEGIN
  1453. prevSection := SELF.section;
  1454. SELF.section := section;
  1455. Emit(Leave(position, callconv));
  1456. IF procedure # NIL THEN
  1457. body := procedure.procedureScope.body;
  1458. ELSE
  1459. body := NIL;
  1460. END;
  1461. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1462. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1463. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1464. Emit(Add(position, sp, fp, op2));
  1465. ELSE
  1466. Emit(Mov(position, sp, fp));
  1467. END;
  1468. Emit(Pop(position, fp));
  1469. END;
  1470. SELF.section := prevSection;
  1471. END EmitLeave;
  1472. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1473. VAR m: SymbolMap;
  1474. BEGIN
  1475. position := x.position;
  1476. IF currentIsInline THEN
  1477. m := currentMapper.Get(x);
  1478. IF m # NIL THEN
  1479. (*
  1480. Printout.Info("mapping from", x);
  1481. Printout.Info("mapping to ", m.to);
  1482. *)
  1483. m.to.Accept(SELF);
  1484. op := result;
  1485. IF m.tag # NIL THEN
  1486. ReleaseIntermediateOperand(result.tag);
  1487. m.tag.Accept(SELF);
  1488. op.tag := result.op;
  1489. ReleaseIntermediateOperand(result.tag);
  1490. END;
  1491. RETURN
  1492. END;
  1493. END;
  1494. x.Accept(SELF);
  1495. op := result;
  1496. END Symbol;
  1497. PROCEDURE Expression(x: SyntaxTree.Expression);
  1498. BEGIN
  1499. position := x.position;
  1500. constantDeclaration := NIL;
  1501. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1502. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1503. END;
  1504. IF x.resolved # NIL THEN
  1505. x.resolved.Accept(SELF)
  1506. ELSE
  1507. x.Accept(SELF)
  1508. END;
  1509. (* check this, was commented out in ActiveCells3 *)
  1510. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1511. Error(x.position, "unsupported modifier");
  1512. END;
  1513. END Expression;
  1514. (*
  1515. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1516. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1517. BEGIN
  1518. temporaries.GetUsage(current);
  1519. FOR i := 0 TO LEN(current)-1 DO
  1520. set := current[i] - previous[i];
  1521. IF set # {} THEN
  1522. FOR j := 0 TO MAX(SET)-1 DO
  1523. IF j IN set THEN
  1524. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1525. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1526. Symbol(variable, op);
  1527. MakeMemory(tmp,op.op,addressType,0);
  1528. ReleaseOperand(op);
  1529. Emit(Mov(position,tmp, nil ) );
  1530. ReleaseIntermediateOperand(tmp);
  1531. END;
  1532. END;
  1533. END;
  1534. END;
  1535. END;
  1536. END ResetUsedTemporaries;
  1537. *)
  1538. PROCEDURE Statement(x: SyntaxTree.Statement);
  1539. VAR use: VariableUse;
  1540. BEGIN
  1541. temporaries.GetUsage(use);
  1542. position := x.position;
  1543. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1544. IF commentPrintout # NIL THEN
  1545. commentPrintout.Statement(x);
  1546. dump.Ln;
  1547. (*dump.Update;*)
  1548. END;
  1549. x.Accept(SELF);
  1550. (*
  1551. CheckRegistersFree();
  1552. *)
  1553. (*ResetUsedTemporaries(use);*)
  1554. temporaries.SetUsage(use);
  1555. END Statement;
  1556. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1557. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1558. *)
  1559. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1560. BEGIN
  1561. ASSERT(op.mode # IntermediateCode.Undefined);
  1562. IF op.mode = IntermediateCode.ModeMemory THEN
  1563. ReuseCopy(res,op);
  1564. ELSE
  1565. res := op;
  1566. UseIntermediateOperand(res);
  1567. END;
  1568. IntermediateCode.AddOffset(res,offset);
  1569. IntermediateCode.MakeMemory(res,type);
  1570. END MakeMemory;
  1571. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1572. VAR mem: IntermediateCode.Operand;
  1573. BEGIN
  1574. MakeMemory(mem,res,type,offset);
  1575. ReleaseIntermediateOperand(res);
  1576. res := mem;
  1577. END ToMemory;
  1578. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1579. VAR mem: IntermediateCode.Operand;
  1580. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1581. componentType: SyntaxTree.Type;
  1582. BEGIN
  1583. type := type.resolved;
  1584. IF operand.mode = ModeReference THEN
  1585. IF type IS SyntaxTree.RangeType THEN
  1586. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1587. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1588. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1589. ReleaseOperand(operand);
  1590. operand.op := firstOp;
  1591. operand.tag := lastOp;
  1592. operand.extra := stepOp;
  1593. ELSIF type IS SyntaxTree.ComplexType THEN
  1594. componentType := type(SyntaxTree.ComplexType).componentType;
  1595. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1596. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1597. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1598. ReleaseOperand(operand);
  1599. operand.op := firstOp;
  1600. operand.tag := lastOp
  1601. ELSE
  1602. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1603. ReleaseIntermediateOperand(operand.op);
  1604. operand.op := mem;
  1605. END;
  1606. operand.mode := ModeValue;
  1607. END;
  1608. ASSERT(operand.mode = ModeValue);
  1609. END LoadValue;
  1610. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1611. VAR prevConditional: BOOLEAN;
  1612. BEGIN
  1613. prevConditional := conditional;
  1614. conditional := FALSE;
  1615. InitOperand(result, ModeUndefined);
  1616. Expression(x);
  1617. op := result;
  1618. LoadValue(op,x.type.resolved);
  1619. conditional := prevConditional;
  1620. END Evaluate;
  1621. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1622. VAR prevConditional: BOOLEAN;
  1623. BEGIN
  1624. prevConditional := conditional;
  1625. conditional := FALSE;
  1626. InitOperand(result,ModeUndefined);
  1627. Expression(x);
  1628. op := result;
  1629. (*
  1630. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1631. *)
  1632. conditional := prevConditional;
  1633. END Designate;
  1634. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1635. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1636. BEGIN
  1637. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1638. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1639. conditional := TRUE;
  1640. trueLabel := trueL; falseLabel := falseL;
  1641. Expression(x);
  1642. trueL := trueLabel; falseL := falseLabel;
  1643. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1644. END Condition;
  1645. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1646. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1647. BEGIN
  1648. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1649. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1650. RETURN op
  1651. END NewRegisterOperand;
  1652. PROCEDURE UnuseRegister(register: LONGINT);
  1653. BEGIN
  1654. IF (register > 0) THEN
  1655. register := registerUsageCount.Map(register);
  1656. registerUsageCount.DecUse(register);
  1657. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1658. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1659. END;
  1660. IF registerUsageCount.Use(register)=0 THEN
  1661. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1662. Warning(position, "register cannot be removed");
  1663. END;
  1664. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1665. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1666. END;
  1667. ELSIF registerUsageCount.Use(register)<0 THEN
  1668. Warning(position, "register removed too often");
  1669. IF dump # NIL THEN
  1670. dump.String("register removed too often"); dump.Ln; dump.Update;
  1671. END;
  1672. END;
  1673. END;
  1674. END UnuseRegister;
  1675. PROCEDURE UseRegister(register: LONGINT);
  1676. BEGIN
  1677. IF (register > 0) THEN
  1678. register := registerUsageCount.Map(register);
  1679. registerUsageCount.IncUse(register);
  1680. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1681. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1682. END;
  1683. IF registerUsageCount.Use(register)=1 THEN
  1684. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1685. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1686. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1687. END;
  1688. END;
  1689. END;
  1690. END UseRegister;
  1691. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1692. BEGIN
  1693. UnuseRegister(op.register)
  1694. END ReleaseIntermediateOperand;
  1695. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1696. BEGIN
  1697. UseRegister(op.register)
  1698. END UseIntermediateOperand;
  1699. PROCEDURE ReleaseOperand(CONST op: Operand);
  1700. BEGIN
  1701. UnuseRegister(op.op.register);
  1702. UnuseRegister(op.tag.register);
  1703. UnuseRegister(op.extra.register);
  1704. END ReleaseOperand;
  1705. (* save registers marked in array "markedRegisters" to the stack
  1706. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1707. *)
  1708. PROCEDURE SaveRegisters();
  1709. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1710. BEGIN
  1711. entry := usedRegisters;
  1712. WHILE entry # NIL DO
  1713. type := registerUsageCount.used[entry.register].type;
  1714. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1715. Emit(Push(position,op));
  1716. entry := entry.next;
  1717. END;
  1718. END SaveRegisters;
  1719. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1720. BEGIN
  1721. saved := usedRegisters;
  1722. usedRegisters := NIL;
  1723. END ReleaseUsedRegisters;
  1724. (** remove parameter registers from used queue *)
  1725. PROCEDURE ReleaseParameterRegisters;
  1726. VAR entry,prev,next: RegisterEntry;
  1727. BEGIN
  1728. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1729. WHILE entry # NIL DO
  1730. next := entry.next;
  1731. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1732. registerUsageCount.DecUse(entry.register);
  1733. ASSERT(registerUsageCount.Use(entry.register)=0);
  1734. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1735. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1736. END;
  1737. ELSIF prev = NIL THEN
  1738. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1739. ELSE
  1740. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1741. END;
  1742. entry := next;
  1743. END;
  1744. END ReleaseParameterRegisters;
  1745. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1746. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1747. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1748. BEGIN
  1749. entry := saved;
  1750. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1751. entry := prev;
  1752. WHILE entry # NIL DO
  1753. prev := entry.prev;
  1754. type := entry.type;
  1755. class := entry.registerClass;
  1756. IntermediateCode.InitRegister(op,type,class,entry.register);
  1757. (*
  1758. new := registerUsageCount.Next(type,class);
  1759. registerUsageCount.Remap(entry.register,new);
  1760. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1761. dump.String("remap register "); dump.Int(entry.register,1);
  1762. dump.String("to "); dump.Int(new,1);
  1763. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1764. END;
  1765. entry.register := new;
  1766. *)
  1767. Emit(Pop(position,op));
  1768. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1769. entry := prev;
  1770. END;
  1771. (*
  1772. usedRegisters := saved;
  1773. *)
  1774. END RestoreRegisters;
  1775. PROCEDURE CheckRegistersFree;
  1776. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1777. BEGIN
  1778. IF usedRegisters # NIL THEN
  1779. r := usedRegisters;
  1780. WHILE r # NIL DO
  1781. warning := "register ";
  1782. Strings.AppendInt(warning, r.register);
  1783. Strings.Append(warning, " not released.");
  1784. Warning(position,warning);
  1785. r := r .next;
  1786. END;
  1787. END;
  1788. FOR i := 0 TO registerUsageCount.count-1 DO
  1789. IF registerUsageCount.used[i].count < 0 THEN
  1790. warning := "register ";
  1791. Strings.AppendInt(warning, i);
  1792. Strings.Append(warning, " unused too often.");
  1793. Warning(position,warning);
  1794. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1795. warning := "register ";
  1796. Strings.AppendInt(warning, i);
  1797. Strings.Append(warning, " not unused often enough.");
  1798. Warning(position,warning);
  1799. END;
  1800. END;
  1801. END CheckRegistersFree;
  1802. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1803. Otherwise allocate a new register.
  1804. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1805. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1806. BEGIN
  1807. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1808. UseIntermediateOperand(result);
  1809. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1810. UseIntermediateOperand(result);
  1811. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1812. END;
  1813. END Reuse2;
  1814. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1815. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1816. If not then allocate a new register.
  1817. Does NOT necessarily keep the content of src1 or src2 in result!
  1818. *)
  1819. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1820. BEGIN
  1821. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1822. UseIntermediateOperand(result);
  1823. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1824. UseIntermediateOperand(result);
  1825. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1826. result := alternative; alternative := emptyOperand;
  1827. UseIntermediateOperand(result);
  1828. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1829. END;
  1830. END Reuse2a;
  1831. (* like reuse2 but only one source *)
  1832. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1833. BEGIN
  1834. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1835. UseIntermediateOperand(result);
  1836. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1837. END;
  1838. END Reuse1;
  1839. (* like reuse2a but only one source *)
  1840. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1841. BEGIN
  1842. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1843. UseIntermediateOperand(result);
  1844. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1845. UseIntermediateOperand(result);
  1846. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1847. END;
  1848. END Reuse1a;
  1849. (* like reuse1 but guarantees that content of src1 is in result *)
  1850. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1851. BEGIN
  1852. IF ReusableRegister(src1) THEN
  1853. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1854. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1855. UseIntermediateOperand(result);
  1856. ELSE
  1857. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1858. Emit(Mov(position,result,src1));
  1859. END
  1860. END ReuseCopy;
  1861. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1862. BEGIN
  1863. IF ReusableRegister(src) THEN
  1864. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1865. ELSE
  1866. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1867. Emit(Mov(position,result,src));
  1868. ReleaseIntermediateOperand(src);
  1869. END
  1870. END TransferToRegister;
  1871. (** labels and branches **)
  1872. PROCEDURE NewLabel(): Label;
  1873. VAR label: Label;
  1874. BEGIN
  1875. NEW(label,section); RETURN label;
  1876. END NewLabel;
  1877. PROCEDURE SetLabel(label: Label);
  1878. BEGIN label.Resolve(section.pc);
  1879. END SetLabel;
  1880. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1881. BEGIN
  1882. ASSERT(label # NIL);
  1883. IF label.pc < 0 THEN (* label not yet set *)
  1884. label.AddFixup(section.pc);
  1885. END;
  1886. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1887. END LabelOperand;
  1888. PROCEDURE BrL(label: Label);
  1889. BEGIN
  1890. Emit(Br(position,LabelOperand(label)));
  1891. END BrL;
  1892. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1893. BEGIN
  1894. Emit(Brge(position,LabelOperand(label),left,right));
  1895. END BrgeL;
  1896. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1897. BEGIN
  1898. Emit(Brlt(position,LabelOperand(label),left,right));
  1899. END BrltL;
  1900. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1901. BEGIN
  1902. Emit(Breq(position,LabelOperand(label),left,right));
  1903. END BreqL;
  1904. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1905. BEGIN
  1906. Emit(Brne(position,LabelOperand(label),left,right));
  1907. END BrneL;
  1908. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1909. VAR new: IntermediateCode.Operand;
  1910. BEGIN
  1911. IF Trace THEN TraceEnter("Convert") END;
  1912. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1913. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1914. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1915. & (operand.offset = 0)
  1916. THEN
  1917. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1918. Emit(Conv(position,new,operand));
  1919. ELSE
  1920. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1921. Emit(Conv(position,new,operand));
  1922. ReleaseIntermediateOperand(operand);
  1923. END;
  1924. operand := new;
  1925. 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
  1926. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1927. ELSE
  1928. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1929. Emit(Conv(position,new,operand));
  1930. ReleaseIntermediateOperand(operand);
  1931. operand := new;
  1932. END;
  1933. IF Trace THEN TraceExit("Convert") END;
  1934. END Convert;
  1935. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1936. VAR exit: Label;
  1937. BEGIN
  1938. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1939. exit := NewLabel();
  1940. br(exit,left,right);
  1941. EmitTrap(position,trapNo);
  1942. SetLabel(exit);
  1943. END TrapC;
  1944. (** expressions *)
  1945. (** emit necessary runtime check for set elements **)
  1946. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1947. VAR max: IntermediateCode.Operand;
  1948. BEGIN
  1949. IF isUnchecked THEN RETURN END;
  1950. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1951. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1952. TrapC(BrgeL, max, o, SetElementTrap);
  1953. END;
  1954. END CheckSetElement;
  1955. (** the set that a range represents **)
  1956. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1957. VAR
  1958. operand: Operand;
  1959. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1960. BEGIN
  1961. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1962. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1963. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1964. one := IntermediateCode.Immediate(setType, 1);
  1965. Evaluate(x, operand);
  1966. Convert(operand.op, setType);
  1967. Convert(operand.tag, setType);
  1968. CheckSetElement(operand.op);
  1969. CheckSetElement(operand.tag);
  1970. (* create mask for lower bound
  1971. i.e. shift 11111111 to the left by the value of the lower bound
  1972. *)
  1973. Reuse1(temp, operand.op);
  1974. Emit(Shl(position,temp, allBits, operand.op));
  1975. ReleaseIntermediateOperand(operand.op);
  1976. operand.op := temp;
  1977. (* create mask for upper bound
  1978. i.e. shift 11111111 to the right by the difference between the
  1979. upper bound and the maximum number of set elements
  1980. *)
  1981. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1982. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1983. Reuse1(temp, operand.tag);
  1984. ELSE
  1985. Reuse1(temp, operand.tag);
  1986. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1987. Emit(Sub(position,temp, size, operand.tag));
  1988. END;
  1989. Emit(Shr(position,temp, allBits, operand.tag));
  1990. ReleaseIntermediateOperand(operand.tag);
  1991. operand.tag := temp;
  1992. Reuse2(resultingSet, operand.op, operand.tag);
  1993. (* intersect the two masks *)
  1994. Emit(And(position,resultingSet, operand.op, operand.tag));
  1995. ReleaseOperand(operand);
  1996. RETURN resultingSet
  1997. END SetFromRange;
  1998. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1999. VAR
  2000. res, operand: Operand;
  2001. temp, one, noBits, dest: IntermediateCode.Operand;
  2002. expression: SyntaxTree.Expression;
  2003. i: LONGINT;
  2004. BEGIN
  2005. IF Trace THEN TraceEnter("VisitSet") END;
  2006. dest := destination;
  2007. destination := emptyOperand;
  2008. noBits := IntermediateCode.Immediate(setType, 0);
  2009. one := IntermediateCode.Immediate(setType, 1);
  2010. (* start off with the empty set *)
  2011. InitOperand(res, ModeValue);
  2012. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2013. Emit(Mov(position,res.op, noBits));
  2014. FOR i := 0 TO x.elements.Length() - 1 DO
  2015. expression := x.elements.GetExpression(i);
  2016. IF expression IS SyntaxTree.RangeExpression THEN
  2017. (* range of set elements *)
  2018. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2019. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2020. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2021. ReleaseIntermediateOperand(temp)
  2022. ELSE
  2023. (* singelton element *)
  2024. Evaluate(expression, operand);
  2025. Convert(operand.op, setType);
  2026. CheckSetElement(operand.op);
  2027. (* create subset containing single element *)
  2028. Reuse1(temp, operand.op);
  2029. Emit(Shl(position,temp, one, operand.op));
  2030. ReleaseOperand(operand);
  2031. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2032. ReleaseIntermediateOperand(temp);
  2033. END
  2034. END;
  2035. result := res;
  2036. destination := dest;
  2037. IF Trace THEN TraceExit("VisitSet") END;
  2038. END VisitSet;
  2039. (* math arrays of the form [a,b,c]
  2040. x is a static array and thus does not provide any pointers
  2041. *)
  2042. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  2043. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2044. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2045. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2046. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2047. element: SyntaxTree.IntegerValue;
  2048. BEGIN
  2049. numberElements := x.elements.Length();
  2050. expression := index.parameters.GetExpression(dim);
  2051. element := expression(SyntaxTree.IntegerValue);
  2052. FOR i := 0 TO numberElements-1 DO
  2053. expression := x.elements.GetExpression(i);
  2054. element.SetValue(i);
  2055. IF expression IS SyntaxTree.MathArrayExpression THEN
  2056. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2057. ELSE
  2058. Assign(index,expression);
  2059. END;
  2060. END;
  2061. END RecursiveAssignment;
  2062. BEGIN
  2063. (*static math array not providing pointers anyway *)
  2064. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2065. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2066. designator.SetType(variable.type);
  2067. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  2068. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2069. FOR i := 0 TO dim-1 DO
  2070. element := SyntaxTree.NewIntegerValue(x.position,0);
  2071. element.SetType(system.longintType);
  2072. index.parameters.AddExpression(element);
  2073. END;
  2074. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2075. RecursiveAssignment(x,0);
  2076. Expression(designator);
  2077. END VisitMathArrayExpression;
  2078. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  2079. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2080. BEGIN
  2081. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2082. dest := destination; destination := emptyOperand;
  2083. IF x.operator = Scanner.Not THEN
  2084. IF conditional THEN
  2085. Condition(x.left,falseLabel,trueLabel)
  2086. ELSE
  2087. Evaluate(x.left,operand);
  2088. InitOperand(result,ModeValue);
  2089. Reuse1a(result.op,operand.op,dest);
  2090. Emit(Xor(position,result.op,operand.op,true));
  2091. ReleaseOperand(operand);
  2092. END;
  2093. ELSIF x.operator = Scanner.Minus THEN
  2094. Evaluate(x.left,operand);
  2095. InitOperand(result,ModeValue);
  2096. Reuse1a(result.op,operand.op,dest);
  2097. type := x.left.type.resolved;
  2098. IF type IS SyntaxTree.SetType THEN
  2099. Emit(Not(position,result.op,operand.op));
  2100. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2101. Reuse1(result.tag,operand.tag);
  2102. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2103. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2104. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2105. Emit(Neg(position,result.op,operand.op));
  2106. ELSE HALT(200)
  2107. END;
  2108. ReleaseOperand(operand);
  2109. ELSIF x.operator = Scanner.Address THEN
  2110. Designate(x.left,operand);
  2111. operand.mode := ModeValue;
  2112. t0 := x.left.type.resolved;
  2113. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2114. ReleaseIntermediateOperand(operand.op);
  2115. operand.op := operand.tag;
  2116. IntermediateCode.InitOperand(operand.tag);
  2117. END;
  2118. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2119. result := operand;
  2120. ELSE HALT(100)
  2121. END;
  2122. destination := dest;
  2123. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2124. END VisitUnaryExpression;
  2125. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2126. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2127. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2128. BEGIN
  2129. type := type.resolved;
  2130. originalType := type;
  2131. IF type IS SyntaxTree.PointerType THEN
  2132. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2133. END;
  2134. IF type IS SyntaxTree.ObjectType THEN
  2135. BrL(trueL);
  2136. ELSE
  2137. ASSERT(type IS SyntaxTree.RecordType);
  2138. (*
  2139. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2140. *)
  2141. ReuseCopy(left,tag);
  2142. right := TypeDescriptorAdr(type);
  2143. IF ~newObjectFile THEN
  2144. IntermediateCode.MakeMemory(right,addressType);
  2145. END;
  2146. IF backend.cooperative THEN
  2147. repeatL := NewLabel();
  2148. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2149. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2150. END;
  2151. SetLabel(repeatL);
  2152. BreqL(trueL,left,right);
  2153. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2154. BrneL(repeatL,left,nil);
  2155. ELSIF meta.simple THEN
  2156. level := type(SyntaxTree.RecordType).Level();
  2157. (* get type desc tag of level relative to base tag *)
  2158. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2159. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2160. IntermediateCode.MakeMemory(left,addressType);
  2161. BreqL(trueL,left,right);
  2162. ELSE
  2163. level := type(SyntaxTree.RecordType).Level();
  2164. (* get type desc tag of level relative to base tag *)
  2165. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2166. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2167. IntermediateCode.MakeMemory(left,addressType);
  2168. BreqL(trueL,left,right);
  2169. END;
  2170. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2171. BrL(falseL);
  2172. END;
  2173. END TypeTest;
  2174. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2175. BEGIN
  2176. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  2177. IF dump # NIL THEN
  2178. dump.String(s); dump.Ln;
  2179. END;
  2180. END Error;
  2181. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2182. BEGIN
  2183. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2184. IF dump # NIL THEN
  2185. dump.String(s); dump.Ln; dump.Update;
  2186. END;
  2187. END Warning;
  2188. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2189. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2190. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2191. operand:Operand;
  2192. BEGIN
  2193. previousSection := section;
  2194. Global.GetModuleName(mod,name);
  2195. Strings.Append(name,".@Trace");
  2196. Basic.ToSegmentedName(name, pooledName);
  2197. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2198. IF dump # NIL THEN dump := section.comments END;
  2199. IF backend.hasLinkRegister THEN
  2200. Emit(Push(Basic.invalidPosition, lr));
  2201. END;
  2202. variable := mod.moduleScope.firstVariable;
  2203. WHILE variable # NIL DO
  2204. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2205. Symbol(variable, operand);
  2206. register := operand.op;
  2207. CallTraceMethod(register, variable.type);
  2208. ReleaseIntermediateOperand(register);
  2209. END;
  2210. variable := variable.nextVariable;
  2211. END;
  2212. IF backend.hasLinkRegister THEN
  2213. Emit(Pop(Basic.invalidPosition, lr));
  2214. END;
  2215. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2216. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2217. Emit(Br(position,op));
  2218. INC(statCoopTraceModule, section.pc);
  2219. section := previousSection;
  2220. IF dump # NIL THEN dump := section.comments END;
  2221. END CreateTraceModuleMethod;
  2222. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2223. BEGIN
  2224. Emit (Push(position, dst));
  2225. Emit (Push(position, src));
  2226. CallThis(position,"GarbageCollector","Assign", 2);
  2227. END CallAssignPointer;
  2228. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2229. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2230. BEGIN
  2231. IF SemanticChecker.IsPointerType (type) THEN
  2232. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2233. ELSIF type.IsRecordType() THEN
  2234. Emit (Push(position,dst));
  2235. Emit (Push(position,src));
  2236. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2237. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2238. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2239. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2240. ELSIF IsStaticArray(type) THEN
  2241. size := StaticArrayNumElements(type);
  2242. base := StaticArrayBaseType(type);
  2243. IF base.IsRecordType() THEN
  2244. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2245. Emit (Push(position, dst));
  2246. Emit (Push(position, src));
  2247. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2248. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2249. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2250. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2251. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2252. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2253. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2254. Emit (Push(position, dst));
  2255. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2256. Emit (Push(position, src));
  2257. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2258. ELSE
  2259. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2260. Emit (Push(position, dst));
  2261. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2262. Emit (Push(position, src));
  2263. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2264. ASSERT(StaticArrayBaseType(type).IsPointer());
  2265. END;
  2266. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2267. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2268. Emit (Push(position, dst));
  2269. Emit (Push(position, src));
  2270. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2271. ELSE HALT(100); (* missing ? *)
  2272. END;
  2273. END CallAssignMethod;
  2274. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2275. VAR name: Basic.SegmentedName;
  2276. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2277. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2278. context: Context;
  2279. BEGIN
  2280. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2281. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2282. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2283. GetRecordTypeName (recordType,name);
  2284. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2285. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2286. IF dump # NIL THEN dump := section.comments END;
  2287. IF backend.hasLinkRegister THEN
  2288. Emit(Push(Basic.invalidPosition, lr));
  2289. END;
  2290. variable := recordType.recordScope.firstVariable;
  2291. WHILE variable # NIL DO
  2292. IF variable.NeedsTrace() THEN
  2293. dst := NewRegisterOperand (addressType);
  2294. src := NewRegisterOperand (addressType);
  2295. Emit (Mov(position, dst, parameter1));
  2296. Emit (Mov(position, src, parameter2));
  2297. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2298. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2299. CallAssignMethod(dst, src, variable.type);
  2300. ReleaseIntermediateOperand(src);
  2301. ReleaseIntermediateOperand(dst);
  2302. END;
  2303. variable := variable.nextVariable;
  2304. END;
  2305. recordBase := recordType.GetBaseRecord();
  2306. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2307. IF backend.hasLinkRegister THEN
  2308. Emit(Pop(Basic.invalidPosition, lr));
  2309. END;
  2310. GetRecordTypeName (recordBase,name);
  2311. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2312. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2313. Emit(Br(position,op));
  2314. ELSE
  2315. Emit(Exit(position,0,0, 0));
  2316. END;
  2317. IF ~recordType.isObject THEN
  2318. GetRecordTypeName (recordType,name);
  2319. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2320. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2321. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2322. NEW(registerUsageCount);
  2323. usedRegisters := NIL;
  2324. dst := NewRegisterOperand (addressType);
  2325. src := NewRegisterOperand (addressType);
  2326. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2327. Emit(Mov(position, dst, parameter1));
  2328. Emit(Mov(position, src, parameter2));
  2329. label := NewLabel();
  2330. SetLabel(label);
  2331. Emit(Push(position, dst));
  2332. Emit(Push(position, src));
  2333. GetRecordTypeName (recordType,name);
  2334. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2335. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2336. Emit(Call(position, op, 0));
  2337. Emit(Pop(position, src));
  2338. Emit(Pop(position, dst));
  2339. Emit(Add(position, dst, dst, ofs));
  2340. Emit(Add(position, src, src, ofs));
  2341. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2342. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2343. Emit(Exit(position,0,0, 0));
  2344. END;
  2345. INC(statCoopAssignProcedure, section.pc);
  2346. ReturnToContext(context);
  2347. IF dump # NIL THEN dump := section.comments END;
  2348. END CreateAssignProcedure;
  2349. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2350. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2351. BEGIN
  2352. IF IsUnsafePointer (type) THEN
  2353. skip := NewLabel();
  2354. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2355. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2356. BreqL (skip, op, nil);
  2357. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2358. SetLabel (skip);
  2359. ELSIF SemanticChecker.IsPointerType (type) THEN
  2360. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2361. CallThis(position,"GarbageCollector","Mark", 1);
  2362. ELSIF type.IsRecordType() THEN
  2363. Emit (Push(position,register));
  2364. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2365. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2366. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2367. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2368. ELSIF IsStaticArray(type) THEN
  2369. size := StaticArrayNumElements(type);
  2370. base := StaticArrayBaseType(type);
  2371. IF base.IsRecordType() THEN
  2372. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2373. Emit (Push(position, register));
  2374. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2375. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2376. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2377. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2378. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2379. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2380. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2381. Emit (Push(position, register));
  2382. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2383. ELSE
  2384. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2385. Emit (Push(position, register));
  2386. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2387. ASSERT(base.IsPointer());
  2388. END;
  2389. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2390. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2391. CallThis(position,"GarbageCollector","Mark", 1);
  2392. ELSE HALT(100); (* missing ? *)
  2393. END;
  2394. END CallTraceMethod;
  2395. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2396. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2397. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2398. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2399. BEGIN
  2400. previousSection := section;
  2401. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2402. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2403. GetRecordTypeName (recordType,name);
  2404. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2405. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2406. IF dump # NIL THEN dump := section.comments END;
  2407. IF backend.hasLinkRegister THEN
  2408. Emit(Push(Basic.invalidPosition, lr));
  2409. END;
  2410. variable := recordType.recordScope.firstVariable;
  2411. WHILE variable # NIL DO
  2412. IF variable.NeedsTrace() THEN
  2413. register := NewRegisterOperand (addressType);
  2414. Emit (Mov(position,register,parameter1));
  2415. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2416. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2417. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2418. END;
  2419. CallTraceMethod(register, variable.type);
  2420. ReleaseIntermediateOperand(register);
  2421. END;
  2422. variable := variable.nextVariable;
  2423. END;
  2424. recordBase := recordType.GetBaseRecord();
  2425. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2426. recordBase := recordBase.GetBaseRecord();
  2427. END;
  2428. IF recordBase # NIL THEN
  2429. IF backend.hasLinkRegister THEN
  2430. Emit(Pop(Basic.invalidPosition, lr));
  2431. END;
  2432. GetRecordTypeName (recordBase,name);
  2433. IF HasExplicitTraceMethod (recordBase) THEN
  2434. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2435. ELSE
  2436. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2437. END;
  2438. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2439. Emit(Br(position,op));
  2440. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2441. Emit(Exit(position,0,0,0));
  2442. ELSE
  2443. IF backend.hasLinkRegister THEN
  2444. Emit(Pop(Basic.invalidPosition, lr));
  2445. END;
  2446. IF recordType.isObject THEN
  2447. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2448. ELSE
  2449. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2450. END;
  2451. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2452. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2453. Emit(Br(position,op));
  2454. END;
  2455. IF ~recordType.isObject THEN
  2456. GetRecordTypeName (recordType,name);
  2457. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2458. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2459. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2460. NEW(registerUsageCount);
  2461. usedRegisters := NIL;
  2462. IF dump # NIL THEN dump := section.comments END;
  2463. register := NewRegisterOperand (addressType);
  2464. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2465. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2466. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2467. END;
  2468. Emit (Push(position,register));
  2469. GetRecordTypeName (recordType,name);
  2470. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2471. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2472. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2473. ReleaseIntermediateOperand(register);
  2474. Emit(Exit(position,0,0,0));
  2475. GetRecordTypeName (recordType,name);
  2476. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2477. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2478. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2479. NEW(registerUsageCount);
  2480. usedRegisters := NIL;
  2481. register := NewRegisterOperand (addressType);
  2482. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2483. Emit(Mov(position, register, parameter1));
  2484. label := NewLabel();
  2485. SetLabel(label);
  2486. Emit(Push(position, register));
  2487. GetRecordTypeName (recordType,name);
  2488. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2489. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2490. Emit(Call(position, op, 0));
  2491. Emit(Pop(position, register));
  2492. Emit(Add(position, register, register, ofs));
  2493. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2494. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2495. Emit(Exit(position,0,0,0));
  2496. END;
  2497. INC(statCoopTraceMethod, section.pc);
  2498. ReturnToContext(context);
  2499. IF dump # NIL THEN dump := section.comments END;
  2500. END CreateTraceMethod;
  2501. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2502. VAR name: Basic.SegmentedName;
  2503. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2504. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2505. context: Context;
  2506. BEGIN
  2507. IF recordType.isObject THEN RETURN END;
  2508. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2509. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2510. GetRecordTypeName (recordType,name);
  2511. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2512. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2513. IF dump # NIL THEN dump := section.comments END;
  2514. IF backend.hasLinkRegister THEN
  2515. Emit(Push(Basic.invalidPosition, lr));
  2516. END;
  2517. variable := recordType.recordScope.firstVariable;
  2518. WHILE variable # NIL DO
  2519. IF variable.NeedsTrace() THEN
  2520. dst := NewRegisterOperand (addressType);
  2521. Emit (Mov(position, dst, parameter1));
  2522. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2523. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2524. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2525. END;
  2526. CallResetProcedure(dst, nil, variable.type);
  2527. ReleaseIntermediateOperand(dst);
  2528. END;
  2529. variable := variable.nextVariable;
  2530. END;
  2531. recordBase := recordType.GetBaseRecord();
  2532. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2533. IF backend.hasLinkRegister THEN
  2534. Emit(Pop(Basic.invalidPosition, lr));
  2535. END;
  2536. GetRecordTypeName (recordBase,name);
  2537. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2538. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2539. Emit(Br(position,op));
  2540. ELSE
  2541. Emit(Exit(position,0,0, 0));
  2542. END;
  2543. GetRecordTypeName (recordType,name);
  2544. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2545. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2546. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2547. NEW(registerUsageCount);
  2548. usedRegisters := NIL;
  2549. dst := NewRegisterOperand (addressType);
  2550. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2551. Emit(Mov(position, dst, parameter1));
  2552. label := NewLabel();
  2553. SetLabel(label);
  2554. Emit(Push(position, dst));
  2555. GetRecordTypeName (recordType,name);
  2556. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2557. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2558. Emit(Call(position, op, 0));
  2559. Emit(Pop(position, dst));
  2560. Emit(Add(position, dst, dst, ofs));
  2561. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2562. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2563. Emit(Exit(position,0,0, 0));
  2564. INC(statCoopResetProcedure, section.pc);
  2565. ReturnToContext(context);
  2566. IF dump # NIL THEN dump := section.comments END;
  2567. END CreateResetProcedure;
  2568. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2569. VAR name: Basic.SegmentedName; context: Context;
  2570. BEGIN
  2571. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2572. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2573. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2574. IF dump # NIL THEN dump := section.comments END;
  2575. IF backend.hasLinkRegister THEN
  2576. Emit(Push(Basic.invalidPosition, lr));
  2577. END;
  2578. Emit(Push(position,fp));
  2579. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2580. ResetVariables(scope);
  2581. Emit(Pop(position,fp));
  2582. Emit(Exit(position,0,0, 0));
  2583. ReturnToContext(context);
  2584. IF dump # NIL THEN dump := section.comments END;
  2585. END CreateResetMethod;
  2586. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2587. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2588. BEGIN
  2589. IF SemanticChecker.IsPointerType (type) THEN
  2590. Emit (Push(position, dest));
  2591. CallThis(position,"GarbageCollector","Reset", 1);
  2592. ELSIF type.IsRecordType() THEN
  2593. Emit (Push(position, dest));
  2594. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2595. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2596. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2597. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2598. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2599. size := GetArrayLength(type, tag);
  2600. base := ArrayBaseType(type);
  2601. IF base.IsRecordType() THEN
  2602. Emit (Push(position, size));
  2603. Emit (Push(position, dest));
  2604. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2605. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2606. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2607. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2608. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2609. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2610. Emit (Push(position, size));
  2611. Emit (Push(position, dest));
  2612. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2613. ELSE
  2614. Emit (Push(position, size));
  2615. Emit (Push(position, dest));
  2616. CallThis(position,"GarbageCollector","ResetArray", 2);
  2617. ASSERT(ArrayBaseType(type).IsPointer());
  2618. END;
  2619. ReleaseIntermediateOperand(size);
  2620. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2621. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2622. Emit (Push(position, dest));
  2623. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2624. ELSE HALT(100); (* missing ? *)
  2625. END;
  2626. END CallResetProcedure;
  2627. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2628. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2629. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2630. VAR operand: Operand;
  2631. BEGIN
  2632. Symbol (symbol, operand);
  2633. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2634. ReleaseOperand(operand);
  2635. END Reset;
  2636. BEGIN
  2637. previousScope := currentScope;
  2638. currentScope := scope;
  2639. pc := section.pc;
  2640. variable := scope.firstVariable;
  2641. WHILE variable # NIL DO
  2642. IF variable.NeedsTrace() THEN
  2643. Reset (variable);
  2644. END;
  2645. variable := variable.nextVariable;
  2646. END;
  2647. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2648. WHILE parameter # NIL DO
  2649. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2650. Reset (parameter);
  2651. END;
  2652. parameter := parameter.nextParameter;
  2653. END;
  2654. INC(statCoopResetVariables, section.pc - pc);
  2655. currentScope := previousScope;
  2656. END ResetVariables;
  2657. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2658. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2659. VAR op: IntermediateCode.Operand; context: Context;
  2660. BEGIN
  2661. previousSection := section;
  2662. GetCodeSectionNameForSymbol(procedure, name);
  2663. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  2664. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  2665. IF dump # NIL THEN dump := section.comments END;
  2666. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2667. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2668. Emit(Data(position,op));
  2669. Emit(Data(position,nil));
  2670. IF HasPointers (procedure.procedureScope) THEN
  2671. GetCodeSectionNameForSymbol(procedure, name);
  2672. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2673. ELSE
  2674. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2675. END;
  2676. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2677. Emit(Data(position,op));
  2678. ReturnToContext(context);
  2679. IF dump # NIL THEN dump := section.comments END;
  2680. END CreateProcedureDescriptor;
  2681. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2682. VAR import: SyntaxTree.Import;
  2683. s: Basic.MessageString;
  2684. selfName: SyntaxTree.IdentifierString;
  2685. BEGIN
  2686. moduleScope.ownerModule.GetName(selfName);
  2687. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2688. module := moduleScope.ownerModule
  2689. ELSE
  2690. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2691. IF import = NIL THEN
  2692. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2693. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2694. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2695. s := "Module ";
  2696. Strings.Append(s,moduleName);
  2697. Strings.Append(s," cannot be imported.");
  2698. IF force THEN
  2699. Error(position,s);
  2700. ELSIF canBeLoaded THEN
  2701. IF WarningDynamicLoading THEN
  2702. Strings.Append(s, "=> no dynamic linking.");
  2703. Warning(position, s);
  2704. END;
  2705. canBeLoaded := FALSE;
  2706. END;
  2707. RETURN FALSE
  2708. ELSE
  2709. SELF.module.imports.AddName(moduleName)
  2710. END;
  2711. ELSIF import.module = NIL THEN (* already tried *)
  2712. RETURN FALSE
  2713. END;
  2714. module := import.module;
  2715. END;
  2716. RETURN TRUE
  2717. END AddImport;
  2718. (* needed for old binary object file format*)
  2719. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2720. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2721. BEGIN
  2722. IF AddImport(moduleName,module,TRUE) THEN
  2723. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2724. IF procedure = NIL THEN
  2725. s := "Instruction not supported on target, emulation procedure ";
  2726. Strings.Append(s,moduleName);
  2727. Strings.Append(s,".");
  2728. Strings.Append(s,procedureName);
  2729. Strings.Append(s," not present");
  2730. Error(position,s);
  2731. ELSE
  2732. StaticCallOperand(r,procedure);
  2733. ReleaseOperand(r);
  2734. fp := GetFingerprint(procedure);
  2735. END;
  2736. END;
  2737. END EnsureSymbol;
  2738. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2739. VAR exit: Label; trueL,falseL: Label;
  2740. BEGIN
  2741. trueL := NewLabel();
  2742. falseL := NewLabel();
  2743. exit := NewLabel();
  2744. Condition(x,trueL,falseL);
  2745. InitOperand(result,ModeValue);
  2746. SetLabel(trueL);
  2747. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2748. Emit(Mov(position,result.op,true));
  2749. BrL(exit);
  2750. SetLabel(falseL);
  2751. Emit(MovReplace(position,result.op,false));
  2752. SetLabel(exit);
  2753. END ConditionToValue;
  2754. PROCEDURE ValueToCondition(VAR op: Operand);
  2755. BEGIN
  2756. LoadValue(op,system.booleanType);
  2757. BrneL(trueLabel,op.op, false);
  2758. ReleaseOperand(op);
  2759. BrL(falseLabel);
  2760. END ValueToCondition;
  2761. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2762. VAR size: LONGINT;
  2763. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2764. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2765. BEGIN
  2766. ASSERT(type.form = SyntaxTree.Open);
  2767. baseType := type.arrayBase.resolved;
  2768. IF IsOpenArray(baseType) THEN
  2769. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2770. ELSE
  2771. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2772. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2773. END;
  2774. len := tag;
  2775. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2776. IntermediateCode.MakeMemory(len,addressType);
  2777. UseIntermediateOperand(len);
  2778. Reuse2(res,sizeOperand,len);
  2779. Emit(Mul(position,res,sizeOperand,len));
  2780. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2781. RETURN res
  2782. END GetArraySize;
  2783. BEGIN
  2784. type := type.resolved;
  2785. IF IsOpenArray(type) THEN
  2786. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2787. RETURN tag
  2788. ELSE
  2789. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2790. END;
  2791. ELSE
  2792. size := ToMemoryUnits(system,system.SizeOf(type));
  2793. RETURN IntermediateCode.Immediate(addressType,size)
  2794. END;
  2795. END GetDynamicSize;
  2796. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2797. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2798. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2799. BEGIN
  2800. ASSERT(type.form = SyntaxTree.Open);
  2801. baseType := type.arrayBase.resolved;
  2802. IF IsOpenArray(baseType) THEN
  2803. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2804. ELSE
  2805. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2806. END;
  2807. len := tag;
  2808. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2809. IntermediateCode.MakeMemory(len,addressType);
  2810. UseIntermediateOperand(len);
  2811. Reuse2(res,sizeOperand,len);
  2812. Emit(Mul(position,res,sizeOperand,len));
  2813. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2814. RETURN res
  2815. END GetLength;
  2816. BEGIN
  2817. type := type.resolved;
  2818. IF IsOpenArray(type) THEN
  2819. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2820. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2821. ELSIF type IS SyntaxTree.StringType THEN
  2822. RETURN tag;
  2823. ELSE
  2824. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  2825. END;
  2826. END GetArrayLength;
  2827. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2828. VAR result: IntermediateCode.Operand;
  2829. BEGIN
  2830. IF backend.cooperative THEN
  2831. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2832. ELSE
  2833. MakeMemory(result, tag, addressType, 0);
  2834. END;
  2835. RETURN result
  2836. END GetSizeFromTag;
  2837. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2838. VAR parameter: SyntaxTree.Parameter;
  2839. BEGIN
  2840. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2841. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2842. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2843. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2844. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2845. END;
  2846. RETURN GetDynamicSize(e.type, tag);
  2847. END GetArrayOfBytesSize;
  2848. (*
  2849. to find imported symbol. not needed ?
  2850. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2851. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2852. BEGIN
  2853. IF AddImport(moduleName,importedModule,FALSE) THEN
  2854. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2855. RETURN symbol
  2856. ELSE
  2857. RETURN NIL
  2858. END
  2859. END SymbolByName;
  2860. *)
  2861. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2862. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2863. BEGIN
  2864. IF AddImport(moduleName,runtimeModule,force) THEN
  2865. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2866. IF procedure = NIL THEN
  2867. s := "Procedure ";
  2868. Strings.Append(s,moduleName);
  2869. Strings.Append(s,".");
  2870. Strings.Append(s,procedureName);
  2871. Strings.Append(s," not present");
  2872. Error(position,s);
  2873. RETURN FALSE
  2874. ELSE
  2875. RETURN TRUE
  2876. END;
  2877. ELSE RETURN FALSE
  2878. END;
  2879. END GetRuntimeProcedure;
  2880. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2881. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2882. s: Basic.MessageString;
  2883. BEGIN
  2884. Basic.InitSegmentedName(name);
  2885. name[0] := Basic.MakeString(moduleName);
  2886. name[1] := Basic.MakeString(typeName);
  2887. name[2] := -1;
  2888. IF AddImport(moduleName,importedModule, FALSE) THEN
  2889. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2890. IF symbol = NIL THEN
  2891. s := "type ";
  2892. Strings.Append(s,moduleName);
  2893. Strings.Append(s,".");
  2894. Strings.Append(s,typeName);
  2895. Strings.Append(s," not present");
  2896. Error(position,s);
  2897. END;
  2898. ELSE symbol := NIL;
  2899. END;
  2900. IF importedModule = moduleScope.ownerModule THEN
  2901. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2902. ELSE
  2903. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2904. END;
  2905. RETURN symbol
  2906. END GetTypeDescriptor;
  2907. (* 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. *)
  2908. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2909. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2910. pooledName: Basic.SegmentedName; size: LONGINT;
  2911. BEGIN
  2912. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2913. StaticCallOperand(result,procedure);
  2914. IF numberParameters < 0 THEN
  2915. size := ProcedureParametersSize(system,procedure);
  2916. ELSE
  2917. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2918. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2919. Error(position,"runtime call parameter count mismatch");
  2920. END;
  2921. END;
  2922. Emit(Call(position, result.op, size));
  2923. ReleaseOperand(result);
  2924. ELSE (* only static linking possible *)
  2925. ASSERT(numberParameters >= 0);
  2926. Basic.InitSegmentedName(pooledName);
  2927. pooledName[0] := Basic.MakeString(moduleName);
  2928. pooledName[1] := Basic.MakeString(procedureName);
  2929. pooledName[2] := -1;
  2930. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2931. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2932. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2933. END;
  2934. END CallThisChecked;
  2935. (* 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. *)
  2936. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2937. BEGIN
  2938. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2939. END CallThis;
  2940. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2941. VAR
  2942. left,right: Operand;
  2943. leftSize, rightSize: IntermediateCode.Operand;
  2944. saved: RegisterEntry;
  2945. reg: IntermediateCode.Operand;
  2946. procedureName: SyntaxTree.IdentifierString;
  2947. BEGIN
  2948. procedureName := "CompareString";
  2949. SaveRegisters();ReleaseUsedRegisters(saved);
  2950. Designate(leftExpression,left);
  2951. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2952. Emit(Push(position,leftSize));
  2953. ReleaseIntermediateOperand(leftSize);
  2954. Emit(Push(position,left.op));
  2955. ReleaseOperand(left);
  2956. Designate(rightExpression,right);
  2957. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2958. Emit(Push(position,rightSize));
  2959. ReleaseIntermediateOperand(rightSize);
  2960. Emit(Push(position,right.op));
  2961. ReleaseOperand(right);
  2962. IF backend.cooperative THEN
  2963. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2964. ELSE
  2965. CallThis(position,runtimeModuleName,procedureName, 4);
  2966. END;
  2967. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2968. Emit(Result(position,reg));
  2969. (*
  2970. AcquireThisRegister(int8,IntermediateCode.Result);
  2971. *)
  2972. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2973. (*
  2974. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2975. *)
  2976. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2977. ReleaseIntermediateOperand(reg);
  2978. BrL(falseLabel);
  2979. END CompareString;
  2980. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2981. VAR
  2982. left,right: Operand;
  2983. leftSize, rightSize: IntermediateCode.Operand;
  2984. saved: RegisterEntry;
  2985. procedureName: SyntaxTree.IdentifierString;
  2986. BEGIN
  2987. procedureName := "CopyString";
  2988. SaveRegisters();ReleaseUsedRegisters(saved);
  2989. Designate(leftExpression,left);
  2990. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2991. Emit(Push(position,leftSize));
  2992. ReleaseIntermediateOperand(leftSize);
  2993. Emit(Push(position,left.op));
  2994. ReleaseOperand(left);
  2995. Designate(rightExpression,right);
  2996. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2997. Emit(Push(position,rightSize));
  2998. ReleaseIntermediateOperand(rightSize);
  2999. Emit(Push(position,right.op));
  3000. ReleaseOperand(right);
  3001. IF backend.cooperative THEN
  3002. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  3003. ELSE
  3004. CallThis(position,runtimeModuleName,procedureName,4);
  3005. END;
  3006. RestoreRegisters(saved);
  3007. END CopyString;
  3008. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  3009. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3010. leftType,rightType: SyntaxTree.Type;
  3011. leftExpression,rightExpression : SyntaxTree.Expression;
  3012. componentType: IntermediateCode.Type;
  3013. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  3014. size: LONGINT;
  3015. BEGIN
  3016. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3017. dest := destination; destination := emptyOperand;
  3018. leftType := x.left.type.resolved;
  3019. rightType := x.right.type.resolved;
  3020. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3021. CASE x.operator OF
  3022. Scanner.Or:
  3023. (* shortcut evaluation of left OR right *)
  3024. IF ~conditional THEN ConditionToValue(x);
  3025. ELSE
  3026. next := NewLabel();
  3027. Condition(x.left,trueLabel,next);
  3028. SetLabel(next);
  3029. Condition(x.right,trueLabel,falseLabel);
  3030. END;
  3031. |Scanner.And:
  3032. (* shortcut evaluation of left & right *)
  3033. IF ~conditional THEN ConditionToValue(x);
  3034. ELSE
  3035. next := NewLabel();
  3036. Condition(x.left,next,falseLabel);
  3037. SetLabel(next);
  3038. Condition(x.right,trueLabel,falseLabel);
  3039. END;
  3040. |Scanner.Is:
  3041. IF ~conditional THEN ConditionToValue(x);
  3042. ELSE
  3043. (* get type desc tag *)
  3044. IF IsPointerToRecord(leftType,recordType) THEN
  3045. Evaluate(x.left,left);
  3046. Dereference(left,recordType,IsUnsafePointer(leftType))
  3047. ELSE
  3048. Designate(x.left,left);
  3049. END;
  3050. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  3051. ReleaseOperand(left);
  3052. END;
  3053. |Scanner.Plus:
  3054. Evaluate(x.left,left);
  3055. Evaluate(x.right,right);
  3056. IF leftType IS SyntaxTree.SetType THEN
  3057. InitOperand(result,ModeValue);
  3058. Reuse2a(result.op,left.op,right.op,dest);
  3059. Emit(Or(position,result.op,left.op,right.op));
  3060. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3061. InitOperand(result,ModeValue);
  3062. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3063. Reuse2(result.tag,left.tag,right.tag);
  3064. Emit(Add(position,result.op,left.op,right.op));
  3065. Emit(Add(position,result.tag,left.tag,right.tag))
  3066. ELSE
  3067. InitOperand(result,ModeValue);
  3068. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3069. AddInt(result.op, left.op, right.op) ;
  3070. ELSE
  3071. *)
  3072. Reuse2a(result.op,left.op,right.op,dest);
  3073. Emit(Add(position,result.op,left.op,right.op));
  3074. (*
  3075. END;
  3076. *)
  3077. END;
  3078. ReleaseOperand(left); ReleaseOperand(right);
  3079. |Scanner.Minus:
  3080. Evaluate(x.left,left);
  3081. Evaluate(x.right,right);
  3082. IF leftType IS SyntaxTree.SetType THEN
  3083. InitOperand(result,ModeValue);
  3084. Reuse1(result.op,right.op);
  3085. Emit(Not(position,result.op,right.op));
  3086. ReleaseOperand(right);
  3087. Emit(And(position,result.op,result.op,left.op));
  3088. ReleaseOperand(left);
  3089. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3090. InitOperand(result,ModeValue);
  3091. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3092. Reuse2(result.tag,left.tag,right.tag);
  3093. Emit(Sub(position,result.op,left.op,right.op));
  3094. Emit(Sub(position,result.tag,left.tag,right.tag));
  3095. ReleaseOperand(left); ReleaseOperand(right)
  3096. ELSE
  3097. InitOperand(result,ModeValue);
  3098. Reuse2a(result.op,left.op,right.op,dest);
  3099. Emit(Sub(position,result.op,left.op,right.op));
  3100. ReleaseOperand(left); ReleaseOperand(right);
  3101. END;
  3102. |Scanner.Times:
  3103. Evaluate(x.left,left);
  3104. Evaluate(x.right,right);
  3105. IF leftType IS SyntaxTree.SetType THEN
  3106. InitOperand(result,ModeValue);
  3107. Reuse2a(result.op,left.op,right.op,dest);
  3108. Emit(And(position,result.op,left.op,right.op));
  3109. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3110. InitOperand(result, ModeValue);
  3111. componentType := left.op.type;
  3112. (* TODO: review this *)
  3113. (*
  3114. result.op = left.op * right.op - left.tag * right.tag
  3115. result.tag = left.tag * right.op + left.op * right.tag
  3116. *)
  3117. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3118. Emit(Mul(position,result.op, left.op, right.op));
  3119. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3120. Emit(Mul(position,tempReg, left.tag, right.tag));
  3121. Emit(Sub(position,result.op, result.op, tempReg));
  3122. Reuse2(result.tag, left.tag, right.op);
  3123. Emit(Mul(position,result.tag, left.tag, right.op));
  3124. Emit(Mul(position,tempReg, left.op, right.tag));
  3125. Emit(Add(position,result.tag, result.tag, tempReg));
  3126. ReleaseIntermediateOperand(tempReg)
  3127. ELSE
  3128. InitOperand(result,ModeValue);
  3129. Reuse2a(result.op,left.op,right.op,dest);
  3130. Emit(Mul(position,result.op,left.op,right.op));
  3131. END;
  3132. ReleaseOperand(left); ReleaseOperand(right);
  3133. |Scanner.Div:
  3134. Evaluate(x.left,left);
  3135. Evaluate(x.right,right);
  3136. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3137. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3138. IF ~isUnchecked THEN
  3139. exit := NewLabel();
  3140. BrltL(exit,zero,right.op);
  3141. EmitTrap(position,NegativeDivisorTrap);
  3142. SetLabel(exit);
  3143. END;
  3144. END;
  3145. InitOperand(result,ModeValue);
  3146. Reuse2a(result.op,left.op,right.op,dest);
  3147. Emit(Div(position,result.op,left.op,right.op));
  3148. ReleaseOperand(left); ReleaseOperand(right);
  3149. |Scanner.Mod:
  3150. Evaluate(x.left,left);
  3151. Evaluate(x.right,right);
  3152. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3153. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3154. IF ~isUnchecked THEN
  3155. exit := NewLabel();
  3156. BrltL(exit,zero,right.op);
  3157. EmitTrap(position,NegativeDivisorTrap);
  3158. SetLabel(exit);
  3159. END;
  3160. END;
  3161. InitOperand(result,ModeValue);
  3162. Reuse2a(result.op,left.op,right.op,dest);
  3163. Emit(Mod(position,result.op,left.op,right.op));
  3164. ReleaseOperand(left); ReleaseOperand(right);
  3165. |Scanner.Slash:
  3166. Evaluate(x.left,left);
  3167. Evaluate(x.right,right);
  3168. IF leftType IS SyntaxTree.SetType THEN
  3169. InitOperand(result,ModeValue);
  3170. Reuse2a(result.op,left.op,right.op,dest);
  3171. Emit(Xor(position,result.op,left.op,right.op));
  3172. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3173. InitOperand(result,ModeValue);
  3174. componentType := left.op.type;
  3175. (* review this *)
  3176. (*
  3177. divisor = right.op * right.op + right.tag * right.tag
  3178. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3179. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3180. *)
  3181. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3182. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3183. Emit(Mul(position,tempReg, right.op, right.op));
  3184. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3185. Emit(Add(position,tempReg, tempReg, tempReg2));
  3186. result.op := tempReg2;
  3187. Emit(Mul(position,result.op, left.op, right.op));
  3188. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3189. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3190. Emit(Add(position,result.op, result.op, tempReg2));
  3191. Emit(Div(position,result.op, result.op, tempReg));
  3192. Reuse2(result.tag, left.tag, right.op);
  3193. Emit(Mul(position,result.tag, left.tag, right.op));
  3194. Emit(Mul(position,tempReg2, left.op, right.tag));
  3195. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3196. Emit(Div(position,result.tag, result.tag, tempReg));
  3197. ReleaseIntermediateOperand(tempReg);
  3198. ReleaseIntermediateOperand(tempReg2)
  3199. ELSE
  3200. InitOperand(result,ModeValue);
  3201. Reuse2a(result.op,left.op,right.op,dest);
  3202. Emit(Div(position,result.op,left.op,right.op));
  3203. END;
  3204. ReleaseOperand(left); ReleaseOperand(right);
  3205. |Scanner.Equal:
  3206. IF ~conditional THEN ConditionToValue(x);
  3207. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3208. CompareString(BreqL,x.left,x.right);
  3209. ELSE
  3210. Evaluate(x.left,left);
  3211. Evaluate(x.right,right);
  3212. IF leftType IS SyntaxTree.RangeType THEN
  3213. ASSERT(rightType IS SyntaxTree.RangeType);
  3214. BrneL(falseLabel, left.op, right.op); (* first *)
  3215. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3216. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3217. ReleaseOperand(left); ReleaseOperand(right);
  3218. BrL(trueLabel)
  3219. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3220. BrneL(falseLabel, left.op, right.op); (* first *)
  3221. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3222. ReleaseOperand(left); ReleaseOperand(right);
  3223. BrL(trueLabel)
  3224. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3225. (* TODO: review this *)
  3226. BrneL(falseLabel, left.op, right.op); (* real part *)
  3227. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3228. ReleaseOperand(left); ReleaseOperand(right);
  3229. BrL(trueLabel)
  3230. ELSE
  3231. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3232. ReleaseOperand(left); ReleaseOperand(right);
  3233. BrL(trueLabel);
  3234. END;
  3235. END;
  3236. |Scanner.LessEqual:
  3237. IF ~conditional THEN ConditionToValue(x);
  3238. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3239. CompareString(BrgeL,x.right,x.left);
  3240. ELSE
  3241. Evaluate(x.left,left);
  3242. Evaluate(x.right,right);
  3243. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3244. Reuse1(temp.op,right.op);
  3245. Emit(And(position,temp.op,left.op,right.op));
  3246. ReleaseOperand(right);
  3247. BreqL(trueLabel,temp.op,left.op);
  3248. BrL(falseLabel);
  3249. ReleaseOperand(temp);ReleaseOperand(left);
  3250. ELSE
  3251. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3252. ReleaseOperand(left); ReleaseOperand(right);
  3253. BrL(trueLabel);
  3254. END;
  3255. END;
  3256. |Scanner.Less:
  3257. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3258. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  3259. leftExpression.SetType(system.booleanType);
  3260. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3261. rightExpression.SetType(system.booleanType);
  3262. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3263. leftExpression.SetType(system.booleanType);
  3264. Expression(leftExpression);
  3265. ELSIF ~conditional THEN ConditionToValue(x);
  3266. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3267. CompareString(BrltL,x.left,x.right);
  3268. ELSE
  3269. Evaluate(x.left,left);
  3270. Evaluate(x.right,right);
  3271. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3272. ReleaseOperand(left); ReleaseOperand(right);
  3273. BrL(trueLabel);
  3274. END;
  3275. |Scanner.Greater:
  3276. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3277. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  3278. leftExpression.SetType(system.booleanType);
  3279. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3280. rightExpression.SetType(system.booleanType);
  3281. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3282. leftExpression.SetType(system.booleanType);
  3283. Expression(leftExpression);
  3284. ELSIF ~conditional THEN ConditionToValue(x);
  3285. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3286. CompareString(BrltL,x.right,x.left);
  3287. ELSE
  3288. Evaluate(x.left,left);
  3289. Evaluate(x.right,right);
  3290. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3291. ReleaseOperand(left); ReleaseOperand(right);
  3292. BrL(trueLabel);
  3293. END;
  3294. |Scanner.GreaterEqual:
  3295. IF ~conditional THEN ConditionToValue(x);
  3296. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3297. CompareString(BrgeL,x.left,x.right);
  3298. ELSE
  3299. Evaluate(x.left,left);
  3300. Evaluate(x.right,right);
  3301. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3302. Reuse1(temp.op,left.op);
  3303. Emit(And(position,temp.op,left.op,right.op));
  3304. ReleaseOperand(left);
  3305. BreqL(trueLabel, temp.op,right.op);
  3306. ReleaseOperand(temp); ReleaseOperand(right);
  3307. BrL(falseLabel);
  3308. ELSE
  3309. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3310. ReleaseOperand(left); ReleaseOperand(right);
  3311. BrL(trueLabel);
  3312. END;
  3313. END;
  3314. |Scanner.Unequal:
  3315. IF ~conditional THEN ConditionToValue(x);
  3316. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3317. CompareString(BrneL,x.left,x.right);
  3318. ELSE
  3319. Evaluate(x.left,left);
  3320. Evaluate(x.right,right);
  3321. IF leftType IS SyntaxTree.RangeType THEN
  3322. ASSERT(rightType IS SyntaxTree.RangeType);
  3323. BrneL(trueLabel, left.op, right.op); (* first *)
  3324. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3325. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3326. ReleaseOperand(left); ReleaseOperand(right);
  3327. BrL(falseLabel)
  3328. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3329. BrneL(trueLabel, left.op, right.op); (* first *)
  3330. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3331. ReleaseOperand(left); ReleaseOperand(right);
  3332. BrL(falseLabel)
  3333. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3334. (* TODO: review this *)
  3335. BrneL(trueLabel, left.op, right.op); (* real part *)
  3336. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3337. ReleaseOperand(left); ReleaseOperand(right);
  3338. BrL(falseLabel)
  3339. ELSE
  3340. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3341. ReleaseOperand(left); ReleaseOperand(right);
  3342. BrL(trueLabel);
  3343. END;
  3344. END;
  3345. |Scanner.In:
  3346. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3347. Evaluate(x.left,left);
  3348. Evaluate(x.right,right);
  3349. Convert(left.op,setType);
  3350. ReuseCopy(temp.op,right.op);
  3351. Emit(Shr(position,temp.op,temp.op,left.op));
  3352. ReleaseOperand(right); ReleaseOperand(left);
  3353. IntermediateCode.InitImmediate(one,setType,1);
  3354. Emit(And(position,temp.op,temp.op,one));
  3355. IF conditional THEN
  3356. IntermediateCode.InitImmediate(zero,setType,0);
  3357. BrneL(trueLabel,temp.op,zero);
  3358. ReleaseOperand(temp);
  3359. BrL(falseLabel);
  3360. ELSE
  3361. Convert(temp.op,bool);
  3362. result.mode := ModeValue;
  3363. result.op := temp.op;
  3364. result.tag := nil; (* may be left over from calls to evaluate *)
  3365. END;
  3366. ELSE
  3367. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3368. IF x.operator = Scanner.Questionmarks THEN
  3369. leftExpression := x.left;
  3370. rightExpression := x.right;
  3371. ELSE
  3372. leftExpression := x.right;
  3373. rightExpression := x.left;
  3374. END;
  3375. Evaluate(leftExpression, left);
  3376. Emit(Push(position,left.op));
  3377. ReleaseOperand(left);
  3378. Designate(rightExpression, right);
  3379. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3380. IF ~backend.cellsAreObjects THEN
  3381. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3382. END;
  3383. Emit(Push(position,right.op));
  3384. ReleaseOperand(right);
  3385. IF backend.cellsAreObjects THEN
  3386. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3387. ELSE
  3388. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3389. END;
  3390. InitOperand(result, ModeValue);
  3391. result.op := NewRegisterOperand(bool);
  3392. Emit(Result(position,result.op));
  3393. IF conditional THEN
  3394. IntermediateCode.InitImmediate(zero,setType,0);
  3395. BrneL(trueLabel,result.op,zero);
  3396. ReleaseOperand(result);
  3397. BrL(falseLabel);
  3398. END;
  3399. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3400. leftExpression := x.left;
  3401. rightExpression := x.right;
  3402. Evaluate(leftExpression, left);
  3403. Emit(Push(position,left.op));
  3404. ReleaseOperand(left);
  3405. Evaluate(rightExpression, right);
  3406. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3407. IF ~backend.cellsAreObjects THEN
  3408. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3409. END;
  3410. Emit(Push(position,right.op));
  3411. ReleaseOperand(right);
  3412. IF backend.cellsAreObjects THEN
  3413. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3414. ELSE
  3415. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3416. END;
  3417. InitOperand(result, ModeValue);
  3418. result.op := NewRegisterOperand(bool);
  3419. Emit(Result(position,result.op));
  3420. IF conditional THEN
  3421. IntermediateCode.InitImmediate(zero,setType,0);
  3422. BrneL(trueLabel,result.op,zero);
  3423. ReleaseOperand(result);
  3424. BrL(falseLabel);
  3425. END;
  3426. ELSE
  3427. HALT(100);
  3428. END;
  3429. END;
  3430. destination := dest;
  3431. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3432. END VisitBinaryExpression;
  3433. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3434. VAR localResult, operand: Operand;
  3435. BEGIN
  3436. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3437. InitOperand(localResult, ModeValue);
  3438. ASSERT(x.first # NIL);
  3439. Evaluate(x.first, operand);
  3440. localResult.op := operand.op;
  3441. ReleaseOperand(operand);
  3442. UseIntermediateOperand(localResult.op);
  3443. ASSERT(x.last # NIL);
  3444. Evaluate(x.last, operand);
  3445. localResult.tag := operand.op;
  3446. ReleaseOperand(operand);
  3447. UseIntermediateOperand(localResult.tag);
  3448. IF x.step # NIL THEN
  3449. Evaluate(x.step, operand);
  3450. localResult.extra := operand.op;
  3451. ReleaseOperand(operand);
  3452. UseIntermediateOperand(localResult.extra);
  3453. END;
  3454. result := localResult;
  3455. IF Trace THEN TraceExit("VisitRangeExpression") END
  3456. END VisitRangeExpression;
  3457. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3458. BEGIN
  3459. HALT(100); (* should never be evaluated *)
  3460. END VisitTensorRangeExpression;
  3461. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3462. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3463. BEGIN
  3464. IF Trace THEN TraceEnter("VisitConversion") END;
  3465. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3466. dest := destination; destination := emptyOperand;
  3467. Evaluate(x.expression,old);
  3468. InitOperand(result,ModeValue);
  3469. result.op := old.op;
  3470. ASSERT(result.op.mode # 0);
  3471. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3472. (* convert TO a complex number *)
  3473. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3474. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3475. ASSERT(result.op.mode # 0);
  3476. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3477. (* convert FROM a complex number TO a complex number*)
  3478. result.tag := old.tag;
  3479. ASSERT(result.tag.mode # 0);
  3480. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3481. ASSERT(result.tag.mode # 0)
  3482. ELSE
  3483. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3484. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3485. END
  3486. ELSE
  3487. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3488. ASSERT(result.op.mode # 0);
  3489. result.tag := old.tag; (*! probably never used *)
  3490. END;
  3491. destination := dest;
  3492. IF Trace THEN TraceExit("VisitConversion") END;
  3493. END VisitConversion;
  3494. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3495. BEGIN
  3496. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3497. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3498. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3499. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3500. END VisitTypeDeclaration;
  3501. (** designators (expressions) *)
  3502. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3503. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3504. BEGIN
  3505. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3506. IF x.left # NIL THEN Expression(x.left) END;
  3507. Symbol(x.symbol,result);
  3508. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3509. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3510. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3511. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3512. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3513. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3514. END;
  3515. END;
  3516. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3517. END VisitSymbolDesignator;
  3518. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3519. BEGIN
  3520. IF isUnchecked THEN RETURN END;
  3521. IF tagsAvailable THEN
  3522. TrapC(BrltL,index,length,IndexCheckTrap);
  3523. END;
  3524. END BoundCheck;
  3525. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3526. VAR d: IntermediateCode.Operand;
  3527. BEGIN
  3528. IF isUnchecked THEN RETURN END;
  3529. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3530. TrapC(op,dim,d,ArraySizeTrap);
  3531. ReleaseIntermediateOperand(d);
  3532. END DimensionCheck;
  3533. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3534. VAR
  3535. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3536. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3537. expression: SyntaxTree.Expression;
  3538. resultingType, leftType, baseType: SyntaxTree.Type;
  3539. skipLabel1: Label;
  3540. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3541. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3542. variableOp: Operand;
  3543. variable: SyntaxTree.Variable;
  3544. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3545. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3546. VAR e: SyntaxTree.Expression; i: LONGINT;
  3547. BEGIN
  3548. tensorFound := FALSE;
  3549. FOR i := 0 TO parameters.Length()-1 DO
  3550. e := parameters.GetExpression(i);
  3551. IF e IS SyntaxTree.TensorRangeExpression THEN
  3552. ASSERT(~tensorFound);
  3553. tensorFound := TRUE;
  3554. ELSIF e IS SyntaxTree.RangeExpression THEN
  3555. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3556. ELSE
  3557. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3558. END;
  3559. END;
  3560. END CountIndices;
  3561. BEGIN
  3562. ASSERT(tagsAvailable);
  3563. resultingType := x.type.resolved; (* resulting type *)
  3564. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3565. InitOperand(localResult, ModeReference);
  3566. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3567. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3568. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3569. (* a globally defined array destination tag is available -> use and invalidate it*)
  3570. localResult.tag := arrayDestinationTag;
  3571. IntermediateCode.InitOperand(arrayDestinationTag)
  3572. ELSE
  3573. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3574. (* the result is of array range type and thus does not provide any collectable pointers *)
  3575. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3576. Symbol(variable, variableOp);
  3577. ReuseCopy(localResult.tag, variableOp.op);
  3578. ReleaseOperand(variableOp);
  3579. END
  3580. END;
  3581. indexListSize := x.parameters.Length();
  3582. CountIndices(x.parameters);
  3583. (*ASSERT(tensorRangeCount <= 1);*)
  3584. (* designate the array to be indexed over, perform tensor range check if known *)
  3585. Designate(x.left, array);
  3586. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3587. Dereference(array, leftType,FALSE);
  3588. IF ~tensorFound THEN
  3589. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  3590. END
  3591. END;
  3592. (* default base offset *)
  3593. srcDimOffset := 0;
  3594. destDimOffset := 0;
  3595. indexDim := 0;
  3596. (* use address of source array as basis *)
  3597. localResult.op := array.op;
  3598. UseIntermediateOperand(localResult.op);
  3599. (* go through the index list *)
  3600. FOR i := 0 TO indexListSize - 1 DO
  3601. expression := x.parameters.GetExpression(i);
  3602. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3603. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3604. srcDimOffset := -indexListSize;
  3605. destDimOffset := -suffixRanges;
  3606. ELSE
  3607. (* determine which dimension of source array is currently looked at *)
  3608. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3609. (* get the memory operand pointing to array descriptor dimension *)
  3610. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3611. (* make a reusable register from it *)
  3612. ReuseCopy(srcDim, tmp);
  3613. ReleaseIntermediateOperand(tmp);
  3614. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3615. ELSE
  3616. srcDim := IntermediateCode.Immediate(sizeType, i);
  3617. END;
  3618. (* get length and increment of source array for current dimension *)
  3619. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3620. Convert(sourceLength.op, sizeType);
  3621. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3622. Convert(sourceIncrement.op, sizeType);
  3623. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3624. ReleaseIntermediateOperand(srcDim);
  3625. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3626. (* SINGLE INDEX *)
  3627. Evaluate(expression, index);
  3628. ReleaseIntermediateOperand(index.tag);
  3629. index.tag := emptyOperand;
  3630. Convert(index.op, sizeType);
  3631. (* lower bound check *)
  3632. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3633. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3634. ELSIF isUnchecked THEN (* do nothing *)
  3635. ELSE
  3636. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3637. END;
  3638. (* upper bound check *)
  3639. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3640. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3641. ELSIF isUnchecked THEN (* do nothing *)
  3642. ELSE
  3643. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3644. END;
  3645. ReleaseOperand(sourceLength);
  3646. Convert(index.op, addressType);
  3647. summand := index.op;
  3648. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3649. (* RANGE OF INDICES *)
  3650. Evaluate(expression, range);
  3651. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3652. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3653. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3654. ReleaseOperand(range);
  3655. Convert(firstIndex, sizeType);
  3656. Convert(lastIndex, sizeType);
  3657. Convert(stepSize, sizeType);
  3658. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3659. if it is 'MAX(LONGINT)' *)
  3660. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3661. TransferToRegister(lastIndex, lastIndex);
  3662. skipLabel1 := NewLabel();
  3663. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3664. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3665. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3666. SetLabel(skipLabel1)
  3667. END;
  3668. (* check if step size is valid *)
  3669. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3670. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3671. ELSIF isUnchecked THEN (* do nothing *)
  3672. ELSE
  3673. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3674. END;
  3675. (* check lower bound check *)
  3676. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3677. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3678. ELSIF isUnchecked THEN (* do nothing *)
  3679. ELSE
  3680. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3681. END;
  3682. (* check upper bound check *)
  3683. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3684. (* statically open range: nothing to do *)
  3685. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3686. ASSERT(staticLastIndex < staticSourceLength)
  3687. ELSIF isUnchecked THEN (* do nothing *)
  3688. ELSE
  3689. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3690. END;
  3691. (* determine length of target array for current dimension *)
  3692. (* 1. incorporate last index: *)
  3693. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3694. (* last index is static *)
  3695. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3696. targetLength := sourceLength.op
  3697. ELSE
  3698. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3699. END;
  3700. UseIntermediateOperand(targetLength);
  3701. ELSE
  3702. (* targetLength := lastIndex + 1
  3703. Reuse1(targetLength, lastIndex);
  3704. *)
  3705. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3706. END;
  3707. ReleaseOperand(sourceLength);
  3708. ReleaseIntermediateOperand(lastIndex);
  3709. (* 2. incorporate first index: *)
  3710. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3711. (* first index and current target length are static *)
  3712. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3713. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3714. (* first index = 0: nothing to do *)
  3715. ELSE
  3716. (* targetLength := targetLength - firstIndex *)
  3717. TransferToRegister(targetLength, targetLength);
  3718. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3719. END;
  3720. (* clip negative lengths to 0 *)
  3721. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3722. IF staticTargetLength < 0 THEN
  3723. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3724. END
  3725. ELSE
  3726. skipLabel1 := NewLabel();
  3727. TransferToRegister(targetLength, targetLength);
  3728. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3729. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3730. SetLabel(skipLabel1)
  3731. END;
  3732. (* 3. incorporate index step size: *)
  3733. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3734. (*step size and current target length are static *)
  3735. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3736. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3737. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3738. (* step size = 1: nothing to do *)
  3739. ELSE
  3740. (* emit code for this:
  3741. targetLength := (targetLength-1) DIV stepSize +1;
  3742. *)
  3743. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3744. DivInt(targetLength, targetLength, stepSize);
  3745. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3746. END;
  3747. (* determine increment of target array for current dimension *)
  3748. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3749. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3750. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3751. (* step size = 1 *)
  3752. targetIncrement := sourceIncrement.op;
  3753. UseIntermediateOperand(targetIncrement)
  3754. ELSE
  3755. (* targetIncrement := sourceIncrement * stepSize *)
  3756. Reuse1(targetIncrement, stepSize);
  3757. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3758. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3759. END;
  3760. ReleaseIntermediateOperand(stepSize);
  3761. (* write length and increment of target array to descriptor *)
  3762. IF destDimOffset < 0 THEN
  3763. (* determine which dimension of target array is currently looked at *)
  3764. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3765. TransferToRegister(destDim, tmp);
  3766. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3767. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3768. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3769. ReleaseIntermediateOperand(destDim);
  3770. INC(destDimOffset);
  3771. ELSE
  3772. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3773. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  3774. END;
  3775. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3776. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3777. INC(indexDim);
  3778. Convert(firstIndex, addressType);
  3779. TransferToRegister(summand, firstIndex);
  3780. ELSE HALT(100);
  3781. END;
  3782. (*
  3783. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3784. *)
  3785. Convert(sourceIncrement.op, addressType);
  3786. Convert(summand, addressType);
  3787. MulInt(summand, summand, sourceIncrement.op);
  3788. ReleaseIntermediateOperand(sourceIncrement.op);
  3789. AddInt(localResult.op, localResult.op, summand);
  3790. ReleaseIntermediateOperand(summand);
  3791. END
  3792. END;
  3793. result := localResult;
  3794. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3795. ReleaseIntermediateOperand(result.tag);
  3796. result.tag := TypeDescriptorAdr(resultingType);
  3797. IF ~newObjectFile THEN
  3798. IntermediateCode.MakeMemory(result.tag,addressType);
  3799. END;
  3800. ELSIF IsDelegate(resultingType) THEN
  3801. ReleaseIntermediateOperand(result.tag);
  3802. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3803. UseIntermediateOperand(result.tag);
  3804. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3805. ReleaseIntermediateOperand(result.tag);
  3806. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3807. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3808. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3809. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3810. (* finalize target array descriptor *)
  3811. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3812. (* write lengths and increments of target array for remaining dimensions *)
  3813. i := indexListSize;
  3814. WHILE indexDim < targetArrayDimensionality DO
  3815. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3816. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3817. ReleaseOperand(sourceLength);
  3818. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3819. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3820. ReleaseOperand(sourceIncrement);
  3821. INC(i); INC(indexDim);
  3822. END;
  3823. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3824. tmp := nil;
  3825. ELSE
  3826. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3827. END;
  3828. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3829. ReleaseIntermediateOperand(tmp);
  3830. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3831. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3832. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3833. ELSE
  3834. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3835. END;
  3836. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3837. ReleaseIntermediateOperand(tmp);
  3838. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3839. (* write dimensionality *)
  3840. IF targetArrayDimensionality # 0 THEN
  3841. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3842. END;
  3843. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3844. END;
  3845. ReleaseOperand(array);
  3846. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3847. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3848. END;
  3849. END MathIndexDesignator;
  3850. (* get the length of an array , trying to make use of static information *)
  3851. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3852. VAR res: IntermediateCode.Operand; size: LONGINT;
  3853. BEGIN
  3854. type := type.resolved;
  3855. IF type IS SyntaxTree.ArrayType THEN
  3856. WITH type: SyntaxTree.ArrayType DO
  3857. IF type.form = SyntaxTree.Static THEN
  3858. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3859. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3860. Evaluate(type.length, op);
  3861. ReleaseIntermediateOperand(op.tag);
  3862. RETURN op.op;*)
  3863. ELSE
  3864. res := tag;
  3865. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3866. IntermediateCode.MakeMemory(res,addressType);
  3867. UseIntermediateOperand(res);
  3868. RETURN res
  3869. END
  3870. END;
  3871. ELSE
  3872. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3873. RETURN IntermediateCode.Immediate(addressType,size);
  3874. END;
  3875. END ArrayLength;
  3876. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  3877. BEGIN
  3878. IF IsImmediate(x) THEN
  3879. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  3880. ELSE
  3881. IF ~ReusableRegister(res) THEN
  3882. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3883. ELSE
  3884. UseIntermediateOperand(res);
  3885. END;
  3886. Emit(Mov(position,res,x))
  3887. END;
  3888. END CopyInt;
  3889. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3890. BEGIN
  3891. ReleaseIntermediateOperand(res);
  3892. IF IsImmediate(x) & IsImmediate(y) THEN
  3893. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3894. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3895. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3896. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3897. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3898. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3899. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3900. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3901. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3902. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3903. UseIntermediateOperand(res);
  3904. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3905. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3906. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3907. UseIntermediateOperand(res);
  3908. ELSE
  3909. IF ~ReusableRegister(res) THEN
  3910. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3911. ELSE
  3912. UseIntermediateOperand(res);
  3913. END;
  3914. IF IsImmediate(x) & (x.intValue = 0) THEN
  3915. Emit(Mov(position,res,y))
  3916. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3917. Emit(Mov(position,res,x))
  3918. ELSE
  3919. Emit(Add(position,res, x, y));
  3920. END;
  3921. END;
  3922. END AddInt;
  3923. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3924. BEGIN
  3925. ReleaseIntermediateOperand(res);
  3926. IF IsImmediate(x) & IsImmediate(y) THEN
  3927. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3928. ELSE
  3929. IF ~ReusableRegister(res) THEN
  3930. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3931. ELSE UseIntermediateOperand(res);
  3932. END;
  3933. IF IsImmediate(x) & (x.intValue = 1) THEN
  3934. Emit(Mov(position,res,y))
  3935. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3936. Emit(Mov(position,res,x))
  3937. ELSE
  3938. Emit(Mul(position,res, x, y));
  3939. END;
  3940. END;
  3941. END MulInt;
  3942. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3943. BEGIN
  3944. ReleaseIntermediateOperand(res);
  3945. IF IsImmediate(x) & IsImmediate(y) THEN
  3946. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3947. ELSE
  3948. IF ~ReusableRegister(res) THEN
  3949. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3950. ELSE UseIntermediateOperand(res);
  3951. END;
  3952. IF IsImmediate(x) & (x.intValue = 1) THEN
  3953. Emit(Mov(position,res,y))
  3954. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3955. Emit(Mov(position,res,x))
  3956. ELSE
  3957. Emit(Div(position,res, x, y));
  3958. END;
  3959. END;
  3960. END DivInt;
  3961. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3962. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3963. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3964. BEGIN
  3965. type := x.left.type.resolved;
  3966. IF type IS SyntaxTree.StringType THEN
  3967. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  3968. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3969. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  3970. type := atype;
  3971. x.left.SetType(type);
  3972. END;
  3973. IntermediateCode.InitImmediate(res,addressType,0);
  3974. maxDim := x.parameters.Length()-1;
  3975. (*
  3976. computation rule:
  3977. a: ARRAY X,Y,Z OF Element with size S
  3978. a[i,j,k] -->
  3979. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  3980. *)
  3981. FOR i := 0 TO maxDim DO
  3982. e := x.parameters.GetExpression(i);
  3983. Evaluate(e,index);
  3984. Convert(index.op,addressType);
  3985. AddInt(res, res, index.op);
  3986. IF i = 0 THEN
  3987. (*
  3988. ReuseCopy(res, index.op);
  3989. *)
  3990. Designate(x.left,array);
  3991. type := x.left.type.resolved;
  3992. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3993. Dereference(array, type, FALSE);
  3994. END;
  3995. (*
  3996. ELSE AddInt(res, res, index.op);
  3997. *)
  3998. END;
  3999. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4000. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4001. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4002. BoundCheck(index.op, length);
  4003. END;
  4004. ReleaseIntermediateOperand(length);
  4005. END;
  4006. ReleaseOperand(index);
  4007. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4008. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4009. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4010. MulInt(res,res,length);
  4011. END;
  4012. ReleaseIntermediateOperand(length);
  4013. END;
  4014. (* remaining open dimensions -- compute address *)
  4015. i := maxDim+1;
  4016. IF type IS SyntaxTree.ArrayType THEN
  4017. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4018. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4019. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4020. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4021. MulInt(res,res,length);
  4022. END;
  4023. ReleaseIntermediateOperand(length);
  4024. INC(i);
  4025. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4026. END;
  4027. END;
  4028. IF (type IS SyntaxTree.ArrayType) THEN
  4029. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4030. size := StaticSize(system, type);
  4031. IF size # 1 THEN
  4032. length := IntermediateCode.Immediate(addressType,size);
  4033. MulInt(res,res,length);
  4034. END;
  4035. ELSE
  4036. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4037. IF size # 1 THEN
  4038. length := IntermediateCode.Immediate(addressType,size);
  4039. MulInt(res,res,length);
  4040. END;
  4041. END;
  4042. END;
  4043. AddInt(res,res,array.op);
  4044. InitOperand(result,ModeReference);
  4045. result.op := res;
  4046. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4047. ReleaseIntermediateOperand(result.tag);
  4048. result.tag := TypeDescriptorAdr(type);
  4049. IF ~newObjectFile THEN
  4050. IntermediateCode.MakeMemory(result.tag,addressType);
  4051. END
  4052. ELSIF IsDelegate(type) THEN
  4053. ReleaseIntermediateOperand(result.tag);
  4054. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4055. UseIntermediateOperand(result.tag);
  4056. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4057. ReleaseIntermediateOperand(result.tag);
  4058. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4059. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4060. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4061. END;
  4062. ReleaseOperand(array);
  4063. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  4064. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  4065. END;
  4066. END IndexDesignator;
  4067. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  4068. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4069. BEGIN
  4070. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4071. dest := destination; destination := emptyOperand;
  4072. type := x.left.type.resolved;
  4073. IF type IS SyntaxTree.MathArrayType THEN
  4074. MathIndexDesignator(x);
  4075. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4076. IndexDesignator(x);
  4077. END;
  4078. destination := dest;
  4079. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4080. END VisitIndexDesignator;
  4081. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4082. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4083. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4084. procedure: SyntaxTree.Procedure;
  4085. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4086. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4087. BEGIN
  4088. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4089. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4090. parameters := expression.parameters;
  4091. moduleName := "FoxArrayBase";
  4092. procedureName := "CopyDescriptor";
  4093. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4094. SaveRegisters();ReleaseUsedRegisters(saved);
  4095. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4096. IF procedure = NIL THEN
  4097. s := "procedure ";
  4098. Strings.Append(s,moduleName);
  4099. Strings.Append(s,".");
  4100. Strings.Append(s,procedureName);
  4101. Strings.Append(s," not present");
  4102. Error(position,s);
  4103. ELSE
  4104. (* push address of temporary variable *)
  4105. Symbol(variable,destOperand);
  4106. Emit(Push(position,destOperand.op));
  4107. ReleaseOperand(destOperand);
  4108. (* push src *)
  4109. Evaluate(expression.left,srcOperand);
  4110. (*
  4111. Dereference(srcOperand,expression.type.resolved);
  4112. Emit(Push(position,srcOperand.tag));
  4113. *)
  4114. Emit(Push(position,srcOperand.op));
  4115. ReleaseOperand(srcOperand);
  4116. tensorFound := FALSE;
  4117. FOR i := 0 TO parameters.Length()-1 DO
  4118. e := parameters.GetExpression(i);
  4119. IF e IS SyntaxTree.TensorRangeExpression THEN
  4120. tensorFound := TRUE;
  4121. ELSIF e IS SyntaxTree.RangeExpression THEN
  4122. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4123. ELSE
  4124. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4125. END;
  4126. END;
  4127. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4128. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4129. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4130. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4131. StaticCallOperand(procOp,procedure);
  4132. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  4133. ReleaseOperand(procOp);
  4134. END;
  4135. RestoreRegisters(saved);
  4136. END;
  4137. RETURN variable
  4138. END PrepareTensorDescriptor;
  4139. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4140. VAR
  4141. type, descriptorType, baseType: SyntaxTree.Type;
  4142. operand, tmpOperand, variableOp, variable2Op: Operand;
  4143. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4144. variable, variable2: SyntaxTree.Variable;
  4145. dim, i, size: LONGINT;
  4146. (* TODO: needed? *)
  4147. oldArrayDestinationTag: IntermediateCode.Operand;
  4148. oldArrayDestinationDimension: LONGINT;
  4149. position: Position;
  4150. saved: RegisterEntry;
  4151. arrayFlags: SET;
  4152. m, n: LONGINT;
  4153. PROCEDURE Pass(op: IntermediateCode.Operand);
  4154. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4155. BEGIN
  4156. IF numberRegister >= 0 THEN
  4157. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  4158. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4159. Emit(Mov(position,parameterRegister, op));
  4160. ELSE
  4161. Emit(Push(position,op))
  4162. END
  4163. END Pass;
  4164. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4165. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4166. BEGIN
  4167. formalType := formalType.resolved; actualType := actualType.resolved;
  4168. IF IsOpenArray(formalType)THEN
  4169. IF actualType IS SyntaxTree.StringType THEN
  4170. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4171. RETURN;
  4172. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4173. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4174. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4175. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4176. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4177. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4178. ELSE
  4179. tmp := baseReg;
  4180. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4181. IntermediateCode.MakeMemory(tmp,addressType);
  4182. Pass((tmp));
  4183. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4184. END;
  4185. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4186. END;
  4187. END PushArrayLens;
  4188. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4189. BEGIN
  4190. CASE size OF
  4191. |2: INCL(flags,Size2Flag);
  4192. |3: INCL(flags,Size3Flag);
  4193. |4: INCL(flags,Size4Flag);
  4194. |5: INCL(flags,Size5Flag);
  4195. |6: INCL(flags,Size6Flag);
  4196. |7: INCL(flags,Size7Flag);
  4197. |8: INCL(flags,Size8Flag);
  4198. END;
  4199. END SetSmallArraySizeFlag;
  4200. BEGIN
  4201. IF Trace THEN TraceEnter("PushParameter") END;
  4202. position := expression.position;
  4203. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4204. type := expression.type.resolved;
  4205. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4206. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4207. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4208. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4209. );
  4210. (* TODO: needed? *)
  4211. oldArrayDestinationTag := arrayDestinationTag;
  4212. oldArrayDestinationDimension := arrayDestinationDimension;
  4213. IF IsArrayOfSystemByte(parameter.type) THEN
  4214. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4215. Designate(expression,operand);
  4216. ELSE
  4217. Evaluate(expression, tmpOperand);
  4218. (* array of system byte does not provide any pointers *)
  4219. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4220. Symbol(variable, operand);
  4221. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4222. Emit(Mov(position,tmp, tmpOperand.op));
  4223. ReleaseOperand(tmpOperand);
  4224. END;
  4225. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4226. ReleaseIntermediateOperand(operand.tag);
  4227. operand.tag := tmp;
  4228. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4229. Pass((operand.tag));
  4230. END;
  4231. Pass((operand.op));
  4232. ELSIF IsOpenArray(parameter.type) THEN
  4233. Designate(expression,operand);
  4234. baseReg := operand.tag;
  4235. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4236. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4237. END;
  4238. Pass((operand.op)); (* address of the array *)
  4239. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4240. (* case 1
  4241. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4242. *)
  4243. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4244. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4245. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4246. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4247. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4248. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4249. arrayDestinationTag := sp;
  4250. (* case 1b
  4251. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4252. *)
  4253. IF expression IS SyntaxTree.IndexDesignator THEN
  4254. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4255. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4256. arrayDestinationDimension := dim;
  4257. Designate(expression,operand);
  4258. (* case 1a
  4259. P(...,A,...) push: push array descriptor to stack
  4260. *)
  4261. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4262. Designate(expression,operand);
  4263. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4264. i := 0;
  4265. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4266. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4267. INC(i);
  4268. END;
  4269. type := expression.type.resolved;
  4270. WHILE (i<dim) DO (* remaining static dimensions *)
  4271. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4272. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4273. ReleaseOperand(tmpOperand);
  4274. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4275. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4276. ReleaseOperand(tmpOperand);
  4277. INC(i);
  4278. END;
  4279. dimOp := IntermediateCode.Immediate(addressType,dim);
  4280. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4281. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4282. (* case 1d
  4283. P(...,T,...) push: process left arguments, create array descriptor with given number of dimensions from T on stack
  4284. + case 1e
  4285. P(.. PT() ... );
  4286. *)
  4287. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4288. Designate(expression,operand);
  4289. Dereference(operand,type.resolved,FALSE);
  4290. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4291. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4292. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4293. (* case 1f
  4294. P(...,S,...) push: create array descriptor to S on stack
  4295. case 1g
  4296. P(... PS()...)
  4297. *)
  4298. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4299. Designate(expression,operand);
  4300. FOR i := 0 TO dim-1 DO
  4301. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4302. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4303. ReleaseOperand(tmpOperand);
  4304. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4305. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4306. ReleaseOperand(tmpOperand);
  4307. END;
  4308. (*******
  4309. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4310. *)
  4311. arrayFlags := {StaticFlag};
  4312. IF dim = 1 THEN
  4313. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4314. ReleaseOperand(tmpOperand);
  4315. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4316. m := LONGINT(tmpOperand.op.intValue);
  4317. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4318. ELSIF dim = 2 THEN
  4319. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4320. ReleaseOperand(tmpOperand);
  4321. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4322. m := LONGINT(tmpOperand.op.intValue);
  4323. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4324. ReleaseOperand(tmpOperand);
  4325. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4326. n := LONGINT(tmpOperand.op.intValue);
  4327. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4328. INCL(arrayFlags,SmallMatrixFlag);
  4329. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4330. END;
  4331. END;
  4332. (*******)
  4333. dimOp := IntermediateCode.Immediate(addressType,dim);
  4334. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4335. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4336. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4337. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4338. baseType := SemanticChecker.ArrayBase(type,dim);
  4339. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4340. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4341. ELSE HALT(100);
  4342. END;
  4343. (* case 2
  4344. procedure P([left args], var A: array [*,*] of Type, [right args])
  4345. *)
  4346. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4347. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4348. (* case 2b
  4349. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4350. push: push reference to pushed array descriptor
  4351. post: remove array descriptor.
  4352. *)
  4353. IF expression IS SyntaxTree.IndexDesignator THEN
  4354. descriptorType := GetMathArrayDescriptorType(dim);
  4355. (* range type : no allocation possible, should be untraced *)
  4356. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4357. Symbol(variable,variableOp);
  4358. arrayDestinationTag := variableOp.op;
  4359. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4360. arrayDestinationDimension := dim;
  4361. NeedDescriptor := TRUE;
  4362. Designate(expression,operand);
  4363. Pass((operand.tag));
  4364. NeedDescriptor := FALSE;
  4365. (* case 2a
  4366. P(...,A,...)
  4367. push: push reference to array descriptor on stack
  4368. *)
  4369. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4370. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4371. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4372. INC(i);
  4373. END;
  4374. IF i = dim THEN
  4375. Designate(expression,operand);
  4376. Pass((operand.tag));
  4377. ELSE (* open-static *)
  4378. type := expression.type.resolved;
  4379. descriptorType := GetMathArrayDescriptorType(dim);
  4380. (* static array , cannot be reallocated, untraced !*)
  4381. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4382. Symbol(variable,variableOp);
  4383. arrayDestinationTag := variableOp.op;
  4384. Designate(expression,operand);
  4385. FOR i := 0 TO dim-1 DO
  4386. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4387. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4388. ReleaseOperand(tmpOperand);
  4389. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4390. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4391. ReleaseOperand(tmpOperand);
  4392. END;
  4393. dimOp := IntermediateCode.Immediate(addressType,dim);
  4394. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4395. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4396. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4397. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4398. baseType := SemanticChecker.ArrayBase(type,dim);
  4399. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4400. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4401. Pass((arrayDestinationTag));
  4402. END;
  4403. (* case 2d
  4404. P(...,T,...) push: emit dimension check, push T
  4405. *)
  4406. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4407. Designate(expression,operand);
  4408. Dereference(operand,type.resolved,FALSE);
  4409. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4410. Pass((operand.tag));
  4411. (* case 2f
  4412. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4413. push: push reference to pushed array descriptor
  4414. post: remove array descriptor
  4415. *)
  4416. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4417. descriptorType := GetMathArrayDescriptorType(dim);
  4418. (* static array -- cannot be reallocatated, untraced *)
  4419. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4420. Symbol(variable,variableOp);
  4421. arrayDestinationTag := variableOp.op;
  4422. Designate(expression,operand);
  4423. FOR i := 0 TO dim-1 DO
  4424. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4425. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4426. ReleaseOperand(tmpOperand);
  4427. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4428. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4429. ReleaseOperand(tmpOperand);
  4430. END;
  4431. (*
  4432. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4433. *)
  4434. arrayFlags := {StaticFlag};
  4435. IF dim = 1 THEN
  4436. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4437. ReleaseOperand(tmpOperand);
  4438. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4439. m := LONGINT(tmpOperand.op.intValue);
  4440. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4441. ELSIF dim = 2 THEN
  4442. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4443. ReleaseOperand(tmpOperand);
  4444. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4445. m := LONGINT(tmpOperand.op.intValue);
  4446. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4447. ReleaseOperand(tmpOperand);
  4448. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4449. n := LONGINT(tmpOperand.op.intValue);
  4450. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4451. INCL(arrayFlags,SmallMatrixFlag);
  4452. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4453. END;
  4454. END;
  4455. (*******)
  4456. dimOp := IntermediateCode.Immediate(addressType,dim);
  4457. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4458. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4459. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4460. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4461. baseType := SemanticChecker.ArrayBase(type,dim);
  4462. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4463. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4464. Pass((arrayDestinationTag));
  4465. ELSE HALT(100);
  4466. END;
  4467. (* case 3
  4468. procedure P([left args], [const] A: array [?] of Type, [right args])
  4469. *)
  4470. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4471. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4472. (* case 3b
  4473. P(...,A[a..b,c..d],...)
  4474. *)
  4475. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4476. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4477. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4478. Symbol(variable,variableOp);
  4479. LoadValue(variableOp,system.addressType);
  4480. ELSE
  4481. descriptorType := GetMathArrayDescriptorType(dim);
  4482. (* range -- cannot be reallocated *)
  4483. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4484. Symbol(variable,variableOp);
  4485. END;
  4486. arrayDestinationTag := variableOp.op;
  4487. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4488. arrayDestinationDimension := 0;
  4489. Designate(expression,operand);
  4490. Pass((operand.tag));
  4491. (* case 3a
  4492. P(...,A,...)
  4493. *)
  4494. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4495. i := 0;
  4496. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4497. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4498. INC(i);
  4499. END;
  4500. IF i = dim THEN
  4501. Designate(expression,operand);
  4502. Pass((operand.tag));
  4503. ELSE (* open-static *)
  4504. type := expression.type.resolved;
  4505. descriptorType := GetMathArrayDescriptorType(dim);
  4506. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4507. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4508. Symbol(variable,variableOp);
  4509. arrayDestinationTag := variableOp.op;
  4510. Designate(expression,operand);
  4511. FOR i := 0 TO dim-1 DO
  4512. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4513. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4514. ReleaseOperand(tmpOperand);
  4515. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4516. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4517. ReleaseOperand(tmpOperand);
  4518. END;
  4519. dimOp := IntermediateCode.Immediate(addressType,dim);
  4520. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4521. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4522. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4523. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4524. baseType := SemanticChecker.ArrayBase(type,dim);
  4525. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4526. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4527. Pass((arrayDestinationTag));
  4528. END;
  4529. (* case 3d
  4530. P(...,T,...)
  4531. case 3e
  4532. P(...,PT(...),...)
  4533. *)
  4534. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4535. Designate(expression,operand);
  4536. Dereference(operand,type.resolved,FALSE);
  4537. Pass((operand.tag));
  4538. (* case 3f
  4539. P(...,S,...)
  4540. case 3g
  4541. P(...,PS(...),...)
  4542. *)
  4543. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4544. descriptorType := GetMathArrayDescriptorType(dim);
  4545. (* static array does not need to be traced *)
  4546. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4547. Symbol(variable,variableOp);
  4548. arrayDestinationTag := variableOp.op;
  4549. Designate(expression,operand);
  4550. IF operand.op.type.length >1 THEN (* vector register *)
  4551. (* static array does not need to be traced *)
  4552. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4553. Symbol(variable2, variable2Op);
  4554. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4555. Emit(Mov(position,tmp, operand.op));
  4556. ReleaseOperand(operand);
  4557. Symbol(variable2, operand);
  4558. END;
  4559. FOR i := 0 TO dim-1 DO
  4560. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4561. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4562. ReleaseOperand(tmpOperand);
  4563. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4564. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4565. ReleaseOperand(tmpOperand);
  4566. END;
  4567. dimOp := IntermediateCode.Immediate(addressType,dim);
  4568. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4569. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4570. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4571. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4572. baseType := SemanticChecker.ArrayBase(type,dim);
  4573. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4574. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4575. Pass((arrayDestinationTag));
  4576. ELSE HALT(100);
  4577. END;
  4578. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4579. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4580. (* case 4b
  4581. P(...,A[a..b,c..d],...)
  4582. *)
  4583. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4584. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4585. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4586. Symbol(variable,variableOp);
  4587. LoadValue(variableOp,system.addressType);
  4588. ELSE
  4589. descriptorType := GetMathArrayDescriptorType(dim);
  4590. (* range array -- cannot be allocated *)
  4591. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4592. Symbol(variable,variableOp);
  4593. END;
  4594. arrayDestinationTag := variableOp.op;
  4595. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4596. arrayDestinationDimension := 0;
  4597. Designate(expression,operand);
  4598. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4599. Symbol(variable,variableOp);
  4600. ELSE
  4601. (* alias to range -- untraced *)
  4602. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4603. Symbol(variable,variableOp);
  4604. MakeMemory(tmp,variableOp.op,addressType,0);
  4605. Emit(Mov(position,tmp,operand.tag));
  4606. ReleaseIntermediateOperand(tmp);
  4607. END;
  4608. Pass((variableOp.op));
  4609. ReleaseOperand(variableOp);
  4610. (* case 4a
  4611. P(...,A,...)
  4612. *)
  4613. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4614. i := 0;
  4615. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4616. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4617. INC(i);
  4618. END;
  4619. IF i = dim THEN
  4620. Designate(expression,operand);
  4621. arrayDestinationTag := operand.tag;
  4622. ELSE (* open-static *)
  4623. type := expression.type.resolved;
  4624. descriptorType := GetMathArrayDescriptorType(dim);
  4625. (* static array -- untraced *)
  4626. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4627. Symbol(variable,variableOp);
  4628. arrayDestinationTag := variableOp.op;
  4629. Designate(expression,operand);
  4630. FOR i := 0 TO dim-1 DO
  4631. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4632. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4633. ReleaseOperand(tmpOperand);
  4634. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4635. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4636. ReleaseOperand(tmpOperand);
  4637. END;
  4638. dimOp := IntermediateCode.Immediate(addressType,dim);
  4639. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4640. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4641. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4642. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4643. baseType := SemanticChecker.ArrayBase(type,dim);
  4644. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4645. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4646. END;
  4647. (* tensor alias to open array -- untraced *)
  4648. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4649. Symbol(variable,variableOp);
  4650. MakeMemory(tmp,variableOp.op,addressType,0);
  4651. Emit(Mov(position,tmp,arrayDestinationTag));
  4652. ReleaseIntermediateOperand(tmp);
  4653. Pass((variableOp.op));
  4654. ReleaseOperand(variableOp);
  4655. (* case 4d
  4656. P(...,T,...)
  4657. *)
  4658. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4659. Designate(expression,operand);
  4660. Pass((operand.op));
  4661. (* case 4f
  4662. P(...,S,...)
  4663. *)
  4664. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4665. descriptorType := GetMathArrayDescriptorType(dim);
  4666. (* static array -- cannot be reallocated, untraced *)
  4667. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4668. Symbol(variable,variableOp);
  4669. arrayDestinationTag := variableOp.op;
  4670. Designate(expression,operand);
  4671. FOR i := 0 TO dim-1 DO
  4672. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4673. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4674. ReleaseOperand(tmpOperand);
  4675. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4676. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4677. ReleaseOperand(tmpOperand);
  4678. END;
  4679. dimOp := IntermediateCode.Immediate(addressType,dim);
  4680. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4681. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4682. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4683. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4684. baseType := SemanticChecker.ArrayBase(type,dim);
  4685. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4686. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4687. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4688. Symbol(variable,variableOp);
  4689. MakeMemory(tmp,variableOp.op,addressType,0);
  4690. Emit(Mov(position,tmp,arrayDestinationTag));
  4691. ReleaseIntermediateOperand(tmp);
  4692. Pass((variableOp.op));
  4693. ReleaseOperand(variableOp);
  4694. ELSE HALT(100);
  4695. END;
  4696. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4697. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4698. Designate(expression,operand);
  4699. IF operand.op.type.length > 1 THEN
  4700. Emit(Push(position, operand.op));
  4701. ELSE
  4702. size := system.SizeOf(type);
  4703. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4704. size := ToMemoryUnits(system,size);
  4705. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4706. arrayDestinationTag := sp;
  4707. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4708. END;
  4709. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4710. Designate(expression,operand);
  4711. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4712. (* static array no pointer *)
  4713. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4714. Symbol(variable,variableOp);
  4715. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4716. Emit(Mov(position,tmp,operand.op));
  4717. Emit(Push(position,variableOp.op));
  4718. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4719. Pass((operand.op));
  4720. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4721. END;
  4722. ELSE HALT(200)
  4723. END;
  4724. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4725. IF parameter.kind = SyntaxTree.VarParameter THEN
  4726. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4727. Designate(expression, operand);
  4728. Pass((operand.op));
  4729. ELSE
  4730. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4731. Evaluate(expression, operand);
  4732. Pass((operand.extra)); (* step *)
  4733. Pass((operand.tag)); (* last *)
  4734. Pass((operand.op)) (* first *)
  4735. END
  4736. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4737. IF parameter.kind = SyntaxTree.VarParameter THEN
  4738. Designate(expression, operand);
  4739. Pass((operand.op));
  4740. ELSE
  4741. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4742. Evaluate(expression, operand);
  4743. Pass((operand.tag)); (* real part *)
  4744. Pass((operand.op)) (* imaginary part *)
  4745. END
  4746. ELSE
  4747. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4748. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4749. Designate(expression,operand);
  4750. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4751. (* stack allocation *)
  4752. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4753. (*! parameter alignment to be discussed ... *)
  4754. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4755. size := type(SyntaxTree.StringType).length;
  4756. END;
  4757. IF backend.cooperative & parameter.NeedsTrace() THEN
  4758. dst := NewRegisterOperand (addressType);
  4759. Emit(Mov(position,dst, sp));
  4760. IntermediateCode.InitImmediate(null, byteType, 0);
  4761. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4762. ReleaseIntermediateOperand(dst);
  4763. SaveRegisters();ReleaseUsedRegisters(saved);
  4764. (* register dst has been freed before SaveRegisters already *)
  4765. CallAssignMethod(dst, operand.op, parameter.type);
  4766. RestoreRegisters(saved);
  4767. END;
  4768. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4769. ELSIF IsOpenArray(parameter.type) THEN
  4770. Designate(expression,operand);
  4771. baseReg := operand.tag;
  4772. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4773. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4774. END;
  4775. Pass((operand.op)); (* address of the array *)
  4776. ELSIF IsDelegate(parameter.type) THEN
  4777. Evaluate(expression,operand);
  4778. IF backend.cooperative & parameter.NeedsTrace() THEN
  4779. Emit(Push(position, nil));
  4780. dst := NewRegisterOperand (addressType);
  4781. Emit(Mov(position,dst, sp));
  4782. ReleaseIntermediateOperand(dst);
  4783. SaveRegisters();ReleaseUsedRegisters(saved);
  4784. Emit(Push(position, dst));
  4785. (* register dst has been freed before SaveRegisters already *)
  4786. Emit(Push(position, operand.tag));
  4787. CallThis(position,"GarbageCollector","Assign",2);
  4788. RestoreRegisters(saved);
  4789. ELSE
  4790. Pass((operand.tag));
  4791. END;
  4792. Pass((operand.op));
  4793. ELSE
  4794. Evaluate(expression,operand);
  4795. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4796. Emit(Push(position, nil));
  4797. dst := NewRegisterOperand (addressType);
  4798. Emit(Mov(position,dst, sp));
  4799. ReleaseIntermediateOperand(dst);
  4800. SaveRegisters();ReleaseUsedRegisters(saved);
  4801. Emit(Push(position, dst));
  4802. (* register dst has been freed before SaveRegisters already *)
  4803. Emit(Push(position, operand.op));
  4804. CallThis(position,"GarbageCollector","Assign",2);
  4805. RestoreRegisters(saved);
  4806. ELSE
  4807. Pass((operand.op));
  4808. END;
  4809. END;
  4810. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4811. Evaluate(expression,operand);
  4812. Pass((operand.op));
  4813. ELSE (* var parameter *)
  4814. Designate(expression,operand);
  4815. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4816. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4817. Pass((operand.tag));
  4818. END;
  4819. END;
  4820. Pass((operand.op));
  4821. END;
  4822. END;
  4823. (* TODO: needed? *)
  4824. arrayDestinationTag := oldArrayDestinationTag;
  4825. arrayDestinationDimension := oldArrayDestinationDimension;
  4826. IF needsParameterBackup THEN
  4827. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4828. ReuseCopy(parameterBackup, operand.op)
  4829. END;
  4830. ReleaseOperand(operand);
  4831. IF Trace THEN TraceExit("PushParameter") END;
  4832. END PushParameter;
  4833. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4834. VAR prevConditional: BOOLEAN;
  4835. BEGIN
  4836. prevConditional := conditional;
  4837. conditional := FALSE;
  4838. 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
  4839. Expression(x.result); (* use register *)
  4840. END;
  4841. Statement(x.statement);
  4842. conditional := prevConditional;
  4843. IF x.result # NIL THEN Expression(x.result) END;
  4844. 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
  4845. ReleaseIntermediateOperand(result.op);
  4846. END;
  4847. END VisitStatementDesignator;
  4848. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4849. VAR
  4850. procedure: SyntaxTree.Procedure;
  4851. procedureType: SyntaxTree.ProcedureType;
  4852. wasInline: BOOLEAN;
  4853. actualParameters: SyntaxTree.ExpressionList;
  4854. formalParameter: SyntaxTree.Parameter;
  4855. actualParameter: SyntaxTree.Expression;
  4856. i: LONGINT;
  4857. localVariable: SyntaxTree.Variable;
  4858. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4859. src, dest: Operand;
  4860. prevInlineExit : Label;
  4861. prevMapper: SymbolMapper;
  4862. tooComplex: BOOLEAN;
  4863. resultDesignator: SyntaxTree.Expression;
  4864. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4865. BEGIN
  4866. IF e = NIL THEN RETURN TRUE
  4867. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4868. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4869. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4870. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4871. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4872. ELSE RETURN FALSE
  4873. END;
  4874. END SimpleExpression;
  4875. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4876. BEGIN
  4877. RETURN checker.CanPassInRegister(type)
  4878. END FitsInRegister;
  4879. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4880. VAR
  4881. variable: SyntaxTree.Variable;
  4882. variableDesignator: SyntaxTree.Designator;
  4883. BEGIN
  4884. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  4885. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  4886. variableDesignator.SetType(type);
  4887. RETURN variableDesignator
  4888. END GetTemp;
  4889. BEGIN
  4890. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4891. wasInline := currentIsInline;
  4892. prevInlineExit := currentInlineExit;
  4893. prevMapper := currentMapper;
  4894. currentInlineExit := NewLabel();
  4895. tooComplex := FALSE;
  4896. NEW(currentMapper);
  4897. currentIsInline := TRUE;
  4898. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4899. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4900. formalParameter := procedureType.firstParameter;
  4901. actualParameters := x.parameters;
  4902. i := 0;
  4903. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4904. actualParameter := actualParameters.GetExpression(i);
  4905. IF actualParameter.resolved # NIL THEN
  4906. actualParameter := actualParameter.resolved
  4907. END;
  4908. (*
  4909. if expression is simple and can be passed immediately
  4910. or if type fits in register then we can proceed
  4911. otherwise we escape to ordinary procedure call.
  4912. *)
  4913. (* cases where the expression can be mapped identically *)
  4914. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4915. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  4916. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4917. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4918. (*
  4919. Assign(variableDesignator, actualParameter);
  4920. *)
  4921. Evaluate(actualParameter, src);
  4922. Designate(variableDesignator, dest);
  4923. Emit(Mov(x.position, dest.op, src.op));
  4924. ReleaseOperand(dest);
  4925. ReleaseOperand(src);
  4926. (* the src operand should now have been completely released ! *)
  4927. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  4928. ELSE tooComplex := TRUE
  4929. END;
  4930. (*
  4931. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4932. currentMapper.Add(formalParameter, actualParameter, NIL);
  4933. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4934. variableDesignator := GetTemp(system.addressType, FALSE);
  4935. Designate(actualParameter, src);
  4936. Designate(variableDesignator, dest);
  4937. IntermediateCode.MakeMemory(dest.op,addressType);
  4938. Emit(Mov(x.position, dest.op, src.op));
  4939. ReleaseOperand(dest);
  4940. IF src.tag.mode # IntermediateCode.Undefined THEN
  4941. tagDesignator := GetTemp(system.addressType, FALSE);
  4942. Designate(tagDesignator, dest);
  4943. IntermediateCode.MakeMemory(dest.op,addressType);
  4944. Emit(Mov(x.position, dest.op, src.op));
  4945. END;
  4946. ReleaseOperand(dest); ReleaseOperand(src);
  4947. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4948. END;
  4949. *)
  4950. formalParameter := formalParameter.nextParameter;
  4951. INC(i);
  4952. END;
  4953. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4954. IF resultDesignator # NIL THEN
  4955. returnDesignator := resultDesignator
  4956. ELSE
  4957. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4958. END;
  4959. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  4960. END;
  4961. localVariable := procedure.procedureScope.firstVariable;
  4962. WHILE ~tooComplex & (localVariable # NIL) DO
  4963. variableDesignator := GetTemp(localVariable.type, FALSE);
  4964. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  4965. localVariable := localVariable.nextVariable;
  4966. END;
  4967. IF ~tooComplex THEN
  4968. VisitStatementBlock(procedure.procedureScope.body);
  4969. SetLabel(currentInlineExit);
  4970. IF procedureType.returnType # NIL THEN
  4971. Designate(returnDesignator, result);
  4972. IF conditional THEN
  4973. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4974. ValueToCondition(result)
  4975. END;
  4976. END;
  4977. END;
  4978. currentMapper := prevMapper;
  4979. currentInlineExit := prevInlineExit;
  4980. currentIsInline := wasInline;
  4981. RETURN ~tooComplex
  4982. END InlineProcedureCall;
  4983. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4984. VAR
  4985. parameters: SyntaxTree.ExpressionList;
  4986. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4987. designator: SyntaxTree.Designator;
  4988. procedureType: SyntaxTree.ProcedureType;
  4989. formalParameter: SyntaxTree.Parameter;
  4990. operand, returnValue: Operand;
  4991. reg, size, mask, dest: IntermediateCode.Operand;
  4992. saved,saved2: RegisterEntry;
  4993. symbol: SyntaxTree.Symbol;
  4994. variable: SyntaxTree.Variable;
  4995. i, parametersSize, returnTypeSize : LONGINT;
  4996. structuredReturnType: BOOLEAN;
  4997. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4998. tempVariableDesignator: SyntaxTree.Designator;
  4999. gap, alignment: LONGINT; (*fld*)
  5000. (* TODO: remove unnecessary backup variables *)
  5001. oldResult: Operand;
  5002. oldCurrentScope: SyntaxTree.Scope;
  5003. oldArrayDestinationTag: IntermediateCode.Operand;
  5004. oldArrayDestinationDimension: LONGINT;
  5005. oldConstantDeclaration: SyntaxTree.Symbol;
  5006. oldDestination: IntermediateCode.Operand;
  5007. oldCurrentLoop: Label;
  5008. oldConditional: BOOLEAN;
  5009. oldTrueLabel, oldFalseLabel: Label;
  5010. oldLocked: BOOLEAN;
  5011. usedRegisters,oldUsedRegisters: RegisterEntry;
  5012. return: IntermediateCode.Operand;
  5013. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5014. arg: IntermediateCode.Operand;
  5015. dummy: IntermediateCode.Operand;
  5016. recordType: SyntaxTree.RecordType;
  5017. operatorSelectionProcedureOperand: Operand;
  5018. operatorSelectionProcedure: SyntaxTree.Procedure;
  5019. fingerPrint: SyntaxTree.FingerPrint;
  5020. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5021. identifierNumber: LONGINT;
  5022. parameterRegister: Backend.Registers;
  5023. parameterRegisters: LONGINT;
  5024. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  5025. procedure: SyntaxTree.Procedure;
  5026. PROCEDURE BackupGlobalState;
  5027. BEGIN
  5028. oldResult := result;
  5029. oldCurrentScope := currentScope;
  5030. oldArrayDestinationTag := arrayDestinationTag;
  5031. oldArrayDestinationDimension := arrayDestinationDimension;
  5032. oldConstantDeclaration := constantDeclaration;
  5033. oldDestination := destination;
  5034. oldCurrentLoop := currentLoop;
  5035. oldConditional := conditional;
  5036. oldTrueLabel := trueLabel;
  5037. oldFalseLabel := falseLabel;
  5038. oldLocked := locked;
  5039. oldUsedRegisters := usedRegisters
  5040. END BackupGlobalState;
  5041. PROCEDURE RestoreGlobalState;
  5042. BEGIN
  5043. result := oldResult;
  5044. currentScope := oldCurrentScope;
  5045. arrayDestinationTag := oldArrayDestinationTag;
  5046. arrayDestinationDimension := oldArrayDestinationDimension;
  5047. constantDeclaration := oldConstantDeclaration;
  5048. destination := oldDestination;
  5049. currentLoop := oldCurrentLoop;
  5050. conditional := oldConditional;
  5051. trueLabel := oldTrueLabel;
  5052. falseLabel := oldFalseLabel;
  5053. locked := oldLocked;
  5054. usedRegisters := oldUsedRegisters
  5055. END RestoreGlobalState;
  5056. (** do preparations before parameter push for array-structured object types (ASOTs):
  5057. if ASOT is passed as VAR parameter:
  5058. - allocate temporary variable of math array type
  5059. - copy contents of ASOT to be passed to temporary variable
  5060. - use temporary variable as the actual parameter instead
  5061. - 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)
  5062. **)
  5063. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5064. VAR
  5065. expression: SyntaxTree.Expression;
  5066. BEGIN
  5067. IF actualParameter IS SyntaxTree.Designator THEN
  5068. designator := actualParameter(SyntaxTree.Designator);
  5069. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5070. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5071. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5072. ASSERT(checker # NIL);
  5073. checker.SetCurrentScope(currentScope);
  5074. (* allocate temporary variable *)
  5075. ASSERT(actualParameter.type # NIL);
  5076. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5077. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5078. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5079. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5080. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5081. ASSERT(tempVariableDesignator.type # NIL);
  5082. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5083. (* copy math array stored in actual parameter to temporary variable *)
  5084. BackupGlobalState;
  5085. AssignMathArray(tempVariableDesignator, actualParameter);
  5086. RestoreGlobalState;
  5087. (* use temporary variable as actual parameter instead of the original one *)
  5088. actualParameter := tempVariableDesignator;
  5089. (* create write-back call and store it in linked list *)
  5090. (* create new list entry *)
  5091. IF firstWriteBackCall = NIL THEN
  5092. NEW(firstWriteBackCall);
  5093. currentWriteBackCall := firstWriteBackCall
  5094. ELSE
  5095. ASSERT(currentWriteBackCall # NIL);
  5096. NEW(currentWriteBackCall.next);
  5097. currentWriteBackCall := currentWriteBackCall.next
  5098. END;
  5099. expression := checker.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5100. ASSERT(expression.type = NIL);
  5101. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5102. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5103. (* prepare writeback for any other "normal" indexer *)
  5104. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5105. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5106. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5107. Assign(tempVariableDesignator, actualParameter);
  5108. actualParameter := tempVariableDesignator;
  5109. IF firstWriteBackCall = NIL THEN
  5110. NEW(firstWriteBackCall);
  5111. currentWriteBackCall := firstWriteBackCall
  5112. ELSE
  5113. ASSERT(currentWriteBackCall # NIL);
  5114. NEW(currentWriteBackCall.next);
  5115. currentWriteBackCall := currentWriteBackCall.next
  5116. END;
  5117. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5118. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5119. END
  5120. END
  5121. END PrepareParameter;
  5122. BEGIN
  5123. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5124. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5125. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5126. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5127. IF InlineProcedureCall(x) THEN
  5128. RETURN
  5129. ELSE
  5130. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5131. END
  5132. END;
  5133. END;
  5134. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5135. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5136. dest := destination; destination := emptyOperand;
  5137. SaveRegisters();ReleaseUsedRegisters(saved);
  5138. parameters := x.parameters;
  5139. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5140. (* an operator is called *)
  5141. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5142. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  5143. (* check if a dynamic operator call should be performed *)
  5144. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5145. ELSE
  5146. isCallOfDynamicOperator := FALSE
  5147. END;
  5148. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5149. Emit(Push(position, ap));
  5150. END;
  5151. alignment := procedureType.stackAlignment;
  5152. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize = 64) THEN
  5153. alignment := 16 (* bytes *);
  5154. END;
  5155. IF alignment > 1 THEN
  5156. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5157. Emit(Mov(position,reg, sp));
  5158. gap := ParametersSize(system, procedureType, FALSE);
  5159. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5160. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN
  5161. gap := 4*ToMemoryUnits(system,system.addressSize); (* at least four registers get pushed*)
  5162. END;
  5163. END;
  5164. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  5165. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5166. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5167. Emit(And(position,sp, sp, mask));
  5168. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5169. Emit(Push(position,reg));
  5170. (*
  5171. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  5172. Emit(Mov(position,mem,reg));
  5173. *)
  5174. ReleaseIntermediateOperand(reg);
  5175. END;
  5176. IF SysvABI(procedureType.callingConvention) & (system.addressSize = 32) THEN
  5177. (* align stack to 16-byte boundary *)
  5178. IntermediateCode.InitImmediate(mask,addressType,-16);
  5179. Emit(And(position,sp, sp, mask));
  5180. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5181. IF gap # 0 THEN
  5182. IntermediateCode.InitImmediate(size,addressType,gap);
  5183. Emit(Sub(position,sp,sp,size))
  5184. END;
  5185. END;
  5186. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5187. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5188. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5189. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5190. ELSE
  5191. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5192. END;
  5193. Evaluate(x.left, operand);
  5194. IF symbol IS SyntaxTree.Procedure THEN
  5195. IF (procedureType.selfParameter # NIL) THEN
  5196. Emit(Push(position,operand.tag));
  5197. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5198. Emit(Push(position,operand.tag));
  5199. ELSIF (procedureType.isDelegate) THEN
  5200. Emit(Push(position,operand.tag));
  5201. END;
  5202. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5203. IF (procedureType.selfParameter # NIL) THEN
  5204. Emit(Push(position,operand.tag));
  5205. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5206. Emit(Push(position,operand.tag));
  5207. END;
  5208. ELSE HALT(200);
  5209. END;
  5210. ReleaseIntermediateOperand(operand.tag);
  5211. operand.tag := emptyOperand;
  5212. (* determine if a structured return type is needed *)
  5213. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5214. IF structuredReturnType THEN
  5215. IF resultDesignator # NIL THEN
  5216. d := resultDesignator;
  5217. ELSE
  5218. (* temporary result that might be allocated, must potentially be traced *)
  5219. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5220. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5221. d.SetType(variable.type);
  5222. END;
  5223. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5224. Designate(d,returnValue);
  5225. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5226. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5227. Emit(Push(position,size));
  5228. Emit(Push(position,returnValue.op));
  5229. ReleaseOperand(returnValue);
  5230. ELSE*)
  5231. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  5232. (*
  5233. END;
  5234. *)
  5235. END;
  5236. firstWriteBackCall := NIL; (* reset write-back call list *)
  5237. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  5238. parameterRegister := backend.GetParameterRegisters(procedureType.callingConvention);
  5239. IF parameterRegister = NIL THEN parameterRegisters := 0
  5240. ELSE parameterRegisters := LEN(parameterRegister)
  5241. END;
  5242. passByRegister := parameterRegisters > 0;
  5243. registerNumber := 0;
  5244. formalParameter := procedureType.lastParameter;
  5245. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5246. actualParameter := parameters.GetExpression(i);
  5247. PrepareParameter(actualParameter, formalParameter);
  5248. IF passByRegister & (i < parameterRegisters) THEN
  5249. IF ~PassInRegister(formalParameter) THEN
  5250. Error(actualParameter.position,"cannot be passed by register")
  5251. ELSE
  5252. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,parameterRegister[i]);
  5253. END;
  5254. INC(registerNumber);
  5255. ELSE
  5256. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5257. END;
  5258. formalParameter := formalParameter.prevParameter;
  5259. END;
  5260. IF passByRegister (* & (registerNumber > 0)*) & ~SysvABI(procedureType.callingConvention) THEN
  5261. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5262. stackSize := ToMemoryUnits(system,parameterRegisters*addressType.sizeInBits);
  5263. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5264. END;
  5265. ELSE
  5266. hasDynamicOperands := FALSE;
  5267. formalParameter := procedureType.firstParameter;
  5268. FOR i := 0 TO parameters.Length() - 1 DO
  5269. actualParameter := parameters.GetExpression(i);
  5270. IF formalParameter # NIL THEN (* TENTATIVE *)
  5271. PrepareParameter(actualParameter, formalParameter);
  5272. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5273. ASSERT(i < 2);
  5274. hasDynamicOperands := TRUE;
  5275. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  5276. ELSE
  5277. IF passByRegister & (registerNumber > 0) THEN
  5278. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5279. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5280. END;
  5281. passByRegister := FALSE;
  5282. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5283. END;
  5284. formalParameter := formalParameter.nextParameter;
  5285. END;
  5286. END;
  5287. END;
  5288. IF symbol IS SyntaxTree.Procedure THEN
  5289. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5290. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5291. Emit(Push(position,reg));
  5292. ReleaseIntermediateOperand(reg);
  5293. END;
  5294. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5295. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5296. parametersSize := ParametersSize(system,procedureType,FALSE);
  5297. END;
  5298. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5299. (*
  5300. dynamic operator overloading:
  5301. first push parameters, regularly:
  5302. [self]
  5303. par1
  5304. par2
  5305. then push parameters for GetOperator
  5306. identifier
  5307. ptr1
  5308. tag
  5309. ptr2
  5310. tag
  5311. call GetOperatorRuntimeProc
  5312. call Operator
  5313. *)
  5314. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5315. (* push ID *)
  5316. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5317. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5318. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5319. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5320. formalParameter := procedureType.firstParameter;
  5321. FOR i := 0 TO parameters.Length() - 1 DO
  5322. IF formalParameter.access # SyntaxTree.Hidden THEN
  5323. ASSERT(i < 2);
  5324. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5325. (* push pointer *)
  5326. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5327. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5328. (* add dereference *)
  5329. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5330. (*! better: do refer to stack above than using parameter backups !!*)
  5331. ReleaseIntermediateOperand(parameterBackups[i]);
  5332. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5333. END;
  5334. Emit(Push(position,parameterBackups[i]));
  5335. ReleaseIntermediateOperand(parameterBackups[i]);
  5336. (* push typetag *)
  5337. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5338. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5339. arg := TypeDescriptorAdr(recordType);
  5340. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5341. Emit(Push(position,arg));
  5342. ELSE
  5343. (* push 'NonPointer' *)
  5344. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5345. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5346. (* push fingerprint *)
  5347. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5348. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5349. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5350. END
  5351. END;
  5352. formalParameter := formalParameter.nextParameter
  5353. END;
  5354. (* for unary operators: complete the information for the second parameter *)
  5355. IF procedureType.numberParameters < 2 THEN
  5356. (* push 'NonPointer' *)
  5357. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5358. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5359. (* push 'NoType' *)
  5360. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5361. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5362. END;
  5363. (* call operator selection procedure *)
  5364. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5365. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5366. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  5367. ReleaseOperand(operatorSelectionProcedureOperand);
  5368. (* use the address that the operator selection procedure returned as the target address of the call *)
  5369. InitOperand(operand, ModeValue);
  5370. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5371. Emit(Result(position,operand.op))
  5372. END
  5373. END;
  5374. ReleaseParameterRegisters();
  5375. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (procedureType.callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5376. SaveRegisters();ReleaseUsedRegisters(saved2);
  5377. CallThis(position,"Objects","LeaveA2",0);
  5378. RestoreRegisters(saved2);
  5379. END;
  5380. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR SysvABI(procedureType.callingConvention) THEN
  5381. Emit(Call(position,operand.op,0));
  5382. ELSE
  5383. Emit(Call(position,operand.op,parametersSize));
  5384. END;
  5385. ReleaseOperand(operand);
  5386. IF procedureType.noReturn THEN
  5387. EmitTrap(position,NoReturnTrap);
  5388. END;
  5389. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5390. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5391. Emit(Result(position,return));
  5392. END;
  5393. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (procedureType.callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5394. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5395. Emit(Push(position, return));
  5396. CallThis(position,"Objects","ReenterA2",0);
  5397. Emit(Pop(position, return));
  5398. ELSE
  5399. CallThis(position,"Objects","ReenterA2",0);
  5400. END;
  5401. END;
  5402. (* === return parameter space === *)
  5403. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & passByRegister (* & (registerNumber > 0) *) THEN
  5404. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5405. (* cleanup all space for all parameters *)
  5406. IF parametersSize < 32 THEN
  5407. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5408. parametersSize := 32
  5409. END;
  5410. size := IntermediateCode.Immediate(addressType,parametersSize);
  5411. Emit(Add(position,sp,sp,size))
  5412. END;
  5413. IF SysvABI(procedureType.callingConvention) THEN
  5414. IF passByRegister THEN
  5415. IF parameters.Length() > parameterRegisters THEN
  5416. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5417. ELSE
  5418. parametersSize := 0
  5419. END;
  5420. ELSE
  5421. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5422. INC( parametersSize, (-parametersSize) MOD 16 )
  5423. END;
  5424. IF parametersSize > 0 THEN
  5425. size := IntermediateCode.Immediate(addressType,parametersSize);
  5426. Emit(Add(position,sp,sp,size))
  5427. END;
  5428. END;
  5429. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5430. IF structuredReturnType THEN
  5431. (* stack pointer rewinding done by callee
  5432. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5433. Emit(Add(position,sp,sp,size));
  5434. *)
  5435. RestoreRegisters(saved);
  5436. InitOperand(result,ModeReference);
  5437. Symbol(variable,result);
  5438. ELSE
  5439. RestoreRegisters(saved);
  5440. InitOperand(result,ModeValue);
  5441. result.op := return;
  5442. END;
  5443. END;
  5444. IF alignment > 1 THEN
  5445. Emit(Pop(position,sp));
  5446. END;
  5447. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5448. Emit(Pop(position, ap));
  5449. END;
  5450. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5451. ValueToCondition(result);
  5452. END;
  5453. destination := dest;
  5454. (* perform all write-back calls in the list *)
  5455. BackupGlobalState;
  5456. currentWriteBackCall := firstWriteBackCall;
  5457. WHILE currentWriteBackCall # NIL DO
  5458. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5459. currentWriteBackCall := currentWriteBackCall.next
  5460. END;
  5461. RestoreGlobalState;
  5462. (* TENATIVE *)
  5463. (*
  5464. IF isOperatorCall THEN
  5465. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5466. END;
  5467. *)
  5468. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5469. END VisitProcedureCallDesignator;
  5470. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5471. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5472. td: SyntaxTree.Symbol;
  5473. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5474. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5475. BEGIN
  5476. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5477. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5478. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5479. variable.SetType(system.anyType);
  5480. scope.AddVariable(variable);
  5481. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5482. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5483. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5484. typeDeclaration.SetScope(module.module.moduleScope);
  5485. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5486. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5487. END;
  5488. RETURN hiddenPointerType;
  5489. END GetHiddenPointerType;
  5490. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5491. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5492. BEGIN
  5493. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5494. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5495. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5496. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5497. scope.AddVariable(variable);
  5498. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5499. variable.SetType(system.anyType);
  5500. scope.AddVariable(variable);
  5501. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5502. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5503. typeDeclaration.SetDeclaredType(delegatePointerType);
  5504. typeDeclaration.SetScope(module.module.moduleScope);
  5505. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5506. delegatePointerType.SetState(SyntaxTree.Resolved);
  5507. END;
  5508. RETURN delegatePointerType
  5509. END GetDelegateType;
  5510. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5511. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5512. such as in VAR a: RECORD ... END;
  5513. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5514. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5515. *)
  5516. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5517. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5518. BEGIN (* no code emission *)
  5519. source := NIL;
  5520. x := x.resolved;
  5521. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5522. x := GetHiddenPointerType();
  5523. ELSIF IsDelegate(x) THEN
  5524. x := GetDelegateType();
  5525. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5526. ELSE HALT(200);
  5527. END;
  5528. td := x.typeDeclaration;
  5529. IF td = NIL THEN
  5530. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5531. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5532. ASSERT(td # NIL);
  5533. END;
  5534. IF newObjectFile THEN
  5535. GetCodeSectionNameForSymbol(td,name);
  5536. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5537. meta.CheckTypeDeclaration(x);
  5538. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5539. ELSE
  5540. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5541. END;
  5542. IF backend.cooperative OR meta.simple THEN
  5543. offset := 0;
  5544. ELSE
  5545. IF x IS SyntaxTree.CellType THEN
  5546. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5547. IF baseRecord = NIL THEN
  5548. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5549. ELSE
  5550. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5551. END;
  5552. ELSE
  5553. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5554. END;
  5555. END;
  5556. ELSE
  5557. offset := 0;
  5558. source := module.allSections.FindBySymbol(td); (*TODO*)
  5559. IF source = NIL THEN
  5560. null := 0;
  5561. GetCodeSectionNameForSymbol(td,name);
  5562. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  5563. Basic.SuffixSegmentedName (name, module.module.name);
  5564. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5565. IntermediateCode.InitImmediate(op,addressType,0);
  5566. source(IntermediateCode.Section).Emit(Data(position,op));
  5567. source.SetReferenced(FALSE)
  5568. ELSE
  5569. name := source.name;
  5570. END;
  5571. END;
  5572. RETURN td
  5573. END GetBackendType;
  5574. BEGIN
  5575. (*td := t.typeDeclaration;*)
  5576. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5577. (*
  5578. IF t IS SyntaxTree.PointerType THEN
  5579. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5580. ELSE
  5581. source := GetBackendType(t);
  5582. END;
  5583. *)
  5584. IF newObjectFile THEN
  5585. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5586. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5587. IntermediateCode.SetOffset(res,offset);
  5588. ELSE
  5589. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5590. END;
  5591. (*
  5592. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5593. make memory should be used when tag is used, not earlier
  5594. *)
  5595. RETURN res
  5596. END TypeDescriptorAdr;
  5597. (*
  5598. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5599. VAR result: IntermediateCode.Operand;
  5600. BEGIN
  5601. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5602. operand.tag := TypeDescriptorAdr(operand.type);
  5603. IntermediateCode.MakeMemory(operand.tag,addressType);
  5604. UseIntermediateOperand(operand.tag);
  5605. END;
  5606. END MakeTypeTag;
  5607. *)
  5608. PROCEDURE ProfilerInit;
  5609. VAR reg: IntermediateCode.Operand;
  5610. BEGIN
  5611. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5612. Emit(Call(position,reg,0));
  5613. END ProfilerInit;
  5614. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5615. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5616. BEGIN
  5617. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5618. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5619. THEN
  5620. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5621. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5622. Emit(Push(position,reg));
  5623. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5624. Emit(Push(position,reg));
  5625. StaticCallOperand(result,procedure);
  5626. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5627. ReleaseOperand(result);
  5628. END;
  5629. END ProfilerEnterExit;
  5630. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5631. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5632. BEGIN
  5633. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5634. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5635. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5636. profileInit.Emit(Push(position,reg));
  5637. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5638. profileInit.Emit(Push(position,reg));
  5639. NEW(string, LEN(name)); COPY(name, string^);
  5640. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5641. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5642. sv.SetType(type);
  5643. Designate(sv,result);
  5644. profileInit.Emit(Push(position,result.tag));
  5645. profileInit.Emit(Push(position,result.op));
  5646. StaticCallOperand(result,procedure);
  5647. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5648. ReleaseOperand(result);
  5649. END;
  5650. END ProfilerAddProcedure;
  5651. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5652. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5653. BEGIN
  5654. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5655. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5656. profileInit.Emit(Push(position,reg));
  5657. profileInitPatchPosition := profileInit.pc;
  5658. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5659. NEW(string, LEN(name)); COPY(name, string^);
  5660. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5661. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5662. sv.SetType(type);
  5663. Designate(sv,result);
  5664. profileInit.Emit(Push(position,result.tag));
  5665. profileInit.Emit(Push(position,result.op));
  5666. StaticCallOperand(result,procedure);
  5667. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5668. ReleaseOperand(result);
  5669. END;
  5670. END ProfilerAddModule;
  5671. PROCEDURE ProfilerPatchInit;
  5672. VAR reg: IntermediateCode.Operand;
  5673. BEGIN
  5674. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5675. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5676. EmitLeave(profileInit,position,NIL,0);
  5677. profileInit.Emit(Exit(position,0,0,0));
  5678. END ProfilerPatchInit;
  5679. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5680. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5681. VAR
  5682. id: LONGINT;
  5683. leftType, rightType: SyntaxTree.Type;
  5684. procedureType: SyntaxTree.ProcedureType;
  5685. runtimeProcedure: SyntaxTree.Procedure;
  5686. runtimeProcedureOperand, operatorOperand: Operand;
  5687. kind: SET;
  5688. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5689. VAR
  5690. arg: IntermediateCode.Operand;
  5691. recordType: SyntaxTree.RecordType;
  5692. fingerPrint: SyntaxTree.FingerPrint;
  5693. BEGIN
  5694. IF type = NIL THEN
  5695. (* no type: push 'NoType' *)
  5696. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5697. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5698. ELSIF IsStrictlyPointerToRecord(type) THEN
  5699. (* pointer to record type: push typetag *)
  5700. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5701. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5702. arg := TypeDescriptorAdr(recordType);
  5703. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5704. ELSE
  5705. (* non-pointer to record type: push fingerprint *)
  5706. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5707. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5708. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5709. END;
  5710. operatorInitializationCodeSection.Emit(Push(position,arg))
  5711. END PushTypeInfo;
  5712. BEGIN
  5713. ASSERT(operatorInitializationCodeSection # NIL);
  5714. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5715. procedureType := operator.type(SyntaxTree.ProcedureType);
  5716. (* determine types *)
  5717. leftType := procedureType.firstParameter.type;
  5718. IF procedureType.numberParameters = 2 THEN
  5719. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5720. rightType := procedureType.firstParameter.nextParameter.type;
  5721. ELSE
  5722. rightType := NIL
  5723. END;
  5724. (* determine operator kind *)
  5725. IF IsStrictlyPointerToRecord(leftType) THEN
  5726. kind := {LhsIsPointer}
  5727. ELSE
  5728. kind := {}
  5729. END;
  5730. IF IsStrictlyPointerToRecord(rightType) THEN
  5731. kind := kind + {RhsIsPointer}
  5732. END;
  5733. IF kind # {} THEN (* TODO: to be removed later on *)
  5734. (* at least one of the types is a pointer to record *)
  5735. (* emit a code that registers this specific operator in the runtime *)
  5736. dump := operatorInitializationCodeSection.comments;
  5737. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5738. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5739. (* push ID *)
  5740. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5741. id := Global.GetSymbol(module.module.case, operator.name);
  5742. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5743. (* push kind *)
  5744. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5745. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5746. (* push type infos *)
  5747. PushTypeInfo(leftType);
  5748. PushTypeInfo(rightType);
  5749. (* push operator address *)
  5750. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5751. StaticCallOperand(operatorOperand, operator);
  5752. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5753. ReleaseOperand(operatorOperand);
  5754. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5755. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5756. ReleaseOperand(runtimeProcedureOperand)
  5757. END
  5758. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5759. END
  5760. END RegisterDynamicOperator;
  5761. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5762. VAR
  5763. traceModule: SyntaxTree.Module;
  5764. procedure: SyntaxTree.Procedure;
  5765. procedureVariable: SyntaxTree.Variable;
  5766. s,msg: Basic.MessageString;
  5767. res: Operand;
  5768. i: LONGINT;
  5769. sv: SyntaxTree.StringValue;
  5770. type: SyntaxTree.Type;
  5771. recordType: SyntaxTree.RecordType;
  5772. printout: Printout.Printer;
  5773. stringWriter: Streams.StringWriter;
  5774. expression: SyntaxTree.Expression;
  5775. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5776. BEGIN
  5777. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5778. IF procedure = NIL THEN
  5779. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5780. END;
  5781. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5782. s := "procedure ";
  5783. Strings.Append(s,backend.traceModuleName);
  5784. Strings.Append(s,".");
  5785. Strings.Append(s,procedureName);
  5786. Strings.Append(s," not present");
  5787. Error(position,s);
  5788. RETURN FALSE
  5789. ELSE
  5790. RETURN TRUE
  5791. END;
  5792. END GetProcedure;
  5793. PROCEDURE CallProcedure;
  5794. VAR size: LONGINT;
  5795. BEGIN
  5796. IF procedure # NIL THEN
  5797. StaticCallOperand(result,procedure);
  5798. size := ProcedureParametersSize(system,procedure);
  5799. ELSE
  5800. Symbol(procedureVariable, result);
  5801. LoadValue(result, procedureVariable.type.resolved);
  5802. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5803. END;
  5804. Emit(Call(position,result.op,size));
  5805. END CallProcedure;
  5806. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5807. VAR res: Operand; string: SyntaxTree.String;
  5808. BEGIN
  5809. IF GetProcedure("String") THEN
  5810. NEW(string, LEN(s)); COPY(s, string^);
  5811. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5812. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  5813. sv.SetType(type);
  5814. Designate(sv,res);
  5815. Emit(Push(position,res.tag));
  5816. Emit(Push(position,res.op));
  5817. ReleaseOperand(res);
  5818. CallProcedure;
  5819. END;
  5820. END String;
  5821. PROCEDURE Integer(op: IntermediateCode.Operand);
  5822. BEGIN
  5823. IF GetProcedure("Int") THEN
  5824. Emit(Push(position,op));
  5825. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5826. CallProcedure;
  5827. END;
  5828. END Integer;
  5829. PROCEDURE Float(op: IntermediateCode.Operand);
  5830. BEGIN
  5831. IF GetProcedure("HIntHex") THEN
  5832. Emit(Push(position,op));
  5833. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5834. CallProcedure;
  5835. END;
  5836. END Float;
  5837. PROCEDURE Set(op: IntermediateCode.Operand);
  5838. BEGIN
  5839. IF GetProcedure("Set") THEN
  5840. Emit(Push(position,op));
  5841. (*
  5842. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5843. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5844. *)
  5845. CallProcedure;
  5846. END;
  5847. END Set;
  5848. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5849. BEGIN
  5850. IF GetProcedure("Boolean") THEN
  5851. Emit(Push(position,op));
  5852. CallProcedure;
  5853. END;
  5854. END Boolean;
  5855. PROCEDURE Char(op: IntermediateCode.Operand);
  5856. BEGIN
  5857. IF GetProcedure("Char") THEN
  5858. Emit(Push(position,op));
  5859. CallProcedure;
  5860. END;
  5861. END Char;
  5862. PROCEDURE Address(op: IntermediateCode.Operand);
  5863. BEGIN
  5864. IF GetProcedure("Address") THEN
  5865. Emit(Push(position,op));
  5866. CallProcedure;
  5867. END;
  5868. END Address;
  5869. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  5870. VAR len: IntermediateCode.Operand;
  5871. BEGIN
  5872. IF GetProcedure("String") THEN
  5873. len := GetArrayLength(type, op.tag);
  5874. Emit(Push(position,len));
  5875. ReleaseIntermediateOperand(len);
  5876. Emit(Push(position,op.op));
  5877. CallProcedure;
  5878. END;
  5879. END StringOperand;
  5880. PROCEDURE Ln;
  5881. BEGIN
  5882. IF GetProcedure("Ln") THEN
  5883. CallProcedure;
  5884. END;
  5885. END Ln;
  5886. BEGIN
  5887. IF backend.traceModuleName = "" THEN RETURN END;
  5888. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5889. IF GetProcedure("Enter") THEN
  5890. CallProcedure
  5891. END;
  5892. NEW(stringWriter,LEN(s));
  5893. FOR i := 0 TO x.Length()-1 DO
  5894. msg := "";
  5895. expression := x.GetExpression(i);
  5896. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5897. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5898. ELSE
  5899. Global.GetModuleName(module.module, s);
  5900. END;
  5901. IF i = 0 THEN
  5902. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  5903. stringWriter.String(":");
  5904. END;
  5905. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5906. IF ~(expression IS SyntaxTree.StringValue) THEN
  5907. printout.Expression(expression);
  5908. stringWriter.Get(s);
  5909. Strings.Append(msg,s);
  5910. Strings.Append(msg,"= ");
  5911. ELSE stringWriter.Get(s); (* remove from string writer *)
  5912. Strings.Append(msg, s);
  5913. END;
  5914. String(msg);
  5915. IF SemanticChecker.IsStringType(expression.type) THEN
  5916. Designate(expression,res);
  5917. StringOperand(res, expression.type);
  5918. ELSE
  5919. Evaluate(expression,res);
  5920. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5921. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5922. Convert(res.op,int64);
  5923. END;
  5924. Integer(res.op);
  5925. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5926. Boolean(res.op);
  5927. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5928. Set(res.op);
  5929. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5930. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5931. Convert(res.op,float64);
  5932. END;
  5933. Float(res.op);
  5934. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5935. Char(res.op);
  5936. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5937. Address(res.op);String("H");
  5938. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5939. Address(res.op);String("H");
  5940. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5941. Address(res.op);String("H");
  5942. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5943. Address(res.op);String("H");
  5944. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5945. String("NIL");
  5946. ELSE HALT(200);
  5947. END;
  5948. END;
  5949. ReleaseOperand(res);
  5950. String("; ");
  5951. END;
  5952. IF GetProcedure("Exit") THEN
  5953. CallProcedure
  5954. ELSE
  5955. Ln;
  5956. END;
  5957. END;
  5958. END SystemTrace;
  5959. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5960. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5961. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5962. BEGIN
  5963. type := type.resolved;
  5964. IF type IS SyntaxTree.RecordType THEN
  5965. WITH type: SyntaxTree.RecordType DO
  5966. baseType := type.baseType;
  5967. IF baseType # NIL THEN
  5968. baseType := baseType.resolved;
  5969. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5970. InitFields(baseType,adr,offset);
  5971. END;
  5972. variable := type.recordScope.firstVariable;
  5973. WHILE variable # NIL DO
  5974. IF variable.initializer # NIL THEN
  5975. Evaluate(variable.initializer,initializerOp);
  5976. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5977. Emit(Mov(position,mem,initializerOp.op));
  5978. ReleaseOperand(initializerOp);
  5979. ReleaseIntermediateOperand(mem);
  5980. END;
  5981. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5982. variable := variable.nextVariable
  5983. END;
  5984. END;
  5985. ELSIF type IS SyntaxTree.CellType THEN
  5986. WITH type: SyntaxTree.CellType DO
  5987. baseType := type.baseType;
  5988. IF baseType # NIL THEN
  5989. baseType := baseType.resolved;
  5990. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5991. InitFields(baseType,adr,offset);
  5992. END;
  5993. variable := type.cellScope.firstVariable;
  5994. WHILE variable # NIL DO
  5995. IF variable.initializer # NIL THEN
  5996. Evaluate(variable.initializer,initializerOp);
  5997. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5998. Emit(Mov(position,mem,initializerOp.op));
  5999. ReleaseOperand(initializerOp);
  6000. ReleaseIntermediateOperand(mem);
  6001. END;
  6002. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6003. variable := variable.nextVariable
  6004. END;
  6005. END;
  6006. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6007. WITH type: SyntaxTree.ArrayType DO
  6008. IF type.form = SyntaxTree.Static THEN
  6009. baseType := type.arrayBase;
  6010. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6011. FOR i := 0 TO type.staticLength-1 DO
  6012. InitFields(baseType,adr,offset+i*size);
  6013. END;
  6014. END;
  6015. END;
  6016. ELSIF type IS SyntaxTree.MathArrayType THEN
  6017. WITH type: SyntaxTree.MathArrayType DO
  6018. IF type.form = SyntaxTree.Open THEN
  6019. dim := DynamicDim(type);
  6020. imm := IntermediateCode.Immediate(addressType,dim);
  6021. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6022. baseType := SemanticChecker.ArrayBase(type,dim);
  6023. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6024. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6025. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6026. ReleaseIntermediateOperand(imm);
  6027. (* flags remain empty (=0) for open array *)
  6028. ELSIF type.form = SyntaxTree.Static THEN
  6029. baseType := type.arrayBase;
  6030. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6031. ASSERT(type.staticLength < 1024*1024*1024);
  6032. FOR i := 0 TO type.staticLength-1 DO
  6033. InitFields(baseType,adr,offset+i*size);
  6034. END;
  6035. END;
  6036. END;
  6037. END;
  6038. END InitFields;
  6039. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6040. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6041. BEGIN
  6042. type := variable.type.resolved;
  6043. IF (type IS SyntaxTree.MathArrayType) THEN
  6044. WITH type: SyntaxTree.MathArrayType DO
  6045. IF type.form = SyntaxTree.Open THEN
  6046. Symbol(variable,operand);
  6047. InitFields(type, operand.tag,0);
  6048. IF temporary THEN
  6049. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6050. END;
  6051. ELSIF type.form = SyntaxTree.Tensor THEN
  6052. Symbol(variable, operand);
  6053. MakeMemory(tmp,operand.op,addressType,0);
  6054. ReleaseOperand(operand);
  6055. IF temporary THEN
  6056. (* trick -- temporary object from array base *)
  6057. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6058. Symbol(symbol,operand);
  6059. MakeMemory(mem,operand.op,addressType,0);
  6060. ReleaseOperand(operand);
  6061. Emit(Mov(position,tmp, mem) );
  6062. ReleaseOperand(operand);
  6063. ELSE
  6064. Emit(Mov(position,tmp, nil ) );
  6065. END;
  6066. ReleaseIntermediateOperand(tmp);
  6067. END;
  6068. END;
  6069. ELSE
  6070. Symbol(variable,operand);
  6071. IF variable.initializer # NIL THEN
  6072. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6073. reference.SetType(variable.type.resolved);
  6074. reference.SetAssignable(TRUE);
  6075. Assign(reference,variable.initializer);
  6076. ELSIF temporary THEN
  6077. IF SemanticChecker.IsPointerType(variable.type) THEN
  6078. Symbol(variable, operand);
  6079. MakeMemory(tmp,operand.op,addressType,0);
  6080. ReleaseOperand(operand);
  6081. Emit(Mov(position,tmp, nil ) );
  6082. ReleaseIntermediateOperand(tmp);
  6083. END;
  6084. END;
  6085. InitFields(type, operand.op,0);
  6086. ReleaseOperand(operand);
  6087. END;
  6088. END InitVariable;
  6089. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6090. VAR end: Label;
  6091. BEGIN
  6092. IF type.form = SyntaxTree.Tensor THEN
  6093. InitOperand(result,ModeValue);
  6094. ReuseCopy(result.op,base);
  6095. end := NewLabel();
  6096. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6097. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6098. SetLabel(end);
  6099. Convert(result.op,lenType);
  6100. ELSE
  6101. InitOperand(result,ModeValue);
  6102. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6103. END
  6104. END MathArrayDim;
  6105. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6106. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6107. BEGIN
  6108. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6109. MakeMemory(mem,base,addressType,offset);
  6110. Emit(Mov(position,mem,value));
  6111. ReleaseIntermediateOperand(mem);
  6112. END PutMathArrayField;
  6113. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6114. VAR mem: IntermediateCode.Operand;
  6115. BEGIN
  6116. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6117. MakeMemory(mem,base,addressType,offset);
  6118. Emit(Mov(position,mem,value));
  6119. ReleaseIntermediateOperand(mem);
  6120. END PutMathArrayFieldOffset;
  6121. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6122. BEGIN
  6123. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6124. MakeMemory(value,base,addressType,offset);
  6125. END GetMathArrayField;
  6126. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6127. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6128. BEGIN
  6129. IF incr THEN
  6130. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6131. ELSE
  6132. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6133. END;
  6134. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6135. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6136. ELSE
  6137. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6138. Emit(Mov(position,reg,dim));
  6139. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6140. Emit(Add(position,reg,reg,base));
  6141. MakeMemory(mem, reg, addressType, offset);
  6142. ReleaseIntermediateOperand(reg);
  6143. Emit(Mov(position,mem,value));
  6144. ReleaseIntermediateOperand(mem);
  6145. END;
  6146. END PutMathArrayLenOrIncr;
  6147. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6148. BEGIN
  6149. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6150. END PutMathArrayLength;
  6151. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6152. BEGIN
  6153. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6154. END PutMathArrayIncrement;
  6155. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6156. BEGIN
  6157. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6158. END GetMathArrayIncrement;
  6159. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6160. BEGIN
  6161. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6162. END GetMathArrayLength;
  6163. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6164. VAR dimOp: IntermediateCode.Operand;
  6165. BEGIN
  6166. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6167. GetMathArrayLength(type, operand, dimOp, check, result);
  6168. END GetMathArrayLengthAt;
  6169. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6170. VAR dimOp: IntermediateCode.Operand;
  6171. BEGIN
  6172. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6173. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6174. END GetMathArrayIncrementAt;
  6175. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6176. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6177. offset: LONGINT;
  6178. BEGIN
  6179. IF increment THEN
  6180. offset := MathIncrOffset;
  6181. ELSE
  6182. offset := MathLenOffset;
  6183. END;
  6184. INC(offset,operand.dimOffset*2);
  6185. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6186. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6187. END;
  6188. (* static dimension *)
  6189. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6190. IF check & (type.form = SyntaxTree.Tensor) THEN
  6191. DimensionCheck(operand.tag,dim,BrltL);
  6192. END;
  6193. val := SHORT(dim.intValue);
  6194. IF type.form # SyntaxTree.Tensor THEN
  6195. t := SemanticChecker.ArrayBase(type,val);
  6196. type := t.resolved(SyntaxTree.MathArrayType);
  6197. IF type.form = SyntaxTree.Static THEN
  6198. IF increment THEN
  6199. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6200. ELSE
  6201. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6202. END;
  6203. InitOperand(result,ModeValue);
  6204. result.op := res;
  6205. RETURN;
  6206. END;
  6207. END;
  6208. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6209. MakeMemory(res,operand.tag,addressType,offset);
  6210. (*
  6211. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6212. *)
  6213. InitOperand(result,ModeValue);
  6214. result.op := res;
  6215. ELSE
  6216. Convert(dim,addressType);
  6217. IF check THEN
  6218. IF type.form = SyntaxTree.Tensor THEN
  6219. DimensionCheck(operand.tag,dim,BrltL);
  6220. ELSIF isUnchecked THEN (* do nothing *)
  6221. ELSE
  6222. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6223. END;
  6224. END;
  6225. end := NewLabel(); next := NIL;
  6226. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6227. Emit(Mov(position,res,dim));
  6228. Convert(res,sizeType);
  6229. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6230. WHILE t IS SyntaxTree.MathArrayType DO
  6231. type := t(SyntaxTree.MathArrayType);
  6232. IF type.form = SyntaxTree.Static THEN
  6233. imm := IntermediateCode.Immediate(sizeType,val);
  6234. next := NewLabel();
  6235. BrneL(next,imm,res);
  6236. IF increment THEN
  6237. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6238. ELSE
  6239. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6240. END;
  6241. Emit(MovReplace(position,res,imm));
  6242. BrL(end);
  6243. ELSE hasDynamicPart := TRUE;
  6244. END;
  6245. t := type.arrayBase.resolved;
  6246. val := val + 1;
  6247. IF next # NIL THEN SetLabel(next) END;
  6248. END;
  6249. IF hasDynamicPart THEN
  6250. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6251. Emit(Mov(position,res2,dim));
  6252. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6253. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6254. Emit(Add(position,res2,res2,imm));
  6255. Emit(Add(position,res2,res2,operand.tag));
  6256. IntermediateCode.MakeMemory(res2,sizeType);
  6257. Emit(MovReplace(position,res,res2));
  6258. ReleaseIntermediateOperand(res2);
  6259. END;
  6260. SetLabel(end);
  6261. Convert(res,sizeType);
  6262. InitOperand(result,ModeValue);
  6263. result.op := res;
  6264. END;
  6265. END MathArrayLenOrIncr;
  6266. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6267. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6268. offset: LONGINT;
  6269. BEGIN
  6270. offset := operand.dimOffset+DynamicDim(type)-1;
  6271. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6272. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6273. val := SHORT(dim.intValue);
  6274. t := SemanticChecker.ArrayBase(type,val);
  6275. type := t.resolved(SyntaxTree.ArrayType);
  6276. IF type.form = SyntaxTree.Static THEN
  6277. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6278. ELSE
  6279. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6280. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6281. END;
  6282. UseIntermediateOperand(res);
  6283. InitOperand(result,ModeValue);
  6284. result.op := res;
  6285. ELSE
  6286. Convert(dim,addressType);
  6287. IF ~isUnchecked THEN
  6288. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6289. END;
  6290. end := NewLabel(); next := NIL;
  6291. (* ReuseCopy(dim,res); *)
  6292. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6293. Emit(Mov(position,res,dim));
  6294. Convert(res,sizeType);
  6295. Convert(res,sizeType);
  6296. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6297. WHILE t IS SyntaxTree.ArrayType DO
  6298. type := t(SyntaxTree.ArrayType);
  6299. IF type.form = SyntaxTree.Static THEN
  6300. imm := IntermediateCode.Immediate(sizeType,val);
  6301. next := NewLabel();
  6302. BrneL(next,imm,res);
  6303. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6304. Emit(MovReplace(position,res,imm));
  6305. BrL(end);
  6306. ELSE hasDynamicPart := TRUE;
  6307. END;
  6308. t := type.arrayBase.resolved;
  6309. val := val + 1;
  6310. IF next # NIL THEN SetLabel(next) END;
  6311. END;
  6312. IF hasDynamicPart THEN
  6313. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6314. Convert(res2,addressType);
  6315. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6316. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6317. Emit(Sub(position,res2,imm,res2));
  6318. Emit(Add(position,res2,res2,operand.tag));
  6319. IntermediateCode.MakeMemory(res2,sizeType);
  6320. Emit(MovReplace(position,res,res2));
  6321. ReleaseIntermediateOperand(res2);
  6322. END;
  6323. SetLabel(end);
  6324. Convert(res,sizeType);
  6325. InitOperand(result,ModeValue);
  6326. result.op := res;
  6327. END;
  6328. END ArrayLen;
  6329. (**
  6330. create a temporary variable in current scope
  6331. **)
  6332. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6333. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6334. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6335. BEGIN
  6336. IF ~register THEN
  6337. v := temporaries.GetFreeVariable(type, untraced, index);
  6338. ELSE
  6339. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6340. END;
  6341. scope := currentScope;
  6342. (*
  6343. variable := NIL; (* disable free variable managemenet for the time being -- does not work *)
  6344. *)
  6345. name := temporaries.GetUID();
  6346. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6347. variable.SetType(type);
  6348. variable.SetAccess(SyntaxTree.Hidden);
  6349. variable.SetUntraced(untraced);
  6350. IF v = NIL THEN
  6351. temporaries.AddVariable(variable);
  6352. IF ~register THEN
  6353. IF scope.lastVariable # NIL THEN
  6354. offset := scope.lastVariable.offsetInBits;
  6355. ELSE
  6356. offset := 0;
  6357. END;
  6358. DEC(offset,system.SizeOf(variable.type));
  6359. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6360. variable(SyntaxTree.Variable).SetOffset(offset);
  6361. scope.AddVariable(variable(SyntaxTree.Variable));
  6362. scope.EnterSymbol(variable, duplicate);
  6363. ASSERT(~duplicate);
  6364. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6365. ELSE
  6366. variable.SetUseRegister(TRUE);
  6367. variable(SyntaxTree.Variable).SetOffset(0);
  6368. END;
  6369. ELSE (* v # NIL *)
  6370. (* reuse slot for new variable, do not create new slot ! *)
  6371. temporaries.SetVariable(index, variable);
  6372. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6373. ASSERT(~register);
  6374. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6375. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6376. scope.EnterSymbol(variable, duplicate);
  6377. ASSERT(~duplicate);
  6378. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6379. END;
  6380. RETURN variable(SyntaxTree.Variable)
  6381. END GetTemporaryVariable;
  6382. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6383. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6384. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6385. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6386. i: LONGINT; duplicate: BOOLEAN;
  6387. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6388. VAR variable: SyntaxTree.Variable;
  6389. BEGIN
  6390. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6391. variable.SetType(type);
  6392. recordScope.AddVariable(variable);
  6393. END AddVariable;
  6394. BEGIN
  6395. name := "@ArrayDescriptor";
  6396. Basic.AppendNumber(name,dimensions);
  6397. identifier := SyntaxTree.NewIdentifier(name);
  6398. parentScope := module.module.moduleScope;
  6399. symbol := parentScope.FindSymbol(identifier);
  6400. IF symbol # NIL THEN
  6401. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6402. type := typeDeclaration.declaredType;
  6403. ELSE
  6404. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6405. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6406. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6407. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6408. recordType.SetTypeDeclaration(typeDeclaration);
  6409. recordType.SetState(SyntaxTree.Resolved);
  6410. typeDeclaration.SetDeclaredType(recordType);
  6411. AddVariable("@ptr",system.anyType);
  6412. AddVariable("@adr",system.addressType);
  6413. AddVariable("@flags",system.addressType);
  6414. AddVariable("@dim",system.addressType);
  6415. AddVariable("@elementSize",system.addressType);
  6416. FOR i := 0 TO dimensions-1 DO
  6417. name := "@len";
  6418. Basic.AppendNumber(name,i);
  6419. AddVariable(name,system.addressType);
  6420. name := "@incr";
  6421. Basic.AppendNumber(name,i);
  6422. AddVariable(name,system.addressType);
  6423. END;
  6424. parentScope.AddTypeDeclaration(typeDeclaration);
  6425. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6426. ASSERT(~duplicate);
  6427. type := recordType;
  6428. END;
  6429. RETURN type
  6430. END GetMathArrayDescriptorType;
  6431. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6432. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6433. BEGIN
  6434. type := GetMathArrayDescriptorType(dimensions);
  6435. Emit(Push(position,op.op));
  6436. (* push type descriptor *)
  6437. reg := TypeDescriptorAdr(type);
  6438. IF ~newObjectFile THEN
  6439. IntermediateCode.MakeMemory(reg,addressType);
  6440. END;
  6441. Emit(Push(position,reg));
  6442. ReleaseIntermediateOperand(reg);
  6443. (* push realtime flag: false by default *)
  6444. Emit(Push(position,false));
  6445. CallThis(position,"Heaps","NewRec",3);
  6446. END NewMathArrayDescriptor;
  6447. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6448. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6449. BEGIN
  6450. NEW(string, LEN(s)); COPY(s, string^);
  6451. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6452. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6453. sv.SetType(type);
  6454. Designate(sv,res);
  6455. Emit(Push(position,res.tag));
  6456. Emit(Push(position,res.op));
  6457. ReleaseOperand(res);
  6458. END PushConstString;
  6459. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6460. BEGIN
  6461. IF b THEN
  6462. Emit(Push(Basic.invalidPosition, true));
  6463. ELSE
  6464. Emit(Push(Basic.invalidPosition, false));
  6465. END;
  6466. END PushConstBoolean;
  6467. PROCEDURE PushConstSet(v: SET);
  6468. VAR value: SyntaxTree.Value; op: Operand;
  6469. BEGIN
  6470. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6471. value.SetType(system.setType);
  6472. Evaluate(value, op);
  6473. Emit(Push(Basic.invalidPosition, op.op));
  6474. ReleaseOperand(op);
  6475. END PushConstSet;
  6476. PROCEDURE PushConstInteger(v: LONGINT);
  6477. VAR value: SyntaxTree.Value; op: Operand;
  6478. BEGIN
  6479. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6480. value.SetType(system.longintType);
  6481. Evaluate(value, op);
  6482. Emit(Push(Basic.invalidPosition, op.op));
  6483. ReleaseOperand(op);
  6484. END PushConstInteger;
  6485. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6486. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6487. section: IntermediateCode.Section;
  6488. BEGIN
  6489. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6490. Global.GetSymbolSegmentedName(symbol, name);
  6491. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6492. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6493. procedure.SetScope(moduleScope);
  6494. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6495. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6496. procedure.SetAccess(SyntaxTree.Hidden);
  6497. currentScope := procedureScope;
  6498. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6499. EmitEnter(section, Basic.invalidPosition,procedure,0,0,0);
  6500. RETURN section;
  6501. END OpenInitializer;
  6502. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6503. BEGIN
  6504. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6505. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6506. section := prev;
  6507. END CloseInitializer;
  6508. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6509. VAR name: SyntaxTree.IdentifierString;
  6510. variable: SyntaxTree.Variable;
  6511. parameter: SyntaxTree.Parameter;
  6512. type: SyntaxTree.Type;
  6513. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6514. BEGIN
  6515. InitOperand(op,ModeReference);
  6516. op.op := fp;
  6517. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6518. Dereference(op, x, FALSE);
  6519. result := op;
  6520. Symbol(symbol, op);
  6521. END Field;
  6522. PROCEDURE Direction(direction: LONGINT): SET;
  6523. BEGIN
  6524. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6525. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6526. ELSE HALT(100);
  6527. END;
  6528. END Direction;
  6529. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6530. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6531. BEGIN
  6532. Field(port, op);
  6533. ToMemory(op.op,addressType,0);
  6534. Emit(Push(Basic.invalidPosition, op.op));
  6535. ReleaseOperand(op);
  6536. Basic.GetString(modifier.identifier, name);
  6537. PushConstString(name);
  6538. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6539. ASSERT(SemanticChecker.IsStringType(value.type));
  6540. Designate(value, op);
  6541. Emit(Push(modifier.position, op.tag));
  6542. Emit(Push(modifier.position, op.op));
  6543. ReleaseOperand(op);
  6544. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6545. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6546. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6547. Evaluate(value, op);
  6548. Emit(Push(modifier.position, op.op));
  6549. ReleaseOperand(op);
  6550. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6551. ELSE
  6552. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6553. END;
  6554. END AddPortProperty;
  6555. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6556. VAR modifier: SyntaxTree.Modifier;
  6557. BEGIN
  6558. modifier := parameter.modifiers;
  6559. WHILE modifier # NIL DO
  6560. AddPortProperty(parameter,modifier, modifier.expression);
  6561. modifier := modifier.nextModifier;
  6562. END;
  6563. END AddPortProperties;
  6564. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6565. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6566. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6567. PROCEDURE PushLens(type: SyntaxTree.Type);
  6568. BEGIN
  6569. IF IsSemiDynamicArray(type) THEN
  6570. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6571. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6572. Emit(Push(Basic.invalidPosition, op.op));
  6573. ReleaseOperand(op);
  6574. INC(dim);
  6575. ELSIF IsStaticArray(type) THEN
  6576. len := len * type(SyntaxTree.ArrayType).staticLength;
  6577. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6578. INC(dim);
  6579. ELSE
  6580. baseType := type;
  6581. END;
  6582. END PushLens;
  6583. BEGIN
  6584. (* cell *)
  6585. IF parameter.type IS SyntaxTree.ArrayType THEN
  6586. type := parameter.type;
  6587. dim := 0;
  6588. len := 1;
  6589. PushLens(type);
  6590. portType := baseType.resolved(SyntaxTree.PortType);
  6591. ELSE
  6592. portType := parameter.type(SyntaxTree.PortType);
  6593. END;
  6594. PushSelfPointer();
  6595. (* port / array of ports *)
  6596. IF IsStaticArray(type) THEN
  6597. PushConstInteger(len);
  6598. END;
  6599. Field(parameter, op);
  6600. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6601. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6602. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6603. Designate(d, op);*)
  6604. Emit(Push(Basic.invalidPosition, op.op));
  6605. ReleaseOperand(op);
  6606. (* name *)
  6607. PushConstString(name);
  6608. (* inout *)
  6609. PushConstSet(Direction(portType.direction));
  6610. (* width *)
  6611. PushConstInteger(portType.sizeInBits);
  6612. IF parameter.type IS SyntaxTree.PortType THEN
  6613. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6614. AddPortProperties(parameter);
  6615. ELSIF IsStaticArray(type)THEN
  6616. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6617. ELSIF IsSemiDynamicArray(type) THEN
  6618. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6619. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6620. Emit(Add(position,reg, sp, size));
  6621. (* dim *)
  6622. PushConstInteger(dim);
  6623. (* len array *)
  6624. Emit(Push(position, reg));
  6625. ReleaseIntermediateOperand(reg);
  6626. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6627. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6628. Emit(Add(position, sp,sp, size));
  6629. ELSE
  6630. HALT(100);
  6631. END;
  6632. END Parameter;
  6633. BEGIN
  6634. IF backend.cellsAreObjects THEN
  6635. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6636. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6637. END;
  6638. parameter := x.firstParameter;
  6639. WHILE (parameter # NIL) DO
  6640. type := parameter.type.resolved;
  6641. WHILE (type IS SyntaxTree.ArrayType) DO
  6642. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6643. END;
  6644. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6645. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6646. Parameter(name,parameter);
  6647. END;
  6648. parameter := parameter.nextParameter;
  6649. END;
  6650. ELSE HALT(200)
  6651. END;
  6652. END AddPorts;
  6653. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6654. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6655. BEGIN
  6656. Symbol(cell,op);
  6657. ToMemory(op.op,addressType,0);
  6658. Emit(Push(position,op.op));
  6659. ReleaseOperand(op);
  6660. property.GetName(name);
  6661. (* does not work when inheritance is used:
  6662. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6663. *)
  6664. PushConstString(name);
  6665. IF (value # NIL) THEN
  6666. ASSERT(
  6667. SemanticChecker.IsStringType(property.type)
  6668. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6669. OR (property.type.resolved IS SyntaxTree.FloatType)
  6670. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6671. OR (property.type.resolved IS SyntaxTree.SetType)
  6672. );
  6673. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6674. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6675. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6676. Designate(d, op);
  6677. IF SemanticChecker.IsStringType(property.type) THEN
  6678. Emit(Push(Basic.invalidPosition, op.tag))
  6679. END;
  6680. Emit(Push(Basic.invalidPosition, op.op));
  6681. ReleaseOperand(op);
  6682. END;
  6683. IF value = NIL THEN
  6684. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6685. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6686. ASSERT(SemanticChecker.IsStringType(value.type));
  6687. Designate(value, op);
  6688. PushString(op, value.type);
  6689. ReleaseOperand(op);
  6690. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6691. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6692. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6693. Evaluate(value, op);
  6694. Emit(Push(property.position, op.op));
  6695. ReleaseOperand(op);
  6696. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6697. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6698. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6699. Evaluate(value, op);
  6700. Emit(Push(property.position, op.op));
  6701. ReleaseOperand(op);
  6702. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6703. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6704. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6705. Evaluate(value, op);
  6706. Emit(Push(property.position, op.op));
  6707. ReleaseOperand(op);
  6708. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6709. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6710. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6711. Evaluate(value, op);
  6712. Emit(Push(property.position, op.op));
  6713. ReleaseOperand(op);
  6714. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6715. ELSE
  6716. HALT(200);
  6717. END;
  6718. END AddProperty;
  6719. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6720. VAR symbol: SyntaxTree.Symbol;
  6721. BEGIN
  6722. WHILE modifier # NIL DO
  6723. symbol := cellType.FindProperty(modifier.identifier);
  6724. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6725. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6726. modifier := modifier.nextModifier;
  6727. END;
  6728. END AddModifiers;
  6729. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6730. VAR last: SyntaxTree.Modifier;
  6731. BEGIN
  6732. IF to = NIL THEN
  6733. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6734. ELSE
  6735. last := to;
  6736. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6737. last := last.nextModifier;
  6738. END;
  6739. IF last.identifier # this.identifier THEN
  6740. ASSERT(last.nextModifier = NIL);
  6741. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6742. END;
  6743. END;
  6744. END AppendModifier;
  6745. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6746. BEGIN
  6747. WHILE this # NIL DO
  6748. AppendModifier(to, this);
  6749. this := this.nextModifier;
  6750. END;
  6751. END AppendModifiers;
  6752. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6753. VAR base: SyntaxTree.Type;
  6754. BEGIN
  6755. AppendModifiers(to, c.modifiers);
  6756. base := c.GetBaseValueType();
  6757. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6758. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6759. END;
  6760. END AppendCellTypeModifiers;
  6761. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6762. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6763. BEGIN
  6764. Basic.GetString(modifier.identifier, name);
  6765. PushConstString(name);
  6766. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6767. ASSERT(SemanticChecker.IsStringType(value.type));
  6768. Designate(value, op);
  6769. PushString(op, value.type);
  6770. ReleaseOperand(op);
  6771. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6772. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6773. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6774. Evaluate(value, op);
  6775. Emit(Push(modifier.position, op.op));
  6776. ReleaseOperand(op);
  6777. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6778. ELSE
  6779. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6780. END;
  6781. END AddPortProperty;
  6782. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6783. BEGIN
  6784. WHILE modifier # NIL DO
  6785. AddPortProperty(modifier, modifier.expression);
  6786. modifier := modifier.nextModifier;
  6787. END;
  6788. END AddPortProperties;
  6789. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6790. VAR op: Operand;
  6791. BEGIN
  6792. Evaluate(p, op);
  6793. Emit(Push(p.position, op.op));
  6794. ReleaseOperand(op);
  6795. IF p IS SyntaxTree.Designator THEN
  6796. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  6797. END;
  6798. END PushPort;
  6799. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6800. VAR tmp: IntermediateCode.Operand;
  6801. BEGIN
  6802. actualType := actualType.resolved;
  6803. IF actualType IS SyntaxTree.StringType THEN
  6804. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6805. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6806. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6807. ELSE
  6808. tmp := op.tag;
  6809. IntermediateCode.MakeMemory(tmp,addressType);
  6810. Emit(Push(position,tmp));
  6811. END;
  6812. Emit(Push(position,op.op))
  6813. END PushString;
  6814. (* conservative check if x is potentially on the heap, excluding the module heap
  6815. required for generational garbage collector
  6816. *)
  6817. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  6818. VAR pos: LONGINT; y: SyntaxTree.Expression;
  6819. BEGIN
  6820. RETURN TRUE;
  6821. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  6822. passed by reference.
  6823. pos := x.position.start;
  6824. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  6825. x := x(SyntaxTree.Designator).left;
  6826. END;
  6827. RETURN x # NIL;
  6828. *)
  6829. END OnHeap;
  6830. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6831. VAR
  6832. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6833. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6834. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6835. tmp:IntermediateCode.Operand;
  6836. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6837. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6838. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6839. dest: IntermediateCode.Operand;
  6840. staticLength: LONGINT; itype: IntermediateCode.Type;
  6841. convert,isTensor: BOOLEAN;
  6842. recordType: SyntaxTree.RecordType;
  6843. baseType: SyntaxTree.Type;
  6844. flags: SET;
  6845. left: SyntaxTree.Expression;
  6846. call: SyntaxTree.Designator;
  6847. procedure: SyntaxTree.Procedure;
  6848. temporaryVariable: SyntaxTree.Variable;
  6849. dummy: IntermediateCode.Operand;
  6850. customBuiltin: SyntaxTree.CustomBuiltin;
  6851. isVarPar: ARRAY 3 OF BOOLEAN;
  6852. callsection: Sections.Section;
  6853. segmentedName: Basic.SegmentedName;
  6854. needsTrace: BOOLEAN;
  6855. n: ARRAY 256 OF CHAR;
  6856. modifier: SyntaxTree.Modifier;
  6857. previous, init: IntermediateCode.Section;
  6858. prevScope: SyntaxTree.Scope;
  6859. firstPar: LONGINT;
  6860. saved: RegisterEntry;
  6861. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6862. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6863. priority: IntermediateCode.Operand;
  6864. op,callop: Operand;
  6865. BEGIN
  6866. IF type = NIL THEN RETURN END;
  6867. type := type.resolved;
  6868. IF type IS SyntaxTree.PointerType THEN
  6869. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6870. END;
  6871. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6872. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6873. recordScope := type(SyntaxTree.RecordType).recordScope;
  6874. IF recordScope.bodyProcedure # NIL THEN
  6875. procedure := recordScope.bodyProcedure;
  6876. body := procedure.procedureScope.body;
  6877. Emit(Push(position,self));
  6878. IF body.isActive THEN
  6879. StaticCallOperand(callop,procedure);
  6880. Emit(Push(position,callop.op));
  6881. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6882. Convert(priority,sizeType);
  6883. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6884. END;
  6885. Emit(Push(position,priority));
  6886. ReleaseIntermediateOperand(priority);
  6887. IF backend.cooperative THEN
  6888. Emit(Push(position,self));
  6889. CallThis(position,"Activities","Create",3)
  6890. ELSE
  6891. flags := 0;
  6892. IF body.isSafe THEN
  6893. flags := 1;
  6894. END;
  6895. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6896. Emit(Push(position,self));
  6897. CallThis(position,"Objects","CreateProcess",4)
  6898. END;
  6899. ELSE
  6900. Emit(Push(position,self));
  6901. StaticCallOperand(callop,procedure);
  6902. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6903. END;
  6904. Emit(Pop(position,self));
  6905. END;
  6906. END CallBodies;
  6907. PROCEDURE PushTD(type: SyntaxTree.Type);
  6908. VAR op: IntermediateCode.Operand;
  6909. BEGIN
  6910. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6911. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6912. ELSE
  6913. IF type.resolved IS SyntaxTree.PointerType THEN
  6914. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6915. END;
  6916. op := TypeDescriptorAdr(type.resolved);
  6917. IF ~newObjectFile THEN
  6918. IntermediateCode.MakeMemory(op,addressType);
  6919. END;
  6920. Emit(Push(position,op));
  6921. END
  6922. END PushTD;
  6923. BEGIN
  6924. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6925. dest := destination; destination := emptyOperand;
  6926. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6927. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6928. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6929. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6930. CASE x.id OF
  6931. (* ---- COPY ----- *)
  6932. |Global.Copy:
  6933. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6934. (* ---- EXCL, INCL----- *)
  6935. |Global.Excl,Global.Incl:
  6936. Evaluate(p0,s0);
  6937. Evaluate(p1,s1);
  6938. Convert(s1.op,setType);
  6939. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6940. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6941. END;
  6942. ReuseCopy(res,s0.op);
  6943. ReleaseOperand(s0);
  6944. Reuse1(tmp,s1.op);
  6945. ReleaseOperand(s1);
  6946. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6947. IF x.id = Global.Excl THEN
  6948. Emit(Not(position,tmp,tmp));
  6949. Emit(And(position,res,res,tmp));
  6950. ELSE
  6951. Emit(Or(position,res,res,tmp));
  6952. END;
  6953. ReleaseIntermediateOperand(tmp);
  6954. Designate(p0,s0);
  6955. ToMemory(s0.op,setType,0);
  6956. Emit(Mov(position,s0.op,res));
  6957. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6958. (* ---- DISPOSE ----- *)
  6959. |Global.Dispose:
  6960. Designate(p0,s0);
  6961. Emit(Push(position,s0.op));
  6962. ReleaseOperand(s0);
  6963. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6964. (* ---- GETPROCEDURE ----- *)
  6965. |Global.GetProcedure:
  6966. Designate(p0,s0);
  6967. PushString(s0,p0.type);
  6968. Designate(p1,s1);
  6969. PushString(s1,p1.type);
  6970. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6971. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6972. ELSE PushTD(procedureType.firstParameter.type)
  6973. END;
  6974. PushTD(procedureType.returnType);
  6975. Designate(p2,s2);
  6976. Emit(Push(position,s2.op));
  6977. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6978. CallThis(position,"Modules","GetProcedure", 7);
  6979. (* ---- ASH, LSH, ROT ----- *)
  6980. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6981. Evaluate(p0,s0);
  6982. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6983. (* make unsigned arguments in order to produced a logical shift *)
  6984. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6985. convert:= TRUE;
  6986. itype := s0.op.type;
  6987. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6988. Convert(s0.op,itype);
  6989. ELSE
  6990. convert := FALSE;
  6991. END;
  6992. END;
  6993. Evaluate(p1,s1);
  6994. IF IsIntegerConstant(p1,hint) THEN
  6995. ReuseCopy(reg,s0.op);
  6996. IF hint > 0 THEN
  6997. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6998. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6999. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7000. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7001. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7002. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7003. END;
  7004. ELSIF hint < 0 THEN
  7005. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7006. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7007. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7008. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7009. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7010. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7011. END;
  7012. END;
  7013. ReleaseOperand(s0); ReleaseOperand(s1);
  7014. ELSE
  7015. exit := NewLabel();
  7016. end := NewLabel();
  7017. ReuseCopy(reg,s0.op);
  7018. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7019. Reuse1(tmp,s1.op);
  7020. Emit(Neg(position,tmp,s1.op));
  7021. Convert(tmp,s1.op.type);
  7022. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7023. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7024. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7025. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7026. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7027. END;
  7028. ReleaseIntermediateOperand(tmp);
  7029. BrL(end);
  7030. SetLabel(exit);
  7031. ReuseCopy(tmp,s1.op);
  7032. Convert(tmp,s1.op.type);
  7033. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7034. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7035. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7036. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7037. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7038. END;
  7039. ReleaseIntermediateOperand(tmp);
  7040. SetLabel(end);
  7041. ReleaseOperand(s0); ReleaseOperand(s1);
  7042. END;
  7043. InitOperand(result,ModeValue);
  7044. IF convert THEN
  7045. itype := reg.type;
  7046. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7047. Convert(reg,itype);
  7048. END;
  7049. result.op := reg;
  7050. (* ---- CAP ----- *)
  7051. |Global.Cap:
  7052. Evaluate(p0,result);
  7053. ReuseCopy(reg,result.op);
  7054. ReleaseIntermediateOperand(result.op);
  7055. ignore := NewLabel();
  7056. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7057. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7058. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7059. SetLabel(ignore);
  7060. result.op := reg;
  7061. (* ---- CHR ----- *)
  7062. |Global.Chr, Global.Chr32:
  7063. Evaluate(p0,result);
  7064. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7065. |Global.Entier, Global.EntierH:
  7066. Evaluate(p0,result);
  7067. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7068. (* ---- MIN and MAX ----- *)
  7069. |Global.Max,Global.Min:
  7070. Evaluate(p0,s0);
  7071. Evaluate(p1,s1);
  7072. Reuse2(res,s0.op,s1.op);
  7073. else := NewLabel();
  7074. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7075. ELSE BrltL(else,s1.op,s0.op) END;
  7076. Emit(Mov(position,res,s0.op));
  7077. ReleaseOperand(s0);
  7078. end := NewLabel();
  7079. BrL(end);
  7080. SetLabel(else);
  7081. Emit(MovReplace(position,res,s1.op));
  7082. SetLabel(end);
  7083. ReleaseOperand(s1);
  7084. InitOperand(result,ModeValue);
  7085. result.op := res;
  7086. (* ---- ODD ----- *)
  7087. |Global.Odd:
  7088. IF ~conditional THEN
  7089. ConditionToValue(x)
  7090. ELSE
  7091. Evaluate(p0,result);
  7092. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7093. Reuse1(res,result.op);
  7094. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7095. ReleaseIntermediateOperand(result.op);
  7096. result.op := res;
  7097. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  7098. ReleaseOperand(result);
  7099. BrL(falseLabel);
  7100. END;
  7101. (* ---- ORD ----- *)
  7102. |Global.Ord, Global.Ord32:
  7103. Evaluate(p0,result);
  7104. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7105. (* ---- SHORT, LONG ----- *)
  7106. |Global.Short, Global.Long:
  7107. Evaluate(p0,result);
  7108. IF x.type IS SyntaxTree.ComplexType THEN
  7109. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7110. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7111. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7112. ELSE
  7113. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7114. END
  7115. (* ---- HALT, SYSTEM.HALT----- *)
  7116. |Global.Halt, Global.systemHalt:
  7117. val := p0.resolved(SyntaxTree.IntegerValue).value;
  7118. EmitTrap (position, val);
  7119. (* ---- ASSERT ----- *)
  7120. |Global.Assert:
  7121. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7122. trueL := NewLabel();
  7123. falseL := NewLabel();
  7124. Condition(p0,trueL,falseL);
  7125. IF p1 = NIL THEN val := AssertTrap
  7126. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  7127. END;
  7128. SetLabel(falseL);
  7129. EmitTrap(position,val);
  7130. SetLabel(trueL);
  7131. END;
  7132. (*
  7133. Emit(TrapC(result.op,val);
  7134. *)
  7135. (* ---- INC, DEC----- *)
  7136. |Global.Inc,Global.Dec:
  7137. Expression(p0); adr := result.op;
  7138. LoadValue(result,p0.type); l := result;
  7139. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7140. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7141. END;
  7142. IF x.id = Global.Inc THEN
  7143. Emit(Add(position,l.op,l.op,r.op));
  7144. ELSE
  7145. Emit(Sub(position,l.op,l.op,r.op));
  7146. END;
  7147. ReleaseOperand(l); ReleaseOperand(r);
  7148. (* ---- LEN ----- *)
  7149. |Global.Len: (* dynamic length, static length done by checker *)
  7150. Designate(p0,operand);
  7151. IF p1 = NIL THEN
  7152. InitOperand(l,ModeValue);
  7153. l.op := IntermediateCode.Immediate(sizeType,0);
  7154. ELSE
  7155. Evaluate(p1,l);
  7156. END;
  7157. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7158. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7159. Dereference(operand, p0.type.resolved, FALSE);
  7160. END;
  7161. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7162. ReleaseOperand(operand); ReleaseOperand(l);
  7163. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7164. ASSERT(p1 # NIL);
  7165. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7166. Dereference(operand,p0.type.resolved,FALSE);
  7167. END;
  7168. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7169. ReleaseOperand(operand); ReleaseOperand(l);
  7170. ELSE HALT(100);
  7171. END;
  7172. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7173. (* ---- FIRST ---- *)
  7174. |Global.First:
  7175. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7176. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7177. ELSE
  7178. Designate(p0, result)
  7179. END
  7180. (* ---- LAST ---- *)
  7181. |Global.Last:
  7182. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7183. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7184. ELSE
  7185. Designate(p0, result);
  7186. (* make sure result.op is a register *)
  7187. tmp := result.op;
  7188. ReuseCopy(result.op, result.op);
  7189. ReleaseIntermediateOperand(tmp);
  7190. (* add offset to result.op *)
  7191. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7192. END
  7193. (* ---- STEP ---- *)
  7194. |Global.Step:
  7195. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7196. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7197. ELSE
  7198. Designate(p0, result);
  7199. (* make sure result.op is a register *)
  7200. tmp := result.op;
  7201. ReuseCopy(result.op, result.op);
  7202. ReleaseIntermediateOperand(tmp);
  7203. (* add offset to result.op *)
  7204. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7205. END
  7206. (* ---- RE ---- *)
  7207. |Global.Re:
  7208. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7209. Designate(p0, result)
  7210. ELSE
  7211. Evaluate(p0, result)
  7212. END
  7213. (* ---- IM ---- *)
  7214. |Global.Im:
  7215. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7216. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7217. Designate(p0, result);
  7218. (* make sure result.op is a register *)
  7219. tmp := result.op;
  7220. ReuseCopy(result.op, result.op);
  7221. ReleaseIntermediateOperand(tmp);
  7222. (* add offset to result.op *)
  7223. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7224. (* ---- ABS ----- *)
  7225. |Global.Abs:
  7226. Evaluate(p0,operand);
  7227. type := p0.type.resolved;
  7228. InitOperand(result,ModeValue);
  7229. Reuse1a(result.op,operand.op,dest);
  7230. Emit(Abs(position,result.op,operand.op));
  7231. ReleaseOperand(operand);
  7232. (* ---- WAIT ----- *)
  7233. |Global.Wait:
  7234. Evaluate(p0,operand);
  7235. Emit(Push(position,operand.op));
  7236. ReleaseOperand(operand);
  7237. CallThis(position,"Activities","Wait", 1);
  7238. (* ---- NEW ----- *)
  7239. |Global.New:
  7240. (*! the following code is only correct for "standard" Oberon calling convention *)
  7241. IF x.type # NIL THEN
  7242. type := x.type.resolved;
  7243. firstPar := 0;
  7244. ELSE
  7245. type := p0.type.resolved;
  7246. firstPar := 1;
  7247. END;
  7248. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7249. THEN
  7250. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7251. IF backend.cooperative THEN
  7252. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7253. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7254. IF recordType.isObject THEN
  7255. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7256. IF recordType.IsActive() THEN
  7257. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7258. END;
  7259. IF recordType.IsProtected() THEN
  7260. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7261. END;
  7262. ELSE
  7263. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7264. END;
  7265. END;
  7266. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7267. CallThis(position,"Runtime","New", 1);
  7268. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7269. Emit(Result(position, pointer));
  7270. exit := NewLabel();
  7271. BreqL(exit,pointer,nil);
  7272. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7273. GetRecordTypeName (recordType,name);
  7274. IF ~recordType.isObject THEN
  7275. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7276. END;
  7277. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7278. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7279. IF recordType.isObject THEN
  7280. IF recordType.IsProtected() THEN
  7281. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7282. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7283. END;
  7284. IF recordType.IsActive() THEN
  7285. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7286. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7287. END;
  7288. END;
  7289. END;
  7290. (* initialize fields *)
  7291. IF type(SyntaxTree.PointerType).isPlain THEN
  7292. size := 0;
  7293. ELSIF recordType.isObject THEN
  7294. size := BaseObjectTypeSize;
  7295. ELSE
  7296. size := BaseRecordTypeSize;
  7297. END;
  7298. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7299. (* call initializer *)
  7300. constructor := GetConstructor(recordType);
  7301. IF constructor # NIL THEN
  7302. (*! should be unified with ProcedureCallDesignator *)
  7303. Emit(Push(position,pointer));
  7304. ReleaseIntermediateOperand(pointer);
  7305. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7306. FOR i := firstPar TO x.parameters.Length()-1 DO
  7307. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7308. formalParameter := formalParameter.nextParameter;
  7309. END;
  7310. (* static call of the constructor *)
  7311. GetCodeSectionNameForSymbol(constructor,name);
  7312. ASSERT(~constructor.isInline);
  7313. IF constructor.scope.ownerModule # module.module THEN
  7314. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7315. ELSE
  7316. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7317. END;
  7318. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7319. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7320. Emit(Pop(position,pointer));
  7321. END;
  7322. (* call bodies *)
  7323. CallBodies(pointer,type);
  7324. SetLabel(exit);
  7325. needsTrace := p0.NeedsTrace();
  7326. IF needsTrace THEN ModifyAssignments(true) END;
  7327. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7328. Emit(Push(position, pointer));
  7329. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7330. Emit(Pop(position, pointer));
  7331. END;
  7332. Designate(p0,l);
  7333. IF needsTrace THEN
  7334. CallAssignPointer(l.op, pointer);
  7335. ELSE
  7336. ToMemory(l.op,addressType,0);
  7337. Emit(Mov(position,l.op,pointer));
  7338. END;
  7339. ReleaseIntermediateOperand(pointer);
  7340. ReleaseOperand(l);
  7341. IF needsTrace THEN ModifyAssignments(false) END;
  7342. ELSE (* not cooperative backend *)
  7343. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7344. IF temporaryVariable # NIL THEN
  7345. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7346. ELSE
  7347. Designate(p0,l);
  7348. END;
  7349. (* l.op contains address of pointer to record *)
  7350. Emit(Push(position,l.op)); (* address for use after syscall *)
  7351. Emit(Push(position,l.op));
  7352. ReleaseOperand(l);
  7353. (* push type descriptor *)
  7354. reg := TypeDescriptorAdr(recordType);
  7355. IF ~newObjectFile THEN
  7356. IntermediateCode.MakeMemory(reg,addressType);
  7357. END;
  7358. Emit(Push(position,reg));
  7359. ReleaseIntermediateOperand(reg);
  7360. (* push realtime flag *)
  7361. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7362. ELSE Emit(Push(position,false));
  7363. END;
  7364. CallThis(position,"Heaps","NewRec", 3);
  7365. (* check allocation success, if not successful then do not call initializers and bodies *)
  7366. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7367. Emit(Pop(position,pointer));
  7368. MakeMemory(reg,pointer,addressType,0);
  7369. ReleaseIntermediateOperand(pointer);
  7370. pointer := reg;
  7371. exit := NewLabel();
  7372. BreqL(exit,pointer,nil);
  7373. Emit(Push(position,pointer));
  7374. (* initialize fields *)
  7375. InitFields(recordType, pointer,0);
  7376. (* call initializer *)
  7377. constructor := GetConstructor(recordType);
  7378. IF constructor # NIL THEN
  7379. (*! should be unified with ProcedureCallDesignator *)
  7380. Emit(Push(position,pointer));
  7381. ReleaseIntermediateOperand(pointer);
  7382. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7383. FOR i := firstPar TO x.parameters.Length()-1 DO
  7384. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7385. formalParameter := formalParameter.nextParameter;
  7386. END;
  7387. (* static call of the constructor *)
  7388. GetCodeSectionNameForSymbol(constructor,name);
  7389. ASSERT(~constructor.isInline);
  7390. IF constructor.scope.ownerModule # module.module THEN
  7391. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7392. ELSE
  7393. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7394. END;
  7395. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7396. ELSE
  7397. ReleaseIntermediateOperand(pointer);
  7398. END;
  7399. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7400. Emit(Pop(position,pointer));
  7401. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7402. Designate(p0,l);
  7403. IF backend.writeBarriers & OnHeap(p0) THEN
  7404. SaveRegisters();ReleaseUsedRegisters(saved);
  7405. Emit(Push(position,l.op));
  7406. Emit(Push(position,pointer));
  7407. CallThis(position,"Heaps","Assign",2);
  7408. RestoreRegisters(saved);
  7409. ELSE
  7410. ToMemory(l.op,addressType,0);
  7411. Emit(Mov(position,l.op,pointer));
  7412. END;
  7413. ReleaseOperand(l);
  7414. result.tag := emptyOperand;
  7415. ELSIF (x.type # NIL) THEN
  7416. result := l; (* temporary variable is the result of NEW Type() *)
  7417. END;
  7418. (* call bodies *)
  7419. CallBodies(pointer,type);
  7420. ReleaseIntermediateOperand(pointer);
  7421. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7422. end := NewLabel();
  7423. BrL(end);
  7424. SetLabel(exit);
  7425. Designate(p0,l);
  7426. ToMemory(l.op,addressType,0);
  7427. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7428. ReleaseOperand(l);
  7429. SetLabel(end);
  7430. ELSE
  7431. SetLabel(exit);
  7432. END;
  7433. END;
  7434. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7435. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7436. IF ~backend.cooperative THEN (* simpler version *)
  7437. (*
  7438. push len0
  7439. push len1
  7440. push len2
  7441. push len_size
  7442. push len_adr
  7443. push tag
  7444. push static elements
  7445. push element size
  7446. push adr
  7447. *)
  7448. dim := 0;
  7449. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7450. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7451. parameter := x.parameters.GetExpression(i);
  7452. Evaluate(parameter,r);
  7453. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7454. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7455. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7456. END;
  7457. Emit(Push(position,r.op));
  7458. ReleaseOperand(r);
  7459. INC(dim);
  7460. END;
  7461. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7462. Emit(Mov(position, adr, sp));
  7463. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7464. Emit(Push(position, adr));
  7465. ReleaseIntermediateOperand(adr);
  7466. openDim := dim;
  7467. staticLength := 1;
  7468. IF type IS SyntaxTree.ArrayType THEN
  7469. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7470. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7471. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7472. END;
  7473. END;
  7474. IF SemanticChecker.ContainsPointer(type) THEN
  7475. tmp := TypeDescriptorAdr(type);
  7476. IF ~newObjectFile THEN
  7477. IntermediateCode.MakeMemory(tmp,addressType);
  7478. END;
  7479. ELSE
  7480. tmp := nil;
  7481. END;
  7482. Emit(Push(position,tmp)); (* type descriptor *)
  7483. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7484. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7485. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7486. Designate(p0,l);
  7487. Emit(Push(position,l.op)); (* address *)
  7488. ReleaseOperand(l);
  7489. CallThis(position,"Heaps","NewArray", 6);
  7490. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7491. Emit(Add(position,sp,sp,tmp));
  7492. ELSE
  7493. dim := 0;
  7494. IntermediateCode.InitOperand(reg);
  7495. IF p1 # NIL THEN
  7496. FOR i := firstPar TO x.parameters.Length()-1 DO
  7497. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7498. parameter := x.parameters.GetExpression(i);
  7499. Evaluate(parameter,r);
  7500. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7501. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7502. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7503. END;
  7504. Emit(Push(position,r.op));
  7505. IF i=1 THEN
  7506. CopyInt(reg,r.op);
  7507. ELSE
  7508. MulInt(reg, reg, r.op);
  7509. END;
  7510. ReleaseOperand(r);
  7511. INC(dim);
  7512. END;
  7513. Convert(reg,addressType);
  7514. ELSE
  7515. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7516. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7517. END;
  7518. openDim := dim;
  7519. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7520. IF backend.cooperative THEN
  7521. size := ToMemoryUnits(system,system.SizeOf(type));
  7522. WHILE type IS SyntaxTree.ArrayType DO
  7523. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7524. END;
  7525. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7526. IF (size # 1) THEN
  7527. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7528. END;
  7529. Emit(Push(position,reg));
  7530. size := ToMemoryUnits(system,system.SizeOf(type));
  7531. IF (size # 1) THEN
  7532. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7533. END;
  7534. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7535. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7536. Emit(Push(position,reg));
  7537. ReleaseIntermediateOperand(reg);
  7538. CallThis(position,"Runtime","New", 1);
  7539. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7540. Emit(Result(position, pointer));
  7541. exit := NewLabel();
  7542. else := NewLabel();
  7543. BreqL(else,pointer,nil);
  7544. IF ~type.hasPointers THEN
  7545. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7546. ELSIF type IS SyntaxTree.RecordType THEN
  7547. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7548. ELSIF type IS SyntaxTree.ProcedureType THEN
  7549. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7550. ELSE
  7551. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7552. END;
  7553. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7554. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7555. 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))));
  7556. IF type IS SyntaxTree.RecordType THEN
  7557. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7558. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7559. ELSE
  7560. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7561. END;
  7562. i := openDim;
  7563. WHILE i > 0 DO
  7564. DEC (i);
  7565. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7566. END;
  7567. needsTrace := p0.NeedsTrace();
  7568. IF needsTrace THEN ModifyAssignments(true) END;
  7569. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7570. Emit(Push(position, pointer));
  7571. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7572. Emit(Pop(position, pointer));
  7573. END;
  7574. Designate(p0,l);
  7575. IF needsTrace THEN
  7576. CallAssignPointer(l.op, pointer);
  7577. ModifyAssignments(false);
  7578. ELSE
  7579. ToMemory(l.op,addressType,0);
  7580. Emit(Mov(position,l.op,pointer));
  7581. END;
  7582. ReleaseIntermediateOperand(pointer);
  7583. ReleaseOperand(l);
  7584. BrL(exit);
  7585. SetLabel(else);
  7586. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7587. Designate(p0,l);
  7588. IF needsTrace THEN
  7589. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7590. ELSE
  7591. ToMemory(l.op,addressType,0);
  7592. Emit(Mov(position,l.op,pointer));
  7593. END;
  7594. ReleaseOperand(l);
  7595. SetLabel(exit);
  7596. ELSE
  7597. (*! the following code is only correct for "standard" Oberon calling convention *)
  7598. IF SemanticChecker.ContainsPointer(type) THEN
  7599. IF type IS SyntaxTree.ArrayType THEN
  7600. staticLength := 1;
  7601. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7602. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7603. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7604. END;
  7605. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7606. MulInt(reg,reg,tmp);
  7607. END;
  7608. Designate(p0,l);
  7609. IF openDim > 0 THEN
  7610. Emit(Push(position,l.op)); (* address for use after syscall *)
  7611. END;
  7612. Emit(Push(position,l.op)); (* address *)
  7613. ReleaseOperand(l);
  7614. tmp := TypeDescriptorAdr(type);
  7615. IF ~newObjectFile THEN
  7616. IntermediateCode.MakeMemory(tmp,addressType);
  7617. END;
  7618. Emit(Push(position,tmp)); (* type descriptor *)
  7619. ReleaseIntermediateOperand(tmp);
  7620. Emit(Push(position,reg)); (* number Elements *)
  7621. ReleaseIntermediateOperand(reg);
  7622. tmp := IntermediateCode.Immediate(addressType,dim);
  7623. Emit(Push(position,tmp)); (* dimensions *)
  7624. (* push realtime flag *)
  7625. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7626. ELSE Emit(Push(position,false));
  7627. END;
  7628. CallThis(position,"Heaps","NewArr",5)
  7629. ELSE
  7630. size := ToMemoryUnits(system,system.SizeOf(type));
  7631. IF (size # 1) THEN
  7632. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7633. (*
  7634. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7635. *)
  7636. END;
  7637. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7638. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7639. AddInt(reg, reg, tmp);
  7640. (*
  7641. Emit(Add(position,reg,reg,tmp));
  7642. *)
  7643. Designate(p0,l);
  7644. IF openDim >0 THEN
  7645. Emit(Push(position,l.op)); (* address for use after syscall *)
  7646. END;
  7647. Emit(Push(position,l.op)); (* address for syscall *)
  7648. ReleaseOperand(l); (* pointer address *)
  7649. Emit(Push(position,reg)); (* size *)
  7650. ReleaseIntermediateOperand(reg);
  7651. (* push realtime flag *)
  7652. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7653. ELSE Emit(Push(position,false));
  7654. END;
  7655. CallThis(position,"Heaps","NewSys", 3)
  7656. END;
  7657. IF openDim > 0 THEN
  7658. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7659. Emit(Pop(position,adr));
  7660. ToMemory(adr,addressType,0);
  7661. ReuseCopy(tmp,adr);
  7662. ReleaseIntermediateOperand(adr);
  7663. adr := tmp;
  7664. else := NewLabel();
  7665. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7666. i := openDim-1;
  7667. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7668. WHILE (i >= 0) DO
  7669. Emit(Pop(position,reg));
  7670. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7671. Emit(Mov(position,res,reg));
  7672. DEC(i);
  7673. END;
  7674. ReleaseIntermediateOperand(adr);
  7675. ReleaseIntermediateOperand(reg);
  7676. exit := NewLabel();
  7677. BrL(exit);
  7678. SetLabel(else);
  7679. (* else part: array could not be allocated *)
  7680. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7681. Emit(Add(position,sp,sp,tmp));
  7682. SetLabel(exit);
  7683. END;
  7684. END;
  7685. END;
  7686. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7687. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7688. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7689. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7690. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7691. left.SetType(procedure.type);
  7692. formalParameter := procedureType.firstParameter;
  7693. (* push array to allocate *)
  7694. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7695. formalParameter :=formalParameter.nextParameter;
  7696. (* push length array *)
  7697. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7698. (* push size *)
  7699. type := t0;
  7700. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7701. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7702. END;
  7703. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7704. Emit(Push(position,tmp));
  7705. (* *)
  7706. IF SemanticChecker.ContainsPointer(type) THEN
  7707. tmp := TypeDescriptorAdr(type);
  7708. IF ~newObjectFile THEN
  7709. IntermediateCode.MakeMemory(tmp,addressType);
  7710. END;
  7711. ELSE
  7712. tmp := IntermediateCode.Immediate(addressType, 0);
  7713. END;
  7714. Emit(Push(position,tmp)); (* type descriptor *)
  7715. StaticCallOperand(result,procedure);
  7716. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7717. ReleaseOperand(result);
  7718. END;
  7719. (*
  7720. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7721. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7722. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7723. *)
  7724. ELSE
  7725. (*
  7726. push len0
  7727. push len1
  7728. push len2
  7729. push size
  7730. push len_adr
  7731. push element_size
  7732. push tag
  7733. push adr
  7734. *)
  7735. dim := 0;
  7736. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7737. isTensor := TRUE;
  7738. ELSE
  7739. isTensor := FALSE;
  7740. END;
  7741. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7742. IF ~isTensor THEN
  7743. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7744. END;
  7745. parameter := x.parameters.GetExpression(i);
  7746. Evaluate(parameter,r);
  7747. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7748. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7749. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7750. END;
  7751. Emit(Push(position,r.op));
  7752. ReleaseOperand(r);
  7753. INC(dim);
  7754. END;
  7755. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7756. Emit(Mov(position, adr, sp));
  7757. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7758. Emit(Push(position, adr));
  7759. ReleaseIntermediateOperand(adr);
  7760. openDim := dim;
  7761. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7762. IF isTensor THEN
  7763. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7764. ELSE
  7765. baseType := SemanticChecker.ArrayBase(type,openDim);
  7766. END;
  7767. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7768. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7769. IF SemanticChecker.ContainsPointer(baseType) THEN
  7770. tmp := TypeDescriptorAdr(baseType);
  7771. IF ~newObjectFile THEN
  7772. IntermediateCode.MakeMemory(tmp,addressType);
  7773. END;
  7774. ELSE
  7775. tmp := nil;
  7776. END;
  7777. Emit(Push(position,tmp)); (* type descriptor *)
  7778. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7779. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7780. ELSE (* error message has already been emited *)
  7781. RETURN;
  7782. END;
  7783. Designate(p0,l);
  7784. IF isTensor THEN
  7785. Emit(Push(position,l.op)); (* address *)
  7786. ELSE
  7787. Emit(Push(position,l.tag)); (* address *)
  7788. END;
  7789. ReleaseOperand(l);
  7790. StaticCallOperand(result,procedure);
  7791. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7792. ReleaseOperand(result);
  7793. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7794. Emit(Add(position,sp,sp,tmp));
  7795. END;
  7796. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7797. THEN
  7798. IF ~backend.cellsAreObjects THEN RETURN END;
  7799. IF InCellScope(currentScope) THEN
  7800. PushSelfPointer()
  7801. ELSE
  7802. Emit(Push(position, nil));
  7803. END;
  7804. (* push temp address *)
  7805. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7806. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7807. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7808. (* l.op contains address of pointer to record *)
  7809. Emit(Push(position,l.op)); (* address for use after syscall *)
  7810. ReleaseOperand(l);
  7811. (* push type descriptor *)
  7812. reg := TypeDescriptorAdr(baseType);
  7813. IF ~newObjectFile THEN
  7814. IntermediateCode.MakeMemory(reg,addressType);
  7815. END;
  7816. Emit(Push(position,reg));
  7817. ReleaseIntermediateOperand(reg);
  7818. (* push name *)
  7819. (*Global.GetSymbolName(p0, n);*)
  7820. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7821. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7822. ELSE
  7823. Global.GetModuleName(module.module, n);
  7824. END;
  7825. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  7826. (*type.typeDeclaration.GetName(n);*)
  7827. PushConstString(n);
  7828. (* push cellnet boolean *)
  7829. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7830. (* push engine boolean *)
  7831. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7832. (* allocate *)
  7833. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7834. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7835. (* l.op contains address of pointer to record *)
  7836. ToMemory(l.op,addressType,0);
  7837. (* l.op contains value of pointer to record *)
  7838. InitFields(baseType, l.op,0);
  7839. (* add capabilities *)
  7840. modifier := p0(SyntaxTree.Designator).modifiers;
  7841. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7842. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7843. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7844. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7845. END;
  7846. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7847. (*
  7848. modifier := baseType(SyntaxTree.CellType).modifiers;
  7849. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7850. modifier := p0(SyntaxTree.Designator).modifiers;
  7851. *)
  7852. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7853. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7854. (* l.op contains address of pointer to record *)
  7855. ToMemory(l.op,addressType,0);
  7856. (* l.op contains value of pointer to record *)
  7857. Emit(Push(position,l.op)); (* address for use after syscall *)
  7858. ReleaseOperand(l);
  7859. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7860. prevScope := currentScope;
  7861. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7862. previous := section;
  7863. section := init;
  7864. (* add ports *)
  7865. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7866. CloseInitializer(previous);
  7867. currentScope := prevScope;
  7868. Symbol(temporaryVariable,l);
  7869. ToMemory(l.op,addressType,0);
  7870. Emit(Push(position,l.op));
  7871. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7872. (*
  7873. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7874. IF constructor # NIL THEN
  7875. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7876. FOR i := 1 TO x.parameters.Length()-1 DO
  7877. p := x.parameters.GetExpression(i);
  7878. Global.GetSymbolName(parameter,name);
  7879. Evaluate(p, value);
  7880. ASSERT(value.type # NIL);
  7881. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7882. par := instance.AddParameter(name);
  7883. par.SetInteger(value.integer);
  7884. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7885. par := instance.AddParameter(name);
  7886. par.SetBoolean(value.boolean);
  7887. ELSE Error(x.position,NotYetImplemented)
  7888. END;
  7889. parameter := parameter.nextParameter
  7890. END;
  7891. END;
  7892. *)
  7893. (* call initializer *)
  7894. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7895. IF constructor # NIL THEN
  7896. (*! should be unified with ProcedureCallDesignator *)
  7897. IF backend.cellsAreObjects THEN
  7898. Symbol(temporaryVariable,l);
  7899. ToMemory(l.op,addressType,0);
  7900. Emit(Push(position,l.op));
  7901. ReleaseOperand(l);
  7902. END;
  7903. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7904. FOR i := firstPar TO x.parameters.Length()-1 DO
  7905. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7906. formalParameter := formalParameter.nextParameter;
  7907. END;
  7908. (* static call of the constructor *)
  7909. Global.GetSymbolSegmentedName(constructor,name);
  7910. ASSERT(~constructor.isInline);
  7911. IF constructor.scope.ownerModule # module.module THEN
  7912. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7913. ELSE
  7914. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7915. END;
  7916. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7917. (*ELSE
  7918. ReleaseIntermediateOperand(pointer);*)
  7919. END;
  7920. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7921. ToMemory(l.op, addressType, 0);
  7922. Designate(p0,s0);
  7923. ToMemory(s0.op,addressType,0);
  7924. Emit(Mov(position,s0.op,l.op));
  7925. ReleaseOperand(l);
  7926. ReleaseOperand(s0);
  7927. result.tag := emptyOperand;
  7928. (* start *)
  7929. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7930. (* push cell *)
  7931. Symbol(temporaryVariable, l);
  7932. ToMemory(l.op,addressType,0);
  7933. Emit(Push(Basic.invalidPosition,l.op));
  7934. (* push delegate *)
  7935. Emit(Push(Basic.invalidPosition,l.op));
  7936. ReleaseOperand(l);
  7937. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7938. Emit(Push(position, s1.op));
  7939. ReleaseOperand(s1);
  7940. CallThis(position,"ActiveCellsRuntime","Start",3);
  7941. END;
  7942. (*IF temporaryVariable # NIL THEN
  7943. end := NewLabel();
  7944. BrL(end);
  7945. SetLabel(exit);
  7946. Designate(p0,l);
  7947. ToMemory(l.op,addressType,0);
  7948. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7949. ReleaseOperand(l);
  7950. SetLabel(end);
  7951. ELSE
  7952. SetLabel(exit);
  7953. END;
  7954. *)
  7955. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7956. ELSE (* no pointer to record, no pointer to array *)
  7957. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7958. (* ignore new statement *)
  7959. Warning(p0.position, "cannot run on final hardware");
  7960. ELSE
  7961. HALT(200);
  7962. END;
  7963. END;
  7964. (* ---- ADDRESSOF----- *)
  7965. |Global.systemAdr:
  7966. Designate(p0,s0);
  7967. s0.mode := ModeValue;
  7968. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7969. ReleaseIntermediateOperand(s0.op);
  7970. s0.op := s0.tag;
  7971. IntermediateCode.InitOperand(s0.tag);
  7972. END;
  7973. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7974. result := s0;
  7975. (* ---- BIT ----- *)
  7976. |Global.systemBit:
  7977. Evaluate(p0,s0);
  7978. ToMemory(s0.op,addressType,0);
  7979. ReuseCopy(res,s0.op);
  7980. ReleaseOperand(s0);
  7981. Evaluate(p1,s1);
  7982. Emit(Ror(position,res,res,s1.op));
  7983. ReleaseOperand(s1);
  7984. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7985. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7986. IF ~conditional THEN
  7987. InitOperand(result,ModeValue); result.op := res;
  7988. ELSE
  7989. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7990. BrL(falseLabel);
  7991. ReleaseIntermediateOperand(res);
  7992. END;
  7993. (* --- MSK ----*)
  7994. |Global.systemMsk:
  7995. Evaluate(p0,s0);
  7996. Evaluate(p1,s1);
  7997. ReuseCopy(res,s0.op);
  7998. ReleaseOperand(s0);
  7999. Emit(And(position,res,res,s1.op));
  8000. ReleaseOperand(s1);
  8001. InitOperand(result,ModeValue);
  8002. result.op := res;
  8003. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8004. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8005. Evaluate(p0,s0);
  8006. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8007. ReleaseOperand(s0);
  8008. InitOperand(result,ModeValue);
  8009. result.op := res;
  8010. (* ---- SYSTEM.GetStackPointer ----- *)
  8011. |Global.systemGetStackPointer:
  8012. InitOperand(result,ModeValue);
  8013. result.op := sp;
  8014. (* ---- SYSTEM.GetFramePointer ----- *)
  8015. |Global.systemGetFramePointer:
  8016. InitOperand(result,ModeValue);
  8017. result.op := fp;
  8018. (* ---- SYSTEM.GetActivity ----- *)
  8019. |Global.systemGetActivity:
  8020. ASSERT(backend.cooperative);
  8021. InitOperand(result,ModeValue);
  8022. result.op := ap;
  8023. (* ---- SYSTEM.SetStackPointer ----- *)
  8024. |Global.systemSetStackPointer:
  8025. Evaluate(p0,s0); (* *)
  8026. Emit(Mov(position,sp,s0.op));
  8027. ReleaseOperand(s0);
  8028. (* ---- SYSTEM.SetFramePointer ----- *)
  8029. |Global.systemSetFramePointer:
  8030. Evaluate(p0,s0); (* *)
  8031. Emit(Mov(position,fp,s0.op));
  8032. ReleaseOperand(s0);
  8033. (* ---- SYSTEM.Activity ----- *)
  8034. |Global.systemSetActivity:
  8035. ASSERT(backend.cooperative);
  8036. Evaluate(p0,s0); (* *)
  8037. Emit(Mov(position,ap,s0.op));
  8038. ReleaseOperand(s0);
  8039. (* ---- SYSTEM.VAL ----- *)
  8040. |Global.systemVal:
  8041. Expression(p1);
  8042. s1 := result;
  8043. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8044. IF s1.mode = ModeReference THEN
  8045. (* nothing to be done if not record type, just take over new type *)
  8046. IF (type IS SyntaxTree.RecordType) THEN
  8047. ReleaseIntermediateOperand(s1.tag);
  8048. s1.tag := TypeDescriptorAdr(type);
  8049. IF ~newObjectFile THEN
  8050. IntermediateCode.MakeMemory(s1.tag,addressType);
  8051. END;
  8052. UseIntermediateOperand(s1.tag);
  8053. END;
  8054. result := s1;
  8055. ELSE (* copy over result to different type, may not use convert *)
  8056. itype := IntermediateCode.GetType(system,type);
  8057. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8058. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8059. Emit(Mov(position,s0.op,s1.op));
  8060. ReleaseOperand(s1);
  8061. InitOperand(result,ModeValue);
  8062. result.op := s0.op;
  8063. ELSE (* different size, must convert *)
  8064. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8065. Convert(s1.op, IntermediateCode.GetType(system,type));
  8066. result := s1;
  8067. END;
  8068. END;
  8069. (* ---- SYSTEM.GET ----- *)
  8070. |Global.systemGet:
  8071. Evaluate(p0,s0); (* adr *)
  8072. Designate(p1,s1); (* variable *)
  8073. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8074. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8075. Emit(Mov(position,s1.op,s0.op));
  8076. ReleaseOperand(s1);
  8077. ReleaseOperand(s0);
  8078. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8079. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8080. Evaluate(p0,s0); (* *)
  8081. Evaluate(p1,s1); (* variable *)
  8082. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8083. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8084. (* real part *)
  8085. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8086. Emit(Mov(position,res, s1.op));
  8087. ReleaseIntermediateOperand(res);
  8088. (* imaginary part *)
  8089. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8090. Emit(Mov(position,res, s1.tag));
  8091. ReleaseIntermediateOperand(res);
  8092. ReleaseOperand(s1);
  8093. ReleaseOperand(s0);
  8094. ELSE
  8095. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8096. ReleaseOperand(s0);
  8097. Emit(Mov(position,res,s1.op));
  8098. ReleaseIntermediateOperand(res);
  8099. ReleaseOperand(s1);
  8100. END;
  8101. (* ---- SYSTEM.MOVE ----- *)
  8102. |Global.systemMove:
  8103. Evaluate(p0,s0);
  8104. Evaluate(p1,s1);
  8105. Evaluate(p2,s2);
  8106. Emit(Copy(position,s1.op,s0.op,s2.op));
  8107. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8108. (* ---- SYSTEM.NEW ----- *)
  8109. |Global.systemNew:
  8110. Designate(p0,s0);
  8111. Emit(Push(position,s0.op));
  8112. ReleaseOperand(s0);
  8113. Evaluate(p1,s1);
  8114. Emit(Push(position,s1.op));
  8115. ReleaseOperand(s1);
  8116. (* push realtime flag: false by default *)
  8117. Emit(Push(position,false));
  8118. CallThis(position,"Heaps","NewSys",3);
  8119. (* ---- SYSTEM.CALL ----- *)
  8120. |Global.systemRef:
  8121. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8122. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8123. s0.mode := ModeValue;
  8124. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8125. result := s0
  8126. (* ---- INCR ----- *)
  8127. |Global.Incr:
  8128. Designate(p0,operand);
  8129. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8130. Dereference(operand,p0.type.resolved,FALSE);
  8131. END;
  8132. ASSERT(p1 # NIL);
  8133. Evaluate(p1,l);
  8134. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8135. ReleaseOperand(operand); ReleaseOperand(l);
  8136. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8137. (* ---- SUM ----- *)
  8138. |Global.Sum: HALT(200);
  8139. (* ---- ALL ----- *)
  8140. |Global.All: HALT(200);
  8141. (* ---- CAS ----- *)
  8142. |Global.Cas:
  8143. needsTrace := p0.NeedsTrace();
  8144. IF needsTrace THEN ModifyAssignments(true) END;
  8145. Designate(p0,s0);
  8146. Evaluate(p1,s1);
  8147. Evaluate(p2,s2);
  8148. IF needsTrace THEN
  8149. Emit(Push(position, s0.op));
  8150. Emit(Push(position, s1.op));
  8151. Emit(Push(position, s2.op));
  8152. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8153. ELSE
  8154. Emit(Cas(position,s0.op,s1.op,s2.op));
  8155. END;
  8156. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8157. IF needsTrace THEN ModifyAssignments(false) END;
  8158. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8159. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  8160. IF conditional THEN
  8161. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8162. BrL(falseLabel);
  8163. ReleaseIntermediateOperand(res);
  8164. END;
  8165. (* ---- DIM ----- *)
  8166. |Global.Dim:
  8167. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8168. Designate(p0,s0);
  8169. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8170. Dereference(s0,p0.type.resolved,FALSE);
  8171. END;
  8172. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8173. ReleaseOperand(s0);
  8174. (* ---- RESHAPE ----- *)
  8175. |Global.Reshape:
  8176. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8177. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8178. left.SetType(procedure.type);
  8179. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8180. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8181. END;
  8182. (* ---- SYSTEM.TYPECODE ----- *)
  8183. |Global.systemTypeCode:
  8184. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8185. IF type.resolved IS SyntaxTree.PointerType THEN
  8186. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8187. END;
  8188. result.op := TypeDescriptorAdr(type);
  8189. IF ~newObjectFile THEN
  8190. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  8191. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  8192. END;
  8193. result.mode := ModeValue;
  8194. (* ---- SYSTEM.TRACE ----- *)
  8195. |Global.systemTrace:
  8196. SystemTrace(x.parameters, x.position);
  8197. (* ----- CONNECT ------*)
  8198. |Global.Connect:
  8199. IF backend.cellsAreObjects THEN
  8200. PushPort(p0);
  8201. PushPort(p1);
  8202. IF p2 # NIL THEN
  8203. Evaluate(p2, s2);
  8204. Emit(Push(p2.position, s2.op));
  8205. ReleaseOperand(s2);
  8206. ELSE
  8207. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8208. END;
  8209. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8210. ELSE
  8211. Warning(x.position, "cannot run on final hardware");
  8212. END;
  8213. (* ----- DELEGATE ------*)
  8214. |Global.Delegate:
  8215. IF backend.cellsAreObjects THEN
  8216. PushPort(p0);
  8217. PushPort(p1);
  8218. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8219. ELSE
  8220. Warning(x.position, "cannot run on final hardware");
  8221. END;
  8222. (* ----- SEND ------*)
  8223. |Global.Send:
  8224. Evaluate(p0,s0);
  8225. Evaluate(p1,s1);
  8226. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8227. Emit(Push(position,s0.op));
  8228. Emit(Push(position,s1.op));
  8229. (*
  8230. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8231. *)
  8232. IF ~backend.cellsAreObjects THEN
  8233. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8234. END;
  8235. ReleaseOperand(s0);
  8236. ReleaseOperand(s1);
  8237. IF backend.cellsAreObjects THEN
  8238. CallThis(position,"ActiveCellsRuntime","Send",2);
  8239. ELSE
  8240. CallThis(position,ChannelModuleName,"Send",2);
  8241. END;
  8242. (* ----- RECEIVE ------*)
  8243. |Global.Receive:
  8244. Evaluate(p0,s0);
  8245. Emit(Push(position,s0.op));
  8246. Designate(p1,s1);
  8247. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8248. Emit(Push(position,s1.op));
  8249. IF p2 # NIL THEN
  8250. Designate(p2,s2);
  8251. Emit(Push(position,s2.op));
  8252. END;
  8253. (*
  8254. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8255. *)
  8256. IF ~backend.cellsAreObjects THEN
  8257. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8258. END;
  8259. ReleaseOperand(s0);
  8260. ReleaseOperand(s1);
  8261. ReleaseOperand(s2);
  8262. IF backend.cellsAreObjects THEN
  8263. IF p2 = NIL THEN
  8264. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8265. ELSE
  8266. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8267. END;
  8268. ELSE
  8269. IF p2 = NIL THEN
  8270. CallThis(position,ChannelModuleName,"Receive",2)
  8271. ELSE
  8272. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8273. END;
  8274. END;
  8275. | Global.systemSpecial:
  8276. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8277. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8278. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8279. (* determine if parameters are of the VAR kind *)
  8280. ASSERT(x.parameters.Length() <= 3);
  8281. formalParameter := procedureType.firstParameter;
  8282. FOR i := 0 TO x.parameters.Length() - 1 DO
  8283. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8284. formalParameter := formalParameter.nextParameter
  8285. END;
  8286. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8287. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8288. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8289. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8290. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8291. IF procedureType.returnType # NIL THEN
  8292. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8293. Emit(Result(position, res));
  8294. (*InitOperand(result,ModeValue);
  8295. result.op := res;
  8296. *)
  8297. IF ~conditional THEN
  8298. InitOperand(result,ModeValue); result.op := res;
  8299. ELSE
  8300. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8301. BrL(falseLabel);
  8302. ReleaseIntermediateOperand(res);
  8303. END;
  8304. END
  8305. ELSE (* function not yet implemented *)
  8306. Error(position,"not yet implemented");
  8307. END;
  8308. destination := dest;
  8309. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8310. END VisitBuiltinCallDesignator;
  8311. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  8312. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8313. BEGIN
  8314. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8315. dest := destination; destination := emptyOperand;
  8316. Expression(x.left);
  8317. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8318. ELSIF isUnchecked THEN (* no check *)
  8319. ELSE
  8320. trueL := NewLabel();
  8321. falseL := NewLabel();
  8322. IF IsPointerToRecord(x.left.type,recordType) THEN
  8323. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8324. Emit(Mov(position,tag, result.op));
  8325. IF result.mode # ModeValue THEN
  8326. ptr := tag;
  8327. IntermediateCode.MakeMemory(ptr,addressType);
  8328. Emit(Mov(position,tag, ptr));
  8329. END;
  8330. IF ~backend.cooperative THEN
  8331. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8332. END;
  8333. IntermediateCode.MakeMemory(tag,addressType);
  8334. ELSE
  8335. tag := result.tag;
  8336. UseIntermediateOperand(tag);
  8337. END;
  8338. TypeTest(tag,x.type,trueL,falseL);
  8339. ReleaseIntermediateOperand(tag);
  8340. SetLabel(falseL);
  8341. EmitTrap(position,TypeCheckTrap);
  8342. SetLabel(trueL);
  8343. END;
  8344. destination := dest;
  8345. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8346. END VisitTypeGuardDesignator;
  8347. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8348. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8349. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8350. VAR label: Label; pc: LONGINT;
  8351. BEGIN
  8352. IF backend.cooperative & ~isUnchecked THEN
  8353. pc := section.pc;
  8354. label := NewLabel();
  8355. BrneL(label, operand.op, nil);
  8356. EmitTrap(position, NilPointerTrap);
  8357. SetLabel(label);
  8358. INC(statCoopNilCheck, section.pc - pc);
  8359. END;
  8360. END NilCheck;
  8361. BEGIN
  8362. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8363. ReuseCopy(dereferenced,operand.op);
  8364. ReleaseOperand(operand);
  8365. operand.mode := ModeReference;
  8366. operand.op := dereferenced;
  8367. operand.tag := dereferenced;
  8368. UseIntermediateOperand(operand.tag);
  8369. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8370. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8371. ReleaseIntermediateOperand(operand.tag);
  8372. operand.tag := TypeDescriptorAdr(type);
  8373. IF ~newObjectFile THEN
  8374. IntermediateCode.MakeMemory(operand.tag,addressType);
  8375. END;
  8376. ELSE
  8377. IF ~backend.cooperative THEN
  8378. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8379. END;
  8380. IntermediateCode.MakeMemory(operand.tag,addressType);
  8381. END;
  8382. NilCheck(operand.op);
  8383. ELSIF type IS SyntaxTree.ArrayType THEN
  8384. IF isUnsafe THEN
  8385. NilCheck(operand.op);
  8386. ReleaseIntermediateOperand(operand.tag);
  8387. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8388. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8389. ELSE
  8390. operand.tag := emptyOperand;
  8391. END;
  8392. ELSE
  8393. NilCheck(operand.op);
  8394. IF backend.cooperative THEN
  8395. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8396. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8397. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8398. ELSE
  8399. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8400. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8401. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8402. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8403. END;
  8404. END;
  8405. ELSIF type IS SyntaxTree.MathArrayType THEN
  8406. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8407. IntermediateCode.MakeMemory(operand.op,addressType);
  8408. ELSE HALT(100);
  8409. END;
  8410. END Dereference;
  8411. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  8412. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8413. BEGIN
  8414. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8415. dest := destination; destination := emptyOperand;
  8416. Evaluate(x.left,d);
  8417. type := x.type.resolved;
  8418. prevIsUnchecked := isUnchecked;
  8419. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8420. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8421. END;
  8422. Dereference(d,type,IsUnsafePointer(x.left.type));
  8423. isUnchecked := prevIsUnchecked;
  8424. result := d;
  8425. 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
  8426. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8427. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8428. END;
  8429. END;
  8430. destination := dest;
  8431. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8432. END VisitDereferenceDesignator;
  8433. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  8434. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8435. BEGIN
  8436. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8437. dest := destination; destination := emptyOperand;
  8438. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8439. tag := result.op;
  8440. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8441. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8442. StaticCallOperand(result,procedure.super);
  8443. ReleaseIntermediateOperand(result.tag);
  8444. UseIntermediateOperand(tag); (* necessary ? *)
  8445. result.tag := tag;
  8446. destination := dest;
  8447. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8448. END VisitSupercallDesignator;
  8449. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  8450. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8451. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8452. name: Basic.SegmentedName;
  8453. procedure: SyntaxTree.Procedure;
  8454. procedureType: SyntaxTree.ProcedureType;
  8455. BEGIN
  8456. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8457. dest := destination; destination := emptyOperand;
  8458. scope := currentScope;
  8459. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8460. scope := scope.outerScope;
  8461. END;
  8462. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8463. IF newObjectFile THEN
  8464. moduleSection := meta.ModuleSection();
  8465. IF backend.cooperative THEN
  8466. moduleOffset := 0;
  8467. ELSE
  8468. moduleOffset := moduleSection.pc;
  8469. END;
  8470. result.mode := ModeValue;
  8471. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8472. ELSE
  8473. Symbol(moduleSelf,result);
  8474. IntermediateCode.MakeMemory(result.op,addressType);
  8475. END
  8476. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8477. result.mode := ModeValue;
  8478. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8479. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8480. ELSE
  8481. GetBaseRegister(basereg,currentScope,scope);
  8482. InitOperand(result,ModeReference);
  8483. result.op := basereg;
  8484. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8485. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8486. parametersSize := ProcedureParametersSize(system,procedure);
  8487. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8488. IF backend.cooperative THEN
  8489. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8490. END;
  8491. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8492. MakeMemory(result.op, result.op, addressType, 0);
  8493. END;
  8494. (* tag must be loaded when dereferencing SELF pointer *)
  8495. END;
  8496. destination := dest;
  8497. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8498. END VisitSelfDesignator;
  8499. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  8500. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8501. BEGIN
  8502. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8503. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8504. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8505. parameter := procedureType.returnParameter;
  8506. IF currentIsInline THEN
  8507. map := currentMapper.Get(NIL);
  8508. IF map # NIL THEN
  8509. Designate(map.to, result);
  8510. ELSE
  8511. HALT(200);
  8512. END;
  8513. RETURN;
  8514. END;
  8515. VisitParameter(parameter);
  8516. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8517. END VisitResultDesignator;
  8518. (** values *)
  8519. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  8520. BEGIN
  8521. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8522. IF conditional THEN
  8523. IF x.value THEN BrL(trueLabel)
  8524. ELSE BrL(falseLabel)
  8525. END;
  8526. ELSE
  8527. InitOperand(result,ModeValue);
  8528. IF x.value THEN result.op := true ELSE result.op := false END;
  8529. END;
  8530. END VisitBooleanValue;
  8531. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8532. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8533. BEGIN
  8534. Global.GetModuleSegmentedName(module.module, name);
  8535. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8536. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8537. RETURN section
  8538. END GetDataSection;
  8539. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8540. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8541. BEGIN
  8542. type := vop.type;
  8543. data := GetDataSection();
  8544. pc := EnterImmediate(data,vop);
  8545. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8546. IntermediateCode.MakeMemory(vop, type);
  8547. END GetImmediateMem;
  8548. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  8549. BEGIN
  8550. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8551. InitOperand(result,ModeValue);
  8552. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8553. IF ~supportedImmediate(result.op) &~inData THEN
  8554. GetImmediateMem(result.op)
  8555. END;
  8556. END VisitIntegerValue;
  8557. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  8558. BEGIN
  8559. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8560. InitOperand(result,ModeValue);
  8561. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8562. END VisitCharacterValue;
  8563. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  8564. BEGIN
  8565. IF Trace THEN TraceEnter("VisitSetValue") END;
  8566. InitOperand(result,ModeValue);
  8567. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8568. END VisitSetValue;
  8569. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  8570. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8571. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8572. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8573. BEGIN
  8574. numberElements := x.elements.Length();
  8575. FOR i := 0 TO numberElements-1 DO
  8576. expression := x.elements.GetExpression(i);
  8577. IF expression IS SyntaxTree.MathArrayExpression THEN
  8578. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8579. ELSE
  8580. inData := TRUE;
  8581. Evaluate(expression,op);
  8582. irv.Emit(Data(position,op.op));
  8583. inData := FALSE;
  8584. ReleaseOperand(op);
  8585. END;
  8586. END;
  8587. END RecursiveData;
  8588. BEGIN
  8589. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8590. IF ~TryConstantDeclaration() THEN
  8591. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8592. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8593. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8594. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8595. ELSE
  8596. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8597. END;
  8598. RecursiveData(x.array);
  8599. InitOperand(result,ModeReference);
  8600. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8601. END
  8602. END VisitMathArrayValue;
  8603. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8604. VAR constant: Sections.Section;
  8605. BEGIN
  8606. IF constantDeclaration = NIL THEN
  8607. RETURN FALSE
  8608. ELSE
  8609. (* Is a constant in this module: did we generate it already? *)
  8610. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8611. IF constant # NIL THEN
  8612. InitOperand(result,ModeReference);
  8613. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8614. RETURN TRUE;
  8615. END;
  8616. END;
  8617. RETURN FALSE
  8618. END TryConstantDeclaration;
  8619. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  8620. BEGIN
  8621. constantDeclaration := x;
  8622. x.value.resolved.Accept(SELF);
  8623. END VisitConstant;
  8624. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  8625. BEGIN
  8626. IF Trace THEN TraceEnter("VisitRealValue") END;
  8627. InitOperand(result,ModeValue);
  8628. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8629. END VisitRealValue;
  8630. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  8631. VAR
  8632. componentType: SyntaxTree.Type;
  8633. BEGIN
  8634. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8635. ASSERT(x.type IS SyntaxTree.ComplexType);
  8636. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8637. InitOperand(result,ModeValue);
  8638. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8639. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8640. END VisitComplexValue;
  8641. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  8642. VAR i: LONGINT; name: Basic.SegmentedName;
  8643. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8644. BEGIN
  8645. IF Trace THEN TraceEnter("VisitStringValue") END;
  8646. IF ~TryConstantDeclaration() THEN
  8647. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8648. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8649. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8650. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8651. ELSE
  8652. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8653. END;
  8654. FOR i := 0 TO x.length-1 DO
  8655. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8656. irv.Emit(Data(position,op));
  8657. END;
  8658. InitOperand(result,ModeReference);
  8659. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8660. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8661. END
  8662. END VisitStringValue;
  8663. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8664. BEGIN
  8665. IF Trace THEN TraceEnter("VisitNilValue") END;
  8666. InitOperand(result,ModeValue);
  8667. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8668. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8669. END VisitNilValue;
  8670. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8671. BEGIN
  8672. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8673. InitOperand(result,ModeValue);
  8674. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8675. END VisitEnumerationValue;
  8676. (** symbols *)
  8677. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8678. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8679. END VisitImport;
  8680. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8681. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8682. BEGIN
  8683. IF scope # baseScope THEN
  8684. (* left := [fp+8] *)
  8685. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8686. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8687. ReuseCopy(left,right);
  8688. ReleaseIntermediateOperand(right);
  8689. scope := scope.outerScope; DEC(level);
  8690. (* { left := [left+8] } *)
  8691. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8692. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8693. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8694. Emit(Mov(position,left,right));
  8695. scope := scope.outerScope; DEC(level);
  8696. END;
  8697. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8698. result := left;
  8699. ELSE
  8700. result := fp;
  8701. END;
  8702. END GetBaseRegister;
  8703. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8704. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8705. BEGIN
  8706. IF Trace THEN TraceEnter("VisitVariable"); END;
  8707. type := x.type.resolved;
  8708. IF (x.useRegister) THEN
  8709. InitOperand(result, ModeValue);
  8710. IF x.registerNumber < 0 THEN
  8711. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8712. reg := x.registerNumber;
  8713. ELSE
  8714. reg := registerUsageCount.Map(x.registerNumber);
  8715. UseRegister(reg);
  8716. END;
  8717. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8718. ELSIF x.externalName # NIL THEN
  8719. InitOperand(result,ModeReference);
  8720. Basic.ToSegmentedName(x.externalName^, name);
  8721. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8722. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8723. InitOperand(result,ModeReference);
  8724. GetBaseRegister(result.op,currentScope,x.scope);
  8725. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8726. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8727. InitOperand(result,ModeReference);
  8728. GetCodeSectionNameForSymbol(x,name);
  8729. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8730. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8731. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8732. InitOperand(result,ModeReference);
  8733. GetCodeSectionNameForSymbol(x,name);
  8734. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8735. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8736. ELSE (* field, left designator must have been emitted *)
  8737. ASSERT(result.mode = ModeReference);
  8738. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8739. ReuseCopy(temp,result.op);
  8740. ReleaseIntermediateOperand(result.op);
  8741. result.op := temp;
  8742. END;
  8743. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8744. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8745. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8746. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8747. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8748. END;
  8749. END;
  8750. END;
  8751. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8752. ValueToCondition(result);
  8753. ELSIF type IS SyntaxTree.ProcedureType THEN
  8754. ReleaseIntermediateOperand(result.tag);
  8755. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8756. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8757. UseIntermediateOperand(result.tag);
  8758. ELSE
  8759. result.tag := nil; (* nil *)
  8760. END;
  8761. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8762. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8763. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8764. ReleaseIntermediateOperand(result.tag);
  8765. Global.GetSymbolSegmentedName(x,name);
  8766. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8767. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8768. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8769. ELSE
  8770. END;
  8771. ELSE
  8772. ReleaseIntermediateOperand(result.tag);
  8773. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8774. END;
  8775. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8776. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8777. ReleaseIntermediateOperand(result.tag);
  8778. result.tag := result.op;
  8779. UseIntermediateOperand(result.tag);
  8780. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8781. IntermediateCode.MakeMemory(result.op,addressType);
  8782. END;
  8783. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8784. ReleaseIntermediateOperand(result.tag);
  8785. result.tag := TypeDescriptorAdr(type);
  8786. IF ~newObjectFile THEN
  8787. IntermediateCode.MakeMemory(result.tag,addressType);
  8788. END;
  8789. UseIntermediateOperand(result.tag);
  8790. (* tag for pointer type computed not here but during dereferencing *)
  8791. END;
  8792. IF Trace THEN TraceExit("VisitVariable") END;
  8793. END VisitVariable;
  8794. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8795. BEGIN
  8796. VisitVariable(property);
  8797. END VisitProperty;
  8798. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8799. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8800. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT; temp: IntermediateCode.Operand;
  8801. BEGIN
  8802. type := x.type.resolved;
  8803. IF Trace THEN TraceEnter("VisitParameter") END;
  8804. IF x.ownerType IS SyntaxTree.CellType THEN
  8805. ptype := x.type.resolved;
  8806. IF backend.cellsAreObjects THEN
  8807. ASSERT(result.mode = ModeReference);
  8808. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8809. ReuseCopy(temp,result.op);
  8810. ReleaseIntermediateOperand(result.op);
  8811. result.op := temp;
  8812. END;
  8813. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8814. RETURN;
  8815. ELSE
  8816. InitOperand(result,ModeReference);
  8817. GetCodeSectionNameForSymbol(x,name);
  8818. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8819. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8820. RETURN;
  8821. END;
  8822. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8823. InitOperand(result,ModeReference);
  8824. GetCodeSectionNameForSymbol(x,name);
  8825. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8826. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8827. RETURN
  8828. ELSE
  8829. GetBaseRegister(basereg,currentScope,x.scope);
  8830. InitOperand(result,ModeReference);
  8831. result.op := basereg;
  8832. END;
  8833. IF IsOpenArray(type) THEN
  8834. result.tag := basereg;
  8835. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8836. IntermediateCode.MakeMemory(result.op,addressType);
  8837. IF Global.IsOberonProcedure(x.ownerType) THEN
  8838. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8839. UseIntermediateOperand(result.tag);
  8840. ELSE
  8841. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8842. END;
  8843. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8844. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8845. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8846. ELSIF IsStaticArray(type) THEN
  8847. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8848. IntermediateCode.MakeMemory(result.op,addressType);
  8849. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8850. ELSIF type IS SyntaxTree.MathArrayType THEN
  8851. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8852. WITH type: SyntaxTree.MathArrayType DO
  8853. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8854. IF type.form = SyntaxTree.Tensor THEN
  8855. ELSIF type.form = SyntaxTree.Open THEN
  8856. result.tag := result.op;
  8857. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8858. IntermediateCode.MakeMemory(result.op,addressType);
  8859. UseIntermediateOperand(result.tag);
  8860. ELSIF type.form = SyntaxTree.Static THEN
  8861. IF x.kind = SyntaxTree.ConstParameter THEN
  8862. IntermediateCode.MakeMemory(result.op,addressType);
  8863. END;
  8864. ELSE HALT(100)
  8865. END;
  8866. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8867. IF type.form = SyntaxTree.Tensor THEN
  8868. ToMemory(result.op,addressType,0);
  8869. ELSIF type.form = SyntaxTree.Open THEN
  8870. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8871. ReuseCopy(result.tag, mem);
  8872. ReleaseIntermediateOperand(mem);
  8873. ReleaseIntermediateOperand(result.op);
  8874. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8875. ELSIF type.form = SyntaxTree.Static THEN
  8876. IntermediateCode.MakeMemory(result.op,addressType);
  8877. ELSE HALT(100)
  8878. END;
  8879. ELSE HALT(100)
  8880. END;
  8881. END;
  8882. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8883. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8884. IntermediateCode.MakeMemory(result.op,addressType);
  8885. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8886. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8887. END;
  8888. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8889. ValueToCondition(result);
  8890. ELSIF type IS SyntaxTree.ProcedureType THEN
  8891. ReleaseIntermediateOperand(result.tag);
  8892. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8893. IF x.kind = SyntaxTree.VarParameter THEN
  8894. ReuseCopy(result.tag,result.op);
  8895. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8896. IntermediateCode.MakeMemory(result.tag,addressType);
  8897. ELSE
  8898. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8899. UseIntermediateOperand(result.tag);
  8900. END;
  8901. ELSE
  8902. result.tag := nil;
  8903. END;
  8904. (* tag for pointer type computed not here but during dereferencing *)
  8905. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  8906. ReleaseIntermediateOperand(result.tag);
  8907. result.tag := basereg;
  8908. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8909. IntermediateCode.MakeMemory(result.tag,addressType);
  8910. UseIntermediateOperand(result.tag);
  8911. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  8912. ReleaseIntermediateOperand(result.tag);
  8913. result.tag := TypeDescriptorAdr(type);
  8914. IF ~newObjectFile THEN
  8915. IntermediateCode.MakeMemory(result.tag,addressType);
  8916. END;
  8917. UseIntermediateOperand(result.tag);
  8918. END;
  8919. IF Trace THEN TraceExit("VisitParameter") END;
  8920. END VisitParameter;
  8921. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8922. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8923. BEGIN
  8924. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8925. (* left.p: left already emitted *)
  8926. tag := result.op; (* value of pointer to left *)
  8927. (* get type desc *)
  8928. tmp := result.tag;
  8929. IntermediateCode.MakeMemory(tmp,addressType);
  8930. (* get method adr *)
  8931. Reuse1(reg,tmp);
  8932. ReleaseIntermediateOperand(tmp);
  8933. IF backend.cooperative THEN
  8934. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8935. WHILE recordType.baseType # NIL DO
  8936. recordType := recordType.GetBaseRecord ();
  8937. END;
  8938. GetRecordTypeName (recordType,name);
  8939. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8940. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8941. offset := 0;
  8942. ELSE
  8943. offset := 2;
  8944. END;
  8945. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8946. ELSE
  8947. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8948. END;
  8949. InitOperand(operand,ModeReference);
  8950. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8951. operand.op := reg;
  8952. operand.tag := tag;
  8953. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8954. END DynamicCallOperand;
  8955. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8956. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8957. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8958. BEGIN
  8959. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8960. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8961. tag := operand.op;
  8962. ReleaseIntermediateOperand(operand.tag);
  8963. ELSE tag := nil
  8964. END;
  8965. IF x.isInline THEN
  8966. sectionType := Sections.InlineCodeSection;
  8967. ELSE
  8968. sectionType := Sections.CodeSection;
  8969. END;
  8970. IF x.externalName # NIL THEN
  8971. Basic.ToSegmentedName(x.externalName^, name);
  8972. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8973. ELSE
  8974. GetCodeSectionNameForSymbol(x, name);
  8975. IF (x.scope.ownerModule = module.module) THEN
  8976. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8977. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8978. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8979. IF source.pc = 0 THEN (* no code yet *)
  8980. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8981. END;
  8982. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8983. bits := x.procedureScope.body.code.inlineCode;
  8984. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8985. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8986. binary.CopyBits(bits, 0, bits.GetSize());
  8987. source.SetResolved(binary);
  8988. ELSE
  8989. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8990. END;
  8991. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8992. END;
  8993. InitOperand(operand,ModeValue);
  8994. operand.op := reg;
  8995. operand.tag := tag;
  8996. IF Trace THEN TraceExit("StaticCallOperand") END;
  8997. END StaticCallOperand;
  8998. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8999. (* handle expressions of the form designator.procedure or procedure *)
  9000. BEGIN
  9001. IF Trace THEN TraceEnter("VisitProcedure") END;
  9002. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  9003. DynamicCallOperand(result,x);
  9004. ELSIF x.isInline THEN
  9005. StaticCallOperand(result,x);
  9006. ELSE
  9007. StaticCallOperand(result,x);
  9008. END;
  9009. IF Trace THEN TraceExit("VisitProcedure") END;
  9010. END VisitProcedure;
  9011. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  9012. BEGIN
  9013. VisitProcedure(x);
  9014. END VisitOperator;
  9015. (** statements *)
  9016. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  9017. BEGIN
  9018. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  9019. Expression(x.call);
  9020. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  9021. ReleaseOperand(result)
  9022. END;
  9023. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  9024. END VisitProcedureCallStatement;
  9025. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  9026. VAR leftType, rightType: SyntaxTree.MathArrayType;
  9027. leftBase, rightBase: SyntaxTree.Type;
  9028. procedureName,s: SyntaxTree.IdentifierString;
  9029. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  9030. size: LONGINT; rightKind: LONGINT;
  9031. dummy: IntermediateCode.Operand;
  9032. CONST moduleName = "FoxArrayBase";
  9033. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  9034. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  9035. BEGIN
  9036. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  9037. IF base IS SyntaxTree.MathArrayType THEN
  9038. base := OpenArray(base(SyntaxTree.MathArrayType));
  9039. END;
  9040. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  9041. result.SetArrayBase(base);
  9042. RETURN result
  9043. END OpenArray;
  9044. BEGIN
  9045. IF AddImport(moduleName,arrayBase,TRUE) THEN
  9046. SaveRegisters();ReleaseUsedRegisters(saved);
  9047. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  9048. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  9049. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  9050. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  9051. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  9052. IF leftType.form = SyntaxTree.Tensor THEN
  9053. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  9054. ELSIF leftType.form = SyntaxTree.Open THEN
  9055. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  9056. ELSIF leftType.form = SyntaxTree.Static THEN
  9057. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  9058. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  9059. END;
  9060. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  9061. IF procedure = NIL THEN
  9062. s := "Instruction not supported on target, emulation procedure ";
  9063. Strings.Append(s,moduleName);
  9064. Strings.Append(s,".");
  9065. Strings.Append(s,procedureName);
  9066. Strings.Append(s," not present");
  9067. Error(position,s);
  9068. ELSE
  9069. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  9070. parameter.SetType(leftType);
  9071. parameter.SetAccess(SyntaxTree.Internal);
  9072. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9073. parameter.SetKind(rightKind);
  9074. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9075. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  9076. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  9077. StaticCallOperand(result,procedure);
  9078. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  9079. ReleaseOperand(result);
  9080. END;
  9081. RestoreRegisters(saved);
  9082. END;
  9083. END AssignMathArray;
  9084. VAR modifyAssignmentCounter := 0: LONGINT;
  9085. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  9086. VAR processor,mem,dst: IntermediateCode.Operand;
  9087. BEGIN
  9088. IF value.intValue = true.intValue THEN
  9089. INC(modifyAssignmentCounter);
  9090. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  9091. modifyAssignmentsPC := section.pc;
  9092. ELSE
  9093. DEC(modifyAssignmentCounter);
  9094. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  9095. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  9096. END;
  9097. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  9098. dst := NewRegisterOperand (addressType);
  9099. Emit(Mov(position,dst, processor));
  9100. IntermediateCode.InitMemory(mem,bool, dst, 0);
  9101. Emit(Mov(position,mem, value));
  9102. ReleaseIntermediateOperand(dst);
  9103. END ModifyAssignments;
  9104. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9105. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9106. BEGIN
  9107. type := left.type.resolved;
  9108. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9109. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9110. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9111. IF procedureType.returnParameter = parameter THEN
  9112. (* this is the only case where the destination can be dynamically smaller than the source
  9113. in all other cases the dynamic size has to be taken
  9114. *)
  9115. IF backend.cooperative THEN
  9116. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  9117. ELSE
  9118. MakeMemory(mem, tag, addressType, 0);
  9119. END;
  9120. RETURN mem;
  9121. END;
  9122. END;
  9123. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9124. END CopySize;
  9125. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9126. VAR
  9127. leftO, rightO: Operand;
  9128. arg,mem, sizeOp: IntermediateCode.Operand;
  9129. leftType, rightType, componentType, base: SyntaxTree.Type;
  9130. size: LONGINT;
  9131. parameters: SyntaxTree.ExpressionList;
  9132. procedure: SyntaxTree.Procedure;
  9133. call: SyntaxTree.ProcedureCallDesignator;
  9134. designator: SyntaxTree.Designator;
  9135. saved: RegisterEntry;
  9136. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9137. VAR procedureType: SyntaxTree.ProcedureType;
  9138. BEGIN
  9139. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9140. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9141. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9142. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9143. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9144. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9145. IF right.id = Global.Reshape THEN RETURN TRUE
  9146. END;
  9147. END;
  9148. END;
  9149. END;
  9150. RETURN FALSE
  9151. END CanPassAsResultParameter;
  9152. BEGIN
  9153. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9154. leftType := left.type.resolved; rightType:= right.type.resolved;
  9155. IF backend.cooperative & left.NeedsTrace() THEN
  9156. ModifyAssignments(true);
  9157. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9158. Designate(right, rightO);
  9159. Designate(left, leftO);
  9160. ASSERT(leftO.mode = ModeReference);
  9161. TransferToRegister(leftO.op, leftO.op);
  9162. TransferToRegister(rightO.op, rightO.op);
  9163. Emit(Push(position, leftO.op));
  9164. Emit(Push(position, rightO.op));
  9165. CallAssignMethod(leftO.op, rightO.op, left.type);
  9166. Emit(Pop(position, rightO.op));
  9167. Emit(Pop(position, leftO.op));
  9168. sizeOp := CopySize(left, leftO.tag);
  9169. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9170. ReleaseIntermediateOperand(sizeOp);
  9171. ReleaseOperand(leftO);
  9172. ReleaseOperand(rightO);
  9173. ELSE
  9174. Evaluate(right,rightO);
  9175. Designate(left,leftO);
  9176. ASSERT(leftO.mode = ModeReference);
  9177. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9178. (* copy procedure address first *)
  9179. MakeMemory(mem,leftO.op,addressType,0);
  9180. Emit(Mov(position,mem,rightO.op));
  9181. ReleaseIntermediateOperand(mem);
  9182. (* copy pointer address *)
  9183. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9184. CallAssignPointer(leftO.tag, rightO.tag);
  9185. ELSE
  9186. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9187. CallAssignPointer(leftO.op, rightO.op);
  9188. END;
  9189. ReleaseOperand(leftO);
  9190. ReleaseOperand(rightO);
  9191. END;
  9192. ModifyAssignments(false);
  9193. RETURN;
  9194. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  9195. SaveRegisters();ReleaseUsedRegisters(saved);
  9196. IF SemanticChecker.IsPointerType(leftType) THEN
  9197. Evaluate(right,rightO);
  9198. Designate(left,leftO);
  9199. Emit(Push(position,leftO.op));
  9200. ReleaseOperand(leftO);
  9201. Emit(Push(position,rightO.op));
  9202. ReleaseOperand(rightO);
  9203. CallThis(position,"Heaps","Assign",2);
  9204. ELSIF leftType.IsRecordType() THEN
  9205. Designate(right,rightO);
  9206. Designate(left,leftO);
  9207. Emit(Push(position,leftO.op));
  9208. Emit(Push(position,leftO.tag)); (* type desc *)
  9209. ReleaseOperand(leftO);
  9210. Emit(Push(position,rightO.op));
  9211. ReleaseOperand(rightO);
  9212. CallThis(position,"Heaps","AssignRecord",3);
  9213. ELSIF IsStaticArray(leftType) THEN
  9214. size := StaticArrayNumElements(leftType);
  9215. base := StaticArrayBaseType(leftType);
  9216. Designate(right,rightO);
  9217. Designate(left,leftO);
  9218. Emit(Push(position,leftO.op));
  9219. ReleaseOperand(leftO);
  9220. arg := TypeDescriptorAdr(base);
  9221. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9222. Emit(Push(position,arg));
  9223. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9224. Emit(Push(position,rightO.op));
  9225. ReleaseOperand(rightO);
  9226. CallThis(position,"Heaps","AssignArray",4);
  9227. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  9228. size := StaticMathArrayNumElements(leftType);
  9229. base := StaticMathArrayBaseType(leftType);
  9230. Designate(right,rightO);
  9231. Designate(left,leftO);
  9232. Emit(Push(position,leftO.op));
  9233. ReleaseOperand(leftO);
  9234. arg := TypeDescriptorAdr(base);
  9235. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9236. Emit(Push(position,arg));
  9237. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9238. Emit(Push(position,rightO.op));
  9239. ReleaseOperand(rightO);
  9240. CallThis(position,"Heaps","AssignArray",4);
  9241. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9242. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9243. Evaluate(right,rightO);
  9244. Designate(left,leftO);
  9245. MakeMemory(mem,leftO.op,addressType,0);
  9246. Emit(Mov(position,mem,rightO.op));
  9247. ReleaseIntermediateOperand(mem);
  9248. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9249. Emit (Push(position, leftO.tag));
  9250. ReleaseOperand(leftO);
  9251. Emit (Push(position, rightO.tag));
  9252. ReleaseOperand(rightO);
  9253. CallThis(position,"Heaps","Assign", 2);
  9254. ELSE HALT(100); (* missing ? *)
  9255. END;
  9256. RestoreRegisters(saved);
  9257. RETURN;
  9258. END;
  9259. IF CanPassAsResultParameter(right) THEN
  9260. procedureResultDesignator := left(SyntaxTree.Designator);
  9261. Expression(right);
  9262. procedureResultDesignator := NIL;
  9263. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9264. (* left <-- ALIAS OF right: zerocopy *)
  9265. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9266. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9267. designator.SetType(procedure.type);
  9268. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9269. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9270. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9271. END;
  9272. ELSIF leftType IS SyntaxTree.RangeType THEN
  9273. (* LHS is of array range type *)
  9274. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9275. Evaluate(right, rightO);
  9276. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9277. (* first *)
  9278. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  9279. Emit(Mov(position,mem, rightO.op));
  9280. ReleaseIntermediateOperand(mem);
  9281. (* last *)
  9282. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9283. Emit(Mov(position,mem, rightO.tag));
  9284. ReleaseIntermediateOperand(mem);
  9285. (* step *)
  9286. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9287. Emit(Mov(position,mem, rightO.extra));
  9288. ReleaseIntermediateOperand(mem);
  9289. ReleaseOperand(rightO);
  9290. ReleaseOperand(leftO)
  9291. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9292. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9293. Evaluate(right, rightO);
  9294. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9295. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9296. (* real part *)
  9297. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9298. Emit(Mov(position,mem, rightO.op));
  9299. ReleaseIntermediateOperand(mem);
  9300. (* imaginary part *)
  9301. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9302. Emit(Mov(position,mem, rightO.tag));
  9303. ReleaseIntermediateOperand(mem);
  9304. ReleaseOperand(rightO);
  9305. ReleaseOperand(leftO)
  9306. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9307. OR (leftType IS SyntaxTree.PortType) THEN
  9308. (* rightO := leftO;*)
  9309. Evaluate(right,rightO);
  9310. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9311. Designate(left,leftO);
  9312. IF leftO.mode = ModeReference THEN
  9313. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9314. destination := mem;
  9315. ELSE
  9316. destination := leftO.op;
  9317. END;
  9318. ReleaseOperand(leftO);
  9319. IF destination.mode # IntermediateCode.Undefined THEN
  9320. Emit(Mov(position,destination,rightO.op));
  9321. END;
  9322. ReleaseOperand(rightO);
  9323. ReleaseIntermediateOperand(mem);
  9324. IntermediateCode.InitOperand(destination);
  9325. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9326. Evaluate(right,rightO);
  9327. Designate(left,leftO);
  9328. MakeMemory(mem,leftO.op,addressType,0);
  9329. Emit(Mov(position,mem,rightO.op));
  9330. ReleaseIntermediateOperand(mem);
  9331. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9332. (* delegate *)
  9333. (*
  9334. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9335. *)
  9336. Emit(Mov(position,leftO.tag,rightO.tag));
  9337. END;
  9338. ReleaseOperand(leftO);
  9339. ReleaseOperand(rightO);
  9340. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9341. Designate(right,rightO);
  9342. Designate(left,leftO);
  9343. sizeOp := CopySize(left, leftO.tag);
  9344. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9345. ReleaseIntermediateOperand(sizeOp);
  9346. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9347. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9348. IF (rightType IS SyntaxTree.StringType) THEN
  9349. CopyString(left,right);
  9350. 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
  9351. Designate(right,rightO);
  9352. Designate(left,leftO);
  9353. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9354. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9355. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9356. ELSE
  9357. HALT(201)
  9358. END;
  9359. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9360. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9361. Designate(right,rightO);
  9362. Designate(left,leftO);
  9363. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9364. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9365. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9366. ELSE
  9367. AssignMathArray(left,right);
  9368. END;
  9369. ELSE
  9370. HALT(200);
  9371. END;
  9372. END Assign;
  9373. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  9374. BEGIN
  9375. IF Trace THEN TraceEnter("VisitAssignment") END;
  9376. Assign(x.left,x.right);
  9377. IF Trace THEN TraceExit("VisitAssignment") END;
  9378. END VisitAssignment;
  9379. PROCEDURE EmitCooperativeSwitch;
  9380. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9381. BEGIN
  9382. ASSERT (cooperativeSwitches);
  9383. pc := section.pc;
  9384. IF lastSwitchPC = section.pc THEN RETURN END;
  9385. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9386. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9387. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9388. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9389. INC(statCoopSwitch, section.pc - pc);
  9390. END EmitCooperativeSwitch;
  9391. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  9392. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9393. BEGIN
  9394. p0 := communication.left; p1 := communication.right;
  9395. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9396. Evaluate(p0,s0);
  9397. Evaluate(p1,s1);
  9398. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9399. Emit(Push(position,s0.op));
  9400. Emit(Push(position,s1.op));
  9401. (*
  9402. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9403. *)
  9404. IF ~backend.cellsAreObjects THEN
  9405. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9406. END;
  9407. ReleaseOperand(s0);
  9408. ReleaseOperand(s1);
  9409. IF backend.cellsAreObjects THEN
  9410. CallThis(position,"ActiveCellsRuntime","Send",2);
  9411. ELSE
  9412. CallThis(position,ChannelModuleName,"Send",2);
  9413. END;
  9414. (* ----- RECEIVE ------*)
  9415. ELSE
  9416. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9417. tmp := p0; p0 := p1; p1 := tmp;
  9418. END;
  9419. Evaluate(p0,s0);
  9420. Emit(Push(position,s0.op));
  9421. Designate(p1,s1);
  9422. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9423. Emit(Push(position,s1.op));
  9424. (*
  9425. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9426. *)
  9427. IF ~backend.cellsAreObjects THEN
  9428. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9429. END;
  9430. ReleaseOperand(s0);
  9431. ReleaseOperand(s1);
  9432. IF backend.cellsAreObjects THEN
  9433. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9434. ELSE
  9435. CallThis(position,ChannelModuleName,"Receive",2)
  9436. END;
  9437. END;
  9438. END VisitCommunicationStatement;
  9439. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  9440. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9441. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9442. VAR true, false: Label; condition, value: BOOLEAN;
  9443. BEGIN
  9444. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9445. IF condition THEN
  9446. true := NewLabel();
  9447. false := NewLabel();
  9448. Condition(if.condition,true,false);
  9449. SetLabel(true);
  9450. StatementSequence(if.statements);
  9451. BrL(end);
  9452. SetLabel(false);
  9453. ELSE
  9454. IF value THEN (* always true *)
  9455. escape := TRUE;
  9456. StatementSequence(if.statements);
  9457. (* no branch necessary -- rest skipped *)
  9458. END;
  9459. END;
  9460. END IfPart;
  9461. BEGIN
  9462. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9463. end := NewLabel();
  9464. elsifs := x.ElsifParts();
  9465. IfPart(x.ifPart);
  9466. FOR i := 0 TO elsifs-1 DO
  9467. IF ~escape THEN
  9468. elsif := x.GetElsifPart(i);
  9469. IfPart(elsif);
  9470. END;
  9471. END;
  9472. IF (x.elsePart # NIL) & ~escape THEN
  9473. StatementSequence(x.elsePart);
  9474. END;
  9475. SetLabel(end);
  9476. IF Trace THEN TraceExit("VisitIfStatement") END;
  9477. END VisitIfStatement;
  9478. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9479. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9480. BEGIN
  9481. (*IF x.variable.type.resolved = x.type.resolved THEN
  9482. (* always true, do nothing *)
  9483. ELSE*)
  9484. Designate(x.variable,res);
  9485. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9486. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9487. END;
  9488. trueL := NewLabel();
  9489. TypeTest(res.tag,x.type,trueL,falseL);
  9490. ReleaseOperand(res);
  9491. SetLabel(trueL);
  9492. StatementSequence(x.statements);
  9493. BrL(endL);
  9494. END WithPart;
  9495. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  9496. VAR endL,falseL: Label;i: LONGINT;
  9497. BEGIN
  9498. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9499. endL := NewLabel();
  9500. FOR i := 0 TO x.WithParts()-1 DO
  9501. falseL := NewLabel();
  9502. WithPart(x.GetWithPart(i),falseL,endL);
  9503. SetLabel(falseL);
  9504. END;
  9505. IF x.elsePart = NIL THEN
  9506. IF ~isUnchecked THEN
  9507. EmitTrap(position,WithTrap);
  9508. END;
  9509. ELSE
  9510. StatementSequence(x.elsePart)
  9511. END;
  9512. SetLabel(endL);
  9513. IF Trace THEN TraceExit("VisitWithStatement") END;
  9514. END VisitWithStatement;
  9515. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  9516. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9517. out,else: Label; label: Label;
  9518. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9519. symbol: SyntaxTree.Symbol;
  9520. BEGIN
  9521. (*! split case statement into if-elsif statements for large case label lists *)
  9522. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9523. size := x.max-x.min+1;
  9524. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9525. END;
  9526. Evaluate(x.variable,var);
  9527. ReuseCopy(tmp,var.op);
  9528. ReleaseIntermediateOperand(var.op);
  9529. var.op := tmp;
  9530. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9531. Convert(var.op,addressType);
  9532. size := x.max-x.min+1;
  9533. else := NewLabel();
  9534. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9535. (*
  9536. UniqueId(name,module.module,"case",caseId);
  9537. *)
  9538. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9539. Global.GetModuleSegmentedName(module.module, name);
  9540. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9541. symbol := SyntaxTree.NewSymbol(name[1]);
  9542. symbol.SetScope(moduleScope);
  9543. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9544. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9545. section.isCaseTable := TRUE;
  9546. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9547. ReuseCopy(res,var.op);
  9548. ReleaseOperand(var);
  9549. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9550. Emit(Add(position,res,res,jmp));
  9551. IntermediateCode.MakeMemory(res,addressType);
  9552. Emit(Br(position,res));
  9553. ReleaseIntermediateOperand(res);
  9554. out := NewLabel();
  9555. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9556. part := x.GetCasePart(i);
  9557. constant := part.firstConstant;
  9558. label := NewLabel();
  9559. SetLabel(label);
  9560. WHILE(constant # NIL) DO (* case labels for this case part *)
  9561. FOR j := constant.min TO constant.max DO
  9562. fixups[j-x.min] := label;
  9563. END;
  9564. constant := constant.next;
  9565. END;
  9566. StatementSequence(part.statements);
  9567. BrL(out);
  9568. END;
  9569. SetLabel(else);
  9570. FOR i := 0 TO size-1 DO
  9571. IF fixups[i] = NIL THEN
  9572. fixups[i] := else;
  9573. END;
  9574. END;
  9575. IF x.elsePart # NIL THEN
  9576. StatementSequence(x.elsePart);
  9577. ELSIF ~isUnchecked THEN
  9578. EmitTrap(position,CaseTrap);
  9579. END;
  9580. SetLabel(out);
  9581. FOR i := 0 TO size-1 DO
  9582. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9583. section.Emit(Data(position,op));
  9584. END;
  9585. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9586. END VisitCaseStatement;
  9587. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  9588. VAR start: Label; true,false: Label;
  9589. BEGIN
  9590. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9591. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9592. start := NewLabel();
  9593. true := NewLabel();
  9594. false := NewLabel();
  9595. SetLabel(start);
  9596. Condition(x.condition,true,false);
  9597. SetLabel(true);
  9598. StatementSequence(x.statements);
  9599. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9600. BrL(start);
  9601. SetLabel(false);
  9602. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9603. END VisitWhileStatement;
  9604. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  9605. VAR false,true: Label;
  9606. BEGIN
  9607. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9608. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9609. true := NewLabel();
  9610. false := NewLabel();
  9611. SetLabel(false);
  9612. StatementSequence(x.statements);
  9613. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9614. Condition(x.condition,true,false);
  9615. SetLabel(true);
  9616. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9617. END VisitRepeatStatement;
  9618. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  9619. VAR
  9620. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9621. temporaryVariable: SyntaxTree.Variable;
  9622. temporaryVariableDesignator : SyntaxTree.Designator;
  9623. BEGIN
  9624. IF Trace THEN TraceEnter("VisitForStatement") END;
  9625. true := NewLabel();
  9626. false := NewLabel();
  9627. start := NewLabel();
  9628. Assign(x.variable,x.from);
  9629. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9630. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9631. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9632. Assign(temporaryVariableDesignator,x.to);
  9633. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9634. IF by > 0 THEN
  9635. cmp := Scanner.LessEqual
  9636. ELSE
  9637. cmp := Scanner.GreaterEqual
  9638. END;
  9639. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9640. binary.SetType(system.booleanType);
  9641. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9642. SetLabel(start);
  9643. Condition(binary,true,false);
  9644. SetLabel(true);
  9645. StatementSequence(x.statements);
  9646. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9647. binary.SetType(x.variable.type);
  9648. Assign(x.variable,binary);
  9649. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9650. BrL(start);
  9651. SetLabel(false);
  9652. IF Trace THEN TraceExit("VisitForStatement") END;
  9653. END VisitForStatement;
  9654. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  9655. VAR prevLoop: Label;
  9656. BEGIN
  9657. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9658. prevLoop := currentLoop;
  9659. currentLoop := NewLabel();
  9660. StatementSequence(x.statements);
  9661. SetLabel(currentLoop);
  9662. currentLoop := prevLoop;
  9663. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9664. END VisitExitableBlock;
  9665. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  9666. VAR prevLoop,start: Label;
  9667. BEGIN
  9668. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9669. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9670. start := NewLabel();
  9671. prevLoop := currentLoop;
  9672. SetLabel(start);
  9673. currentLoop := NewLabel();
  9674. StatementSequence(x.statements);
  9675. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9676. BrL(start);
  9677. SetLabel(currentLoop);
  9678. currentLoop := prevLoop;
  9679. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9680. END VisitLoopStatement;
  9681. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  9682. VAR outer: SyntaxTree.Statement;
  9683. BEGIN
  9684. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9685. IF locked THEN (* r if we jump out of an exclusive block *)
  9686. outer := x.outer;
  9687. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9688. outer := outer.outer;
  9689. END;
  9690. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9691. Lock(FALSE);
  9692. END;
  9693. END;
  9694. BrL(currentLoop);
  9695. IF Trace THEN TraceExit("VisitExitStatement") END;
  9696. END VisitExitStatement;
  9697. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  9698. VAR
  9699. expression, parameterDesignator: SyntaxTree.Expression;
  9700. type, componentType: SyntaxTree.Type;
  9701. res, right: Operand;
  9702. left, mem, reg: IntermediateCode.Operand;
  9703. parameter: SyntaxTree.Parameter;
  9704. procedure: SyntaxTree.Procedure;
  9705. procedureType: SyntaxTree.ProcedureType;
  9706. returnTypeOffset: LONGINT;
  9707. delegate: BOOLEAN;
  9708. map: SymbolMap;
  9709. cc, parametersSize: LONGINT;
  9710. BEGIN
  9711. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9712. expression := x.returnValue;
  9713. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9714. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9715. IF currentIsInline THEN
  9716. IF expression # NIL THEN
  9717. map := currentMapper.Get(NIL);
  9718. IF map # NIL THEN
  9719. Assign(map.to, expression);
  9720. ELSE
  9721. Evaluate(expression,res);
  9722. Emit(Return(position,res.op));
  9723. ReleaseOperand(res);
  9724. END;
  9725. END;
  9726. BrL(currentInlineExit);
  9727. RETURN;
  9728. END;
  9729. IF expression # NIL THEN
  9730. type := expression.type.resolved;
  9731. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9732. IF locked THEN Lock(FALSE) END;
  9733. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9734. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9735. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9736. (* return without structured return parameter *)
  9737. Evaluate(expression,res);
  9738. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9739. IF locked OR profile THEN
  9740. Emit(Push(position,res.op));
  9741. IF delegate THEN HALT(200) END;
  9742. ReleaseOperand(res);
  9743. IF locked THEN Lock(FALSE) END;
  9744. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9745. reg := NewRegisterOperand(res.op.type);
  9746. Emit(Pop(position,reg));
  9747. Emit(Return(position,reg));
  9748. ReleaseIntermediateOperand(reg);
  9749. ELSE
  9750. Emit(Return(position,res.op));
  9751. ReleaseOperand(res);
  9752. END;
  9753. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9754. THEN
  9755. (* return using structured return parameter *)
  9756. 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)
  9757. OR SemanticChecker.IsPointerType(type));
  9758. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9759. parameter :=procedureType.returnParameter;
  9760. ASSERT(parameter # NIL);
  9761. returnTypeOffset := parameter.offsetInBits;
  9762. (*
  9763. IF parameter# NIL THEN
  9764. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9765. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9766. ELSE
  9767. returnTypeOffset := system.offsetFirstParameter
  9768. END;
  9769. *)
  9770. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9771. IF type IS SyntaxTree.RangeType THEN
  9772. (* array range type *)
  9773. Evaluate(expression, right);
  9774. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  9775. Emit(Mov(position,mem, right.op)); (* first *)
  9776. ReleaseIntermediateOperand(mem);
  9777. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9778. Emit(Mov(position,mem, right.tag)); (* last *)
  9779. ReleaseIntermediateOperand(mem);
  9780. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9781. Emit(Mov(position,mem, right.extra)); (* step *)
  9782. ReleaseIntermediateOperand(mem);
  9783. ReleaseOperand(right);
  9784. ELSIF type IS SyntaxTree.ComplexType THEN
  9785. Evaluate(expression, right);
  9786. componentType := type(SyntaxTree.ComplexType).componentType;
  9787. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9788. Emit(Mov(position,mem, right.op)); (* real part *)
  9789. ReleaseIntermediateOperand(mem);
  9790. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9791. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9792. ReleaseIntermediateOperand(mem);
  9793. ReleaseOperand(right);
  9794. ELSE (* covers cases: pointer / record / array *)
  9795. parameter := procedureType.returnParameter;
  9796. checker.SetCurrentScope(currentScope);
  9797. ASSERT(parameter # NIL);
  9798. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9799. Assign(parameterDesignator,expression);
  9800. END;
  9801. ReleaseIntermediateOperand(left);
  9802. IF locked THEN Lock(FALSE) END;
  9803. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9804. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9805. parameter := procedureType.returnParameter;
  9806. checker.SetCurrentScope(currentScope);
  9807. IF parameter = NIL THEN
  9808. Error(procedure.position, "structured return of parameter of procedure not found");
  9809. ELSE
  9810. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9811. Assign(parameterDesignator,expression);
  9812. END;
  9813. IF locked THEN Lock(FALSE) END;
  9814. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9815. ELSE
  9816. HALT(200);
  9817. END;
  9818. ELSE
  9819. IF locked THEN Lock(FALSE) END;
  9820. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9821. END;
  9822. IF backend.cooperative THEN
  9823. BrL(exitLabel);
  9824. ELSE
  9825. cc := procedureType(SyntaxTree.ProcedureType).callingConvention;
  9826. IF cc = SyntaxTree.WinAPICallingConvention THEN
  9827. parametersSize := ProcedureParametersSize(backend.system,procedure);
  9828. ELSE
  9829. parametersSize := 0;
  9830. END;
  9831. EmitLeave(section, position,procedure, procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9832. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention, parametersSize));
  9833. END;
  9834. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9835. END VisitReturnStatement;
  9836. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9837. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9838. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9839. statements: SyntaxTree.StatementSequence;
  9840. name, suffix: SyntaxTree.IdentifierString;
  9841. BEGIN
  9842. Strings.IntToStr(awaitProcCounter,suffix);
  9843. Strings.Concat("@AwaitProcedure",suffix,name);
  9844. identifier := SyntaxTree.NewIdentifier(name);
  9845. INC(awaitProcCounter);
  9846. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9847. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9848. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9849. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9850. procedure.SetAccess(SyntaxTree.Hidden);
  9851. procedure.SetScope(currentScope);
  9852. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9853. procedureType.SetReturnType(system.booleanType);
  9854. procedure.SetType(procedureType);
  9855. body := SyntaxTree.NewBody(x.position,procedureScope);
  9856. procedureScope.SetBody(body);
  9857. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9858. returnStatement.SetReturnValue(x.condition);
  9859. statements := SyntaxTree.NewStatementSequence();
  9860. statements.AddStatement(returnStatement);
  9861. body.SetStatementSequence(statements);
  9862. currentScope.AddProcedure(procedure);
  9863. RETURN procedure
  9864. END MakeAwaitProcedure;
  9865. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9866. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9867. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9868. BEGIN
  9869. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9870. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9871. IF backend.cooperative THEN
  9872. start := NewLabel();
  9873. true := NewLabel();
  9874. false := NewLabel();
  9875. SetLabel(start);
  9876. Condition(x.condition,true,false);
  9877. SetLabel(false);
  9878. PushSelfPointer();
  9879. CallThis(position,"ExclusiveBlocks","Await",1);
  9880. BrL(start);
  9881. SetLabel(true);
  9882. PushSelfPointer();
  9883. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9884. ELSE
  9885. proc := MakeAwaitProcedure(x);
  9886. Emit(Push(position,fp));
  9887. GetCodeSectionNameForSymbol(proc,name);
  9888. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9889. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9890. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9891. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9892. Emit(Result(position,res));
  9893. (*
  9894. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9895. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9896. *)
  9897. InitOperand(result,ModeValue);
  9898. result.op := res;
  9899. label := NewLabel();
  9900. BreqL(label, result.op, SELF.true);
  9901. ReleaseOperand(result);
  9902. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9903. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9904. Emit(Push(position,res));
  9905. Emit(Push(position,fp));
  9906. PushSelfPointer();
  9907. Emit(Push(position,nil));
  9908. CallThis(position,"Objects","Await",4);
  9909. SetLabel(label);
  9910. END;
  9911. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9912. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9913. END VisitAwaitStatement;
  9914. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9915. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9916. BEGIN
  9917. FOR i := 0 TO x.Length() - 1 DO
  9918. statement := x.GetStatement( i );
  9919. Statement(statement);
  9920. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9921. END;
  9922. END StatementSequence;
  9923. PROCEDURE PushSelfPointer;
  9924. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  9925. procedureType: SyntaxTree.ProcedureType;
  9926. BEGIN
  9927. scope := currentScope;
  9928. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9929. scope := scope.outerScope;
  9930. END;
  9931. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9932. IF ~newObjectFile THEN
  9933. Symbol(moduleSelf,op);
  9934. IntermediateCode.MakeMemory(op.op,addressType);
  9935. ELSE
  9936. moduleSection := meta.ModuleSection();
  9937. IF backend.cooperative THEN
  9938. moduleOffset := 0;
  9939. ELSE
  9940. moduleOffset := moduleSection.pc;
  9941. END;
  9942. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9943. END;
  9944. ELSE
  9945. GetBaseRegister(op.op,currentScope,scope);
  9946. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9947. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9948. parametersSize := ProcedureParametersSize(system,procedure);
  9949. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  9950. IF backend.cooperative THEN
  9951. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9952. END;
  9953. IntermediateCode.MakeMemory(op.op,addressType);
  9954. END;
  9955. Emit(Push(position,op.op));
  9956. ReleaseOperand(op);
  9957. END PushSelfPointer;
  9958. PROCEDURE Lock(lock: BOOLEAN);
  9959. BEGIN
  9960. IF Trace THEN TraceEnter("Lock") END;
  9961. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9962. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9963. ASSERT(modifyAssignmentCounter = 0);
  9964. IF dump # NIL THEN
  9965. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9966. dump.Ln;dump.Update;
  9967. END;
  9968. PushSelfPointer;
  9969. IF backend.cooperative THEN
  9970. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9971. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9972. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9973. END;
  9974. ELSE
  9975. Emit(Push(position,true));
  9976. IF lock THEN CallThis(position,"Objects","Lock",2)
  9977. ELSE CallThis(position,"Objects","Unlock",2);
  9978. END;
  9979. END;
  9980. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9981. IF Trace THEN TraceExit("Lock") END;
  9982. END Lock;
  9983. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9984. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9985. BEGIN
  9986. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9987. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9988. previouslyUnchecked := isUnchecked;
  9989. isUnchecked := isUnchecked OR x.isUnchecked;
  9990. previouslyCooperativeSwitches := cooperativeSwitches;
  9991. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9992. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9993. IF x.statements # NIL THEN
  9994. StatementSequence(x.statements);
  9995. END;
  9996. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9997. isUnchecked := previouslyUnchecked;
  9998. cooperativeSwitches := previouslyCooperativeSwitches;
  9999. IF Trace THEN TraceExit("VisitStatementBlock") END;
  10000. END VisitStatementBlock;
  10001. PROCEDURE VisitCode(x: SyntaxTree.Code);
  10002. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  10003. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  10004. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  10005. procedure: SyntaxTree.Procedure;
  10006. map: SymbolMap;
  10007. cc, parametersSize: LONGINT;
  10008. BEGIN
  10009. scope := currentScope;
  10010. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  10011. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10012. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10013. return := emptyOperand;
  10014. IF Trace THEN TraceEnter("VisitCode") END;
  10015. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  10016. NEW(in, x.inRules.Length());
  10017. FOR i := 0 TO LEN(in)-1 DO
  10018. statement := x.inRules.GetStatement(i);
  10019. WITH statement: SyntaxTree.Assignment DO
  10020. Evaluate(statement.right, operand);
  10021. result := operand.op;
  10022. NEW(str, 64);
  10023. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  10024. in[i] := result; IntermediateCode.SetString(in[i], str);
  10025. ReleaseIntermediateOperand(operand.tag);
  10026. END;
  10027. END;
  10028. ELSE in := NIL
  10029. END;
  10030. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  10031. NEW(out, x.outRules.Length());
  10032. FOR i := 0 TO LEN(out)-1 DO
  10033. statement := x.outRules.GetStatement(i);
  10034. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  10035. WITH statement: SyntaxTree.Assignment DO
  10036. Designate(statement.left, operand);
  10037. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  10038. NEW(str, 64);
  10039. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  10040. out[i] := result; IntermediateCode.SetString(out[i], str);
  10041. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  10042. |statement: SyntaxTree.ReturnStatement DO
  10043. NEW(str, 64);
  10044. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  10045. IF currentIsInline THEN
  10046. map := currentMapper.Get(NIL);
  10047. Designate(map.to, operand);
  10048. IF map.isAddress THEN
  10049. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10050. ELSE
  10051. result := operand.op;
  10052. END;
  10053. (*! only if it does not fit into register
  10054. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10055. *)
  10056. (*Evaluate(map.to, operand);*)
  10057. out[i] := result;
  10058. ELSE
  10059. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  10060. END;
  10061. IntermediateCode.SetString(out[i], str);
  10062. ReleaseIntermediateOperand(operand.tag);
  10063. return := out[i];
  10064. ELSE
  10065. END;
  10066. END;
  10067. ELSE out := NIL
  10068. END;
  10069. Emit(Asm(x.position,x.sourceCode, in, out));
  10070. IF in # NIL THEN
  10071. FOR i := 0 TO LEN(in)-1 DO
  10072. ReleaseIntermediateOperand(in[i]);
  10073. END;
  10074. END;
  10075. IF out # NIL THEN
  10076. FOR i := 0 TO LEN(out)-1 DO
  10077. WITH statement: SyntaxTree.Assignment DO
  10078. ReleaseIntermediateOperand(out[i]);
  10079. |statement: SyntaxTree.ReturnStatement DO
  10080. (* release happens below *)
  10081. ELSE
  10082. END;
  10083. statement := x.outRules.GetStatement(i);
  10084. END;
  10085. END;
  10086. IF return.mode # IntermediateCode.Undefined THEN
  10087. IF currentIsInline THEN
  10088. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  10089. Symbol(procedureType.returnParameter, par);
  10090. MakeMemory(mem, par.op, return.type, 0);
  10091. ReleaseOperand(par);
  10092. Emit(Mov(position, mem, return));
  10093. ReleaseIntermediateOperand(mem);
  10094. ELSE
  10095. Emit(Return(position,return));
  10096. END;
  10097. ReleaseIntermediateOperand(return);
  10098. IF currentIsInline THEN RETURN END;
  10099. cc := procedureType(SyntaxTree.ProcedureType).callingConvention;
  10100. IF cc = SyntaxTree.WinAPICallingConvention THEN
  10101. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10102. ELSE
  10103. parametersSize := 0;
  10104. END;
  10105. EmitLeave(section, position,procedure, cc);
  10106. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,cc, parametersSize));
  10107. END;
  10108. IF Trace THEN TraceExit("VisitCode") END;
  10109. END VisitCode;
  10110. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  10111. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  10112. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  10113. const, call: IntermediateCode.Operand;
  10114. parameterDesignator: SyntaxTree.Expression;
  10115. saved: RegisterEntry;
  10116. name: Basic.SegmentedName;
  10117. BEGIN
  10118. IF Trace THEN TraceEnter("ParameterCopies") END;
  10119. parameter := x.firstParameter;
  10120. WHILE parameter # NIL DO
  10121. IF parameter.kind = SyntaxTree.ValueParameter THEN
  10122. type := parameter.type.resolved;
  10123. IF IsOpenArray(type) THEN
  10124. VisitParameter(parameter);
  10125. op := result;
  10126. IF backend.cooperative & parameter.NeedsTrace() THEN
  10127. length := GetArrayLength(type, op.tag);
  10128. size := NewRegisterOperand(addressType);
  10129. base := ArrayBaseType(type);
  10130. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10131. Emit(Mul(position, size, length, const));
  10132. dst := NewRegisterOperand (addressType);
  10133. Emit(Mov(position, dst, size));
  10134. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10135. Emit(Sub(position,dst,sp,dst));
  10136. Emit(And(position,dst,dst,const));
  10137. Emit(Mov(position,sp,dst));
  10138. par := fp;
  10139. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10140. IntermediateCode.InitImmediate(null, byteType, 0);
  10141. Emit(Fill(position, dst, size, null));
  10142. ReleaseIntermediateOperand(dst);
  10143. ReleaseIntermediateOperand(length);
  10144. SaveRegisters();ReleaseUsedRegisters(saved);
  10145. (* register dst has been freed before SaveRegisters already *)
  10146. base := ArrayBaseType(type);
  10147. (* assign method of open array *)
  10148. IF base.IsRecordType() THEN
  10149. Emit (Push(position, length));
  10150. Emit (Push(position, dst));
  10151. Emit (Push(position, op.op));
  10152. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10153. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10154. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10155. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10156. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10157. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10158. Emit (Push(position,length));
  10159. Emit (Push(position, dst));
  10160. Emit (Push(position, length));
  10161. Emit (Push(position, op.op));
  10162. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10163. ELSE
  10164. Emit (Push(position, length));
  10165. Emit (Push(position, dst));
  10166. Emit (Push(position, length));
  10167. Emit (Push(position, op.op));
  10168. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10169. ASSERT(ArrayBaseType(type).IsPointer());
  10170. END;
  10171. RestoreRegisters(saved);
  10172. ELSE
  10173. temp := GetDynamicSize(type,op.tag);
  10174. ReuseCopy(size,temp);
  10175. ReleaseIntermediateOperand(temp);
  10176. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10177. Emit(Sub(position,size,sp,size));
  10178. Emit(And(position,size,size,const));
  10179. Emit(Mov(position,sp,size));
  10180. par := fp;
  10181. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10182. ReleaseIntermediateOperand(size);
  10183. size := GetDynamicSize(type,op.tag);
  10184. END;
  10185. Emit(Copy(position,sp,op.op,size));
  10186. ReleaseIntermediateOperand(size);
  10187. ReleaseOperand(op);
  10188. IntermediateCode.MakeMemory(par,addressType);
  10189. Emit(Mov(position,par,sp));
  10190. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10191. checker.SetCurrentScope(currentScope);
  10192. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10193. Assign(parameterDesignator,parameterDesignator);
  10194. END;
  10195. END;
  10196. parameter := parameter.nextParameter;
  10197. END;
  10198. IF Trace THEN TraceExit("ParameterCopies") END;
  10199. END ParameterCopies;
  10200. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10201. VAR x: SyntaxTree.Variable;
  10202. BEGIN
  10203. x := scope.firstVariable;
  10204. WHILE x # NIL DO
  10205. InitVariable(x,FALSE);
  10206. x := x.nextVariable;
  10207. END;
  10208. END InitVariables;
  10209. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10210. BEGIN
  10211. IF (symbol # NIL) THEN
  10212. RETURN fingerPrinter.SymbolFP(symbol).public
  10213. ELSE
  10214. RETURN 0
  10215. END;
  10216. END GetFingerprint;
  10217. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10218. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10219. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10220. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10221. name: Basic.SegmentedName;
  10222. offset: LONGINT;
  10223. BEGIN
  10224. IF Trace THEN TraceEnter("Body") END;
  10225. ReleaseUsedRegisters(saved); (* just in case ... *)
  10226. section := ir;
  10227. exitLabel := NewLabel ();
  10228. IF moduleBody THEN moduleBodySection := section END;
  10229. IF ir.comments # NIL THEN
  10230. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10231. commentPrintout.SingleStatement(TRUE);
  10232. dump := ir.comments;
  10233. ELSE
  10234. commentPrintout := NIL;
  10235. dump := NIL;
  10236. END;
  10237. prevScope := currentScope;
  10238. currentScope := scope;
  10239. lastSwitchPC := 0;
  10240. cooperativeSwitches := backend.cooperative;
  10241. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10242. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10243. IF x # NIL THEN
  10244. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10245. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10246. IF moduleBody THEN
  10247. ProfilerInit();
  10248. ELSE
  10249. Basic.SegmentedNameToString(ir.name, string);
  10250. ProfilerAddProcedure(numberProcedures,string);
  10251. ProfilerEnterExit(numberProcedures,TRUE);
  10252. END;
  10253. END;
  10254. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10255. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10256. END;
  10257. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10258. IF moduleBody & ~newObjectFile THEN
  10259. InitVariables(moduleScope)
  10260. END;
  10261. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10262. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10263. IF procedure = cellScope.bodyProcedure THEN
  10264. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10265. StaticCallOperand(op, cellScope.constructor);
  10266. Emit(Call(position,op.op,0));
  10267. END;
  10268. END;
  10269. END;
  10270. InitVariables(scope);
  10271. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10272. GetCodeSectionNameForSymbol(procedure, name);
  10273. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10274. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10275. IF ProtectModulesPointers THEN
  10276. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10277. ELSE
  10278. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10279. END;
  10280. IntermediateCode.SetOffset(right,offset); (* tag *)
  10281. IntermediateCode.InitMemory(left,addressType,fp,0);
  10282. Emit(Mov(position, left, right));
  10283. END;
  10284. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10285. ParameterCopies(procedureType);
  10286. IF x.code = NIL THEN
  10287. VisitStatementBlock(x);
  10288. ELSE
  10289. VisitCode(x.code)
  10290. END;
  10291. IF x.finally # NIL THEN (*! mark finally block for object file *)
  10292. ir.SetFinally(ir.pc);
  10293. StatementSequence(x.finally)
  10294. END;
  10295. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10296. IF ~backend.cooperative THEN
  10297. ProfilerEnterExit(numberProcedures,FALSE);
  10298. END;
  10299. INC(numberProcedures);
  10300. END;
  10301. END;
  10302. IF backend.cooperative THEN
  10303. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10304. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10305. END;
  10306. IF x # NIL THEN
  10307. SELF.position := x.position;
  10308. END;
  10309. CheckRegistersFree();
  10310. ASSERT(modifyAssignmentCounter = 0);
  10311. currentScope := prevScope;
  10312. IF Trace THEN TraceExit("Body") END;
  10313. END Body;
  10314. END ImplementationVisitor;
  10315. MetaDataGenerator=OBJECT
  10316. VAR
  10317. implementationVisitor: ImplementationVisitor;
  10318. declarationVisitor: DeclarationVisitor;
  10319. module: Sections.Module;
  10320. moduleName: ARRAY 128 OF CHAR;
  10321. moduleNamePool: Basic.HashTableInt;
  10322. moduleNamePoolSection: IntermediateCode.Section;
  10323. modulePointerSection: IntermediateCode.Section;
  10324. modulePointerSizePC: LONGINT;
  10325. modulePointerSectionOffset: LONGINT;
  10326. modulePointers: LONGINT;
  10327. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  10328. RecordBaseOffset: LONGINT;
  10329. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10330. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10331. TypeTags: LONGINT; (* type extension level support *)
  10332. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10333. patchInfoPC: LONGINT;
  10334. patchCRC: LONGINT;
  10335. CONST
  10336. EmptyBlockOffset = 2;
  10337. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10338. BEGIN
  10339. IF implementationVisitor.backend.cooperative THEN
  10340. TypeTags := MAX(LONGINT);
  10341. BaseTypesTableOffset := 0;
  10342. MethodTableOffset := 2;
  10343. TypeRecordBaseOffset := 0;
  10344. RecordBaseOffset := 0;
  10345. ELSIF simple THEN
  10346. TypeTags := 3; (* only 3 extensions allowed *)
  10347. BaseTypesTableOffset := 1;
  10348. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10349. TypeRecordBaseOffset := 0;
  10350. RecordBaseOffset := 1;
  10351. ELSE
  10352. TypeTags := 16;
  10353. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10354. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10355. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10356. (* change this when Heaps.HeapBlock is modified *)
  10357. RecordBaseOffset := 8;
  10358. END;
  10359. SELF.simple := simple;
  10360. SELF.implementationVisitor := implementationVisitor;
  10361. SELF.declarationVisitor := declarationVisitor;
  10362. implementationVisitor.meta := SELF;
  10363. declarationVisitor.meta := SELF;
  10364. END InitMetaDataGenerator;
  10365. PROCEDURE SetModule(module: Sections.Module);
  10366. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10367. BEGIN
  10368. SELF.module := module;
  10369. Global.GetModuleName(module.module,moduleName);
  10370. Global.GetSymbolSegmentedName(module.module, name);
  10371. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple & ~implementationVisitor.backend.cooperative THEN
  10372. NEW(moduleNamePool, 32);
  10373. (*! require GC protection *)
  10374. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10375. IF ProtectModulesPointers THEN
  10376. name := "Heaps.AnyPtr";
  10377. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10378. (* set base pointer *)
  10379. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10380. END;
  10381. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10382. modulePointers := 0;
  10383. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10384. AddPointer(moduleNamePoolSection, namePoolOffset);
  10385. END;
  10386. END SetModule;
  10387. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10388. BEGIN
  10389. IF ~implementationVisitor.backend.cooperative THEN
  10390. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  10391. INC(modulePointers);
  10392. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10393. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10394. END;
  10395. END AddPointer;
  10396. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10397. BEGIN
  10398. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10399. END GetTypeRecordBaseOffset;
  10400. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10401. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10402. BEGIN
  10403. (* change this when Heaps.HeapBlock is modified *)
  10404. INC(dataAdrOffset,6);
  10405. Info(section,"headerAdr");
  10406. Address(section,0);
  10407. Info(section,"typeDesc");
  10408. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10409. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10410. NamedSymbol(section, name, symbol, 0, offset);
  10411. Info(section,"mark: LONGINT;");
  10412. Longint(section,-1);
  10413. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10414. Info(section,"dataAdr-: ADDRESS");
  10415. Symbol(section,section, dataAdrOffset,0);
  10416. Info(section,"size-: SIZE");
  10417. Address(section,0);
  10418. Info(section,"nextMark: HeapBlock;");
  10419. Address(section,0);
  10420. END HeapBlock;
  10421. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10422. VAR i: LONGINT;
  10423. BEGIN
  10424. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10425. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10426. Info(section,"count*: LONGINT");
  10427. Longint(section,0);
  10428. Info(section,"locked*: BOOLEAN");
  10429. Longint(section,0);
  10430. Info(section,"awaitingLock*: ProcessQueue");
  10431. Address(section,0);
  10432. Address(section,0);
  10433. Info(section,"awaitingCond*: ProcessQueue");
  10434. Address(section,0);
  10435. Address(section,0);
  10436. Info(section,"lockedBy*: ANY");
  10437. Address(section,0);
  10438. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10439. Longint(section,1);
  10440. FOR i := 2 TO 6 DO
  10441. Longint(section,0);
  10442. END;
  10443. Info(section,"lock*: ANY");
  10444. Address(section,0);
  10445. END ProtectedHeapBlock;
  10446. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10447. BEGIN
  10448. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10449. END Info;
  10450. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10451. VAR op: IntermediateCode.Operand;
  10452. BEGIN
  10453. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10454. section.Emit(Data(Basic.invalidPosition,op));
  10455. END Address;
  10456. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10457. VAR op: IntermediateCode.Operand;
  10458. BEGIN
  10459. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10460. section.Emit(Data(Basic.invalidPosition,op));
  10461. END Size;
  10462. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  10463. VAR op: IntermediateCode.Operand;
  10464. BEGIN
  10465. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  10466. section.Emit(Data(Basic.invalidPosition,op));
  10467. END Set;
  10468. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10469. VAR op: IntermediateCode.Operand;
  10470. BEGIN
  10471. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10472. section.Emit(Data(Basic.invalidPosition,op));
  10473. END Longint;
  10474. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10475. VAR op,noOperand: IntermediateCode.Operand;
  10476. BEGIN
  10477. IntermediateCode.InitOperand(noOperand);
  10478. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10479. section.PatchOperands(pc,op,noOperand,noOperand);
  10480. END PatchAddress;
  10481. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10482. VAR op,noOperand: IntermediateCode.Operand;
  10483. BEGIN
  10484. IntermediateCode.InitOperand(noOperand);
  10485. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10486. section.PatchOperands(pc,op,noOperand,noOperand);
  10487. END PatchSize;
  10488. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10489. VAR op,noOperand: IntermediateCode.Operand;
  10490. BEGIN
  10491. IntermediateCode.InitOperand(noOperand);
  10492. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10493. section.PatchOperands(pc,op,noOperand,noOperand);
  10494. END PatchLongint;
  10495. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10496. VAR op, noOperand: IntermediateCode.Operand;
  10497. BEGIN
  10498. IntermediateCode.InitOperand(noOperand);
  10499. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10500. section.PatchOperands(pc,op,noOperand,noOperand);
  10501. END PatchSymbol;
  10502. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10503. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10504. BEGIN
  10505. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10506. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10507. section.Emit(Data(Basic.invalidPosition,op));
  10508. END Boolean;
  10509. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10510. VAR op: IntermediateCode.Operand;
  10511. BEGIN
  10512. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10513. section.Emit(Data(Basic.invalidPosition,op));
  10514. END Char;
  10515. PROCEDURE Integer(section: IntermediateCode.Section; int: LONGINT);
  10516. VAR op: IntermediateCode.Operand;
  10517. BEGIN
  10518. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.integerType),int);
  10519. section.Emit(Data(Basic.invalidPosition,op));
  10520. END Integer;
  10521. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10522. VAR i: LONGINT;
  10523. BEGIN
  10524. Info(section,str);
  10525. i := 0;
  10526. WHILE(str[i] # 0X) DO
  10527. Char(section,str[i]);
  10528. INC(i);
  10529. END;
  10530. Char(section,0X);
  10531. END String;
  10532. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10533. VAR s: Basic.SectionName;
  10534. BEGIN
  10535. StringPool.GetString(str, s);
  10536. String(section, s);
  10537. END String0;
  10538. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10539. VAR op: IntermediateCode.Operand;
  10540. BEGIN
  10541. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10542. IntermediateCode.SetOffset(op,realOffset);
  10543. section.Emit(Data(Basic.invalidPosition,op));
  10544. END NamedSymbol;
  10545. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10546. VAR op: IntermediateCode.Operand;
  10547. BEGIN
  10548. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10549. IntermediateCode.SetOffset(op,realOffset);
  10550. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10551. END NamedSymbolAt;
  10552. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10553. BEGIN
  10554. IF symbol= NIL THEN
  10555. Address( section, realOffset);
  10556. ASSERT(virtualOffset = 0);
  10557. ELSE
  10558. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10559. END;
  10560. END Symbol;
  10561. (* OutPointers delivers
  10562. {pointerOffset}
  10563. *)
  10564. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10565. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10566. BEGIN
  10567. type := type.resolved;
  10568. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10569. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10570. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10571. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10572. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10573. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10574. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10575. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10576. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10577. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10578. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10579. ELSIF (type IS SyntaxTree.RecordType) THEN
  10580. (* never treat a record like a pointer, even if the pointer field is set! *)
  10581. WITH type: SyntaxTree.RecordType DO
  10582. base := type.GetBaseRecord();
  10583. IF base # NIL THEN
  10584. Pointers(offset,symbol,section, base,numberPointers);
  10585. END;
  10586. variable := type.recordScope.firstVariable;
  10587. WHILE(variable # NIL) DO
  10588. IF ~(variable.untraced) THEN
  10589. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10590. END;
  10591. variable := variable.nextVariable;
  10592. END;
  10593. END;
  10594. ELSIF (type IS SyntaxTree.CellType) THEN
  10595. WITH type: SyntaxTree.CellType DO
  10596. base := type.GetBaseRecord();
  10597. IF base # NIL THEN
  10598. Pointers(offset,symbol,section, base,numberPointers);
  10599. END;
  10600. variable := type.cellScope.firstVariable;
  10601. WHILE(variable # NIL) DO
  10602. IF ~(variable.untraced) THEN
  10603. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10604. END;
  10605. variable := variable.nextVariable;
  10606. END;
  10607. property := type.firstProperty;
  10608. WHILE(property # NIL) DO
  10609. IF ~(property.untraced) THEN
  10610. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10611. END;
  10612. property := property.nextProperty;
  10613. END;
  10614. parameter := type.firstParameter;
  10615. WHILE(parameter # NIL) DO
  10616. IF ~(parameter.untraced) THEN
  10617. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10618. END;
  10619. parameter := parameter.nextParameter;
  10620. END;
  10621. END;
  10622. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10623. WITH type: SyntaxTree.ArrayType DO
  10624. IF type.form= SyntaxTree.Static THEN
  10625. n := type.staticLength;
  10626. base := type.arrayBase.resolved;
  10627. WHILE(base IS SyntaxTree.ArrayType) DO
  10628. type := base(SyntaxTree.ArrayType);
  10629. n := n* type.staticLength;
  10630. base := type.arrayBase.resolved;
  10631. END;
  10632. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10633. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  10634. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10635. FOR i := 0 TO n-1 DO
  10636. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10637. END;
  10638. END;
  10639. ELSE
  10640. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10641. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10642. END;
  10643. END;
  10644. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10645. WITH type: SyntaxTree.MathArrayType DO
  10646. IF type.form = SyntaxTree.Static THEN
  10647. n := type.staticLength;
  10648. base := type.arrayBase.resolved;
  10649. WHILE(base IS SyntaxTree.MathArrayType) DO
  10650. type := base(SyntaxTree.MathArrayType);
  10651. n := n* type.staticLength;
  10652. base := type.arrayBase.resolved;
  10653. END;
  10654. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10655. IF SemanticChecker.ContainsPointer(base) THEN
  10656. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10657. FOR i := 0 TO n-1 DO
  10658. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10659. END;
  10660. END;
  10661. ELSE
  10662. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10663. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10664. END
  10665. END;
  10666. (* ELSE no pointers in type *)
  10667. END;
  10668. END Pointers;
  10669. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10670. VAR position,i: LONGINT; ch: CHAR;
  10671. BEGIN
  10672. IF pool.Has(index) THEN
  10673. RETURN pool.GetInt(index)
  10674. ELSE
  10675. position := source.pc;
  10676. pool.PutInt(index, position);
  10677. Info(source, name);
  10678. i := 0;
  10679. REPEAT
  10680. ch := name[i]; INC(i);
  10681. Char( source, ch);
  10682. UNTIL ch = 0X;
  10683. END;
  10684. RETURN position;
  10685. END EnterDynamicName;
  10686. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10687. VAR name: Basic.SectionName; position: LONGINT;
  10688. BEGIN
  10689. IF pool.Has(index) THEN
  10690. RETURN pool.GetInt(index)
  10691. ELSE
  10692. StringPool.GetString(index, name);
  10693. position := EnterDynamicName(source,name,index, pool);
  10694. END;
  10695. RETURN position;
  10696. END DynamicName;
  10697. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10698. VAR section: IntermediateCode.Section;
  10699. BEGIN
  10700. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10701. IF implementationVisitor.backend.cooperative THEN
  10702. Info(section, "TypeDescriptor");
  10703. Basic.ToSegmentedName("BaseTypes.Array", name);
  10704. NamedSymbol(section, name,NIL, 0, 0);
  10705. BasePointer(section);
  10706. offset := 0;
  10707. ELSE
  10708. IF ProtectModulesPointers THEN
  10709. HeapBlock(mName,typeName,section,2);
  10710. END;
  10711. Info(section, "HeapBlock");
  10712. IF ProtectModulesPointers THEN
  10713. Symbol(section,section,2,0);
  10714. ELSE
  10715. Address(section,0);
  10716. END;
  10717. Info(section, "TypeDescriptor");
  10718. Address(section,0);
  10719. offset := section.pc;
  10720. END;
  10721. RETURN section
  10722. END NamedBlock;
  10723. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10724. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10725. BEGIN
  10726. COPY(moduleName,name);
  10727. Strings.Append(name,suffix);
  10728. Basic.ToSegmentedName(name, pooledName);
  10729. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10730. END Block;
  10731. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10732. VAR name: Basic.SegmentedName;
  10733. BEGIN
  10734. Info(source,"ArrayHeader");
  10735. IF implementationVisitor.backend.cooperative THEN
  10736. sizePC := source.pc;
  10737. Address(source,0);
  10738. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10739. IF baseType # "" THEN
  10740. Basic.ToSegmentedName(baseType, name);
  10741. NamedSymbol(source, name,NIL, 0, 0);
  10742. ELSE
  10743. Address(source,0);
  10744. END;
  10745. Address(source,0);
  10746. ELSE
  10747. Address(source,0);
  10748. Address(source,0);
  10749. (* first pointer for GC *)
  10750. IF hasPointer THEN
  10751. (* points to first element in the array, this is NOT the base type descriptor *)
  10752. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  10753. ELSE
  10754. Address(source,0);
  10755. END;
  10756. sizePC := source.pc;
  10757. Address(source,0);
  10758. Info(source,"array data");
  10759. END;
  10760. END ArrayBlock;
  10761. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10762. BEGIN
  10763. IF implementationVisitor.backend.cooperative THEN
  10764. PatchSize(section, pc, size);
  10765. PatchSize(section, pc + 3, size);
  10766. ELSE
  10767. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  10768. PatchSize(section, pc, size);
  10769. END;
  10770. END PatchArray;
  10771. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10772. VAR
  10773. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10774. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10775. poolMap: Basic.HashTableInt;
  10776. namePool: IntermediateCode.Section;
  10777. namePoolOffset: LONGINT;
  10778. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10779. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10780. BEGIN
  10781. Basic.SegmentedNameToString(s1.name,n1);
  10782. Basic.SegmentedNameToString(s2.name,n2);
  10783. index := 0;
  10784. ch1 := n1[index];
  10785. ch2 := n2[index];
  10786. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10787. INC(index);
  10788. ch1 := n1[index];
  10789. ch2 := n2[index];
  10790. END;
  10791. RETURN ch1 < ch2;
  10792. END Compare;
  10793. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10794. VAR
  10795. i, j: LONGINT;
  10796. x, t: Sections.Section;
  10797. BEGIN
  10798. IF lo < hi THEN
  10799. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10800. WHILE i <= j DO
  10801. WHILE Compare(list[i], x) DO INC(i) END;
  10802. WHILE Compare(x, list[j]) DO DEC(j) END;
  10803. IF i <= j THEN
  10804. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10805. INC(i); DEC(j)
  10806. END
  10807. END;
  10808. IF lo < j THEN QuickSort(list, lo, j) END;
  10809. IF i < hi THEN QuickSort(list, i, hi) END
  10810. END;
  10811. END QuickSort;
  10812. (*
  10813. ExportDesc* = RECORD
  10814. fp*: ADDRESS;
  10815. name* {UNTRACED}: DynamicName;
  10816. adr*: ADDRESS;
  10817. exports*: LONGINT;
  10818. dsc* {UNTRACED}: ExportArray
  10819. END;
  10820. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10821. *)
  10822. PROCEDURE ExportDesc2(
  10823. source: IntermediateCode.Section;
  10824. namePool: IntermediateCode.Section;
  10825. fingerPrinter: FingerPrinter.FingerPrinter;
  10826. symbol: Sections.Section;
  10827. name: StringPool.Index;
  10828. VAR patchAdr: LONGINT
  10829. ): BOOLEAN;
  10830. VAR fingerPrint: SyntaxTree.FingerPrint;
  10831. BEGIN
  10832. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10833. & (symbol.type # Sections.InlineCodeSection)
  10834. THEN
  10835. *)
  10836. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10837. & (symbol.type # Sections.InlineCodeSection))
  10838. THEN
  10839. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10840. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10841. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10842. Longint(source,fingerPrint.public);
  10843. ELSE
  10844. Longint(source, 0);
  10845. END;
  10846. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  10847. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10848. Symbol(source, symbol,0,0);
  10849. patchAdr := source.pc;
  10850. Longint(source, 0);
  10851. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  10852. Address(source,0);
  10853. END;
  10854. RETURN TRUE
  10855. ELSE
  10856. RETURN FALSE
  10857. END;
  10858. END ExportDesc2;
  10859. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10860. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10861. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10862. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  10863. nextPatch: LONGINT;
  10864. TYPE
  10865. Scope = RECORD
  10866. elements: LONGINT;
  10867. gelements: LONGINT;
  10868. section: IntermediateCode.Section;
  10869. patchAdr: LONGINT;
  10870. arraySizePC: LONGINT;
  10871. beginPC: LONGINT; (* current scope start pc *)
  10872. END;
  10873. BEGIN
  10874. Basic.InitSegmentedName(prev);
  10875. olevel := -1;
  10876. scopes[0].section := source;
  10877. scopes[0].arraySizePC := MIN(LONGINT);
  10878. FOR s := 0 TO LEN(sections)-1 DO
  10879. symbol := sections[s];
  10880. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10881. this := sections[s].name;
  10882. level := 0;
  10883. WHILE (this[level] > 0) DO
  10884. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10885. INC(level);
  10886. END;
  10887. WHILE level < olevel DO
  10888. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10889. IF olevel > 0 THEN
  10890. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10891. nextPatch := scopes[olevel-1].patchAdr+1;
  10892. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10893. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10894. END;
  10895. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10896. DEC(olevel);
  10897. END;
  10898. IF (this[level] > 0) THEN
  10899. IF level > olevel THEN
  10900. (*TRACE("opening",level); *)
  10901. IF scopes[level].section = NIL THEN
  10902. arrayName := ".@ExportArray";
  10903. Strings.AppendInt(arrayName, level);
  10904. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  10905. AddPointer(scopes[level].section,offset);
  10906. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  10907. END;
  10908. scopes[level].beginPC := scopes[level].section.pc;
  10909. olevel := level;
  10910. scopes[olevel].elements := 0;
  10911. END;
  10912. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10913. sym := sections[s];
  10914. ELSE
  10915. sym := NIL;
  10916. END;
  10917. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10918. THEN
  10919. INC(scopes[olevel].elements);
  10920. END;
  10921. (* enter string in scope *)
  10922. INC(level);
  10923. END;
  10924. END;
  10925. Basic.SegmentedNameToString(this, name);
  10926. prev := this;
  10927. END;
  10928. END;
  10929. WHILE 0 <= olevel DO
  10930. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10931. IF olevel > 0 THEN
  10932. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10933. nextPatch := scopes[olevel-1].patchAdr+1;
  10934. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10935. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10936. END;
  10937. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10938. DEC(olevel);
  10939. END;
  10940. level := 0;
  10941. WHILE (level < LEN(scopes)) DO
  10942. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  10943. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10944. END;
  10945. INC(level);
  10946. END;
  10947. END Export;
  10948. BEGIN
  10949. NEW(fingerPrinter);
  10950. NEW(poolMap, 64);
  10951. (* 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 *)
  10952. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10953. NEW(sectionArray, module.allSections.Length());
  10954. FOR i := 0 TO module.allSections.Length() - 1 DO
  10955. section := module.allSections.GetSection(i);
  10956. sectionArray[i] := section;
  10957. END;
  10958. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10959. Export(sectionArray^);
  10960. END ExportDesc;
  10961. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10962. VAR
  10963. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10964. BEGIN
  10965. Info(source, "exception table offsets array descriptor");
  10966. size := 0;
  10967. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  10968. Info(source, "exception table content");
  10969. FOR i := 0 TO module.allSections.Length() - 1 DO
  10970. p := module.allSections.GetSection(i);
  10971. IF p.type = Sections.CodeSection THEN
  10972. finallyPC := p(IntermediateCode.Section).finally;
  10973. IF finallyPC>=0 THEN
  10974. Symbol( source, p, 0,0);
  10975. Symbol( source, p, finallyPC, 0);
  10976. Symbol( source, p, finallyPC,0);
  10977. INC(size);
  10978. END;
  10979. END
  10980. END;
  10981. PatchArray(source,sizePC,size);
  10982. END ExceptionArray;
  10983. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10984. VAR i: LONGINT; ch: CHAR;
  10985. BEGIN
  10986. i := 0;
  10987. REPEAT
  10988. ch := name[i]; INC(i);
  10989. Char( section, ch);
  10990. UNTIL ch = 0X;
  10991. WHILE i < 32 DO
  10992. Char( section, 0X); INC(i);
  10993. END;
  10994. END Name;
  10995. PROCEDURE References(section: IntermediateCode.Section);
  10996. CONST
  10997. sfTypeNone = 0X;
  10998. sfTypeCHAR = 01X;
  10999. sfTypeCHAR8 = 02X;
  11000. sfTypeCHAR16 = 03X;
  11001. sfTypeCHAR32 = 04X;
  11002. sfTypeRANGE = 05X;
  11003. sfTypeSHORTINT = 06X;
  11004. sfTypeINTEGER = 07X;
  11005. sfTypeLONGINT = 08X;
  11006. sfTypeHUGEINT = 09X;
  11007. sfTypeWORD = 0AX;
  11008. sfTypeLONGWORD = 0BX;
  11009. sfTypeSIGNED8 = 0CX;
  11010. sfTypeSIGNED16 = 0DX;
  11011. sfTypeSIGNED32 = 0EX;
  11012. sfTypeSIGNED64 = 0FX;
  11013. sfTypeUNSIGNED8 = 10X;
  11014. sfTypeUNSIGNED16 = 11X;
  11015. sfTypeUNSIGNED32 = 12X;
  11016. sfTypeUNSIGNED64 = 13X;
  11017. sfTypeREAL = 14X;
  11018. sfTypeLONGREAL = 15X;
  11019. sfTypeCOMPLEX = 16X;
  11020. sfTypeLONGCOMPLEX = 17X;
  11021. sfTypeBOOLEAN = 18X;
  11022. sfTypeSET = 19X;
  11023. sfTypeANY = 1AX;
  11024. sfTypeOBJECT = 1BX;
  11025. sfTypeBYTE = 1CX;
  11026. sfTypeADDRESS = 1DX;
  11027. sfTypeSIZE = 1EX;
  11028. sfTypeIndirect = 1FX;
  11029. sfTypeRecord = 20X;
  11030. sfTypePointerToRecord = 21X;
  11031. sfTypePointerToArray = 22X;
  11032. sfTypeOpenArray = 23X;
  11033. sfTypeStaticArray = 24X;
  11034. sfTypeDynamicArray = 25X;
  11035. sfTypeMathStaticArray = 26X;
  11036. sfTypeMathOpenArray = 27X;
  11037. sfTypeMathTensor = 28X;
  11038. sfTypeDelegate = 29X;
  11039. sfTypeENUM = 2AX;
  11040. sfTypeCELL = 2BX;
  11041. sfTypePORT = 2CX;
  11042. sfIN = 0X;
  11043. sfOUT = 1X;
  11044. flagDelegate = 0;
  11045. flagConstructor = 1;
  11046. (* variable / parameter addressing modes *)
  11047. sfAbsolute = 0X; (* global vars *)
  11048. sfRelative = 1X; (* variables, value parameters *)
  11049. sfIndirect = 2X; (* var parameters *)
  11050. sfScopeBegin = 0F0X;
  11051. sfScopeEnd = 0F1X;
  11052. sfProcedure = 0F2X;
  11053. sfVariable = 0F3X;
  11054. sfTypeDeclaration = 0F4X;
  11055. sfModule = 0FFX;
  11056. RefInfo = TRUE;
  11057. VAR
  11058. s: Sections.Section; sizePC, i, startPC, lastOffset: LONGINT;
  11059. indirectTypes: Basic.HashTable;
  11060. PROCEDURE CurrentIndex(): LONGINT;
  11061. VAR i: LONGINT;
  11062. BEGIN
  11063. FOR i := startPC TO section.pc -1 DO
  11064. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  11065. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  11066. END;
  11067. startPC := section.pc;
  11068. RETURN lastOffset;
  11069. END CurrentIndex;
  11070. (*
  11071. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11072. Module = sfModule prevSymbol:SIZE name:String Scope.
  11073. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11074. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  11075. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11076. Type =
  11077. sfTypePointerToRecord
  11078. | sfTypePointerToArray Type
  11079. | sfTypeOpenArray Type
  11080. | sfTypeDynamicArray Type
  11081. | sfTypeStaticArray length:SIZE Type
  11082. | sfTypeMathOpenArray Type
  11083. | sfTypeMathStaticArray length:SIZE Type
  11084. | sfTypeMathTensor Type
  11085. | sfTypeRecord tdAdr:ADDRESS
  11086. | sfTypeDelegate {Parameter} return:Type
  11087. | sfTypePort (sfIN | sfOUT)
  11088. | sfTypeBOOLEAN
  11089. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  11090. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  11091. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  11092. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  11093. | sfTypeWORD | sfTypeLONGWORD
  11094. | sfTypeREAL | sfTypeLONGREAL
  11095. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  11096. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  11097. | sfTypeIndirect offset:SIZE.
  11098. *)
  11099. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  11100. VAR offset: SIZE;
  11101. BEGIN
  11102. IF indirectTypes.Has(type) THEN
  11103. offset := indirectTypes.GetInt(type);
  11104. Char(section, sfTypeIndirect);
  11105. Size(section, offset);
  11106. RETURN TRUE;
  11107. ELSE
  11108. indirectTypes.PutInt(type, CurrentIndex());
  11109. RETURN FALSE;
  11110. END;
  11111. END Indirect;
  11112. PROCEDURE NType(type: SyntaxTree.Type);
  11113. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  11114. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  11115. BEGIN
  11116. IF type = NIL THEN
  11117. Char(section, sfTypeNone)
  11118. ELSE
  11119. type := type.resolved;
  11120. size := type.sizeInBits;
  11121. WITH type:SyntaxTree.PointerType DO
  11122. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11123. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11124. Char(section, sfTypePointerToRecord);
  11125. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11126. ELSE
  11127. IF RefInfo THEN Info(section,"PointerToArray") END;
  11128. Char(section, sfTypePointerToArray);
  11129. NType(type.pointerBase);
  11130. END;
  11131. | type: SyntaxTree.ArrayType DO
  11132. IF ~Indirect(type) THEN
  11133. IF type.form = SyntaxTree.Open THEN
  11134. IF RefInfo THEN Info(section,"OpenArray") END;
  11135. Char(section, sfTypeOpenArray);
  11136. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11137. IF RefInfo THEN Info(section,"DynamicArray") END;
  11138. Char(section, sfTypeDynamicArray);
  11139. ELSIF type.form = SyntaxTree.Static THEN
  11140. IF RefInfo THEN Info(section,"StaticArray") END;
  11141. Char(section, sfTypeStaticArray);
  11142. Size(section, type.staticLength);
  11143. ELSE
  11144. HALT(100);
  11145. END;
  11146. NType(type.arrayBase);
  11147. END;
  11148. | type: SyntaxTree.MathArrayType DO
  11149. IF ~Indirect(type) THEN
  11150. IF type.form = SyntaxTree.Open THEN
  11151. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11152. Char(section, sfTypeMathOpenArray);
  11153. ELSIF type.form = SyntaxTree.Static THEN
  11154. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11155. Char(section, sfTypeMathStaticArray);
  11156. Size(section, type.staticLength);
  11157. ELSIF type.form = SyntaxTree.Tensor THEN
  11158. IF RefInfo THEN Info(section,"MathTensor") END;
  11159. Char(section, sfTypeMathTensor);
  11160. ELSE
  11161. HALT(100);
  11162. END;
  11163. NType(type.arrayBase);
  11164. END;
  11165. | type: SyntaxTree.RecordType DO
  11166. IF ~Indirect(type) THEN
  11167. IF type.pointerType # NIL (* OBJECT *) THEN
  11168. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11169. Char(section, sfTypePointerToRecord)
  11170. ELSE
  11171. IF RefInfo THEN Info(section,"Record") END;
  11172. Char(section, sfTypeRecord);
  11173. td := type.typeDeclaration;
  11174. IF RefInfo THEN Info(section,"TD") END;
  11175. IF (td # NIL) THEN
  11176. Global.GetSymbolSegmentedName(td,segmentedName);
  11177. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11178. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11179. ELSE
  11180. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11181. END;
  11182. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11183. Symbol(section, tir, 0, offset);
  11184. ELSE
  11185. Address(section, 0);
  11186. END;
  11187. END;
  11188. END;
  11189. | type: SyntaxTree.CellType DO
  11190. IF ~Indirect(type) THEN
  11191. IF RefInfo THEN Info(section,"Record") END;
  11192. Char(section, sfTypeRecord);
  11193. td := type.typeDeclaration;
  11194. IF RefInfo THEN Info(section,"TD") END;
  11195. IF (td # NIL) THEN
  11196. Global.GetSymbolSegmentedName(td,segmentedName);
  11197. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11198. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11199. ELSE
  11200. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11201. END;
  11202. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11203. Symbol(section, tir, 0, offset);
  11204. ELSE
  11205. Address(section, 0);
  11206. END;
  11207. END;
  11208. | type: SyntaxTree.PortType DO
  11209. Char(section, sfTypePORT);
  11210. IF type.direction = SyntaxTree.OutPort THEN
  11211. Char(section, sfOUT)
  11212. ELSE
  11213. Char(section, sfIN)
  11214. END;
  11215. | type: SyntaxTree.ProcedureType DO
  11216. IF ~Indirect(type) THEN
  11217. Char(section, sfTypeDelegate);
  11218. parameter := type.firstParameter;
  11219. WHILE(parameter # NIL) DO
  11220. NParameter(parameter, -1);
  11221. parameter := parameter.nextParameter;
  11222. END;
  11223. NType(type.returnType);
  11224. END;
  11225. | type:SyntaxTree.EnumerationType DO
  11226. Char(section, sfTypeENUM);
  11227. | type: SyntaxTree.BasicType DO
  11228. WITH type: SyntaxTree.BooleanType DO
  11229. IF RefInfo THEN Info(section,"Boolean") END;
  11230. Char(section, sfTypeBOOLEAN);
  11231. | type: SyntaxTree.CharacterType DO
  11232. IF type = module.system.characterType THEN
  11233. IF RefInfo THEN Info(section,"CHAR") END;
  11234. Char(section, sfTypeCHAR);
  11235. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11236. IF RefInfo THEN Info(section,"CHAR8") END;
  11237. Char(section, sfTypeCHAR8)
  11238. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11239. IF RefInfo THEN Info(section,"CHAR16") END;
  11240. Char(section, sfTypeCHAR16);
  11241. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11242. IF RefInfo THEN Info(section,"CHAR32") END;
  11243. Char(section, sfTypeCHAR32);
  11244. ELSE
  11245. HALT(100);
  11246. END;
  11247. |type: SyntaxTree.IntegerType DO
  11248. IF type(SyntaxTree.IntegerType).signed THEN
  11249. IF (type = module.system.shortintType) THEN
  11250. IF RefInfo THEN Info(section,"SHORTINT") END;
  11251. Char(section, sfTypeSHORTINT)
  11252. ELSIF (type = module.system.integerType) THEN
  11253. IF RefInfo THEN Info(section,"INTEGER") END;
  11254. Char(section, sfTypeINTEGER)
  11255. ELSIF (type = module.system.longintType) THEN
  11256. IF RefInfo THEN Info(section,"LONGINT") END;
  11257. Char(section, sfTypeLONGINT)
  11258. ELSIF (type = module.system.hugeintType) THEN
  11259. IF RefInfo THEN Info(section,"HUGEINT") END;
  11260. Char(section, sfTypeHUGEINT)
  11261. ELSIF (type = module.system.wordType) THEN
  11262. IF RefInfo THEN Info(section,"WORD") END;
  11263. Char(section, sfTypeWORD)
  11264. ELSIF (type = module.system.longWordType) THEN
  11265. IF RefInfo THEN Info(section,"LONGWORD") END;
  11266. Char(section, sfTypeLONGWORD);
  11267. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11268. IF RefInfo THEN Info(section,"SIGNED8") END;
  11269. Char(section, sfTypeSIGNED8)
  11270. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11271. IF RefInfo THEN Info(section,"SIGNED16") END;
  11272. Char(section, sfTypeSIGNED16)
  11273. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11274. IF RefInfo THEN Info(section,"SIGNED32") END;
  11275. Char(section, sfTypeSIGNED32)
  11276. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11277. IF RefInfo THEN Info(section,"SIGNED64") END;
  11278. Char(section, sfTypeSIGNED64)
  11279. ELSE
  11280. HALT(100);
  11281. END
  11282. ELSE (* unsigned *)
  11283. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11284. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11285. Char(section, sfTypeUNSIGNED8)
  11286. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11287. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11288. Char(section, sfTypeUNSIGNED16)
  11289. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11290. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11291. Char(section, sfTypeUNSIGNED32)
  11292. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11293. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11294. Char(section, sfTypeUNSIGNED64)
  11295. ELSE
  11296. HALT(100)
  11297. END
  11298. END;
  11299. | type: SyntaxTree.FloatType DO
  11300. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11301. IF RefInfo THEN Info(section,"REAL") END;
  11302. Char(section, sfTypeREAL);
  11303. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11304. IF RefInfo THEN Info(section,"LONGREAL") END;
  11305. Char(section, sfTypeLONGREAL);
  11306. ELSE
  11307. HALT(100);
  11308. END;
  11309. |type: SyntaxTree.ComplexType DO
  11310. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11311. IF RefInfo THEN Info(section,"COMPLEX") END;
  11312. Char(section, sfTypeCOMPLEX);
  11313. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11314. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11315. Char(section, sfTypeLONGCOMPLEX);
  11316. ELSE
  11317. HALT(100);
  11318. END;
  11319. |type:SyntaxTree.SetType DO
  11320. IF RefInfo THEN Info(section,"SET") END;
  11321. Char(section, sfTypeSET);
  11322. |type:SyntaxTree.AnyType DO
  11323. IF RefInfo THEN Info(section,"ANY") END;
  11324. Char(section, sfTypeANY);
  11325. |type:SyntaxTree.ObjectType DO
  11326. IF RefInfo THEN Info(section,"OBJECT") END;
  11327. Char(section, sfTypeOBJECT);
  11328. |type:SyntaxTree.ByteType DO
  11329. IF RefInfo THEN Info(section,"BYTE") END;
  11330. Char(section, sfTypeBYTE);
  11331. |type:SyntaxTree.RangeType DO
  11332. IF RefInfo THEN Info(section,"RANGE") END;
  11333. Char(section, sfTypeRANGE)
  11334. |type:SyntaxTree.AddressType DO
  11335. IF RefInfo THEN Info(section,"ADDRESS") END;
  11336. Char(section, sfTypeADDRESS)
  11337. |type:SyntaxTree.SizeType DO
  11338. IF RefInfo THEN Info(section,"SIZE") END;
  11339. Char(section, sfTypeSIZE)
  11340. ELSE
  11341. HALT(100)
  11342. END;
  11343. ELSE HALT(101);
  11344. END;
  11345. END;
  11346. END NType;
  11347. (*
  11348. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11349. *)
  11350. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11351. VAR pos: LONGINT; type: SyntaxTree.Type;
  11352. BEGIN
  11353. IF RefInfo THEN Info(section, "Parameter") END;
  11354. Char(section, sfVariable);
  11355. Size(section, procOffset);
  11356. String0(section, parameter.name);
  11357. type := parameter.type.resolved;
  11358. IF parameter.kind = SyntaxTree.VarParameter THEN
  11359. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11360. ELSE Char(section, sfIndirect)
  11361. END;
  11362. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11363. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11364. Char(section, sfIndirect);
  11365. ELSE
  11366. Char(section, sfRelative);
  11367. END;
  11368. ELSE
  11369. Char(section, sfRelative);
  11370. END;
  11371. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11372. NType(parameter.type);
  11373. END NParameter;
  11374. (*
  11375. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11376. *)
  11377. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11378. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11379. flags: SET;
  11380. BEGIN
  11381. IF procedure.externalName # NIL THEN RETURN END;
  11382. IF RefInfo THEN Info(section, "Procedure") END;
  11383. pos := CurrentIndex();
  11384. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11385. Char(section, sfProcedure);
  11386. Size(section, scopeOffset);
  11387. String0(section,procedure.name);
  11388. s := module.allSections.FindBySymbol(procedure);
  11389. Symbol(section,s,0,0); (* start *)
  11390. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11391. flags := {};
  11392. IF procedureType.isDelegate THEN
  11393. INCL(flags, flagDelegate);
  11394. END;
  11395. IF procedure.isConstructor THEN
  11396. INCL(flags, flagConstructor);
  11397. END;
  11398. Set(section, flags);
  11399. IF RefInfo THEN Info(section, "Parameters") END;
  11400. parameter := procedureType.firstParameter;
  11401. WHILE(parameter # NIL) DO
  11402. NParameter(parameter, pos);
  11403. parameter := parameter.nextParameter;
  11404. END;
  11405. IF procedureType.returnParameter # NIL THEN
  11406. NParameter(procedureType.returnParameter, pos);
  11407. END;
  11408. IF procedureType.selfParameter # NIL THEN
  11409. NParameter(procedureType.selfParameter, pos);
  11410. END;
  11411. IF RefInfo THEN Info(section, "ReturnType") END;
  11412. NType(procedureType.returnType);
  11413. NScope(procedure.procedureScope, pos);
  11414. END NProcedure;
  11415. (*
  11416. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11417. *)
  11418. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11419. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11420. BEGIN
  11421. IF RefInfo THEN Info(section, "Variable") END;
  11422. pos := CurrentIndex();
  11423. Char(section, sfVariable);
  11424. Size(section, scopeOffset);
  11425. String0(section, variable.name);
  11426. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11427. Char(section, sfAbsolute);
  11428. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11429. NamedSymbol(section, sn,variable, 0,0);
  11430. ELSE
  11431. Char(section, sfRelative);
  11432. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11433. END;
  11434. NType(variable.type);
  11435. s := module.allSections.FindBySymbol(variable);
  11436. END NVariable;
  11437. (*
  11438. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11439. *)
  11440. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11441. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11442. BEGIN
  11443. IF typeDeclaration = NIL THEN RETURN END;
  11444. pos := CurrentIndex();
  11445. s := module.allSections.FindBySymbol(typeDeclaration);
  11446. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11447. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11448. Char(section, sfTypeDeclaration);
  11449. Size(section, scopeOffset);
  11450. String0(section, typeDeclaration.name);
  11451. declared := typeDeclaration.declaredType.resolved;
  11452. IF (declared IS SyntaxTree.PointerType) THEN
  11453. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11454. END;
  11455. WITH declared: SyntaxTree.RecordType DO
  11456. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11457. Symbol(section, s, 0, offset);
  11458. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11459. Basic.AppendToSegmentedName(name,".@Info");
  11460. s := module.allSections.FindByName(name);
  11461. IF s # NIL THEN (* does not work for coop *)
  11462. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11463. END;
  11464. NScope(declared.recordScope, pos);
  11465. |declared: SyntaxTree.CellType DO
  11466. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11467. Symbol(section, s, 0, offset);
  11468. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11469. Basic.AppendToSegmentedName(name,".@Info");
  11470. s := module.allSections.FindByName(name);
  11471. IF s # NIL THEN
  11472. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11473. END;
  11474. NScope(declared.cellScope, pos);
  11475. ELSE
  11476. Address(section, 0);
  11477. END;
  11478. END NTypeDeclaration;
  11479. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11480. VAR pos: LONGINT;
  11481. BEGIN
  11482. pos := CurrentIndex();
  11483. Char(section,sfModule);
  11484. Size(section, prevSymbol);
  11485. String0(section, module.name);
  11486. NScope(module.moduleScope, pos);
  11487. END NModule;
  11488. (*
  11489. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11490. *)
  11491. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11492. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration; pos: LONGINT;
  11493. BEGIN
  11494. IF scope = NIL THEN RETURN END;
  11495. IF RefInfo THEN Info(section, "Scope") END;
  11496. Char(section, sfScopeBegin);
  11497. variable := scope.firstVariable;
  11498. WHILE (variable # NIL) DO
  11499. NVariable(variable, prevSymbol);
  11500. variable := variable.nextVariable;
  11501. END;
  11502. WITH scope: SyntaxTree.ModuleScope DO
  11503. bodyProcedure := scope.bodyProcedure;
  11504. |scope: SyntaxTree.RecordScope DO
  11505. bodyProcedure := scope.bodyProcedure;
  11506. ELSE
  11507. bodyProcedure := NIL;
  11508. END;
  11509. IF bodyProcedure # NIL THEN
  11510. NProcedure(bodyProcedure, prevSymbol)
  11511. END;
  11512. procedure := scope.firstProcedure;
  11513. WHILE procedure # NIL DO
  11514. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11515. procedure := procedure.nextProcedure;
  11516. END;
  11517. typeDeclaration := scope.firstTypeDeclaration;
  11518. WHILE typeDeclaration # NIL DO
  11519. NTypeDeclaration(typeDeclaration, prevSymbol);
  11520. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11521. END;
  11522. Char(section, sfScopeEnd); (* scope ends *)
  11523. END NScope;
  11524. BEGIN
  11525. NEW(indirectTypes, 32);
  11526. ArrayBlock(section,sizePC,"", FALSE);
  11527. startPC := section.pc;
  11528. NModule(module.module, -1);
  11529. PatchArray(section,sizePC,CurrentIndex());
  11530. END References;
  11531. (*
  11532. Command* = RECORD
  11533. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11534. name*: Name; (* name of the procedure *)
  11535. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11536. entryAdr* : ADDRESS; (* entry address of procedure *)
  11537. END;
  11538. *)
  11539. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11540. VAR
  11541. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11542. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11543. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11544. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11545. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11546. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11547. BEGIN
  11548. RETURN
  11549. (type = NIL) OR
  11550. (type.resolved IS SyntaxTree.RecordType) OR
  11551. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11552. (type.resolved IS SyntaxTree.AnyType);
  11553. END TypeAllowed;
  11554. BEGIN
  11555. numberParameters := procedureType.numberParameters;
  11556. RETURN
  11557. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11558. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11559. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11560. END GetProcedureAllowed;
  11561. PROCEDURE WriteType(type : SyntaxTree.Type);
  11562. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11563. name: Basic.SegmentedName; offset: LONGINT;
  11564. BEGIN
  11565. IF type = NIL THEN
  11566. Address(source,0);
  11567. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11568. Address(source,1);
  11569. ELSE
  11570. type := type.resolved;
  11571. IF type IS SyntaxTree.PointerType THEN
  11572. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11573. END;
  11574. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11575. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11576. name[0] := typeDeclaration.name; name[1] := -1;
  11577. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11578. ASSERT(section # NIL);
  11579. ELSE
  11580. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11581. (* TODO *)
  11582. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11583. END;
  11584. IF implementationVisitor.backend.cooperative THEN
  11585. offset := 0;
  11586. ELSE
  11587. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11588. END;
  11589. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11590. END;
  11591. END WriteType;
  11592. BEGIN
  11593. Info(source, "command array descriptor");
  11594. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11595. numberCommands := 0;
  11596. Info(source, "command array content");
  11597. FOR i := 0 TO module.allSections.Length() - 1 DO
  11598. p := module.allSections.GetSection(i);
  11599. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11600. procedure := p.symbol(SyntaxTree.Procedure);
  11601. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11602. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11603. procedure.GetName(name);
  11604. Name(source,name);
  11605. numberParameters := procedureType.numberParameters;
  11606. (* offset of type of first parameter *)
  11607. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11608. ELSE WriteType(procedureType.firstParameter.type)
  11609. END;
  11610. (* offset of type of return parameter *)
  11611. WriteType(procedureType.returnType);
  11612. (* command name *)
  11613. (* command code offset *)
  11614. Symbol(source,p,0,0);
  11615. INC(numberCommands);
  11616. IF Trace THEN
  11617. D.Ln;
  11618. END;
  11619. END;
  11620. END
  11621. END;
  11622. PatchArray(source,sizePC,numberCommands);
  11623. END CommandArray;
  11624. (* to prevent from double import of different module aliases *)
  11625. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11626. VAR i: SyntaxTree.Import;
  11627. BEGIN
  11628. i := module.module.moduleScope.firstImport;
  11629. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11630. i := i.nextImport;
  11631. END;
  11632. RETURN i = import
  11633. END IsFirstDirectOccurence;
  11634. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11635. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11636. BEGIN
  11637. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11638. ArrayBlock(source,pc,"", FALSE);
  11639. Info(source, "import module array data");
  11640. IF implementationVisitor.backend.cooperative THEN
  11641. offset := 0;
  11642. ELSE
  11643. IF module.system.addressType.sizeInBits = 64 THEN
  11644. (* change this when Heaps.HeapBlock is modified *)
  11645. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11646. ELSE
  11647. (* change this when Heaps.HeapBlock is modified *)
  11648. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11649. END;
  11650. END;
  11651. import := module.module.moduleScope.firstImport;
  11652. numberImports := 0;
  11653. WHILE import # NIL DO
  11654. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11655. Global.GetModuleSegmentedName(import.module,name);
  11656. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11657. NamedSymbol(source, name, NIL, 0, offset);
  11658. INC(numberImports);
  11659. END;
  11660. import := import.nextImport
  11661. END;
  11662. PatchArray(source,pc,numberImports);
  11663. END ImportsArray;
  11664. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11665. VAR
  11666. p: Sections.Section; sizePC, size, i: LONGINT;
  11667. BEGIN
  11668. Info(source, "Type info section");
  11669. size := 0;
  11670. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11671. FOR i := 0 TO module.allSections.Length() - 1 DO
  11672. p := module.allSections.GetSection(i);
  11673. WITH p: IntermediateCode.Section DO
  11674. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11675. Symbol(source,p,EmptyBlockOffset,0);
  11676. INC(size);
  11677. END;
  11678. END
  11679. END;
  11680. PatchArray(source,sizePC,size);
  11681. END TypeInfoSection;
  11682. (*
  11683. ProcTableEntry* = RECORD
  11684. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11685. noPtr*: LONGINT;
  11686. END;
  11687. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11688. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11689. *)
  11690. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11691. VAR
  11692. numberPointers: LONGINT;
  11693. procedure: SyntaxTree.Procedure;
  11694. BEGIN
  11695. Info(section,"pcFrom");
  11696. Symbol(section,procedureSection,0,0);
  11697. Info(section,"pcTo");
  11698. Symbol(section, procedureSection, procedureSection.pc, 0);
  11699. Info(section,"pointer to offsets array");
  11700. Symbol(section, section,section.pc+1,0);
  11701. Info(section,"offsets array");
  11702. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11703. PointerArray(section, procedure.procedureScope, numberPointers);
  11704. END ProcedureDescriptor;
  11705. (* only for tracing, the descriptor is otherwise not complete ! *)
  11706. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11707. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; offset: LONGINT; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11708. BEGIN
  11709. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11710. name := procedureSection.name;
  11711. Basic.AppendToSegmentedName(name,".@Info");
  11712. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11713. Address(section,0);
  11714. Symbol(section,section,2,0);
  11715. (*
  11716. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11717. descSize: SIZE;
  11718. sentinel: ADDRESS; (* = MPO-4 *)
  11719. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11720. flags*: SET;
  11721. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11722. name*: Name;
  11723. END;
  11724. *)
  11725. Size(section, 0);
  11726. Address(section,0);
  11727. Address(section,0);
  11728. Set(section,{});
  11729. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); END;
  11730. moduleSection := ModuleSection();
  11731. Symbol( section, moduleSection, moduleSection.pc,0);
  11732. IF procedureSection.symbol = NIL THEN
  11733. Basic.SegmentedNameToString(procedureSection.name, infoName);
  11734. ELSE
  11735. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  11736. END;
  11737. Name(section, infoName);
  11738. Size(section, 0);
  11739. RETURN section;
  11740. END MakeProcedureDescriptorTag;
  11741. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11742. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  11743. BEGIN
  11744. name := procedureSection.name;
  11745. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  11746. IF implementationVisitor.backend.cooperative THEN
  11747. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11748. Info(section, "TypeDescriptor");
  11749. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  11750. NamedSymbol(dest, name,NIL, 0, 0);
  11751. BaseRecord(dest);
  11752. offset := 0;
  11753. ELSIF CreateProcedureDescInfo THEN
  11754. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11755. Address(dest,0);
  11756. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  11757. offset := dest.pc;
  11758. ELSE
  11759. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  11760. END;
  11761. ProcedureDescriptor(dest, procedureSection);
  11762. Symbol(section, dest, offset, 0);
  11763. END ProcedureDescriptorPointer;
  11764. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  11765. VAR sizePC, i: LONGINT; destination: Sections.Section;
  11766. BEGIN
  11767. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  11768. numberProcs := 0;
  11769. FOR i := 0 TO module.allSections.Length() - 1 DO
  11770. destination := module.allSections.GetSection(i);
  11771. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11772. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  11773. INC(numberProcs);
  11774. END
  11775. END;
  11776. PatchArray(section, sizePC, numberProcs);
  11777. END ProcedureDescriptorArray;
  11778. (*
  11779. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11780. VAR
  11781. next*: Module; (** once a module is published, all fields are read-only *)
  11782. name*: Name;
  11783. init, published: BOOLEAN;
  11784. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11785. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  11786. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11787. command*: POINTER TO ARRAY OF Command;
  11788. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11789. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11790. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11791. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11792. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11793. data*, code*: Bytes;
  11794. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11795. export*: ExportDesc;
  11796. term*: TerminationHandler;
  11797. exTable*: ExceptionTable;
  11798. noProcs*: LONGINT;
  11799. firstProc*: ADDRESS; <- done by loader
  11800. maxPtrs*: LONGINT;
  11801. crc*: LONGINT;
  11802. *)
  11803. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11804. BEGIN
  11805. Info(section, "cycle");
  11806. Size(section,0);
  11807. Info(section, "references");
  11808. Size(section,0);
  11809. Info(section, "nextMarked");
  11810. Address(section,0);
  11811. Info(section, "nextWatched");
  11812. Address(section,0);
  11813. END BasePointer;
  11814. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11815. BEGIN
  11816. BasePointer(section);
  11817. Info(section, "action");
  11818. Address(section,0);
  11819. Info(section, "monitor");
  11820. Address(section,0);
  11821. END BaseObject;
  11822. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  11823. BEGIN
  11824. BasePointer(section);
  11825. Info(section, "action");
  11826. Address(section,0);
  11827. Info(section, "monitor");
  11828. Address(section,0);
  11829. END BaseRecord;
  11830. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  11831. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  11832. pooledName: Basic.SegmentedName;
  11833. symbol: SyntaxTree.Symbol;
  11834. BEGIN
  11835. Global.GetModuleName(module.module,name);
  11836. Strings.Append(name,".@Module.@Descriptor");
  11837. Basic.ToSegmentedName(name, pooledName);
  11838. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11839. Symbol(section,descriptorSection,0,0);
  11840. Info(descriptorSection, "descriptor");
  11841. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11842. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  11843. Address(descriptorSection,0);
  11844. Global.GetModuleName(module.module,name);
  11845. Strings.Append(name,".@Trace");
  11846. Basic.ToSegmentedName(name, pooledName);
  11847. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11848. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  11849. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11850. END ModuleDescriptor;
  11851. PROCEDURE ModuleSection(): IntermediateCode.Section;
  11852. VAR name: ARRAY 128 OF CHAR;
  11853. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  11854. symbol: SyntaxTree.Symbol;
  11855. BEGIN
  11856. ASSERT(implementationVisitor.backend.newObjectFile);
  11857. Global.GetModuleName(module.module,name);
  11858. Strings.Append(name,".@Module");
  11859. Basic.ToSegmentedName(name, pooledName);
  11860. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11861. moduleSection.SetExported(TRUE);
  11862. IF moduleSection.pc = 0 THEN
  11863. IF implementationVisitor.backend.cooperative THEN
  11864. Info(moduleSection, "descriptor");
  11865. ModuleDescriptor(moduleSection);
  11866. BaseObject(moduleSection);
  11867. implementationVisitor.CreateTraceModuleMethod(module.module);
  11868. ELSE
  11869. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  11870. Info(moduleSection, "HeapBlock");
  11871. Symbol(moduleSection,moduleSection,2,0);
  11872. Info(moduleSection, "TypeDescriptor");
  11873. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11874. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  11875. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  11876. END;
  11877. END;
  11878. RETURN moduleSection;
  11879. END ModuleSection;
  11880. PROCEDURE NewModuleInfo();
  11881. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11882. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11883. sectionName: Basic.SectionName;
  11884. CONST MPO=-40000000H;
  11885. BEGIN
  11886. (*
  11887. TypeDesc* = POINTER TO RECORD
  11888. descSize: SIZE;
  11889. sentinel: LONGINT; (* = MPO-4 *)
  11890. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11891. flags*: SET;
  11892. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11893. name*: Name;
  11894. refsOffset: SIZE;
  11895. END;
  11896. *)
  11897. (*name is missing prefixes sometimes*)
  11898. Global.GetModuleSegmentedName(module.module,name);
  11899. Basic.AppendToSegmentedName(name,".@Info");
  11900. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11901. IF ~implementationVisitor.backend.cooperative THEN
  11902. Info(source, "HeapBlock");
  11903. Address(source,0); (* an empty heap block prevents GC marking *)
  11904. Info(source, "TypeDescriptor");
  11905. Address(source,0);
  11906. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  11907. END;
  11908. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11909. Address(source,MPO-4);
  11910. Info(source, "type tag pointer");
  11911. Address( source,0);
  11912. Info(source, "type flags");
  11913. flags := {};
  11914. Set( source, flags);
  11915. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  11916. Info(source, "pointer to module");
  11917. moduleSection := ModuleSection();
  11918. Symbol( source, moduleSection, moduleSection.pc,0);
  11919. Info(source, "type name");
  11920. i := 0;
  11921. sectionName := "@Self";
  11922. (*
  11923. Global.GetSymbolSegmentedName(td,name);
  11924. Basic.SegmentedNameToString(name, sectionName);
  11925. *)
  11926. Name(source,sectionName);
  11927. source.SetReferenced(FALSE);
  11928. patchInfoPC := source.pc;
  11929. Size(source, 0);
  11930. END NewModuleInfo;
  11931. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  11932. VAR
  11933. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  11934. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  11935. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  11936. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, maxPointers, numberProcs,temp,
  11937. referenceSectionOffset : LONGINT;
  11938. name: Basic.SegmentedName; offset: LONGINT;
  11939. flags: SET;
  11940. BEGIN
  11941. NewModuleInfo();
  11942. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  11943. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  11944. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  11945. ImportsArray(importSection);
  11946. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  11947. CommandArray(commandsSection);
  11948. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  11949. ExceptionArray(exceptionSection);
  11950. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  11951. AddPointer(typeInfoSection, typeInfoSectionOffset);
  11952. TypeInfoSection(typeInfoSection);
  11953. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  11954. References(referenceSection);
  11955. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  11956. ProcedureDescriptorArray(procTableSection, numberProcs);
  11957. IF ProtectModulesPointers THEN
  11958. name := "Heaps.AnyPtr";
  11959. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  11960. (* set base pointer *)
  11961. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  11962. END;
  11963. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  11964. ArrayBlock(emptyArraySection,temp,"", FALSE);
  11965. moduleSection := ModuleSection();
  11966. Info(moduleSection, "nextRoot*: RootObject");
  11967. Address(moduleSection,0);
  11968. Info(moduleSection, "next*: Module");
  11969. Address(moduleSection,0);
  11970. Info(moduleSection, "name*: Name");
  11971. Name(moduleSection,moduleName);
  11972. Info(moduleSection, "init, published: BOOLEAN");
  11973. Boolean(moduleSection,FALSE);
  11974. Boolean(moduleSection,FALSE);
  11975. Info(moduleSection,"filler"); (*! introduce alignment! *)
  11976. Boolean(moduleSection,FALSE);
  11977. Boolean(moduleSection,FALSE);
  11978. Info(moduleSection, "refcnt*: LONGINT");
  11979. Longint(moduleSection,0);
  11980. Info(moduleSection, "sb*: ADDRESS");
  11981. Address(moduleSection,0);
  11982. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  11983. Address(moduleSection,0);
  11984. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  11985. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  11986. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  11987. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  11988. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  11989. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  11990. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  11991. Symbol(moduleSection,importSection,importSectionOffset,0);
  11992. Info(moduleSection, "procTable*: ProcTable");
  11993. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  11994. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  11995. Address(moduleSection,0);
  11996. Address(moduleSection,0);
  11997. Address(moduleSection,0);
  11998. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  11999. Info(moduleSection, "export*: ExportDesc");
  12000. ExportDesc(moduleSection);
  12001. Info(moduleSection, "term*: TerminationHandler");
  12002. Address(moduleSection,0);
  12003. Info(moduleSection, "exTable*: ExceptionTable");
  12004. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  12005. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  12006. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  12007. Info(moduleSection, "crc*: LONGINT");
  12008. patchCRC:= moduleSection.pc;
  12009. Longint(moduleSection, 0); (*! must be implemented *)
  12010. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  12011. Info(moduleSection, "body*: ADDRESS");
  12012. Symbol(moduleSection, bodyProc, 0,0);
  12013. Info(moduleSection, "module flags");
  12014. flags := {};
  12015. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  12016. Set( moduleSection, flags);
  12017. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END;
  12018. IF implementationVisitor.backend.cooperative THEN
  12019. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  12020. Info(moduleSection, "monitor.owner");
  12021. Address(moduleSection,0);
  12022. Info(moduleSection, "monitor.nestingLevel");
  12023. Address(moduleSection,0);
  12024. Info(moduleSection, "monitor.blockedQueue");
  12025. Address(moduleSection,0); Address(moduleSection,0);
  12026. Info(moduleSection, "monitor.waitingQueue");
  12027. Address(moduleSection,0); Address(moduleSection,0);
  12028. Info(moduleSection, "monitor.waitingSentinel");
  12029. Address(moduleSection,0);
  12030. END;
  12031. END Module;
  12032. PROCEDURE PatchCRC(crc: LONGINT);
  12033. BEGIN
  12034. IF implementationVisitor.newObjectFile & ~simple THEN
  12035. PatchLongint(ModuleSection(), patchCRC, crc);
  12036. END;
  12037. END PatchCRC;
  12038. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  12039. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  12040. BEGIN
  12041. ArrayBlock(source,pc,"",FALSE);
  12042. Info(source, "pointer offsets array data");
  12043. IF scope IS SyntaxTree.RecordScope THEN
  12044. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  12045. ELSIF scope IS SyntaxTree.CellScope THEN
  12046. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  12047. ELSIF scope IS SyntaxTree.ModuleScope THEN
  12048. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  12049. WHILE variable # NIL DO
  12050. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12051. symbol := module.allSections.FindBySymbol(variable);
  12052. ASSERT(symbol # NIL);
  12053. Pointers(0,symbol, source,variable.type,numberPointers);
  12054. END;
  12055. variable := variable.nextVariable;
  12056. END;
  12057. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  12058. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12059. WHILE parameter # NIL DO
  12060. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12061. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  12062. END;
  12063. parameter := parameter.nextParameter;
  12064. END;
  12065. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  12066. parametersSize := ProcedureParametersSize(module.system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  12067. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12068. IF implementationVisitor.backend.preciseGC THEN
  12069. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12070. END;
  12071. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  12072. END;
  12073. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  12074. WHILE(variable # NIL) DO
  12075. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12076. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  12077. END;
  12078. variable := variable.nextVariable
  12079. END;
  12080. END;
  12081. PatchArray(source,pc,numberPointers);
  12082. END PointerArray;
  12083. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  12084. VAR
  12085. name: Basic.SegmentedName;
  12086. section: IntermediateCode.Section;
  12087. BEGIN
  12088. ASSERT(implementationVisitor.newObjectFile);
  12089. Global.GetSymbolSegmentedName(symbol,name);
  12090. Basic.AppendToSegmentedName(name,suffix);
  12091. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL,declarationVisitor.dump);
  12092. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  12093. Info(section, "HeapBlock");
  12094. Address(section,0); (* empty such that GC does not go on traversing *)
  12095. Info(section, suffix);
  12096. Address(section,0);
  12097. pc := section.pc;
  12098. RETURN section;
  12099. END SymbolSection;
  12100. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  12101. VAR recordType: SyntaxTree.RecordType;
  12102. tir, tdInfo: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  12103. section: Sections.Section; cellType: SyntaxTree.CellType;
  12104. tdInfoOffset: LONGINT;
  12105. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  12106. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12107. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12108. sectionName: Basic.SectionName;
  12109. CONST MPO=-40000000H;
  12110. BEGIN
  12111. (*
  12112. TypeDesc* = POINTER TO RECORD
  12113. descSize: SIZE;
  12114. sentinel: LONGINT; (* = MPO-4 *)
  12115. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12116. flags*: SET;
  12117. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12118. name*: Name;
  12119. refsOffset: SIZE;
  12120. END;
  12121. *)
  12122. (* source := module.sections.FindByName(...) *)
  12123. Global.GetSymbolSegmentedName(td,name);
  12124. Basic.AppendToSegmentedName(name,".@Info");
  12125. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12126. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12127. Address(source,0);
  12128. Info(source, "TypeDescriptor");
  12129. Address(source,0);
  12130. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12131. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12132. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12133. Info(source, "type tag pointer");
  12134. Symbol( source, tag, offset, 0);
  12135. Info(source, "type flags");
  12136. flags := {};
  12137. IF isProtected THEN INCL(flags,31) END;
  12138. Set( source, flags);
  12139. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  12140. Info(source, "pointer to module");
  12141. moduleSection := ModuleSection();
  12142. Symbol( source, moduleSection, moduleSection.pc,0);
  12143. Info(source, "type name");
  12144. i := 0;
  12145. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12146. (*
  12147. Global.GetSymbolSegmentedName(td,name);
  12148. Basic.SegmentedNameToString(name, sectionName);
  12149. *)
  12150. Name(source,sectionName);
  12151. source.SetReferenced(FALSE);
  12152. Size(source, 0);
  12153. RETURN source;
  12154. END NewTypeDescriptorInfo;
  12155. PROCEDURE NewTypeDescriptor;
  12156. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12157. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12158. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12159. numberPointers: LONGINT; padding, i, tdInfoOffset: LONGINT;
  12160. CONST MPO=-40000000H;
  12161. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12162. VAR i: LONGINT;
  12163. PROCEDURE Td(record: SyntaxTree.RecordType);
  12164. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12165. BEGIN
  12166. IF record # NIL THEN
  12167. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12168. baseTD := record.typeDeclaration;
  12169. Global.GetSymbolSegmentedName(baseTD,name);
  12170. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12171. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12172. ELSE
  12173. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12174. END;
  12175. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12176. Symbol(source, tir, 0, offset);
  12177. IF reverse THEN Td(record.GetBaseRecord()) END;
  12178. END;
  12179. END Td;
  12180. BEGIN
  12181. Info(source, "tag table");
  12182. baseRecord := recordType;
  12183. i := 0;
  12184. WHILE baseRecord # NIL DO
  12185. INC(i);
  12186. baseRecord := baseRecord.GetBaseRecord();
  12187. END;
  12188. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12189. IF ~reverse THEN Td(recordType) END;
  12190. WHILE i < size DO
  12191. Address(source,0);
  12192. INC(i);
  12193. END;
  12194. IF reverse THEN Td(recordType) END;
  12195. END TdTable;
  12196. PROCEDURE MethodTable(reverse: BOOLEAN);
  12197. VAR i,methods: LONGINT;
  12198. BEGIN
  12199. Info(source, "method table");
  12200. IF recordType # NIL THEN
  12201. methods := recordType.recordScope.numberMethods;
  12202. IF reverse THEN
  12203. FOR i := methods-1 TO 0 BY -1 DO
  12204. procedure := recordType.recordScope.FindMethod(i);
  12205. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12206. NamedSymbol(source, name,procedure, 0,0);
  12207. END;
  12208. ELSE
  12209. FOR i := 0 TO methods-1 DO
  12210. procedure := recordType.recordScope.FindMethod(i);
  12211. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12212. NamedSymbol(source, name,procedure, 0,0);
  12213. END;
  12214. END;
  12215. END;
  12216. END MethodTable;
  12217. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12218. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12219. BEGIN
  12220. Info(source, "method table");
  12221. baseRecord := recordType;
  12222. WHILE baseRecord.baseType # NIL DO
  12223. baseRecord := baseRecord.GetBaseRecord ();
  12224. END;
  12225. GetRecordTypeName (baseRecord, name);
  12226. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12227. IF name = stackFrame THEN
  12228. start := 0;
  12229. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12230. baseRecord := recordType;
  12231. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12232. baseRecord := baseRecord.GetBaseRecord ();
  12233. END;
  12234. IF baseRecord # NIL THEN
  12235. GetRecordTypeName (baseRecord, name);
  12236. IF pointer & ~baseRecord.isObject THEN
  12237. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12238. END;
  12239. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12240. ELSIF recordType.isObject THEN
  12241. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12242. ELSIF pointer THEN
  12243. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12244. ELSE
  12245. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12246. END;
  12247. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12248. Symbol(source, tir, 0, 0);
  12249. start := 0;
  12250. baseRecord := recordType;
  12251. WHILE (baseRecord # NIL) DO
  12252. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12253. baseRecord := baseRecord.GetBaseRecord ();
  12254. END;
  12255. ELSE
  12256. (* explicit trace method: *)
  12257. procedure := recordType.recordScope.FindMethod(0);
  12258. IF ~procedure.isFinalizer THEN
  12259. Global.GetSymbolSegmentedName(procedure, name);
  12260. NamedSymbol(source, name,procedure, 0,0);
  12261. END;
  12262. start := 1;
  12263. END;
  12264. IF (name # stackFrame) & recordType.isObject THEN
  12265. baseRecord := recordType;
  12266. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12267. baseRecord := baseRecord.GetBaseRecord ();
  12268. END;
  12269. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12270. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12271. ELSE
  12272. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12273. END;
  12274. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12275. Symbol(source, tir, 0, 0);
  12276. END;
  12277. methods := recordType.recordScope.numberMethods;
  12278. FOR i := start TO methods-1 DO
  12279. procedure := recordType.recordScope.FindMethod(i);
  12280. IF ~procedure.isFinalizer THEN
  12281. Global.GetSymbolSegmentedName(procedure, name);
  12282. NamedSymbol(source, name,procedure, 0,0);
  12283. END;
  12284. END;
  12285. END CooperativeMethodTable;
  12286. BEGIN
  12287. Global.GetSymbolSegmentedName(td,name);
  12288. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12289. source.SetExported(IsExported(td));
  12290. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12291. IF implementationVisitor.backend.cooperative THEN
  12292. base := NIL;
  12293. baseRecord := recordType.GetBaseRecord();
  12294. IF baseRecord # NIL THEN
  12295. baseTD := baseRecord.typeDeclaration;
  12296. END;
  12297. IF ~recordType.isObject THEN
  12298. Info(source, "parent");
  12299. IF baseRecord # NIL THEN
  12300. Global.GetSymbolSegmentedName(baseTD,name);
  12301. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12302. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12303. ELSE
  12304. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12305. END;
  12306. Symbol(source, tir, 0, 0);
  12307. ELSE
  12308. Address(source,0);
  12309. END;
  12310. Info(source, "record size");
  12311. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12312. source.SetReferenced(FALSE);
  12313. CooperativeMethodTable(FALSE);
  12314. base := source;
  12315. Global.GetSymbolSegmentedName(td,name);
  12316. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12317. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12318. source.SetExported(IsExported(td));
  12319. source.SetReferenced(FALSE);
  12320. END;
  12321. Info(source, "parent");
  12322. IF baseRecord # NIL THEN
  12323. Global.GetSymbolSegmentedName(baseTD,name);
  12324. sym := baseTD;
  12325. IF ~recordType.isObject THEN
  12326. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12327. sym := NIL;
  12328. END;
  12329. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12330. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12331. ELSE
  12332. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12333. END;
  12334. Symbol(source, tir, 0, 0);
  12335. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12336. Address(source,0);
  12337. ELSE
  12338. IF recordType.isObject THEN
  12339. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12340. ELSE
  12341. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12342. END;
  12343. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12344. Symbol(source, tir, 0, 0);
  12345. END;
  12346. Info(source, "base record descriptor");
  12347. Symbol(source, base, 0, 0);
  12348. CooperativeMethodTable(TRUE);
  12349. source.SetReferenced(FALSE);
  12350. IF recordType.hasPointers THEN
  12351. IF ~HasExplicitTraceMethod (recordType) THEN
  12352. implementationVisitor.CreateTraceMethod(recordType);
  12353. END;
  12354. implementationVisitor.CreateResetProcedure(recordType);
  12355. implementationVisitor.CreateAssignProcedure(recordType);
  12356. END;
  12357. ELSIF ~simple THEN
  12358. (*
  12359. MethodEnd = MPO
  12360. ---
  12361. methods (# methods)
  12362. ---
  12363. tags (16)
  12364. ---
  12365. TypeDesc = TypeInfoAdr
  12366. ---
  12367. td adr ---> rec size
  12368. ----
  12369. pointer offsets
  12370. ----
  12371. (padding)
  12372. -----
  12373. empty [2 addresses aligned]
  12374. empty
  12375. empty
  12376. numPtrs
  12377. ---
  12378. pointer offsets
  12379. ---
  12380. *)
  12381. Info(source, "MethodEnd = MPO");
  12382. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12383. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12384. MethodTable(TRUE);
  12385. TdTable(TypeTags, TRUE);
  12386. Info(source, "type descriptor info pointer");
  12387. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12388. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12389. IF (cellType # NIL) THEN
  12390. IF cellType.sizeInBits < 0 THEN
  12391. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12392. END;
  12393. Info(source, "cell size");
  12394. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12395. ELSE
  12396. Info(source, "record size");
  12397. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12398. END;
  12399. Info(source, "pointer offsets pointer");
  12400. padding := 1- source.pc MOD 2;
  12401. Symbol(source, source, source.pc+1+padding,0);
  12402. IF padding >0 THEN
  12403. Info(source, "padding");
  12404. FOR i := 1 TO padding DO Address(source,0) END;
  12405. END;
  12406. IF cellType # NIL THEN
  12407. PointerArray(source, cellType.cellScope, numberPointers);
  12408. ELSE
  12409. PointerArray(source, recordType.recordScope, numberPointers);
  12410. END;
  12411. ELSE
  12412. (*
  12413. simple:
  12414. td adr --> size
  12415. tag(1)
  12416. tag(2)
  12417. tag(3)
  12418. methods ->
  12419. *)
  12420. Info(source, "record size");
  12421. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12422. TdTable(TypeTags, FALSE);
  12423. MethodTable(FALSE);
  12424. source.SetReferenced(FALSE);
  12425. END;
  12426. END NewTypeDescriptor;
  12427. BEGIN
  12428. x := x.resolved;
  12429. IF (x IS SyntaxTree.PointerType) THEN
  12430. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12431. END;
  12432. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12433. recordType := x(SyntaxTree.RecordType);
  12434. td := x.typeDeclaration;
  12435. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12436. ASSERT(td # NIL);
  12437. section := module.allSections.FindBySymbol(td); (* TODO *)
  12438. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12439. IF implementationVisitor.newObjectFile THEN
  12440. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12441. NewTypeDescriptor
  12442. END;
  12443. ELSE
  12444. (* data section in intermediate code *)
  12445. Global.GetSymbolSegmentedName(td,name);
  12446. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  12447. Basic.SuffixSegmentedName (name, module.module.name);
  12448. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  12449. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  12450. tir.Emit(Data(Basic.invalidPosition,op));
  12451. END;
  12452. END;
  12453. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12454. cellType := x(SyntaxTree.CellType);
  12455. td := x.typeDeclaration;
  12456. section := module.allSections.FindBySymbol(td); (* TODO *)
  12457. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12458. IF implementationVisitor.newObjectFile THEN
  12459. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12460. NewTypeDescriptor
  12461. END;
  12462. END;
  12463. END;
  12464. END
  12465. END CheckTypeDeclaration
  12466. END MetaDataGenerator;
  12467. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12468. VAR
  12469. trace-: BOOLEAN;
  12470. traceString-: SyntaxTree.IdentifierString;
  12471. traceModuleName-: SyntaxTree.IdentifierString;
  12472. newObjectFile-: BOOLEAN;
  12473. profile-: BOOLEAN;
  12474. noRuntimeChecks: BOOLEAN;
  12475. simpleMetaData-: BOOLEAN;
  12476. noAsserts: BOOLEAN;
  12477. optimize-: BOOLEAN;
  12478. cooperative-: BOOLEAN;
  12479. preregisterStatic-: BOOLEAN;
  12480. dump-: Basic.Writer;
  12481. cellsAreObjects: BOOLEAN;
  12482. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12483. experiment: BOOLEAN;
  12484. PROCEDURE &InitIntermediateBackend*;
  12485. BEGIN
  12486. simpleMetaData := FALSE;
  12487. newObjectFile := FALSE;
  12488. InitBackend;
  12489. SetRuntimeModuleName(DefaultRuntimeModuleName);
  12490. SetTraceModuleName(DefaultTraceModuleName);
  12491. END InitIntermediateBackend;
  12492. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12493. VAR
  12494. declarationVisitor: DeclarationVisitor;
  12495. implementationVisitor: ImplementationVisitor;
  12496. module: Sections.Module;
  12497. name, platformName: SyntaxTree.IdentifierString;
  12498. meta: MetaDataGenerator;
  12499. crc: CRC.CRC32Stream;
  12500. BEGIN
  12501. ResetError;
  12502. Global.GetSymbolName(x,name);
  12503. NEW(module,x,system); (* backend structures *)
  12504. Global.GetModuleName(x, name);
  12505. module.SetModuleName(name);
  12506. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  12507. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12508. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12509. declarationVisitor.Module(x,module);
  12510. IF newObjectFile & ~meta.simple THEN
  12511. meta.Module(implementationVisitor.moduleBodySection);
  12512. END;
  12513. GetDescription(platformName);
  12514. module.SetPlatformName(platformName);
  12515. IF newObjectFile THEN
  12516. NEW(crc);
  12517. module.allSections.WriteRaw(crc);
  12518. crc.Update;
  12519. meta.PatchCRC(crc.GetCRC());
  12520. END;
  12521. RETURN module
  12522. END GenerateIntermediate;
  12523. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12524. BEGIN RETURN TRUE
  12525. END SupportedImmediate;
  12526. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12527. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12528. END ProcessSyntaxTreeModule;
  12529. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12530. VAR
  12531. result: Sections.Module;
  12532. traceName: Basic.MessageString;
  12533. BEGIN
  12534. ASSERT(intermediateCodeModule IS Sections.Module);
  12535. result := intermediateCodeModule(Sections.Module);
  12536. IF trace THEN
  12537. traceName := "intermediate code trace: ";
  12538. Strings.Append(traceName,traceString);
  12539. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12540. IF (traceString="") OR (traceString="*") THEN
  12541. result.Dump(dump);
  12542. dump.Update
  12543. ELSE
  12544. Sections.DumpFiltered(dump, result, traceString);
  12545. END
  12546. END;
  12547. RETURN result
  12548. END ProcessIntermediateCodeModule;
  12549. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12550. BEGIN instructionSet := "Intermediate";
  12551. END GetDescription;
  12552. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  12553. BEGIN
  12554. SELF.newObjectFile := newObjectFile;
  12555. SELF.simpleMetaData := simpleMetaData;
  12556. END SetNewObjectFile;
  12557. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12558. BEGIN COPY(name, traceModuleName)
  12559. END SetTraceModuleName;
  12560. PROCEDURE DefineOptions(options: Options.Options);
  12561. BEGIN
  12562. DefineOptions^(options);
  12563. options.Add(0X,"trace",Options.String);
  12564. options.Add(0X,"runtime",Options.String);
  12565. options.Add(0X,"newObjectFile",Options.Flag);
  12566. options.Add(0X,"traceModule",Options.String);
  12567. options.Add(0X,"profile",Options.Flag);
  12568. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12569. options.Add(0X,"noAsserts",Options.Flag);
  12570. options.Add(0X,"metaData",Options.String);
  12571. options.Add('o',"optimize", Options.Flag);
  12572. options.Add(0X,"preregisterStatic", Options.Flag);
  12573. options.Add(0X,"cellsAreObjects", Options.Flag);
  12574. options.Add(0X,"preciseGC", Options.Flag);
  12575. options.Add(0X,"trackLeave", Options.Flag);
  12576. options.Add(0X,"writeBarriers", Options.Flag);
  12577. options.Add(0X,"experiment", Options.Flag);
  12578. END DefineOptions;
  12579. PROCEDURE GetOptions(options: Options.Options);
  12580. VAR name,string: SyntaxTree.IdentifierString;
  12581. BEGIN
  12582. GetOptions^(options);
  12583. trace := options.GetString("trace",traceString);
  12584. profile := options.GetFlag("profile");
  12585. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12586. noAsserts := options.GetFlag("noAsserts");
  12587. cooperative := options.GetFlag("cooperative");
  12588. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  12589. IF cooperative THEN
  12590. SetRuntimeModuleName("CPU") END
  12591. END;
  12592. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12593. simpleMetaData := TRUE
  12594. END;
  12595. IF options.GetString("metaData",string) THEN
  12596. IF string = "simple" THEN simpleMetaData := TRUE
  12597. ELSIF string ="full" THEN simpleMetaData := FALSE
  12598. END;
  12599. END;
  12600. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  12601. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12602. optimize := options.GetFlag("optimize");
  12603. preregisterStatic := options.GetFlag("preregisterStatic");
  12604. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12605. preciseGC := options.GetFlag("preciseGC");
  12606. trackLeave := options.GetFlag("trackLeave");
  12607. writeBarriers := options.GetFlag("writeBarriers");
  12608. experiment := options.GetFlag("experiment");
  12609. END GetOptions;
  12610. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  12611. BEGIN RETURN SymbolFileFormat.Get()
  12612. END DefaultSymbolFileFormat;
  12613. END IntermediateBackend;
  12614. (* ----------------------------------- register allocation ------------------------------------- *)
  12615. (* register mapping scheme
  12616. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12617. spill offset
  12618. part(n) --> ticket <--> physical register
  12619. spill offset
  12620. *)
  12621. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12622. emptyOperand: IntermediateCode.Operand;
  12623. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12624. statCoopResetVariables: LONGINT;
  12625. statCoopModifyAssignments: LONGINT;
  12626. modifyAssignmentsPC : LONGINT;
  12627. statCoopNilCheck: LONGINT;
  12628. statCoopSwitch: LONGINT;
  12629. statCoopAssignProcedure: LONGINT;
  12630. statCoopTraceMethod: LONGINT;
  12631. statCoopResetProcedure: LONGINT;
  12632. statCoopTraceModule: LONGINT;
  12633. PROCEDURE ResetStatistics*;
  12634. BEGIN
  12635. statCoopResetVariables := 0;
  12636. statCoopModifyAssignments := 0;
  12637. statCoopNilCheck:= 0;
  12638. statCoopSwitch:= 0;
  12639. statCoopAssignProcedure:= 0;
  12640. statCoopTraceMethod:= 0;
  12641. statCoopResetProcedure:= 0;
  12642. statCoopTraceModule:= 0;
  12643. END ResetStatistics;
  12644. PROCEDURE Statistics*;
  12645. BEGIN
  12646. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12647. TRACE(statCoopNilCheck, statCoopSwitch);
  12648. TRACE(statCoopAssignProcedure,
  12649. statCoopTraceMethod,
  12650. statCoopResetProcedure,
  12651. statCoopTraceModule)
  12652. END Statistics;
  12653. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12654. VAR h: LONGINT;
  12655. BEGIN
  12656. WHILE b # 0 DO
  12657. h := a MOD b;
  12658. a := b;
  12659. b := h;
  12660. END;
  12661. RETURN a
  12662. END GCD;
  12663. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12664. BEGIN
  12665. RETURN a*b DIV GCD(a,b)
  12666. END SCM;
  12667. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12668. BEGIN
  12669. (*TRACE(a,b);*)
  12670. IF a = 0 THEN RETURN b
  12671. ELSIF b = 0 THEN RETURN a
  12672. ELSE RETURN SCM(a,b)
  12673. END;
  12674. END CommonAlignment;
  12675. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  12676. BEGIN
  12677. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12678. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12679. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  12680. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12681. 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)
  12682. END
  12683. END PassBySingleReference;
  12684. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  12685. BEGIN
  12686. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  12687. END PassInRegister;
  12688. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12689. VAR new: RegisterEntry;
  12690. BEGIN
  12691. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12692. IF queue = NIL THEN
  12693. queue := new
  12694. ELSE
  12695. new.next := queue;
  12696. IF queue#NIL THEN queue.prev := new END;
  12697. queue := new
  12698. END;
  12699. END AddRegisterEntry;
  12700. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12701. VAR this: RegisterEntry;
  12702. BEGIN
  12703. this := queue;
  12704. WHILE (this # NIL) & (this.register # register) DO
  12705. this := this.next;
  12706. END;
  12707. IF this = NIL THEN
  12708. RETURN FALSE
  12709. END;
  12710. ASSERT(this # NIL);
  12711. IF this = queue THEN queue := queue.next END;
  12712. IF this.prev # NIL THEN this.prev.next := this.next END;
  12713. IF this.next # NIL THEN this.next.prev := this.prev END;
  12714. RETURN TRUE
  12715. END RemoveRegisterEntry;
  12716. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12717. BEGIN ASSERT(cond);
  12718. END Assert;
  12719. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12720. BEGIN
  12721. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12722. END ReusableRegister;
  12723. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12724. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12725. BEGIN
  12726. procedure := moduleScope.bodyProcedure;
  12727. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12728. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12729. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12730. procedure.SetScope(moduleScope);
  12731. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12732. procedure.SetAccess(SyntaxTree.Hidden);
  12733. moduleScope.SetBodyProcedure(procedure);
  12734. moduleScope.AddProcedure(procedure);
  12735. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12736. END;
  12737. END EnsureBodyProcedure;
  12738. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12739. VAR import: SyntaxTree.Import;
  12740. selfName: SyntaxTree.IdentifierString;
  12741. module: SyntaxTree.Module;
  12742. BEGIN
  12743. scope.ownerModule.GetName(selfName);
  12744. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12745. module := scope.ownerModule
  12746. ELSE
  12747. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12748. IF import = NIL THEN
  12749. RETURN NIL
  12750. ELSIF import.module = NIL THEN
  12751. RETURN NIL
  12752. ELSE module := import.module
  12753. END;
  12754. END;
  12755. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12756. END GetSymbol;
  12757. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12758. BEGIN
  12759. op.mode := mode;
  12760. IntermediateCode.InitOperand(op.op);
  12761. IntermediateCode.InitOperand(op.tag);
  12762. IntermediateCode.InitOperand(op.extra);
  12763. op.dimOffset := 0;
  12764. END InitOperand;
  12765. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12766. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12767. BEGIN RETURN IntermediateCode.GetType(system, type)
  12768. END GetType;
  12769. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12770. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12771. BEGIN
  12772. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12773. (*
  12774. UniqueId(name,module,name,adr);
  12775. *)
  12776. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  12777. constant.SetValue(value);
  12778. constant.SetAccess(SyntaxTree.Hidden);
  12779. module.moduleScope.AddConstant(constant);
  12780. constant.SetScope(module.moduleScope);
  12781. RETURN constant
  12782. END BuildConstant;
  12783. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12784. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12785. BEGIN
  12786. variable := scope.firstVariable;
  12787. WHILE variable # NIL DO
  12788. IF variable.NeedsTrace() THEN
  12789. RETURN TRUE;
  12790. END;
  12791. variable := variable.nextVariable;
  12792. END;
  12793. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12794. WHILE parameter # NIL DO
  12795. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12796. RETURN TRUE;
  12797. END;
  12798. parameter := parameter.nextParameter;
  12799. END;
  12800. RETURN FALSE;
  12801. END HasPointers;
  12802. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12803. BEGIN RETURN (parameter.kind = SyntaxTree.VarParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ((parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) OR (parameter.type.resolved IS SyntaxTree.MathArrayType));
  12804. END IsVariableParameter;
  12805. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12806. VAR parameter: SyntaxTree.Parameter;
  12807. BEGIN
  12808. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12809. WHILE parameter # NIL DO
  12810. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12811. IF parameter.movable THEN RETURN TRUE END;
  12812. parameter := parameter.nextParameter;
  12813. END;
  12814. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12815. END HasVariableParameters;
  12816. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12817. BEGIN
  12818. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12819. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12820. END HasExplicitTraceMethod;
  12821. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12822. BEGIN
  12823. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12824. IF (expression IS SyntaxTree.IntegerValue) THEN
  12825. val := expression(SyntaxTree.IntegerValue).value;
  12826. RETURN TRUE
  12827. ELSE
  12828. RETURN FALSE
  12829. END;
  12830. END IsIntegerConstant;
  12831. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12832. BEGIN
  12833. IF val <= 0 THEN RETURN FALSE END;
  12834. exp := 0;
  12835. WHILE ~ODD(val) DO
  12836. val := val DIV 2;
  12837. INC(exp)
  12838. END;
  12839. RETURN val = 1
  12840. END PowerOf2;
  12841. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12842. VAR procedure: SyntaxTree.Procedure;
  12843. BEGIN
  12844. procedure := record.recordScope.constructor;
  12845. IF procedure = NIL THEN
  12846. record := record.GetBaseRecord();
  12847. IF record # NIL THEN
  12848. procedure := GetConstructor(record)
  12849. END;
  12850. END;
  12851. RETURN procedure;
  12852. END GetConstructor;
  12853. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12854. BEGIN
  12855. value := SHORT(op.intValue);
  12856. RETURN op.mode = IntermediateCode.ModeImmediate;
  12857. END IsIntegerImmediate;
  12858. (** whether a type strictily is a pointer to record or object type
  12859. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12860. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12861. BEGIN
  12862. IF type = NIL THEN
  12863. RETURN FALSE
  12864. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  12865. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  12866. ELSE
  12867. RETURN FALSE
  12868. END
  12869. END IsStrictlyPointerToRecord;
  12870. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  12871. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  12872. END IsUnsafePointer;
  12873. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  12874. BEGIN type := type.resolved;
  12875. IF type IS SyntaxTree.PointerType THEN
  12876. type := type(SyntaxTree.PointerType).pointerBase;
  12877. type := type.resolved;
  12878. IF type IS SyntaxTree.RecordType THEN
  12879. recordType := type(SyntaxTree.RecordType);
  12880. RETURN TRUE
  12881. ELSE
  12882. RETURN FALSE
  12883. END
  12884. ELSIF type IS SyntaxTree.RecordType THEN
  12885. recordType := type(SyntaxTree.RecordType);
  12886. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  12887. ELSIF type IS SyntaxTree.ObjectType THEN
  12888. RETURN TRUE
  12889. ELSIF type IS SyntaxTree.AnyType THEN
  12890. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  12891. ELSE
  12892. RETURN FALSE
  12893. END;
  12894. END IsPointerToRecord;
  12895. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  12896. BEGIN
  12897. type := type.resolved;
  12898. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  12899. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  12900. END IsArrayOfSystemByte;
  12901. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  12902. BEGIN
  12903. IF type = NIL THEN RETURN FALSE END;
  12904. type := type.resolved;
  12905. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  12906. END IsOpenArray;
  12907. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  12908. BEGIN
  12909. IF type = NIL THEN RETURN FALSE END;
  12910. type := type.resolved;
  12911. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  12912. END IsSemiDynamicArray;
  12913. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  12914. BEGIN
  12915. IF type = NIL THEN RETURN FALSE END;
  12916. type := type.resolved;
  12917. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  12918. END IsStaticArray;
  12919. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  12920. BEGIN
  12921. IF type = NIL THEN RETURN FALSE END;
  12922. type := type.resolved;
  12923. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  12924. END IsStaticMathArray;
  12925. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12926. BEGIN
  12927. WHILE (IsStaticMathArray(type)) DO
  12928. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  12929. END;
  12930. RETURN type;
  12931. END StaticMathArrayBaseType;
  12932. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12933. VAR size: LONGINT;
  12934. BEGIN
  12935. size := 1;
  12936. WHILE (IsStaticArray(type)) DO
  12937. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  12938. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12939. END;
  12940. RETURN size;
  12941. END StaticArrayNumElements;
  12942. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12943. VAR size: LONGINT;
  12944. BEGIN
  12945. size := 1;
  12946. WHILE (IsStaticMathArray(type)) DO
  12947. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  12948. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  12949. END;
  12950. RETURN size;
  12951. END StaticMathArrayNumElements;
  12952. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12953. BEGIN
  12954. WHILE (IsStaticArray(type)) DO
  12955. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12956. END;
  12957. RETURN type;
  12958. END StaticArrayBaseType;
  12959. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12960. BEGIN
  12961. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  12962. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12963. END;
  12964. RETURN type;
  12965. END ArrayBaseType;
  12966. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  12967. BEGIN
  12968. IF type = NIL THEN RETURN FALSE END;
  12969. type := type.resolved;
  12970. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  12971. END IsDelegate;
  12972. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  12973. VAR i: LONGINT;
  12974. BEGIN
  12975. i := 0; type := type.resolved;
  12976. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12977. INC(i);
  12978. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  12979. END;
  12980. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12981. INC(i);
  12982. type := type(SyntaxTree.MathArrayType).arrayBase;
  12983. IF type # NIL THEN type := type.resolved END;
  12984. END;
  12985. RETURN i
  12986. END DynamicDim;
  12987. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  12988. BEGIN
  12989. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12990. type := type(SyntaxTree.ArrayType).arrayBase;
  12991. END;
  12992. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12993. type := type(SyntaxTree.MathArrayType).arrayBase;
  12994. END;
  12995. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  12996. END StaticSize;
  12997. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  12998. BEGIN
  12999. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  13000. END IsImmediate;
  13001. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  13002. BEGIN
  13003. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  13004. END IsAddress;
  13005. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  13006. BEGIN
  13007. RETURN (x.mode = IntermediateCode.ModeRegister);
  13008. END IsRegister;
  13009. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  13010. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  13011. BEGIN
  13012. typeDeclaration := recordType.typeDeclaration;
  13013. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13014. Global.GetSymbolSegmentedName(typeDeclaration,name);
  13015. END GetRecordTypeName;
  13016. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  13017. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  13018. BEGIN
  13019. parSize := 0;
  13020. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  13021. parameter := procedureType.returnParameter;
  13022. INC(parSize,system.SizeOfParameter(parameter));
  13023. parSize := parSize + (-parSize) MOD system.addressSize;
  13024. END;
  13025. parameter :=procedureType.lastParameter;
  13026. WHILE (parameter # NIL) DO
  13027. IF SysvABIorWINAPI(procedureType.callingConvention) THEN
  13028. INC(parSize, system.addressSize);
  13029. ELSE
  13030. INC(parSize,system.SizeOfParameter(parameter));
  13031. parSize := parSize + (-parSize) MOD system.addressSize;
  13032. END;
  13033. parameter := parameter.prevParameter;
  13034. END;
  13035. IF procedureType.selfParameter # NIL THEN
  13036. parameter := procedureType.selfParameter;
  13037. INC(parSize,system.SizeOfParameter(parameter));
  13038. parSize := parSize + (-parSize) MOD system.addressSize;
  13039. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  13040. END; (* method => self pointer *)
  13041. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  13042. RETURN ToMemoryUnits(system,parSize)
  13043. END ParametersSize;
  13044. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  13045. BEGIN
  13046. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  13047. END IsNested;
  13048. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  13049. BEGIN
  13050. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  13051. scope := scope.outerScope;
  13052. END;
  13053. RETURN scope # NIL;
  13054. END InCellScope;
  13055. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  13056. BEGIN
  13057. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  13058. RETURN 0
  13059. ELSE
  13060. *)
  13061. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  13062. (*END;*)
  13063. END ProcedureParametersSize;
  13064. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  13065. VAR dataUnit: LONGINT;
  13066. BEGIN dataUnit := system.dataUnit;
  13067. ASSERT(size MOD system.dataUnit = 0);
  13068. RETURN LONGINT(size DIV system.dataUnit)
  13069. END ToMemoryUnits;
  13070. PROCEDURE Get*(): Backend.Backend;
  13071. VAR backend: IntermediateBackend;
  13072. BEGIN NEW(backend); RETURN backend
  13073. END Get;
  13074. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  13075. VAR instruction: IntermediateCode.Instruction;
  13076. BEGIN
  13077. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  13078. RETURN instruction
  13079. END Nop;
  13080. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13081. VAR instruction: IntermediateCode.Instruction;
  13082. BEGIN
  13083. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  13084. RETURN instruction
  13085. END Mov;
  13086. (* like Mov but ensures that no new register will be allocated for dest *)
  13087. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13088. VAR instruction: IntermediateCode.Instruction;
  13089. BEGIN
  13090. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  13091. RETURN instruction
  13092. END MovReplace;
  13093. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13094. VAR instruction: IntermediateCode.Instruction;
  13095. BEGIN
  13096. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  13097. RETURN instruction
  13098. END Conv;
  13099. PROCEDURE SysvABI( cc: LONGINT ): BOOLEAN;
  13100. BEGIN
  13101. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention})
  13102. END SysvABI;
  13103. PROCEDURE SysvABIorWINAPI( cc: LONGINT ): BOOLEAN;
  13104. BEGIN
  13105. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention, SyntaxTree.WinAPICallingConvention})
  13106. END SysvABIorWINAPI;
  13107. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  13108. VAR instruction: IntermediateCode.Instruction;
  13109. BEGIN
  13110. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  13111. RETURN instruction
  13112. END Call;
  13113. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  13114. VAR op1, op2, op3: IntermediateCode.Operand;
  13115. VAR instruction: IntermediateCode.Instruction;
  13116. BEGIN
  13117. IntermediateCode.InitNumber(op1,pcOffset);
  13118. IntermediateCode.InitNumber(op2,callingConvention);
  13119. IntermediateCode.InitNumber(op3,unwind);
  13120. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  13121. RETURN instruction
  13122. END Exit;
  13123. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13124. VAR instruction: IntermediateCode.Instruction;
  13125. BEGIN
  13126. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  13127. RETURN instruction
  13128. END Return;
  13129. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13130. VAR instruction: IntermediateCode.Instruction;
  13131. BEGIN
  13132. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  13133. RETURN instruction
  13134. END Result;
  13135. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  13136. VAR op1: IntermediateCode.Operand;
  13137. VAR instruction: IntermediateCode.Instruction;
  13138. BEGIN
  13139. IntermediateCode.InitNumber(op1,nr);
  13140. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  13141. RETURN instruction
  13142. END Trap;
  13143. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  13144. VAR instruction: IntermediateCode.Instruction;
  13145. BEGIN
  13146. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  13147. RETURN instruction
  13148. END Br;
  13149. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13150. VAR instruction: IntermediateCode.Instruction;
  13151. BEGIN
  13152. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  13153. RETURN instruction
  13154. END Breq;
  13155. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13156. VAR instruction: IntermediateCode.Instruction;
  13157. BEGIN
  13158. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13159. RETURN instruction
  13160. END Brne;
  13161. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13162. VAR instruction: IntermediateCode.Instruction;
  13163. BEGIN
  13164. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13165. RETURN instruction
  13166. END Brge;
  13167. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13168. VAR instruction: IntermediateCode.Instruction;
  13169. BEGIN
  13170. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13171. RETURN instruction
  13172. END Brlt;
  13173. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13174. VAR instruction: IntermediateCode.Instruction;
  13175. BEGIN
  13176. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13177. RETURN instruction
  13178. END Pop;
  13179. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13180. VAR instruction: IntermediateCode.Instruction;
  13181. BEGIN
  13182. ASSERT(op.mode # IntermediateCode.Undefined);
  13183. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13184. RETURN instruction
  13185. END Push;
  13186. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13187. VAR instruction: IntermediateCode.Instruction;
  13188. BEGIN
  13189. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13190. RETURN instruction
  13191. END Neg;
  13192. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13193. VAR instruction: IntermediateCode.Instruction;
  13194. BEGIN
  13195. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13196. RETURN instruction
  13197. END Not;
  13198. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13199. VAR instruction: IntermediateCode.Instruction;
  13200. BEGIN
  13201. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13202. RETURN instruction
  13203. END Abs;
  13204. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13205. VAR instruction: IntermediateCode.Instruction;
  13206. BEGIN
  13207. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13208. ASSERT(~IsImmediate(instruction.op1));
  13209. RETURN instruction
  13210. END Mul;
  13211. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13212. VAR instruction: IntermediateCode.Instruction;
  13213. BEGIN
  13214. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13215. RETURN instruction
  13216. END Div;
  13217. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13218. VAR instruction: IntermediateCode.Instruction;
  13219. BEGIN
  13220. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13221. RETURN instruction
  13222. END Mod;
  13223. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13224. VAR instruction: IntermediateCode.Instruction;
  13225. BEGIN
  13226. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13227. RETURN instruction
  13228. END Sub;
  13229. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13230. VAR instruction: IntermediateCode.Instruction;
  13231. BEGIN
  13232. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13233. RETURN instruction
  13234. END Add;
  13235. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13236. VAR instruction: IntermediateCode.Instruction;
  13237. BEGIN
  13238. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13239. RETURN instruction
  13240. END And;
  13241. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13242. VAR instruction: IntermediateCode.Instruction;
  13243. BEGIN
  13244. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13245. RETURN instruction
  13246. END Or;
  13247. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13248. VAR instruction: IntermediateCode.Instruction;
  13249. BEGIN
  13250. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13251. RETURN instruction
  13252. END Xor;
  13253. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13254. VAR instruction: IntermediateCode.Instruction;
  13255. BEGIN
  13256. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13257. RETURN instruction
  13258. END Shl;
  13259. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13260. VAR instruction: IntermediateCode.Instruction;
  13261. BEGIN
  13262. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13263. RETURN instruction
  13264. END Shr;
  13265. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13266. VAR instruction: IntermediateCode.Instruction;
  13267. BEGIN
  13268. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13269. RETURN instruction
  13270. END Rol;
  13271. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13272. VAR instruction: IntermediateCode.Instruction;
  13273. BEGIN
  13274. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13275. RETURN instruction
  13276. END Ror;
  13277. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13278. VAR instruction: IntermediateCode.Instruction;
  13279. BEGIN
  13280. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13281. RETURN instruction
  13282. END Cas;
  13283. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13284. VAR instruction: IntermediateCode.Instruction;
  13285. BEGIN
  13286. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13287. RETURN instruction
  13288. END Copy;
  13289. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13290. VAR instruction: IntermediateCode.Instruction;
  13291. BEGIN
  13292. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13293. RETURN instruction
  13294. END Fill;
  13295. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13296. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13297. BEGIN
  13298. string := IntermediateCode.String(s);
  13299. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13300. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13301. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13302. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13303. RETURN instruction
  13304. END Asm;
  13305. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13306. VAR instruction: IntermediateCode.Instruction;
  13307. BEGIN
  13308. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13309. RETURN instruction
  13310. END Data;
  13311. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13312. VAR instruction: IntermediateCode.Instruction;
  13313. BEGIN
  13314. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13315. IntermediateCode.SetSubType(instruction, subtype);
  13316. RETURN instruction
  13317. END SpecialInstruction;
  13318. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13319. VAR op1: IntermediateCode.Operand;
  13320. VAR instruction: IntermediateCode.Instruction;
  13321. BEGIN
  13322. (*! generate a warning if size exceeds a certain limit *)
  13323. (*
  13324. ASSERT(bytes < 1000000); (* sanity check *)
  13325. *)
  13326. ASSERT(0 <= units); (* sanity check *)
  13327. IntermediateCode.InitNumber(op1,units);
  13328. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13329. RETURN instruction
  13330. END Reserve;
  13331. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13332. VAR op1: IntermediateCode.Operand;
  13333. VAR instruction: IntermediateCode.Instruction;
  13334. BEGIN
  13335. IntermediateCode.InitNumber(op1,position.start);
  13336. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13337. RETURN instruction
  13338. END LabelInstruction;
  13339. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13340. VAR pc: LONGINT;
  13341. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13342. BEGIN
  13343. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13344. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13345. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13346. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13347. IF instr.op1.type.form = IntermediateCode.Float THEN
  13348. RETURN instr.op1.floatValue = op.floatValue
  13349. ELSE
  13350. RETURN instr.op1.intValue = op.intValue
  13351. END;
  13352. END ProvidesValue;
  13353. BEGIN
  13354. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13355. pc := 0;
  13356. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13357. INC(pc);
  13358. END;
  13359. IF pc = data.pc THEN
  13360. data.Emit(Data(Basic.invalidPosition,vop));
  13361. END;
  13362. RETURN pc
  13363. END EnterImmediate;
  13364. PROCEDURE Init;
  13365. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13366. BEGIN
  13367. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13368. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13369. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13370. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13371. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13372. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13373. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13374. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13375. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13376. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13377. IntermediateCode.InitOperand(emptyOperand);
  13378. FOR i := 0 TO NumberSystemCalls-1 DO
  13379. name := "@SystemCall";
  13380. Basic.AppendNumber(name,i);
  13381. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13382. END;
  13383. END Init;
  13384. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13385. BEGIN
  13386. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  13387. END IsExported;
  13388. BEGIN
  13389. Init;
  13390. END FoxIntermediateBackend.
  13391. Compiler.Compile -p=Win32G FoxIntermediateBackend.Mod ~
  13392. # Release.Build --path="/temp/obg/" Win32G ~
  13393. # StaticLinker.Link --fileFormat=PE32 --fileName=A2H.exe --extension=GofW --displacement=401000H Runtime Trace Kernel32 Machine Heaps Modules Objects Kernel KernelLog Streams Commands Files WinFS Clock Dates Reals Strings Diagnostics BitSets StringPool ObjectFile GenericLinker Reflection GenericLoader BootConsole ~
  13394. FStols.CloseFiles A2Z.exe ~
  13395. SystemTools.FreeDownTo FoxIntermediateBackend ~
  13396. Compiler.Compile -p=Win32G --destPath=/temp/obg/ --traceModule=Trace
  13397. Runtime.Mod Trace.Mod Generic.Win32.Kernel32.Mod Win32.Machine.Mod Heaps.Mod
  13398. Generic.Modules.Mod Win32.Objects.Mod Win32.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13399. Commands.Mod I386.Reals.Mod Generic.Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13400. Win32.Traps.Mod Locks.Mod Win32.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13401. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13402. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Win32.User32.Mod
  13403. Win32.WinTrace.Mod Win32.ODBC.Mod Win32.Shell32.Mod Win32.SQL.Mod Win32.WinFS.Mod
  13404. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13405. GenericLinker.Mod GenericLoader.Mod BootConsole.Mod