FoxIntermediateBackend.Mod 581 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200620162026203620462056206620762086209621062116212621362146215621662176218621962206221622262236224622562266227622862296230623162326233623462356236623762386239624062416242624362446245624662476248624962506251625262536254625562566257625862596260626162626263626462656266626762686269627062716272627362746275627662776278627962806281628262836284628562866287628862896290629162926293629462956296629762986299630063016302630363046305630663076308630963106311631263136314631563166317631863196320632163226323632463256326632763286329633063316332633363346335633663376338633963406341634263436344634563466347634863496350635163526353635463556356635763586359636063616362636363646365636663676368636963706371637263736374637563766377637863796380638163826383638463856386638763886389639063916392639363946395639663976398639964006401640264036404640564066407640864096410641164126413641464156416641764186419642064216422642364246425642664276428642964306431643264336434643564366437643864396440644164426443644464456446644764486449645064516452645364546455645664576458645964606461646264636464646564666467646864696470647164726473647464756476647764786479648064816482648364846485648664876488648964906491649264936494649564966497649864996500650165026503650465056506650765086509651065116512651365146515651665176518651965206521652265236524652565266527652865296530653165326533653465356536653765386539654065416542654365446545654665476548654965506551655265536554655565566557655865596560656165626563656465656566656765686569657065716572657365746575657665776578657965806581658265836584658565866587658865896590659165926593659465956596659765986599660066016602660366046605660666076608660966106611661266136614661566166617661866196620662166226623662466256626662766286629663066316632663366346635663666376638663966406641664266436644664566466647664866496650665166526653665466556656665766586659666066616662666366646665666666676668666966706671667266736674667566766677667866796680668166826683668466856686668766886689669066916692669366946695669666976698669967006701670267036704670567066707670867096710671167126713671467156716671767186719672067216722672367246725672667276728672967306731673267336734673567366737673867396740674167426743674467456746674767486749675067516752675367546755675667576758675967606761676267636764676567666767676867696770677167726773677467756776677767786779678067816782678367846785678667876788678967906791679267936794679567966797679867996800680168026803680468056806680768086809681068116812681368146815681668176818681968206821682268236824682568266827682868296830683168326833683468356836683768386839684068416842684368446845684668476848684968506851685268536854685568566857685868596860686168626863686468656866686768686869687068716872687368746875687668776878687968806881688268836884688568866887688868896890689168926893689468956896689768986899690069016902690369046905690669076908690969106911691269136914691569166917691869196920692169226923692469256926692769286929693069316932693369346935693669376938693969406941694269436944694569466947694869496950695169526953695469556956695769586959696069616962696369646965696669676968696969706971697269736974697569766977697869796980698169826983698469856986698769886989699069916992699369946995699669976998699970007001700270037004700570067007700870097010701170127013701470157016701770187019702070217022702370247025702670277028702970307031703270337034703570367037703870397040704170427043704470457046704770487049705070517052705370547055705670577058705970607061706270637064706570667067706870697070707170727073707470757076707770787079708070817082708370847085708670877088708970907091709270937094709570967097709870997100710171027103710471057106710771087109711071117112711371147115711671177118711971207121712271237124712571267127712871297130713171327133713471357136713771387139714071417142714371447145714671477148714971507151715271537154715571567157715871597160716171627163716471657166716771687169717071717172717371747175717671777178717971807181718271837184718571867187718871897190719171927193719471957196719771987199720072017202720372047205720672077208720972107211721272137214721572167217721872197220722172227223722472257226722772287229723072317232723372347235723672377238723972407241724272437244724572467247724872497250725172527253725472557256725772587259726072617262726372647265726672677268726972707271727272737274727572767277727872797280728172827283728472857286728772887289729072917292729372947295729672977298729973007301730273037304730573067307730873097310731173127313731473157316731773187319732073217322732373247325732673277328732973307331733273337334733573367337733873397340734173427343734473457346734773487349735073517352735373547355735673577358735973607361736273637364736573667367736873697370737173727373737473757376737773787379738073817382738373847385738673877388738973907391739273937394739573967397739873997400740174027403740474057406740774087409741074117412741374147415741674177418741974207421742274237424742574267427742874297430743174327433743474357436743774387439744074417442744374447445744674477448744974507451745274537454745574567457745874597460746174627463746474657466746774687469747074717472747374747475747674777478747974807481748274837484748574867487748874897490749174927493749474957496749774987499750075017502750375047505750675077508750975107511751275137514751575167517751875197520752175227523752475257526752775287529753075317532753375347535753675377538753975407541754275437544754575467547754875497550755175527553755475557556755775587559756075617562756375647565756675677568756975707571757275737574757575767577757875797580758175827583758475857586758775887589759075917592759375947595759675977598759976007601760276037604760576067607760876097610761176127613761476157616761776187619762076217622762376247625762676277628762976307631763276337634763576367637763876397640764176427643764476457646764776487649765076517652765376547655765676577658765976607661766276637664766576667667766876697670767176727673767476757676767776787679768076817682768376847685768676877688768976907691769276937694769576967697769876997700770177027703770477057706770777087709771077117712771377147715771677177718771977207721772277237724772577267727772877297730773177327733773477357736773777387739774077417742774377447745774677477748774977507751775277537754775577567757775877597760776177627763776477657766776777687769777077717772777377747775777677777778777977807781778277837784778577867787778877897790779177927793779477957796779777987799780078017802780378047805780678077808780978107811781278137814781578167817781878197820782178227823782478257826782778287829783078317832783378347835783678377838783978407841784278437844784578467847784878497850785178527853785478557856785778587859786078617862786378647865786678677868786978707871787278737874787578767877787878797880788178827883788478857886788778887889789078917892789378947895789678977898789979007901790279037904790579067907790879097910791179127913791479157916791779187919792079217922792379247925792679277928792979307931793279337934793579367937793879397940794179427943794479457946794779487949795079517952795379547955795679577958795979607961796279637964796579667967796879697970797179727973797479757976797779787979798079817982798379847985798679877988798979907991799279937994799579967997799879998000800180028003800480058006800780088009801080118012801380148015801680178018801980208021802280238024802580268027802880298030803180328033803480358036803780388039804080418042804380448045804680478048804980508051805280538054805580568057805880598060806180628063806480658066806780688069807080718072807380748075807680778078807980808081808280838084808580868087808880898090809180928093809480958096809780988099810081018102810381048105810681078108810981108111811281138114811581168117811881198120812181228123812481258126812781288129813081318132813381348135813681378138813981408141814281438144814581468147814881498150815181528153815481558156815781588159816081618162816381648165816681678168816981708171817281738174817581768177817881798180818181828183818481858186818781888189819081918192819381948195819681978198819982008201820282038204820582068207820882098210821182128213821482158216821782188219822082218222822382248225822682278228822982308231823282338234823582368237823882398240824182428243824482458246824782488249825082518252825382548255825682578258825982608261826282638264826582668267826882698270827182728273827482758276827782788279828082818282828382848285828682878288828982908291829282938294829582968297829882998300830183028303830483058306830783088309831083118312831383148315831683178318831983208321832283238324832583268327832883298330833183328333833483358336833783388339834083418342834383448345834683478348834983508351835283538354835583568357835883598360836183628363836483658366836783688369837083718372837383748375837683778378837983808381838283838384838583868387838883898390839183928393839483958396839783988399840084018402840384048405840684078408840984108411841284138414841584168417841884198420842184228423842484258426842784288429843084318432843384348435843684378438843984408441844284438444844584468447844884498450845184528453845484558456845784588459846084618462846384648465846684678468846984708471847284738474847584768477847884798480848184828483848484858486848784888489849084918492849384948495849684978498849985008501850285038504850585068507850885098510851185128513851485158516851785188519852085218522852385248525852685278528852985308531853285338534853585368537853885398540854185428543854485458546854785488549855085518552855385548555855685578558855985608561856285638564856585668567856885698570857185728573857485758576857785788579858085818582858385848585858685878588858985908591859285938594859585968597859885998600860186028603860486058606860786088609861086118612861386148615861686178618861986208621862286238624862586268627862886298630863186328633863486358636863786388639864086418642864386448645864686478648864986508651865286538654865586568657865886598660866186628663866486658666866786688669867086718672867386748675867686778678867986808681868286838684868586868687868886898690869186928693869486958696869786988699870087018702870387048705870687078708870987108711871287138714871587168717871887198720872187228723872487258726872787288729873087318732873387348735873687378738873987408741874287438744874587468747874887498750875187528753875487558756875787588759876087618762876387648765876687678768876987708771877287738774877587768777877887798780878187828783878487858786878787888789879087918792879387948795879687978798879988008801880288038804880588068807880888098810881188128813881488158816881788188819882088218822882388248825882688278828882988308831883288338834883588368837883888398840884188428843884488458846884788488849885088518852885388548855885688578858885988608861886288638864886588668867886888698870887188728873887488758876887788788879888088818882888388848885888688878888888988908891889288938894889588968897889888998900890189028903890489058906890789088909891089118912891389148915891689178918891989208921892289238924892589268927892889298930893189328933893489358936893789388939894089418942894389448945894689478948894989508951895289538954895589568957895889598960896189628963896489658966896789688969897089718972897389748975897689778978897989808981898289838984898589868987898889898990899189928993899489958996899789988999900090019002900390049005900690079008900990109011901290139014901590169017901890199020902190229023902490259026902790289029903090319032903390349035903690379038903990409041904290439044904590469047904890499050905190529053905490559056905790589059906090619062906390649065906690679068906990709071907290739074907590769077907890799080908190829083908490859086908790889089909090919092909390949095909690979098909991009101910291039104910591069107910891099110911191129113911491159116911791189119912091219122912391249125912691279128912991309131913291339134913591369137913891399140914191429143914491459146914791489149915091519152915391549155915691579158915991609161916291639164916591669167916891699170917191729173917491759176917791789179918091819182918391849185918691879188918991909191919291939194919591969197919891999200920192029203920492059206920792089209921092119212921392149215921692179218921992209221922292239224922592269227922892299230923192329233923492359236923792389239924092419242924392449245924692479248924992509251925292539254925592569257925892599260926192629263926492659266926792689269927092719272927392749275927692779278927992809281928292839284928592869287928892899290929192929293929492959296929792989299930093019302930393049305930693079308930993109311931293139314931593169317931893199320932193229323932493259326932793289329933093319332933393349335933693379338933993409341934293439344934593469347934893499350935193529353935493559356935793589359936093619362936393649365936693679368936993709371937293739374937593769377937893799380938193829383938493859386938793889389939093919392939393949395939693979398939994009401940294039404940594069407940894099410941194129413941494159416941794189419942094219422942394249425942694279428942994309431943294339434943594369437943894399440944194429443944494459446944794489449945094519452945394549455945694579458945994609461946294639464946594669467946894699470947194729473947494759476947794789479948094819482948394849485948694879488948994909491949294939494949594969497949894999500950195029503950495059506950795089509951095119512951395149515951695179518951995209521952295239524952595269527952895299530953195329533953495359536953795389539954095419542954395449545954695479548954995509551955295539554955595569557955895599560956195629563956495659566956795689569957095719572957395749575957695779578957995809581958295839584958595869587958895899590959195929593959495959596959795989599960096019602960396049605960696079608960996109611961296139614961596169617961896199620962196229623962496259626962796289629963096319632963396349635963696379638963996409641964296439644964596469647964896499650965196529653965496559656965796589659966096619662966396649665966696679668966996709671967296739674967596769677967896799680968196829683968496859686968796889689969096919692969396949695969696979698969997009701970297039704970597069707970897099710971197129713971497159716971797189719972097219722972397249725972697279728972997309731973297339734973597369737973897399740974197429743974497459746974797489749975097519752975397549755975697579758975997609761976297639764976597669767976897699770977197729773977497759776977797789779978097819782978397849785978697879788978997909791979297939794979597969797979897999800980198029803980498059806980798089809981098119812981398149815981698179818981998209821982298239824982598269827982898299830983198329833983498359836983798389839984098419842984398449845984698479848984998509851985298539854985598569857985898599860986198629863986498659866986798689869987098719872987398749875987698779878987998809881988298839884988598869887988898899890989198929893989498959896989798989899990099019902990399049905990699079908990999109911991299139914991599169917991899199920992199229923992499259926992799289929993099319932993399349935993699379938993999409941994299439944994599469947994899499950995199529953995499559956995799589959996099619962996399649965996699679968996999709971997299739974997599769977997899799980998199829983998499859986998799889989999099919992999399949995999699979998999910000100011000210003100041000510006100071000810009100101001110012100131001410015100161001710018100191002010021100221002310024100251002610027100281002910030100311003210033100341003510036100371003810039100401004110042100431004410045100461004710048100491005010051100521005310054100551005610057100581005910060100611006210063100641006510066100671006810069100701007110072100731007410075100761007710078100791008010081100821008310084100851008610087100881008910090100911009210093100941009510096100971009810099101001010110102101031010410105101061010710108101091011010111101121011310114101151011610117101181011910120101211012210123101241012510126101271012810129101301013110132101331013410135101361013710138101391014010141101421014310144101451014610147101481014910150101511015210153101541015510156101571015810159101601016110162101631016410165101661016710168101691017010171101721017310174101751017610177101781017910180101811018210183101841018510186101871018810189101901019110192101931019410195101961019710198101991020010201102021020310204102051020610207102081020910210102111021210213102141021510216102171021810219102201022110222102231022410225102261022710228102291023010231102321023310234102351023610237102381023910240102411024210243102441024510246102471024810249102501025110252102531025410255102561025710258102591026010261102621026310264102651026610267102681026910270102711027210273102741027510276102771027810279102801028110282102831028410285102861028710288102891029010291102921029310294102951029610297102981029910300103011030210303103041030510306103071030810309103101031110312103131031410315103161031710318103191032010321103221032310324103251032610327103281032910330103311033210333103341033510336103371033810339103401034110342103431034410345103461034710348103491035010351103521035310354103551035610357103581035910360103611036210363103641036510366103671036810369103701037110372103731037410375103761037710378103791038010381103821038310384103851038610387103881038910390103911039210393103941039510396103971039810399104001040110402104031040410405104061040710408104091041010411104121041310414104151041610417104181041910420104211042210423104241042510426104271042810429104301043110432104331043410435104361043710438104391044010441104421044310444104451044610447104481044910450104511045210453104541045510456104571045810459104601046110462104631046410465104661046710468104691047010471104721047310474104751047610477104781047910480104811048210483104841048510486104871048810489104901049110492104931049410495104961049710498104991050010501105021050310504105051050610507105081050910510105111051210513105141051510516105171051810519105201052110522105231052410525105261052710528105291053010531105321053310534105351053610537105381053910540105411054210543105441054510546105471054810549105501055110552105531055410555105561055710558105591056010561105621056310564105651056610567105681056910570105711057210573105741057510576105771057810579105801058110582105831058410585105861058710588105891059010591105921059310594105951059610597105981059910600106011060210603106041060510606106071060810609106101061110612106131061410615106161061710618106191062010621106221062310624106251062610627106281062910630106311063210633106341063510636106371063810639106401064110642106431064410645106461064710648106491065010651106521065310654106551065610657106581065910660106611066210663106641066510666106671066810669106701067110672106731067410675106761067710678106791068010681106821068310684106851068610687106881068910690106911069210693106941069510696106971069810699107001070110702107031070410705107061070710708107091071010711107121071310714107151071610717107181071910720107211072210723107241072510726107271072810729107301073110732107331073410735107361073710738107391074010741107421074310744107451074610747107481074910750107511075210753107541075510756107571075810759107601076110762107631076410765107661076710768107691077010771107721077310774107751077610777107781077910780107811078210783107841078510786107871078810789107901079110792107931079410795107961079710798107991080010801108021080310804108051080610807108081080910810108111081210813108141081510816108171081810819108201082110822108231082410825108261082710828108291083010831108321083310834108351083610837108381083910840108411084210843108441084510846108471084810849108501085110852108531085410855108561085710858108591086010861108621086310864108651086610867108681086910870108711087210873108741087510876108771087810879108801088110882108831088410885108861088710888108891089010891108921089310894108951089610897108981089910900109011090210903109041090510906109071090810909109101091110912109131091410915109161091710918109191092010921109221092310924109251092610927109281092910930109311093210933109341093510936109371093810939109401094110942109431094410945109461094710948109491095010951109521095310954109551095610957109581095910960109611096210963109641096510966109671096810969109701097110972109731097410975109761097710978109791098010981109821098310984109851098610987109881098910990109911099210993109941099510996109971099810999110001100111002110031100411005110061100711008110091101011011110121101311014110151101611017110181101911020110211102211023110241102511026110271102811029110301103111032110331103411035110361103711038110391104011041110421104311044110451104611047110481104911050110511105211053110541105511056110571105811059110601106111062110631106411065110661106711068110691107011071110721107311074110751107611077110781107911080110811108211083110841108511086110871108811089110901109111092110931109411095110961109711098110991110011101111021110311104111051110611107111081110911110111111111211113111141111511116111171111811119111201112111122111231112411125111261112711128111291113011131111321113311134111351113611137111381113911140111411114211143111441114511146111471114811149111501115111152111531115411155111561115711158111591116011161111621116311164111651116611167111681116911170111711117211173111741117511176111771117811179111801118111182111831118411185111861118711188111891119011191111921119311194111951119611197111981119911200112011120211203112041120511206112071120811209112101121111212112131121411215112161121711218112191122011221112221122311224112251122611227112281122911230112311123211233112341123511236112371123811239112401124111242112431124411245112461124711248112491125011251112521125311254112551125611257112581125911260112611126211263112641126511266112671126811269112701127111272112731127411275112761127711278112791128011281112821128311284112851128611287112881128911290112911129211293112941129511296112971129811299113001130111302113031130411305113061130711308113091131011311113121131311314113151131611317113181131911320113211132211323113241132511326113271132811329113301133111332113331133411335113361133711338113391134011341113421134311344113451134611347113481134911350113511135211353113541135511356113571135811359113601136111362113631136411365113661136711368113691137011371113721137311374113751137611377113781137911380113811138211383113841138511386113871138811389113901139111392113931139411395113961139711398113991140011401114021140311404114051140611407114081140911410114111141211413114141141511416114171141811419114201142111422114231142411425114261142711428114291143011431114321143311434114351143611437114381143911440114411144211443114441144511446114471144811449114501145111452114531145411455114561145711458114591146011461114621146311464114651146611467114681146911470114711147211473114741147511476114771147811479114801148111482114831148411485114861148711488114891149011491114921149311494114951149611497114981149911500115011150211503115041150511506115071150811509115101151111512115131151411515115161151711518115191152011521115221152311524115251152611527115281152911530115311153211533115341153511536115371153811539115401154111542115431154411545115461154711548115491155011551115521155311554115551155611557115581155911560115611156211563115641156511566115671156811569115701157111572115731157411575115761157711578115791158011581115821158311584115851158611587115881158911590115911159211593115941159511596115971159811599116001160111602116031160411605116061160711608116091161011611116121161311614116151161611617116181161911620116211162211623116241162511626116271162811629116301163111632116331163411635116361163711638116391164011641116421164311644116451164611647116481164911650116511165211653116541165511656116571165811659116601166111662116631166411665116661166711668116691167011671116721167311674116751167611677116781167911680116811168211683116841168511686116871168811689116901169111692116931169411695116961169711698116991170011701117021170311704117051170611707117081170911710117111171211713117141171511716117171171811719117201172111722117231172411725117261172711728117291173011731117321173311734117351173611737117381173911740117411174211743117441174511746117471174811749117501175111752117531175411755117561175711758117591176011761117621176311764117651176611767117681176911770117711177211773117741177511776117771177811779117801178111782117831178411785117861178711788117891179011791117921179311794117951179611797117981179911800118011180211803118041180511806118071180811809118101181111812118131181411815118161181711818118191182011821118221182311824118251182611827118281182911830118311183211833118341183511836118371183811839118401184111842118431184411845118461184711848118491185011851118521185311854118551185611857118581185911860118611186211863118641186511866118671186811869118701187111872118731187411875118761187711878118791188011881118821188311884118851188611887118881188911890118911189211893118941189511896118971189811899119001190111902119031190411905119061190711908119091191011911119121191311914119151191611917119181191911920119211192211923119241192511926119271192811929119301193111932119331193411935119361193711938119391194011941119421194311944119451194611947119481194911950119511195211953119541195511956119571195811959119601196111962119631196411965119661196711968119691197011971119721197311974119751197611977119781197911980119811198211983119841198511986119871198811989119901199111992119931199411995119961199711998119991200012001120021200312004120051200612007120081200912010120111201212013120141201512016120171201812019120201202112022120231202412025120261202712028120291203012031120321203312034120351203612037120381203912040120411204212043120441204512046120471204812049120501205112052120531205412055120561205712058120591206012061120621206312064120651206612067120681206912070120711207212073120741207512076120771207812079120801208112082120831208412085120861208712088120891209012091120921209312094120951209612097120981209912100121011210212103121041210512106121071210812109121101211112112121131211412115121161211712118121191212012121121221212312124121251212612127121281212912130121311213212133121341213512136121371213812139121401214112142121431214412145121461214712148121491215012151121521215312154121551215612157121581215912160121611216212163121641216512166121671216812169121701217112172121731217412175121761217712178121791218012181121821218312184121851218612187121881218912190121911219212193121941219512196121971219812199122001220112202122031220412205122061220712208122091221012211122121221312214122151221612217122181221912220122211222212223122241222512226122271222812229122301223112232122331223412235122361223712238122391224012241122421224312244122451224612247122481224912250122511225212253122541225512256122571225812259122601226112262122631226412265122661226712268122691227012271122721227312274122751227612277122781227912280122811228212283122841228512286122871228812289122901229112292122931229412295122961229712298122991230012301123021230312304123051230612307123081230912310123111231212313123141231512316123171231812319123201232112322123231232412325123261232712328123291233012331123321233312334123351233612337123381233912340123411234212343123441234512346123471234812349123501235112352123531235412355123561235712358123591236012361123621236312364123651236612367123681236912370123711237212373123741237512376123771237812379123801238112382123831238412385123861238712388123891239012391123921239312394123951239612397123981239912400124011240212403124041240512406124071240812409124101241112412124131241412415124161241712418124191242012421124221242312424124251242612427124281242912430124311243212433124341243512436124371243812439124401244112442124431244412445124461244712448124491245012451124521245312454124551245612457124581245912460124611246212463124641246512466124671246812469124701247112472124731247412475124761247712478124791248012481124821248312484124851248612487124881248912490124911249212493124941249512496124971249812499125001250112502125031250412505125061250712508125091251012511125121251312514125151251612517125181251912520125211252212523125241252512526125271252812529125301253112532125331253412535125361253712538125391254012541125421254312544125451254612547125481254912550125511255212553125541255512556125571255812559125601256112562125631256412565125661256712568125691257012571125721257312574125751257612577125781257912580125811258212583125841258512586125871258812589125901259112592125931259412595125961259712598125991260012601126021260312604126051260612607126081260912610126111261212613126141261512616126171261812619126201262112622126231262412625126261262712628126291263012631126321263312634126351263612637126381263912640126411264212643126441264512646126471264812649126501265112652126531265412655126561265712658126591266012661126621266312664126651266612667126681266912670126711267212673126741267512676126771267812679126801268112682126831268412685126861268712688126891269012691126921269312694126951269612697126981269912700127011270212703127041270512706127071270812709127101271112712127131271412715127161271712718127191272012721127221272312724127251272612727127281272912730127311273212733127341273512736127371273812739127401274112742127431274412745127461274712748127491275012751127521275312754127551275612757127581275912760127611276212763127641276512766127671276812769127701277112772127731277412775127761277712778127791278012781127821278312784127851278612787127881278912790127911279212793127941279512796127971279812799128001280112802128031280412805128061280712808128091281012811128121281312814128151281612817128181281912820128211282212823128241282512826128271282812829128301283112832128331283412835128361283712838128391284012841128421284312844128451284612847128481284912850128511285212853128541285512856128571285812859128601286112862128631286412865128661286712868128691287012871128721287312874128751287612877128781287912880128811288212883128841288512886128871288812889128901289112892128931289412895128961289712898128991290012901129021290312904129051290612907129081290912910129111291212913129141291512916129171291812919129201292112922129231292412925129261292712928129291293012931129321293312934129351293612937129381293912940129411294212943129441294512946129471294812949129501295112952129531295412955129561295712958129591296012961129621296312964129651296612967129681296912970129711297212973129741297512976129771297812979129801298112982129831298412985129861298712988129891299012991129921299312994129951299612997129981299913000130011300213003130041300513006130071300813009130101301113012130131301413015130161301713018130191302013021130221302313024130251302613027130281302913030130311303213033130341303513036130371303813039130401304113042130431304413045130461304713048130491305013051130521305313054130551305613057130581305913060130611306213063130641306513066130671306813069130701307113072130731307413075130761307713078130791308013081130821308313084130851308613087130881308913090130911309213093130941309513096130971309813099131001310113102131031310413105131061310713108131091311013111131121311313114131151311613117131181311913120131211312213123131241312513126131271312813129131301313113132131331313413135131361313713138131391314013141131421314313144131451314613147131481314913150131511315213153131541315513156131571315813159131601316113162131631316413165131661316713168131691317013171131721317313174131751317613177131781317913180131811318213183131841318513186131871318813189131901319113192131931319413195131961319713198131991320013201132021320313204132051320613207132081320913210132111321213213132141321513216132171321813219132201322113222132231322413225132261322713228132291323013231132321323313234132351323613237132381323913240132411324213243132441324513246132471324813249132501325113252132531325413255132561325713258132591326013261132621326313264132651326613267132681326913270132711327213273132741327513276132771327813279132801328113282132831328413285132861328713288132891329013291132921329313294132951329613297132981329913300133011330213303133041330513306133071330813309133101331113312133131331413315133161331713318133191332013321133221332313324133251332613327133281332913330133311333213333133341333513336133371333813339133401334113342133431334413345133461334713348133491335013351133521335313354133551335613357133581335913360133611336213363133641336513366133671336813369133701337113372133731337413375133761337713378133791338013381133821338313384133851338613387133881338913390133911339213393133941339513396133971339813399134001340113402134031340413405134061340713408134091341013411134121341313414134151341613417134181341913420134211342213423134241342513426134271342813429134301343113432134331343413435134361343713438134391344013441134421344313444134451344613447134481344913450134511345213453134541345513456134571345813459134601346113462134631346413465134661346713468134691347013471134721347313474134751347613477134781347913480134811348213483134841348513486134871348813489134901349113492134931349413495134961349713498134991350013501135021350313504135051350613507135081350913510135111351213513135141351513516135171351813519135201352113522135231352413525135261352713528135291353013531135321353313534135351353613537135381353913540135411354213543135441354513546135471354813549135501355113552135531355413555135561355713558135591356013561135621356313564135651356613567135681356913570135711357213573135741357513576135771357813579135801358113582135831358413585135861358713588135891359013591135921359313594135951359613597135981359913600136011360213603136041360513606136071360813609136101361113612136131361413615136161361713618136191362013621136221362313624136251362613627136281362913630136311363213633136341363513636136371363813639136401364113642136431364413645136461364713648136491365013651136521365313654136551365613657136581365913660136611366213663136641366513666136671366813669136701367113672136731367413675136761367713678136791368013681136821368313684136851368613687136881368913690136911369213693136941369513696136971369813699137001370113702137031370413705137061370713708137091371013711137121371313714137151371613717137181371913720137211372213723137241372513726137271372813729137301373113732137331373413735137361373713738137391374013741137421374313744137451374613747137481374913750137511375213753137541375513756137571375813759137601376113762137631376413765137661376713768137691377013771137721377313774137751377613777137781377913780137811378213783137841378513786137871378813789137901379113792137931379413795137961379713798137991380013801138021380313804138051380613807138081380913810138111381213813138141381513816138171381813819138201382113822138231382413825138261382713828138291383013831138321383313834138351383613837138381383913840138411384213843138441384513846138471384813849138501385113852138531385413855138561385713858138591386013861138621386313864138651386613867138681386913870138711387213873138741387513876138771387813879138801388113882138831388413885138861388713888138891389013891138921389313894138951389613897138981389913900139011390213903139041390513906139071390813909139101391113912139131391413915139161391713918139191392013921139221392313924139251392613927139281392913930139311393213933139341393513936139371393813939139401394113942139431394413945139461394713948139491395013951139521395313954139551395613957139581395913960139611396213963139641396513966139671396813969139701397113972139731397413975139761397713978139791398013981139821398313984139851398613987139881398913990139911399213993139941399513996139971399813999140001400114002140031400414005140061400714008140091401014011140121401314014140151401614017140181401914020140211402214023140241402514026140271402814029140301403114032140331403414035140361403714038140391404014041140421404314044140451404614047140481404914050140511405214053140541405514056140571405814059140601406114062140631406414065140661406714068140691407014071140721407314074140751407614077140781407914080140811408214083140841408514086140871408814089140901409114092140931409414095140961409714098140991410014101141021410314104141051410614107141081410914110141111411214113141141411514116141171411814119141201412114122141231412414125141261412714128141291413014131141321413314134141351413614137141381413914140141411414214143141441414514146141471414814149141501415114152141531415414155141561415714158141591416014161141621416314164141651416614167141681416914170141711417214173141741417514176141771417814179141801418114182141831418414185141861418714188141891419014191141921419314194141951419614197141981419914200142011420214203142041420514206142071420814209142101421114212142131421414215142161421714218142191422014221142221422314224142251422614227142281422914230142311423214233142341423514236142371423814239142401424114242142431424414245142461424714248142491425014251142521425314254142551425614257142581425914260142611426214263142641426514266142671426814269142701427114272142731427414275142761427714278142791428014281142821428314284142851428614287142881428914290142911429214293142941429514296142971429814299143001430114302143031430414305143061430714308143091431014311143121431314314143151431614317143181431914320143211432214323143241432514326143271432814329143301433114332143331433414335143361433714338143391434014341143421434314344143451434614347143481434914350143511435214353143541435514356143571435814359143601436114362143631436414365143661436714368143691437014371143721437314374143751437614377143781437914380143811438214383143841438514386143871438814389143901439114392143931439414395143961439714398143991440014401144021440314404144051440614407144081440914410144111441214413144141441514416144171441814419144201442114422144231442414425144261442714428144291443014431144321443314434144351443614437144381443914440144411444214443144441444514446144471444814449144501445114452144531445414455144561445714458144591446014461144621446314464144651446614467144681446914470144711447214473144741447514476144771447814479144801448114482144831448414485144861448714488144891449014491144921449314494144951449614497144981449914500145011450214503145041450514506145071450814509145101451114512145131451414515145161451714518145191452014521145221452314524145251452614527145281452914530145311453214533145341453514536145371453814539145401454114542145431454414545145461454714548145491455014551145521455314554145551455614557145581455914560145611456214563145641456514566145671456814569145701457114572145731457414575145761457714578145791458014581145821458314584145851458614587145881458914590145911459214593145941459514596145971459814599146001460114602146031460414605146061460714608146091461014611146121461314614146151461614617146181461914620146211462214623146241462514626146271462814629146301463114632146331463414635146361463714638146391464014641146421464314644146451464614647146481464914650146511465214653146541465514656146571465814659146601466114662146631466414665146661466714668146691467014671146721467314674146751467614677146781467914680146811468214683146841468514686146871468814689146901469114692146931469414695146961469714698146991470014701147021470314704147051470614707147081470914710147111471214713147141471514716147171471814719147201472114722147231472414725147261472714728147291473014731147321473314734147351473614737147381473914740147411474214743147441474514746147471474814749147501475114752147531475414755147561475714758147591476014761147621476314764147651476614767147681476914770147711477214773147741477514776147771477814779147801478114782147831478414785147861478714788147891479014791147921479314794147951479614797147981479914800148011480214803148041480514806148071480814809148101481114812148131481414815148161481714818148191482014821148221482314824148251482614827148281482914830148311483214833148341483514836148371483814839148401484114842148431484414845148461484714848148491485014851148521485314854148551485614857148581485914860148611486214863148641486514866148671486814869148701487114872148731487414875148761487714878148791488014881148821488314884148851488614887148881488914890148911489214893148941489514896148971489814899149001490114902149031490414905149061490714908149091491014911149121491314914149151491614917149181491914920149211492214923149241492514926149271492814929149301493114932149331493414935149361493714938149391494014941149421494314944149451494614947149481494914950149511495214953149541495514956149571495814959
  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, 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. RethrowTrap* = 18; (* rethrow exception after unlock *)
  42. Trace = FALSE;
  43. TraceRegisterUsageCount=TRUE;
  44. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  45. (** system call numbers *)
  46. NumberSystemCalls* = 12;
  47. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  48. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  49. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  50. DefaultBuiltinsModuleName ="Builtins";
  51. DefaultTraceModuleName ="KernelLog";
  52. ChannelModuleName = "Channels";
  53. NonPointer = -1; (* special pointer values *)
  54. NoType = 0; (* special type info values *)
  55. LhsIsPointer = 0; (* for the operator kind *)
  56. RhsIsPointer = 1;
  57. (* priority values, lower means higher priority *)
  58. BasePointerTypeSize = 5;
  59. BaseArrayTypeSize = BasePointerTypeSize + 3;
  60. LengthOffset = BasePointerTypeSize + 0;
  61. DataOffset = BasePointerTypeSize + 1;
  62. DescriptorOffset = BasePointerTypeSize + 2;
  63. BaseRecordTypeSize = BasePointerTypeSize + 2;
  64. ActionOffset = BasePointerTypeSize + 0;
  65. MonitorOffset = BasePointerTypeSize + 1;
  66. BaseObjectTypeSize = BaseRecordTypeSize;
  67. ActionTypeSize = 3;
  68. MonitorTypeSize = 7;
  69. ProcessorOffset = BaseObjectTypeSize + 1;
  70. StackLimitOffset* = BaseObjectTypeSize + 3;
  71. QuantumOffset = BaseObjectTypeSize + 4;
  72. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  73. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  74. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  75. Size2Flag = 4; (* size = 2 *)
  76. Size3Flag = 5; (* size = 3 *)
  77. Size4Flag = 6; (* size = 4 *)
  78. Size5Flag = 7; (* size = 5 *)
  79. Size6Flag = 8; (* size = 6 *)
  80. Size7Flag = 9; (* size = 7 *)
  81. Size8Flag = 10; (* size = 8 *)
  82. ReflectionSupport = TRUE;
  83. (* 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:
  84. 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
  85. a base pointer but a procedure descriptor. The base pointer itself is in such cases located at BP + address size.
  86. *)
  87. (* I am not 100% sure if it is necessary or not -- so I keep a flag to be able to re-enable this *)
  88. ProtectModulesPointers = FALSE;
  89. CreateProcedureDescInfo = TRUE;
  90. WarningDynamicLoading = FALSE;
  91. SysvABI = {SyntaxTree.CCallingConvention};
  92. SysvABIorWINAPI = {SyntaxTree.CCallingConvention, SyntaxTree.WinAPICallingConvention};
  93. TYPE
  94. Position=SyntaxTree.Position;
  95. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  96. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  97. Operand = RECORD
  98. mode: SHORTINT;
  99. op: IntermediateCode.Operand;
  100. tag: IntermediateCode.Operand;
  101. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  102. dimOffset: LONGINT;
  103. availability: WORD; (* index *)
  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
  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, Streams.Invalid, s);
  164. END Error;
  165. (** types **)
  166. PROCEDURE Type(x: SyntaxTree.Type);
  167. BEGIN
  168. WITH x:
  169. SyntaxTree.QualifiedType DO QualifiedType(x)
  170. |SyntaxTree.MathArrayType DO meta.CheckTypeDeclaration(x)
  171. |SyntaxTree.PointerType DO meta.CheckTypeDeclaration(x) (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  172. |SyntaxTree.RecordType DO RecordType(x)
  173. |SyntaxTree.CellType DO CellType(x)
  174. ELSE
  175. END;
  176. END Type;
  177. PROCEDURE QualifiedType(x: SyntaxTree.QualifiedType);
  178. VAR type: SyntaxTree.Type;
  179. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  180. type := x.resolved;
  181. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  182. meta.CheckTypeDeclaration(type);
  183. END;
  184. END QualifiedType;
  185. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  186. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  187. BEGIN
  188. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  189. WHILE (this # NIL) & (this.identifier# id) DO
  190. this := this.nextModifier;
  191. END;
  192. RETURN this # NIL
  193. END HasFlag;
  194. PROCEDURE RecordType(x: SyntaxTree.RecordType);
  195. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  196. BEGIN (* no code emission *)
  197. meta.CheckTypeDeclaration(x);
  198. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  199. IF x.pointerType.typeDeclaration # NIL THEN
  200. td := x.pointerType.typeDeclaration
  201. ELSE
  202. td := x.typeDeclaration
  203. END;
  204. Global.GetSymbolName(td,name);
  205. (* code section for object *)
  206. END;
  207. Scope(x.recordScope);
  208. END RecordType;
  209. PROCEDURE CellType(x: SyntaxTree.CellType);
  210. VAR capabilities: SET;
  211. BEGIN
  212. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  213. capabilities := {};
  214. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  215. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  216. backend.SetCapabilities(capabilities);
  217. IF ~implementationVisitor.checker.SkipImplementation(x) THEN
  218. Scope(x.cellScope);
  219. END;
  220. END CellType;
  221. (* symbols *)
  222. PROCEDURE Variable(x: SyntaxTree.Variable);
  223. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, dim, i: LONGINT;
  224. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  225. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  226. BEGIN
  227. type := type.resolved;
  228. IF type IS SyntaxTree.RecordType THEN
  229. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  230. ELSIF (type IS SyntaxTree.ArrayType) THEN
  231. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  232. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  233. END;
  234. ELSIF type IS SyntaxTree.MathArrayType THEN
  235. WITH type: SyntaxTree.MathArrayType DO
  236. IF type.form = SyntaxTree.Open THEN
  237. RETURN TRUE
  238. ELSIF type.form = SyntaxTree.Static THEN
  239. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  240. END;
  241. END;
  242. END;
  243. RETURN FALSE
  244. END TypeNeedsInitialization;
  245. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  246. VAR variable: SyntaxTree.Variable;
  247. BEGIN
  248. variable := scope.firstVariable;
  249. WHILE variable # NIL DO
  250. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  251. IF variable.initializer # NIL THEN RETURN TRUE END;
  252. variable := variable.nextVariable;
  253. END;
  254. RETURN FALSE
  255. END ScopeNeedsInitialization;
  256. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset:LONGINT);
  257. VAR size: LONGINT;
  258. BEGIN
  259. size := offset - lastUpdated;
  260. IF size > 0 THEN
  261. irv.Emit(Reserve(x.position,size));
  262. END;
  263. irv.Emit(Data(x.position, op));
  264. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  265. END SingleInitialize;
  266. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset:LONGINT);
  267. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable; i: LONGINT; size:LONGINT;
  268. BEGIN
  269. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  270. WITH type:
  271. SyntaxTree.RecordType DO
  272. baseType := type.baseType;
  273. IF baseType # NIL THEN
  274. baseType := baseType.resolved;
  275. IF baseType IS SyntaxTree.PointerType THEN
  276. baseType := baseType(SyntaxTree.PointerType).pointerBase
  277. END;
  278. Initialize(baseType,NIL, offset);
  279. END;
  280. variable := type.recordScope.firstVariable;
  281. WHILE variable # NIL DO
  282. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  283. variable := variable.nextVariable
  284. END;
  285. | SyntaxTree.ArrayType DO
  286. IF type.form = SyntaxTree.Static THEN
  287. baseType := type.arrayBase;
  288. IF TypeNeedsInitialization(baseType) THEN
  289. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  290. FOR i := 0 TO type.staticLength-1 DO
  291. Initialize(baseType,NIL,offset+i*size);
  292. END;
  293. END;
  294. END;
  295. | SyntaxTree.MathArrayType DO
  296. IF type.form = SyntaxTree.Open THEN
  297. dim := DynamicDim(type);
  298. baseType := SemanticChecker.ArrayBase(type,dim);
  299. imm := IntermediateCode.Immediate(addressType,dim);
  300. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  301. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  302. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  303. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  304. (* flags remain empty (=0) for open array *)
  305. ELSIF type.form = SyntaxTree.Static THEN
  306. baseType := type.arrayBase;
  307. IF TypeNeedsInitialization(baseType) THEN
  308. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  309. ASSERT(type.staticLength < 1024*1024*1024);
  310. FOR i := 0 TO type.staticLength-1 DO
  311. Initialize(baseType,NIL,offset+i*size);
  312. END;
  313. END;
  314. END;
  315. ELSE
  316. IF initializer # NIL THEN
  317. implementationVisitor.Evaluate(initializer, op);
  318. SingleInitialize(op.op, offset);
  319. END;
  320. END;
  321. END Initialize;
  322. BEGIN
  323. IF x.externalName # NIL THEN RETURN END;
  324. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  325. (* code section for variable *)
  326. Global.GetSymbolSegmentedName(x,name);
  327. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  328. irv.SetExported(IsExported(x));
  329. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  330. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  331. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  332. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  333. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  334. FOR i := 0 TO DynamicDim(x.type)-1 DO
  335. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  336. END;
  337. ELSE
  338. lastUpdated:= 0;
  339. IF ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  340. Initialize(x.type, x.initializer, 0);
  341. END;
  342. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  343. IF size > 0 THEN
  344. irv.Emit(Reserve(x.position,size));
  345. END;
  346. IF ~x.fixed THEN
  347. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  348. ELSE
  349. align := x.alignment;
  350. END;
  351. irv.SetPositionOrAlignment(x.fixed, align);
  352. meta.CheckTypeDeclaration(x.type);
  353. END;
  354. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  355. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  356. END;
  357. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  358. END Variable;
  359. PROCEDURE Parameter(x: SyntaxTree.Parameter);
  360. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i: LONGINT;
  361. size: LONGINT; lastUpdated: LONGINT;
  362. BEGIN
  363. ASSERT(currentScope IS SyntaxTree.CellScope);
  364. Global.GetSymbolSegmentedName(x,name);
  365. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  366. irv.SetExported(IsExported(x));
  367. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  368. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  369. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  370. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  371. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  372. FOR i := 0 TO DynamicDim(x.type)-1 DO
  373. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  374. END;
  375. ELSE
  376. lastUpdated:= 0;
  377. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  378. IF size > 0 THEN
  379. irv.Emit(Reserve(x.position,size));
  380. END;
  381. IF ~x.fixed THEN
  382. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  383. ELSE
  384. align := x.alignment;
  385. END;
  386. irv.SetPositionOrAlignment(x.fixed, align);
  387. meta.CheckTypeDeclaration(x.type);
  388. END;
  389. END Parameter;
  390. PROCEDURE TypeDeclaration(x: SyntaxTree.TypeDeclaration);
  391. BEGIN
  392. Type(x.declaredType); (* => code in objects *)
  393. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  394. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  395. END;
  396. END TypeDeclaration;
  397. PROCEDURE Constant(x: SyntaxTree.Constant);
  398. BEGIN
  399. IF (SyntaxTree.Public * x.access # {}) THEN
  400. implementationVisitor.VisitConstant(x);
  401. END;
  402. END Constant;
  403. PROCEDURE Scope(x: SyntaxTree.Scope);
  404. VAR procedure: SyntaxTree.Procedure;
  405. constant: SyntaxTree.Constant;
  406. variable: SyntaxTree.Variable;
  407. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  408. cell: SyntaxTree.CellType;
  409. parameter: SyntaxTree.Parameter;
  410. property: SyntaxTree.Property;
  411. BEGIN
  412. prevScope := currentScope;
  413. currentScope := x;
  414. (* constants treated in implementation visitor *)
  415. WITH x: SyntaxTree.CellScope DO
  416. cell := x.ownerCell;
  417. parameter := cell.firstParameter;
  418. WHILE parameter # NIL DO
  419. Parameter(parameter);
  420. parameter := parameter.nextParameter;
  421. END;
  422. property := cell.firstProperty;
  423. WHILE property # NIL DO
  424. Variable(property);
  425. property := property.nextProperty;
  426. END;
  427. ELSE
  428. END;
  429. typeDeclaration := x.firstTypeDeclaration;
  430. WHILE typeDeclaration # NIL DO
  431. TypeDeclaration(typeDeclaration);
  432. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  433. END;
  434. variable := x.firstVariable;
  435. WHILE variable # NIL DO
  436. Variable(variable);
  437. variable := variable.nextVariable;
  438. END;
  439. procedure := x.firstProcedure;
  440. WHILE procedure # NIL DO
  441. Procedure(procedure);
  442. procedure := procedure.nextProcedure;
  443. END;
  444. constant := x.firstConstant;
  445. WHILE constant # NIL DO
  446. Constant(constant);
  447. constant := constant.nextConstant;
  448. END;
  449. currentScope := prevScope;
  450. END Scope;
  451. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  452. VAR parameter: SyntaxTree.Parameter;
  453. BEGIN
  454. parameter := first;
  455. WHILE parameter # NIL DO
  456. Parameter(parameter);
  457. parameter := parameter.nextParameter;
  458. END;
  459. END Parameters;
  460. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  461. VAR scope: SyntaxTree.ProcedureScope;
  462. prevScope: SyntaxTree.Scope;
  463. inline, finalizer: BOOLEAN;
  464. procedureType: SyntaxTree.ProcedureType;
  465. pc: LONGINT;
  466. memorySize: Basic.Integer; stackSize: LONGINT;
  467. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  468. null,size,src,dest,fp,res: IntermediateCode.Operand;
  469. callingConvention: LONGINT;
  470. cellType: SyntaxTree.CellType;
  471. register: WORD;
  472. registerClass: IntermediateCode.RegisterClass;
  473. type: IntermediateCode.Type;
  474. formalParameter: SyntaxTree.Parameter;
  475. recordType: SyntaxTree.RecordType;
  476. isModuleBody: BOOLEAN;
  477. parametersSize: LONGINT;
  478. position: LONGINT;
  479. variable: SyntaxTree.Variable;
  480. nonParameterRegisters: WORD;
  481. PROCEDURE Signature;
  482. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  483. BEGIN
  484. procedureType := x.type(SyntaxTree.ProcedureType);
  485. returnType := procedureType.returnType;
  486. IF returnType # NIL THEN
  487. meta.CheckTypeDeclaration(returnType)
  488. END;
  489. parameter := procedureType.firstParameter;
  490. WHILE parameter # NIL DO
  491. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  492. parameter := parameter.nextParameter;
  493. END;
  494. END Signature;
  495. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: Basic.Integer): BOOLEAN;
  496. VAR result: BOOLEAN;
  497. BEGIN
  498. result := FALSE;
  499. IF x = SyntaxTree.invalidExpression THEN
  500. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  501. result := TRUE;
  502. value := x.resolved(SyntaxTree.IntegerValue).value;
  503. ELSE
  504. Error(x.position,"expression is not an integer constant");
  505. END;
  506. RETURN result;
  507. END CheckIntegerValue;
  508. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: Basic.Integer): BOOLEAN;
  509. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  510. BEGIN
  511. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  512. WHILE (this # NIL) & (this.identifier # id) DO
  513. this := this.nextModifier;
  514. END;
  515. IF this # NIL THEN
  516. IF this.expression = NIL THEN
  517. Error(this.position,"expected expression value");
  518. ELSIF CheckIntegerValue(this.expression,value) THEN
  519. END;
  520. RETURN TRUE
  521. ELSE RETURN FALSE
  522. END;
  523. END HasValue;
  524. CONST DefaultDataMemorySize=512;
  525. BEGIN
  526. IF x.externalName # NIL THEN RETURN END;
  527. (*
  528. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  529. *)
  530. (* code section for this procedure *)
  531. position := x.position.start;
  532. scope := x.procedureScope;
  533. prevScope := currentScope;
  534. currentScope := scope;
  535. procedureType := x.type(SyntaxTree.ProcedureType);
  536. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  537. implementationVisitor.temporaries.Clear;
  538. implementationVisitor.usedRegisters := NIL;
  539. implementationVisitor.registerUsageCount.Init;
  540. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  541. IF (scope.body # NIL) & (x.isInline) THEN
  542. inline := TRUE;
  543. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  544. ir.SetExported(IsExported(x));
  545. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  546. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  547. IF backend.cellsAreObjects THEN
  548. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  549. ir.SetExported(IsExported(x));
  550. ELSE
  551. RETURN; (* cellnet cannot be compiled for final static hardware *)
  552. END;
  553. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  554. inline := FALSE;
  555. AddBodyCallStub(x);
  556. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  557. ir.SetExported(IsExported(x));
  558. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  559. inline := FALSE;
  560. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  561. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,memorySize) THEN memorySize := DefaultDataMemorySize END;
  562. AddBodyCallStub(x);
  563. AddStackAllocation(x,memorySize);
  564. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  565. ir.SetExported(IsExported(x));
  566. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  567. inline := FALSE;
  568. Parameters(procedureType.firstParameter);
  569. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  570. ir.SetExported(IsExported(x));
  571. ELSE
  572. inline := FALSE;
  573. IF x.isEntry OR x.isExit THEN
  574. IF x.isEntry THEN
  575. ir := implementationVisitor.NewSection(module.allSections, Sections.EntryCodeSection, name,x,dump);
  576. ELSE
  577. ir := implementationVisitor.NewSection(module.allSections, Sections.ExitCodeSection, name,x,dump);
  578. END;
  579. ir.SetExported(TRUE);
  580. ELSE
  581. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  582. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  583. END;
  584. END;
  585. callingConvention := procedureType.callingConvention;
  586. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  587. parametersSize := ProcedureParametersSize(backend.system,x);
  588. ELSE
  589. parametersSize := 0;
  590. END;
  591. IF scope.body # NIL THEN
  592. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  593. IF ~inline THEN
  594. IF scope.lastVariable = NIL THEN
  595. stackSize := 0
  596. ELSE
  597. stackSize := scope.lastVariable.offsetInBits;
  598. IF stackSize <0 THEN stackSize := -stackSize END;
  599. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  600. END;
  601. (*
  602. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  603. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  604. *)
  605. (*
  606. ir.Emit(Nop(position)); (* placeholder for fill *)
  607. *)
  608. IF (callingConvention # SyntaxTree.OberonCallingConvention) & (~(callingConvention IN SysvABI) OR (system.addressSize # 64)) THEN
  609. backend.ResetParameterRegisters();
  610. (* assumption: registers are passed left to right and left parameters are in registers *)
  611. formalParameter := procedureType.firstParameter;
  612. WHILE (formalParameter # NIL) DO
  613. IF PassInRegister(formalParameter, callingConvention) THEN
  614. IF formalParameter.type.IsRecordType() THEN
  615. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  616. type := addressType;
  617. ELSE
  618. type := GetType(system, formalParameter.type);
  619. END;
  620. IF backend.GetParameterRegister(callingConvention, type, register) THEN
  621. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  622. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  623. IntermediateCode.InitMemory(dest,type,implementationVisitor.sp,ToMemoryUnits(system,formalParameter.offsetInBits - system.addressSize));
  624. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  625. implementationVisitor.ReleaseIntermediateOperand(src);
  626. END;
  627. END;
  628. formalParameter := formalParameter.nextParameter;
  629. END;
  630. END;
  631. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  632. implementationVisitor.EmitEnter(ir,x.position,x,callingConvention,ToMemoryUnits(system,stackSize));
  633. END;
  634. pc := ir.pc-1;
  635. IF (callingConvention IN SysvABI) & (system.addressSize = 64) THEN
  636. backend.ResetParameterRegisters();
  637. nonParameterRegisters := 0;
  638. (* assumption: registers are passed left to right and left parameters are in registers *)
  639. formalParameter := procedureType.firstParameter;
  640. WHILE (formalParameter # NIL) DO
  641. IF PassInRegister(formalParameter, callingConvention) THEN
  642. IF formalParameter.type.IsRecordType() THEN
  643. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  644. type := addressType;
  645. ELSE
  646. type := GetType(system, formalParameter.type);
  647. END;
  648. IF backend.GetParameterRegister(callingConvention, type, register) THEN
  649. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  650. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  651. implementationVisitor.currentScope := currentScope;
  652. variable := implementationVisitor.GetTemporaryVariable(formalParameter.type,FALSE,FALSE);
  653. formalParameter.SetOffset(variable.offsetInBits);
  654. IntermediateCode.InitMemory(dest,type,implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  655. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  656. implementationVisitor.ReleaseIntermediateOperand(src);
  657. ELSE
  658. INC(nonParameterRegisters);
  659. formalParameter.SetOffset(nonParameterRegisters * addressType.sizeInBits);
  660. END;
  661. END;
  662. formalParameter := formalParameter.nextParameter;
  663. END;
  664. END;
  665. END;
  666. implementationVisitor.tagsAvailable := callingConvention = SyntaxTree.OberonCallingConvention;
  667. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  668. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  669. IF scope.lastVariable # NIL THEN
  670. stackSize := scope.lastVariable.offsetInBits;
  671. IF stackSize <0 THEN stackSize := -stackSize END;
  672. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  673. END;
  674. END;
  675. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  676. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  677. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  678. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.builtinsModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  679. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  680. ir.EmitAt(pc,Push(size));
  681. implementationVisitor.StaticCallOperand(result,procedure);
  682. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  683. END;
  684. *)
  685. END;
  686. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,callingConvention,ToMemoryUnits(system,stackSize))); (*!!*)
  687. IF stackSize > 0 THEN
  688. IF (stackSize MOD system.addressSize = 0) THEN
  689. null := IntermediateCode.Immediate(addressType,0);
  690. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  691. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  692. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  693. ELSE
  694. null := IntermediateCode.Immediate(int8,0);
  695. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  696. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  697. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  698. END;
  699. (*! should potentially be called by backend -- enter might initialize
  700. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  701. *)
  702. END;
  703. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  704. parametersSize := ProcedureParametersSize(backend.system,x);
  705. ELSE
  706. parametersSize := 0;
  707. END;
  708. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  709. finalizer := FALSE;
  710. IF backend.cooperative & x.isFinalizer THEN
  711. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  712. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  713. GetRecordTypeName(recordType,name);
  714. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  715. END;
  716. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  717. IF backend.cooperative THEN
  718. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  719. IF implementationVisitor.profile & ~isModuleBody THEN
  720. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  721. END;
  722. ELSE
  723. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  724. END;
  725. implementationVisitor.EmitLeave(ir, x.position,x,callingConvention);
  726. IF finalizer THEN
  727. IF backend.hasLinkRegister THEN
  728. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  729. END;
  730. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  731. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  732. ir.Emit(Br(x.position,dest));
  733. ELSE
  734. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  735. END;
  736. ELSE
  737. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  738. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  739. END;
  740. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  741. IF backend.cooperative THEN
  742. IF HasPointers (scope) THEN
  743. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  744. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  745. ir.Emit(Result(x.position, res));
  746. ir.Emit(Push(x.position, res));
  747. implementationVisitor.ResetVariables(scope);
  748. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  749. ir.Emit(Pop(x.position, res));
  750. ir.Emit(Return(x.position, res));
  751. ELSE
  752. implementationVisitor.ResetVariables(scope);
  753. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  754. END;
  755. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  756. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  757. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  758. ir.Emit(Result(x.position, res));
  759. ir.Emit(Push(x.position, res));
  760. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  761. ir.Emit(Pop(x.position, res));
  762. ir.Emit(Return(x.position, res));
  763. ELSE
  764. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  765. END;
  766. END;
  767. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  768. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  769. ELSE
  770. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  771. ir.Emit(Nop(x.position));
  772. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  773. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  774. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  775. END;
  776. END;
  777. END
  778. END;
  779. ELSE (* force body for procedures *)
  780. implementationVisitor.EmitEnter(ir, x.position,x,callingConvention,0);
  781. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  782. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  783. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  784. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  785. END;
  786. Scope(scope);
  787. Signature;
  788. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  789. currentScope := prevScope;
  790. END Procedure;
  791. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  792. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  793. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  794. BEGIN
  795. ASSERT (bodyProcedure # NIL);
  796. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  797. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  798. procedure.SetScope(bodyProcedure.scope);
  799. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  800. procedure.SetAccess(SyntaxTree.Hidden);
  801. Global.GetSymbolSegmentedName (procedure,name);
  802. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  803. ir.SetExported(TRUE);
  804. Global.GetSymbolSegmentedName (bodyProcedure,name);
  805. IF ~meta.simple THEN
  806. implementationVisitor.currentScope := module.module.moduleScope;
  807. implementationVisitor.section := ir;
  808. implementationVisitor.PushSelfPointer();
  809. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  810. ELSIF backend.preregisterStatic THEN
  811. implementationVisitor.currentScope := module.module.moduleScope;
  812. implementationVisitor.section := ir;
  813. implementationVisitor.PushSelfPointer();
  814. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  815. ELSE
  816. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  817. ir.Emit(Call(bodyProcedure.position,op, 0));
  818. END;
  819. END AddBodyCallStub;
  820. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: Basic.Integer); (* code that is only necessary for static linkers *)
  821. VAR name: Basic.SegmentedName;
  822. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  823. BEGIN
  824. Global.GetSymbolSegmentedName (symbol,name);
  825. Basic.RemoveSuffix(name);
  826. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  827. ir := implementationVisitor.NewSection(module.allSections,Sections.EntryCodeSection,name,NIL,dump);
  828. ir.SetExported(TRUE);
  829. IntermediateCode.InitImmediate(op,addressType,initStack);
  830. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  831. END AddStackAllocation;
  832. (** entry function to visit a complete module *)
  833. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  834. VAR
  835. name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  836. hasDynamicOperatorDeclarations: BOOLEAN;
  837. operator: SyntaxTree.Operator;
  838. import: SyntaxTree.Import;
  839. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  840. BEGIN
  841. type := type.resolved;
  842. IF type IS SyntaxTree.RecordType THEN
  843. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  844. ELSIF (type IS SyntaxTree.ArrayType) THEN
  845. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  846. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  847. END;
  848. ELSIF type IS SyntaxTree.MathArrayType THEN
  849. WITH type: SyntaxTree.MathArrayType DO
  850. IF type.form = SyntaxTree.Open THEN
  851. RETURN TRUE
  852. ELSIF type.form = SyntaxTree.Static THEN
  853. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  854. END;
  855. END;
  856. END;
  857. RETURN FALSE
  858. END TypeNeedsInitialization;
  859. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  860. VAR variable: SyntaxTree.Variable;
  861. BEGIN
  862. variable := scope.firstVariable;
  863. WHILE variable # NIL DO
  864. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  865. IF variable.initializer # NIL THEN RETURN TRUE END;
  866. variable := variable.nextVariable;
  867. END;
  868. RETURN FALSE
  869. END ScopeNeedsInitialization;
  870. BEGIN
  871. ASSERT(x # NIL); ASSERT(module # NIL);
  872. SELF.module := module;
  873. (* add import names to the generated Sections.Module *)
  874. import := x.moduleScope.firstImport;
  875. WHILE import # NIL DO
  876. import.module.GetName(idstr);
  877. module.imports.AddName(idstr);
  878. import := import.nextImport
  879. END;
  880. implementationVisitor.module := module;
  881. implementationVisitor.moduleScope := x.moduleScope;
  882. implementationVisitor.moduleSelf := moduleSelf;
  883. implementationVisitor.canBeLoaded := TRUE;
  884. meta.SetModule(module);
  885. IF (forceModuleBody OR ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  886. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  887. END;
  888. IF backend.profile THEN
  889. EnsureBodyProcedure(x.moduleScope);
  890. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  891. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  892. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  893. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  894. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  895. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0);
  896. Global.GetModuleName(module.module,idstr);
  897. implementationVisitor.ProfilerAddModule(idstr);
  898. implementationVisitor.numberProcedures := 0;
  899. END;
  900. implementationVisitor.profile := backend.profile;
  901. (* check if there is at least one dynamic operator locally defined *)
  902. hasDynamicOperatorDeclarations := FALSE;
  903. operator := x.moduleScope.firstOperator;
  904. WHILE operator # NIL DO
  905. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  906. operator := operator.nextOperator
  907. END;
  908. (* add operator initialization code section *)
  909. IF hasDynamicOperatorDeclarations THEN
  910. EnsureBodyProcedure(x.moduleScope);
  911. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  912. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  913. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0);
  914. END;
  915. Scope(x.moduleScope);
  916. IF hasDynamicOperatorDeclarations THEN
  917. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  918. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  919. END;
  920. IF backend.profile THEN
  921. implementationVisitor.ProfilerPatchInit;
  922. END;
  923. END Module;
  924. END DeclarationVisitor;
  925. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  926. RegisterUsageCount*=OBJECT
  927. VAR used: UsedArray; count: LONGINT;
  928. PROCEDURE &Init;
  929. VAR i: LONGINT;
  930. BEGIN
  931. count := 0;
  932. IF used = NIL THEN NEW(used,64); END;
  933. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  934. END Init;
  935. PROCEDURE Grow;
  936. VAR new: UsedArray; size,i: LONGINT;
  937. BEGIN
  938. size := LEN(used)*2;
  939. NEW(new,size);
  940. FOR i := 0 TO LEN(used)-1 DO
  941. new[i].count := used[i].count;
  942. new[i].type := used[i].type;
  943. new[i].map := used[i].map
  944. END;
  945. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  946. used := new
  947. END Grow;
  948. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  949. BEGIN
  950. INC(count);
  951. IF count = LEN(used) THEN Grow END;
  952. used[count].type := type;
  953. used[count].class := class;
  954. used[count].map := count;
  955. RETURN count;
  956. END Next;
  957. PROCEDURE IncUse(register: LONGINT);
  958. BEGIN
  959. INC(used[register].count);
  960. (*
  961. IF (register = 1) & (count > 30) THEN
  962. D.TraceBack;
  963. END;
  964. *)
  965. END IncUse;
  966. PROCEDURE DecUse(register: LONGINT);
  967. BEGIN
  968. DEC(used[register].count);
  969. END DecUse;
  970. PROCEDURE Map(register: LONGINT): LONGINT;
  971. VAR map : LONGINT;
  972. BEGIN
  973. IF register > 0 THEN
  974. map := used[register].map;
  975. WHILE register # map DO register := map; map := used[register].map END;
  976. END;
  977. RETURN register
  978. END Map;
  979. PROCEDURE Use(register: LONGINT): LONGINT;
  980. BEGIN
  981. IF register< LEN(used) THEN
  982. RETURN used[register].count
  983. ELSE
  984. RETURN 0
  985. END
  986. END Use;
  987. END RegisterUsageCount;
  988. RegisterEntry = POINTER TO RECORD
  989. prev,next: RegisterEntry;
  990. register: LONGINT;
  991. registerClass: IntermediateCode.RegisterClass;
  992. type: IntermediateCode.Type;
  993. END;
  994. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  995. Variables = OBJECT (Basic.List)
  996. VAR
  997. inUse: VariableUse;
  998. registerIndex: LONGINT;
  999. nameIndex: LONGINT;
  1000. PROCEDURE & Init;
  1001. VAR i: LONGINT;
  1002. BEGIN
  1003. InitList(16);
  1004. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1005. registerIndex := 1024;
  1006. nameIndex := 0;
  1007. END Init;
  1008. PROCEDURE Clear*;
  1009. VAR i: LONGINT;
  1010. BEGIN
  1011. Clear^;
  1012. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1013. registerIndex := 1024;
  1014. nameIndex := 0;
  1015. END Clear;
  1016. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1017. VAR string: SyntaxTree.IdentifierString ;
  1018. BEGIN
  1019. COPY("@hiddenIRVar",string);
  1020. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1021. RETURN SyntaxTree.NewIdentifier(string);
  1022. END GetUID;
  1023. PROCEDURE GetUsage(VAR use: VariableUse);
  1024. BEGIN
  1025. use := inUse;
  1026. END GetUsage;
  1027. PROCEDURE SetUsage(CONST use: VariableUse);
  1028. BEGIN
  1029. inUse := use;
  1030. END SetUsage;
  1031. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1032. VAR any: ANY;
  1033. BEGIN
  1034. any := Get(i);
  1035. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1036. END GetVariable;
  1037. PROCEDURE SetVariable(pos: LONGINT; v: SyntaxTree.Variable);
  1038. BEGIN
  1039. Set(pos, v);
  1040. END SetVariable;
  1041. PROCEDURE Occupy(pos: LONGINT);
  1042. BEGIN
  1043. INCL(inUse[pos DIV 32], pos MOD 32);
  1044. END Occupy;
  1045. PROCEDURE Occupied(pos: LONGINT): BOOLEAN;
  1046. BEGIN
  1047. RETURN (pos MOD 32) IN inUse[pos DIV 32];
  1048. END Occupied;
  1049. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1050. BEGIN
  1051. Occupy(Length());
  1052. Add(v);
  1053. END AddVariable;
  1054. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1055. BEGIN
  1056. t1 := t1.resolved;
  1057. t2 := t2.resolved;
  1058. (*RETURN t1.SameType(t2); *)
  1059. RETURN
  1060. (t1.SameType(t2))
  1061. OR
  1062. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1063. OR
  1064. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits > 0) & (t1.sizeInBits = t2.sizeInBits)
  1065. OR
  1066. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1067. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1068. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1069. OR
  1070. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1071. (DynamicDim(t1) = DynamicDim(t2))
  1072. );
  1073. END CompatibleType;
  1074. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1075. VAR var : SyntaxTree.Variable; i: LONGINT;
  1076. BEGIN
  1077. pos := Length();
  1078. FOR i := 0 TO pos-1 DO
  1079. IF ~(Occupied(i)) THEN
  1080. var := GetVariable(i);
  1081. IF (~var.useRegister) & CompatibleType(type, var.type) & (var.untraced = untraced) (*& ~(var.type.NeedsTrace())*) THEN
  1082. pos := i;
  1083. Occupy(i);
  1084. RETURN var;
  1085. END;
  1086. END;
  1087. END;
  1088. RETURN NIL
  1089. END GetFreeVariable;
  1090. END Variables;
  1091. SymbolMap = POINTER TO RECORD
  1092. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1093. isAddress: BOOLEAN;
  1094. END;
  1095. SymbolMapper = OBJECT
  1096. VAR
  1097. first: SymbolMap;
  1098. PROCEDURE & Init;
  1099. BEGIN
  1100. first := NIL;
  1101. END Init;
  1102. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1103. VAR new: SymbolMap;
  1104. BEGIN
  1105. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1106. new.next := first; first := new;
  1107. END Add;
  1108. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1109. VAR s: SymbolMap;
  1110. BEGIN
  1111. s := first;
  1112. WHILE (s # NIL) & (s.this # this) DO
  1113. s := s.next
  1114. END;
  1115. RETURN s
  1116. END Get;
  1117. END SymbolMapper;
  1118. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1119. VAR
  1120. system: Global.System;
  1121. section: IntermediateCode.Section;
  1122. module: Sections.Module;
  1123. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1124. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1125. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1126. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1127. checker: SemanticChecker.Checker;
  1128. backend: IntermediateBackend;
  1129. meta: MetaDataGenerator;
  1130. position: Position;
  1131. moduleSelf: SyntaxTree.Variable;
  1132. (* variables for hand over of variables / temporary state *)
  1133. currentScope: SyntaxTree.Scope;
  1134. constantDeclaration : SyntaxTree.Symbol;
  1135. result: Operand; (* result of the most recent expression / statement *)
  1136. destination: IntermediateCode.Operand;
  1137. arrayDestinationTag: IntermediateCode.Operand;
  1138. arrayDestinationDimension:LONGINT;
  1139. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1140. trueLabel, falseLabel, exitLabel: Label;
  1141. locked: BOOLEAN;
  1142. (*
  1143. usedRegisters: Registers;
  1144. *)
  1145. registerUsageCount: RegisterUsageCount;
  1146. usedRegisters: RegisterEntry;
  1147. (* useful operands and types *)
  1148. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1149. bool,addressType,setType, sizeType, lenType, byteType: IntermediateCode.Type;
  1150. commentPrintout: Printout.Printer;
  1151. dump: Streams.Writer;
  1152. tagsAvailable : BOOLEAN;
  1153. supportedInstruction: SupportedInstructionProcedure;
  1154. supportedImmediate: SupportedImmediateProcedure;
  1155. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1156. emitLabels: BOOLEAN;
  1157. builtinsModuleName : SyntaxTree.IdentifierString;
  1158. indexCounter: LONGINT;
  1159. profile: BOOLEAN;
  1160. profileId, profileInit: IntermediateCode.Section;
  1161. profileInitPatchPosition: LONGINT;
  1162. numberProcedures: LONGINT;
  1163. procedureResultDesignator : SyntaxTree.Designator;
  1164. operatorInitializationCodeSection: IntermediateCode.Section;
  1165. fingerPrinter: FingerPrinter.FingerPrinter;
  1166. temporaries: Variables;
  1167. canBeLoaded : BOOLEAN;
  1168. currentIsInline: BOOLEAN;
  1169. currentMapper: SymbolMapper;
  1170. currentInlineExit: Label;
  1171. moduleBodySection: IntermediateCode.Section;
  1172. NeedDescriptor : BOOLEAN;
  1173. cooperativeSwitches: BOOLEAN;
  1174. lastSwitchPC: LONGINT;
  1175. isUnchecked: BOOLEAN;
  1176. (* EXPERIMENTAL *)
  1177. availableSymbols: ARRAY 1024 OF
  1178. RECORD
  1179. symbol: SyntaxTree.Symbol;
  1180. inMemory, inRegister: BOOLEAN;
  1181. register: IntermediateCode.Operand;
  1182. memory: IntermediateCode.Operand;
  1183. END;
  1184. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend);
  1185. BEGIN
  1186. SELF.system := system;
  1187. SELF.builtinsModuleName := runtime;
  1188. currentScope := NIL;
  1189. hiddenPointerType := NIL;
  1190. delegatePointerType := NIL;
  1191. awaitProcCounter := 0;
  1192. labelId := 0; constId := 0; labelId := 0;
  1193. SELF.checker := checker;
  1194. SELF.backend := backend;
  1195. position := Basic.invalidPosition;
  1196. locked := FALSE;
  1197. InitOperand(result,ModeUndefined);
  1198. addressType := IntermediateCode.GetType(system,system.addressType);
  1199. setType := IntermediateCode.GetType(system,system.setType);
  1200. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1201. lenType := IntermediateCode.GetType(system, system.lenType);
  1202. byteType := IntermediateCode.GetType(system, system.byteType);
  1203. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1204. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1205. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1206. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1207. nil := IntermediateCode.Immediate(addressType,0);
  1208. one := IntermediateCode.Immediate(addressType,1);
  1209. IntermediateCode.InitOperand(destination);
  1210. tagsAvailable := TRUE;
  1211. supportedInstruction := supportedInstructionProcedure;
  1212. supportedImmediate := supportedImmediateProcedure;
  1213. inData := FALSE;
  1214. SELF.emitLabels := emitLabels;
  1215. IntermediateCode.InitOperand(arrayDestinationTag);
  1216. bool := IntermediateCode.GetType(system,system.booleanType);
  1217. IntermediateCode.InitImmediate(false,bool,0);
  1218. IntermediateCode.InitImmediate(true,bool,1);
  1219. indexCounter := 0;
  1220. NEW(registerUsageCount);
  1221. usedRegisters := NIL;
  1222. procedureResultDesignator := NIL;
  1223. NEW(fingerPrinter);
  1224. NEW(temporaries);
  1225. currentIsInline := FALSE;
  1226. NeedDescriptor := FALSE;
  1227. isUnchecked := backend.noRuntimeChecks;
  1228. END Init;
  1229. TYPE Context = RECORD
  1230. section: IntermediateCode.Section;
  1231. registerUsageCount: RegisterUsageCount;
  1232. usedRegisters: RegisterEntry;
  1233. temporaries: Variables;
  1234. END;
  1235. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1236. VAR context: Context;
  1237. BEGIN
  1238. context.section := section;
  1239. context.registerUsageCount := registerUsageCount;
  1240. context.usedRegisters := usedRegisters;
  1241. context.temporaries := temporaries;
  1242. section := new;
  1243. NEW(registerUsageCount);
  1244. NEW(temporaries);
  1245. usedRegisters := NIL;
  1246. RETURN context;
  1247. END SwitchContext;
  1248. PROCEDURE ReturnToContext(context: Context);
  1249. BEGIN
  1250. section := context.section;
  1251. registerUsageCount := context.registerUsageCount;
  1252. usedRegisters := context.usedRegisters;
  1253. temporaries := context.temporaries;
  1254. END ReturnToContext;
  1255. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1256. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1257. BEGIN
  1258. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1259. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1260. END;
  1261. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1262. section.SetExported(IsExported(syntaxTreeSymbol));
  1263. RETURN section
  1264. END NewSection;
  1265. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1266. VAR new: LONGINT;
  1267. BEGIN
  1268. new := registerUsageCount.Next(type,class);
  1269. UseRegister(new);
  1270. RETURN new
  1271. END AcquireRegister;
  1272. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1273. VAR
  1274. fingerPrint: SyntaxTree.FingerPrint;
  1275. fingerPrintString: ARRAY 32 OF CHAR;
  1276. BEGIN
  1277. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1278. string := "[";
  1279. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1280. Strings.Append(string, fingerPrintString);
  1281. Strings.Append(string, "]");
  1282. END GetFingerprintString;
  1283. (** get the name for the code section that represens a certain symbol
  1284. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1285. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1286. VAR string: ARRAY 32 OF CHAR;
  1287. BEGIN
  1288. Global.GetSymbolSegmentedName(symbol, name);
  1289. (* if the symbol is an operator, then append the fingerprint to the name *)
  1290. IF symbol IS SyntaxTree.Operator THEN
  1291. GetFingerprintString(symbol, string);
  1292. Basic.AppendToSegmentedName(name,string);
  1293. END
  1294. END GetCodeSectionNameForSymbol;
  1295. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1296. BEGIN
  1297. IF dump # NIL THEN
  1298. dump.String("enter "); dump.String(s); dump.Ln;
  1299. END;
  1300. END TraceEnter;
  1301. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1302. BEGIN
  1303. IF dump # NIL THEN
  1304. dump.String("exit "); dump.String(s); dump.Ln;
  1305. END;
  1306. END TraceExit;
  1307. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1308. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1309. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1310. VAR i: LONGINT;
  1311. BEGIN
  1312. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1313. IF op.rule # NIL THEN
  1314. FOR i := 0 TO LEN(op.rule)-1 DO
  1315. CheckRegister(op.rule[i])
  1316. END;
  1317. END;
  1318. END CheckRegister;
  1319. BEGIN
  1320. CheckRegister(instruction.op1);
  1321. CheckRegister(instruction.op2);
  1322. CheckRegister(instruction.op3);
  1323. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1324. ELSE section.Emit(instruction);
  1325. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1326. END;
  1327. END Emit;
  1328. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1329. VAR saved: RegisterEntry;
  1330. BEGIN
  1331. IF backend.cooperative THEN
  1332. ReleaseUsedRegisters(saved);
  1333. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1334. CallThis(position,"Runtime","Trap",1);
  1335. RestoreRegisterUse(saved);
  1336. ELSE
  1337. Emit(Trap(position,trapNo));
  1338. END;
  1339. END EmitTrap;
  1340. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT);
  1341. VAR name: Basic.SegmentedName;
  1342. VAR op1, op2, reg: IntermediateCode.Operand;
  1343. VAR call, nocall: Label;
  1344. VAR parametersSize: LONGINT;
  1345. VAR prevSection: IntermediateCode.Section;
  1346. VAR prevDump: Streams.Writer;
  1347. VAR body: SyntaxTree.Body;
  1348. VAR procedureType: SyntaxTree.ProcedureType;
  1349. BEGIN
  1350. IF procedure # NIL THEN
  1351. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1352. ELSE procedureType := NIL;
  1353. END;
  1354. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1355. prevSection := SELF.section;
  1356. SELF.section := section;
  1357. prevDump := dump;
  1358. dump := section.comments;
  1359. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1360. IF backend.hasLinkRegister THEN
  1361. Emit(Push(Basic.invalidPosition, lr));
  1362. END;
  1363. Emit(Push(Basic.invalidPosition,fp));
  1364. IF procedure # NIL THEN
  1365. body := procedure.procedureScope.body;
  1366. ELSE
  1367. body := NIL;
  1368. END;
  1369. IF backend.cooperative THEN
  1370. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1371. GetCodeSectionNameForSymbol(procedure, name);
  1372. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1373. ELSE
  1374. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1375. END;
  1376. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1377. IntermediateCode.AddOffset(op1, 1);
  1378. Emit(Push(Basic.invalidPosition,op1));
  1379. Emit(Mov(Basic.invalidPosition,fp, sp));
  1380. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1381. NEW(call, section);
  1382. NEW(nocall, section);
  1383. reg := NewRegisterOperand(addressType);
  1384. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1385. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1386. BrltL(call, sp, reg);
  1387. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1388. BrgeL(nocall, sp, op2);
  1389. call.Resolve(section.pc);
  1390. Emit(Push(Basic.invalidPosition, reg));
  1391. ReleaseIntermediateOperand(reg);
  1392. parametersSize := ProcParametersSize(procedure);
  1393. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1394. Emit(Push(Basic.invalidPosition, op2));
  1395. CallThis(position, "Activities","ExpandStack",2);
  1396. Emit(Result(Basic.invalidPosition, sp));
  1397. nocall.Resolve(section.pc);
  1398. END;
  1399. ELSE
  1400. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1401. Emit(Push(Basic.invalidPosition, one)) ;
  1402. procedureType.SetParametersOffset(1);
  1403. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1404. END;
  1405. Emit(Mov(Basic.invalidPosition, fp, sp));
  1406. END;
  1407. END;
  1408. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1409. SELF.section := prevSection;
  1410. dump := prevDump;
  1411. END EmitEnter;
  1412. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1413. VAR op1,op2: IntermediateCode.Operand;
  1414. VAR instruction: IntermediateCode.Instruction;
  1415. BEGIN
  1416. IntermediateCode.InitNumber(op1,callconv);
  1417. IntermediateCode.InitNumber(op2,varSize);
  1418. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1419. RETURN instruction
  1420. END Enter;
  1421. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1422. VAR op1: IntermediateCode.Operand;
  1423. VAR instruction: IntermediateCode.Instruction;
  1424. BEGIN
  1425. IntermediateCode.InitNumber(op1,callconv);
  1426. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1427. RETURN instruction
  1428. END Leave;
  1429. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1430. VAR prevSection: IntermediateCode.Section;
  1431. VAR op2: IntermediateCode.Operand;
  1432. VAR body: SyntaxTree.Body;
  1433. BEGIN
  1434. prevSection := SELF.section;
  1435. SELF.section := section;
  1436. Emit(Leave(position, callconv));
  1437. IF procedure # NIL THEN
  1438. body := procedure.procedureScope.body;
  1439. ELSE
  1440. body := NIL;
  1441. END;
  1442. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1443. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1444. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1445. Emit(Add(position, sp, fp, op2));
  1446. ELSE
  1447. Emit(Mov(position, sp, fp));
  1448. END;
  1449. Emit(Pop(position, fp));
  1450. END;
  1451. SELF.section := prevSection;
  1452. END EmitLeave;
  1453. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1454. VAR m: SymbolMap;
  1455. BEGIN
  1456. position := x.position;
  1457. IF currentIsInline THEN
  1458. m := currentMapper.Get(x);
  1459. IF m # NIL THEN
  1460. (*
  1461. Printout.Info("mapping from", x);
  1462. Printout.Info("mapping to ", m.to);
  1463. *)
  1464. VExpression(m.to);
  1465. op := result;
  1466. IF m.tag # NIL THEN
  1467. ReleaseIntermediateOperand(result.tag);
  1468. VExpression(m.tag);
  1469. op.tag := result.op;
  1470. ReleaseIntermediateOperand(result.tag);
  1471. END;
  1472. RETURN
  1473. END;
  1474. END;
  1475. VSymbol(x);
  1476. op := result;
  1477. END Symbol;
  1478. PROCEDURE Expression(x: SyntaxTree.Expression);
  1479. BEGIN
  1480. position := x.position;
  1481. constantDeclaration := NIL;
  1482. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1483. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1484. END;
  1485. IF x.resolved # NIL THEN
  1486. VExpression(x.resolved);
  1487. ELSE
  1488. VExpression(x);
  1489. END;
  1490. (* check this, was commented out in ActiveCells3 *)
  1491. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1492. Error(x.position, "unsupported modifier");
  1493. END;
  1494. END Expression;
  1495. (*
  1496. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1497. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1498. BEGIN
  1499. temporaries.GetUsage(current);
  1500. FOR i := 0 TO LEN(current)-1 DO
  1501. set := current[i] - previous[i];
  1502. IF set # {} THEN
  1503. FOR j := 0 TO MAX(SET)-1 DO
  1504. IF j IN set THEN
  1505. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1506. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1507. Symbol(variable, op);
  1508. MakeMemory(tmp,op.op,addressType,0);
  1509. ReleaseOperand(op);
  1510. Emit(Mov(position,tmp, nil ) );
  1511. ReleaseIntermediateOperand(tmp);
  1512. END;
  1513. END;
  1514. END;
  1515. END;
  1516. END;
  1517. END ResetUsedTemporaries;
  1518. *)
  1519. PROCEDURE Statement(x: SyntaxTree.Statement);
  1520. VAR use: VariableUse;
  1521. BEGIN
  1522. temporaries.GetUsage(use);
  1523. position := x.position;
  1524. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1525. IF commentPrintout # NIL THEN
  1526. commentPrintout.Statement(x);
  1527. dump.Ln;
  1528. (*dump.Update;*)
  1529. END;
  1530. VStatement(x);
  1531. (*
  1532. CheckRegistersFree();
  1533. *)
  1534. (*ResetUsedTemporaries(use);*)
  1535. temporaries.SetUsage(use);
  1536. END Statement;
  1537. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1538. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1539. *)
  1540. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1541. BEGIN
  1542. ASSERT(op.mode # IntermediateCode.Undefined);
  1543. IF op.mode = IntermediateCode.ModeMemory THEN
  1544. ReuseCopy(res,op);
  1545. ELSE
  1546. res := op;
  1547. UseIntermediateOperand(res);
  1548. END;
  1549. IntermediateCode.AddOffset(res,offset);
  1550. IntermediateCode.MakeMemory(res,type);
  1551. END MakeMemory;
  1552. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1553. VAR mem: IntermediateCode.Operand;
  1554. BEGIN
  1555. MakeMemory(mem,res,type,offset);
  1556. ReleaseIntermediateOperand(res);
  1557. res := mem;
  1558. END ToMemory;
  1559. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1560. VAR mem: IntermediateCode.Operand;
  1561. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1562. componentType: SyntaxTree.Type;
  1563. BEGIN
  1564. type := type.resolved;
  1565. IF operand.mode = ModeReference THEN
  1566. IF type IS SyntaxTree.RangeType THEN
  1567. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1568. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1569. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1570. ReleaseOperand(operand);
  1571. operand.op := firstOp;
  1572. operand.tag := lastOp;
  1573. operand.extra := stepOp;
  1574. ELSIF type IS SyntaxTree.ComplexType THEN
  1575. componentType := type(SyntaxTree.ComplexType).componentType;
  1576. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1577. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1578. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1579. ReleaseOperand(operand);
  1580. operand.op := firstOp;
  1581. operand.tag := lastOp
  1582. ELSE
  1583. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1584. ReleaseIntermediateOperand(operand.op);
  1585. (* EXPERIMENTAL *)
  1586. IF operand.availability >= 0 THEN
  1587. IF availableSymbols[operand.availability].inRegister THEN
  1588. operand.op := availableSymbols[operand.availability].register;
  1589. UseIntermediateOperand(operand.op);
  1590. ELSE
  1591. availableSymbols[operand.availability].register := NewRegisterOperand(IntermediateCode.GetType(system,type));
  1592. availableSymbols[operand.availability].memory := mem;
  1593. operand.op := availableSymbols[operand.availability].register;
  1594. Emit(Mov(position, operand.op, mem));
  1595. availableSymbols[operand.availability].inRegister := TRUE;
  1596. END;
  1597. ReleaseIntermediateOperand(mem);
  1598. ELSE
  1599. operand.op := mem;
  1600. END;
  1601. END;
  1602. operand.mode := ModeValue;
  1603. END;
  1604. ASSERT(operand.mode = ModeValue);
  1605. END LoadValue;
  1606. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1607. BEGIN
  1608. InitOperand(result, ModeUndefined);
  1609. Expression(x);
  1610. op := result;
  1611. LoadValue(op,x.type.resolved);
  1612. END Evaluate;
  1613. PROCEDURE EvaluateX(x: SyntaxTree.Expression): Operand;
  1614. VAR op: Operand;
  1615. BEGIN
  1616. Evaluate(x, op);
  1617. RETURN op;
  1618. END EvaluateX;
  1619. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1620. BEGIN
  1621. InitOperand(result,ModeUndefined);
  1622. Expression(x);
  1623. op := result;
  1624. END Designate;
  1625. PROCEDURE Condition(CONST x: SyntaxTree.Expression; label: Label; reason: BOOLEAN);
  1626. VAR skip: Label; recordType: SyntaxTree.RecordType; left, right: Operand;
  1627. leftType, rightType: SyntaxTree.Type; temp: IntermediateCode.Operand;
  1628. leftExpression, rightExpression: SyntaxTree.Expression;
  1629. BEGIN
  1630. ASSERT(label # NIL);
  1631. IF (x.resolved # NIL) & (x.resolved # x) THEN Condition(x.resolved, label, reason); RETURN END;
  1632. WITH x:
  1633. SyntaxTree.UnaryExpression DO
  1634. CASE x.operator OF
  1635. Scanner.Not:
  1636. Condition(x.left,label,~reason);
  1637. RETURN;
  1638. ELSE
  1639. END;
  1640. | SyntaxTree.BinaryExpression DO
  1641. leftType := x.left.type.resolved;
  1642. rightType := x.right.type.resolved;
  1643. CASE x.operator OF
  1644. Scanner.Or:
  1645. (* shortcut evaluation of left OR right *)
  1646. IF reason THEN (*left or right*)
  1647. Condition(x.left,label,TRUE);
  1648. Condition(x.right,label,TRUE);
  1649. ELSE (* ~ (left or right) = ~left & ~right *)
  1650. skip := NewLabel();
  1651. Condition(x.left,skip,TRUE);
  1652. Condition(x.right,label,FALSE);
  1653. SetLabel(skip);
  1654. END;
  1655. RETURN;
  1656. |Scanner.And:
  1657. (* shortcut evaluation of left & right *)
  1658. IF reason THEN (* left and right *)
  1659. skip := NewLabel();
  1660. Condition(x.left,skip,FALSE);
  1661. Condition(x.right,label,TRUE);
  1662. SetLabel(skip);
  1663. ELSE (* ~(left and right) = ~left or ~right *)
  1664. Condition(x.left,label,FALSE);
  1665. Condition(x.right,label,FALSE);
  1666. END;
  1667. RETURN;
  1668. |Scanner.Is:
  1669. (* get type desc tag *)
  1670. IF IsPointerToRecord(x.left.type,recordType) THEN
  1671. left := EvaluateX(x.left);
  1672. Dereference(left,recordType,IsUnsafePointer(x.left.type))
  1673. ELSE
  1674. Designate(x.left,left);
  1675. END;
  1676. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,label,reason,FALSE);
  1677. ReleaseOperand(left);
  1678. RETURN;
  1679. |Scanner.Equal:
  1680. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1681. IF reason THEN
  1682. CompareString(BreqL,label,x.left,x.right);
  1683. ELSE
  1684. CompareString(BrneL,label,x.left,x.right);
  1685. END;
  1686. ELSE
  1687. Evaluate(x.left,left);
  1688. Evaluate(x.right,right);
  1689. IF leftType IS SyntaxTree.RangeType THEN
  1690. ASSERT(rightType IS SyntaxTree.RangeType);
  1691. IF reason THEN
  1692. skip := NewLabel();
  1693. BrneL(skip, left.op, right.op); (* first *)
  1694. BrneL(skip, left.tag, right.tag); (* last *)
  1695. BreqL(label, left.extra, right.extra); (* step *)
  1696. SetLabel(skip);
  1697. ELSE
  1698. BrneL(label, left.op, right.op); (* first *)
  1699. BrneL(label, left.tag, right.tag); (* last *)
  1700. BrneL(label, left.extra, right.extra); (* step *)
  1701. END;
  1702. ReleaseOperand(left); ReleaseOperand(right);
  1703. ELSIF IsDelegate(leftType) OR (leftType IS SyntaxTree.ComplexType) THEN (* pair comparison *)
  1704. IF reason THEN
  1705. skip := NewLabel();
  1706. BrneL(skip, left.op, right.op); (* first *)
  1707. BreqL(label, left.tag, right.tag); (* last *)
  1708. SetLabel(skip);
  1709. ELSE
  1710. BrneL(label, left.op, right.op); (* first *)
  1711. BrneL(label, left.tag, right.tag); (* last *)
  1712. END;
  1713. ReleaseOperand(left); ReleaseOperand(right);
  1714. ELSE
  1715. IF reason THEN
  1716. BreqL(label,left.op,right.op);
  1717. ELSE
  1718. BrneL(label,left.op,right.op);
  1719. END;
  1720. ReleaseOperand(left); ReleaseOperand(right);
  1721. END;
  1722. END;
  1723. RETURN;
  1724. |Scanner.LessEqual:
  1725. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1726. IF reason THEN
  1727. CompareString(BrgeL,label,x.right,x.left);
  1728. ELSE
  1729. CompareString(BrltL,label,x.right,x.left);
  1730. END;
  1731. ELSE
  1732. Evaluate(x.left,left);
  1733. Evaluate(x.right,right);
  1734. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  1735. Reuse1(temp,right.op);
  1736. Emit(And(position,temp,left.op,right.op));
  1737. ReleaseOperand(right);
  1738. IF reason THEN
  1739. BreqL(label,temp,left.op);
  1740. ELSE
  1741. BrneL(label,temp,left.op);
  1742. END;
  1743. ReleaseIntermediateOperand(temp);ReleaseOperand(left);
  1744. ELSE
  1745. IF reason THEN
  1746. BrgeL(label,right.op,left.op);
  1747. ELSE
  1748. BrltL(label,right.op,left.op);
  1749. END;
  1750. ReleaseOperand(left); ReleaseOperand(right);
  1751. END;
  1752. END;
  1753. RETURN;
  1754. |Scanner.Less:
  1755. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  1756. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  1757. leftExpression.SetType(system.booleanType);
  1758. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  1759. rightExpression.SetType(system.booleanType);
  1760. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  1761. leftExpression.SetType(system.booleanType);
  1762. Condition(leftExpression,label,reason);
  1763. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1764. IF reason THEN
  1765. CompareString(BrltL,label,x.left,x.right);
  1766. ELSE
  1767. CompareString(BrgeL,label,x.left,x.right);
  1768. END;
  1769. ELSE
  1770. Evaluate(x.left,left);
  1771. Evaluate(x.right,right);
  1772. IF reason THEN
  1773. BrltL(label,left.op,right.op);
  1774. ELSE
  1775. BrgeL(label,left.op,right.op);
  1776. END;
  1777. ReleaseOperand(left); ReleaseOperand(right);
  1778. END;
  1779. RETURN;
  1780. |Scanner.Greater:
  1781. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  1782. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  1783. leftExpression.SetType(system.booleanType);
  1784. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  1785. rightExpression.SetType(system.booleanType);
  1786. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  1787. leftExpression.SetType(system.booleanType);
  1788. Condition(leftExpression,label,reason);
  1789. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1790. IF reason THEN
  1791. CompareString(BrltL,label,x.right,x.left);
  1792. ELSE
  1793. CompareString(BrgeL,label,x.right,x.left);
  1794. END;
  1795. ELSE
  1796. Evaluate(x.left,left);
  1797. Evaluate(x.right,right);
  1798. IF reason THEN
  1799. BrltL(label, right.op,left.op);
  1800. ELSE
  1801. BrgeL(label, right.op,left.op);
  1802. END;
  1803. ReleaseOperand(left); ReleaseOperand(right);
  1804. END;
  1805. RETURN;
  1806. |Scanner.GreaterEqual:
  1807. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1808. IF reason THEN
  1809. CompareString(BrgeL,label,x.left,x.right);
  1810. ELSE
  1811. CompareString(BrltL,label,x.left,x.right);
  1812. END;
  1813. ELSE
  1814. Evaluate(x.left,left);
  1815. Evaluate(x.right,right);
  1816. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  1817. Reuse1(temp,left.op);
  1818. Emit(And(position,temp,left.op,right.op));
  1819. ReleaseOperand(left);
  1820. IF reason THEN
  1821. BreqL(label, temp, right.op);
  1822. ELSE
  1823. BrneL(label, temp, right.op);
  1824. END;
  1825. ReleaseIntermediateOperand(temp); ReleaseOperand(right);
  1826. ELSE
  1827. IF reason THEN
  1828. BrgeL(label,left.op,right.op);
  1829. ELSE
  1830. BrltL(label, left.op,right.op);
  1831. END;
  1832. ReleaseOperand(left); ReleaseOperand(right);
  1833. END;
  1834. END;
  1835. RETURN;
  1836. |Scanner.Unequal:
  1837. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1838. IF reason THEN
  1839. CompareString(BrneL,label,x.left,x.right);
  1840. ELSE
  1841. CompareString(BreqL,label,x.left,x.right);
  1842. END
  1843. ELSE
  1844. Evaluate(x.left,left);
  1845. Evaluate(x.right,right);
  1846. IF leftType IS SyntaxTree.RangeType THEN
  1847. ASSERT(rightType IS SyntaxTree.RangeType);
  1848. IF ~reason THEN
  1849. skip := NewLabel();
  1850. BrneL(skip, left.op, right.op); (* first *)
  1851. BrneL(skip, left.tag, right.tag); (* last *)
  1852. BreqL(label, left.extra, right.extra); (* step *)
  1853. SetLabel(skip);
  1854. ELSE
  1855. BrneL(label, left.op, right.op); (* first *)
  1856. BrneL(label, left.tag, right.tag); (* last *)
  1857. BrneL(label, left.extra, right.extra); (* step *)
  1858. END;
  1859. ReleaseOperand(left); ReleaseOperand(right);
  1860. ELSIF IsDelegate(leftType) OR (leftType IS SyntaxTree.ComplexType) THEN (* pair comparison *)
  1861. IF reason THEN
  1862. BrneL(label, left.op, right.op);
  1863. BrneL(label, left.tag, right.tag);
  1864. ELSE
  1865. skip := NewLabel();
  1866. BrneL(skip, left.op, right.op);
  1867. BreqL(label, left.tag, right.tag);
  1868. SetLabel(skip);
  1869. END;
  1870. ReleaseOperand(left); ReleaseOperand(right);
  1871. ELSE
  1872. IF reason THEN
  1873. BrneL(label,left.op,right.op);
  1874. ELSE
  1875. BreqL(label,left.op,right.op);
  1876. END;
  1877. ReleaseOperand(left); ReleaseOperand(right);
  1878. END;
  1879. END;
  1880. RETURN;
  1881. ELSE (* case *)
  1882. END;
  1883. |SyntaxTree.BooleanValue DO
  1884. IF reason = x.value THEN BrL(label) END;
  1885. ELSE (* with *)
  1886. END;
  1887. (* default case: evaluate and compare result *)
  1888. left := EvaluateX(x);
  1889. IF reason THEN
  1890. BrneL(label,left.op, false);
  1891. ELSE
  1892. BreqL(label,left.op, false);
  1893. END;
  1894. ReleaseOperand(left);
  1895. END Condition;
  1896. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1897. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1898. BEGIN
  1899. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1900. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1901. RETURN op
  1902. END NewRegisterOperand;
  1903. PROCEDURE UnuseRegister(register: LONGINT);
  1904. BEGIN
  1905. IF (register > 0) THEN
  1906. register := registerUsageCount.Map(register);
  1907. registerUsageCount.DecUse(register);
  1908. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1909. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1910. END;
  1911. IF registerUsageCount.Use(register)=0 THEN
  1912. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1913. Warning(position, "register cannot be removed");
  1914. END;
  1915. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1916. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1917. END;
  1918. ELSIF registerUsageCount.Use(register)<0 THEN
  1919. Warning(position, "register removed too often");
  1920. IF dump # NIL THEN
  1921. dump.String("register removed too often"); dump.Ln; dump.Update;
  1922. END;
  1923. END;
  1924. END;
  1925. END UnuseRegister;
  1926. PROCEDURE UseRegister(register: LONGINT);
  1927. BEGIN
  1928. IF (register > 0) THEN
  1929. register := registerUsageCount.Map(register);
  1930. registerUsageCount.IncUse(register);
  1931. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1932. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1933. END;
  1934. IF registerUsageCount.Use(register)=1 THEN
  1935. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1936. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1937. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1938. END;
  1939. END;
  1940. END;
  1941. END UseRegister;
  1942. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1943. BEGIN
  1944. UnuseRegister(op.register)
  1945. END ReleaseIntermediateOperand;
  1946. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1947. BEGIN
  1948. UseRegister(op.register)
  1949. END UseIntermediateOperand;
  1950. PROCEDURE ReleaseOperand(CONST op: Operand);
  1951. BEGIN
  1952. UnuseRegister(op.op.register);
  1953. UnuseRegister(op.tag.register);
  1954. UnuseRegister(op.extra.register);
  1955. END ReleaseOperand;
  1956. (* save registers marked in array "markedRegisters" to the stack
  1957. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1958. *)
  1959. PROCEDURE SaveRegisters();
  1960. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1961. BEGIN
  1962. entry := usedRegisters;
  1963. WHILE entry # NIL DO
  1964. type := registerUsageCount.used[entry.register].type;
  1965. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1966. Emit(Push(position,op));
  1967. entry := entry.next;
  1968. END;
  1969. END SaveRegisters;
  1970. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1971. BEGIN
  1972. saved := usedRegisters;
  1973. usedRegisters := NIL;
  1974. END ReleaseUsedRegisters;
  1975. (** remove parameter registers from used queue *)
  1976. PROCEDURE ReleaseParameterRegisters;
  1977. VAR entry,prev,next: RegisterEntry;
  1978. BEGIN
  1979. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1980. WHILE entry # NIL DO
  1981. next := entry.next;
  1982. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1983. registerUsageCount.DecUse(entry.register);
  1984. ASSERT(registerUsageCount.Use(entry.register)=0);
  1985. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1986. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1987. END;
  1988. ELSIF prev = NIL THEN
  1989. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1990. ELSE
  1991. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1992. END;
  1993. entry := next;
  1994. END;
  1995. END ReleaseParameterRegisters;
  1996. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1997. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1998. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1999. BEGIN
  2000. entry := saved;
  2001. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  2002. entry := prev;
  2003. WHILE entry # NIL DO
  2004. prev := entry.prev;
  2005. type := entry.type;
  2006. class := entry.registerClass;
  2007. IntermediateCode.InitRegister(op,type,class,entry.register);
  2008. Emit(Pop(position,op));
  2009. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  2010. entry := prev;
  2011. END;
  2012. END RestoreRegisters;
  2013. (* re-enter registers from array saved into array markedRegisters (recursion possible) *)
  2014. PROCEDURE RestoreRegisterUse(CONST saved: RegisterEntry);
  2015. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  2016. BEGIN
  2017. entry := saved;
  2018. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  2019. entry := prev;
  2020. WHILE entry # NIL DO
  2021. prev := entry.prev;
  2022. type := entry.type;
  2023. class := entry.registerClass;
  2024. IntermediateCode.InitRegister(op,type,class,entry.register);
  2025. Emit(Mov(position,op,op));
  2026. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  2027. entry := prev;
  2028. END;
  2029. END RestoreRegisterUse;
  2030. PROCEDURE CheckRegistersFree;
  2031. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  2032. BEGIN
  2033. IF usedRegisters # NIL THEN
  2034. r := usedRegisters;
  2035. WHILE r # NIL DO
  2036. warning := "register ";
  2037. Strings.AppendInt(warning, r.register);
  2038. Strings.Append(warning, " not released.");
  2039. Warning(position,warning);
  2040. r := r .next;
  2041. END;
  2042. END;
  2043. FOR i := 0 TO registerUsageCount.count-1 DO
  2044. IF registerUsageCount.used[i].count < 0 THEN
  2045. warning := "register ";
  2046. Strings.AppendInt(warning, i);
  2047. Strings.Append(warning, " unused too often.");
  2048. Warning(position,warning);
  2049. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  2050. warning := "register ";
  2051. Strings.AppendInt(warning, i);
  2052. Strings.Append(warning, " not unused often enough.");
  2053. Warning(position,warning);
  2054. END;
  2055. END;
  2056. END CheckRegistersFree;
  2057. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  2058. Otherwise allocate a new register.
  2059. Does NOT necessarily keep the content of src1 or src2 in result! *)
  2060. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  2061. BEGIN
  2062. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2063. UseIntermediateOperand(result);
  2064. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  2065. UseIntermediateOperand(result);
  2066. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  2067. END;
  2068. END Reuse2;
  2069. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  2070. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  2071. If not then allocate a new register.
  2072. Does NOT necessarily keep the content of src1 or src2 in result!
  2073. *)
  2074. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  2075. BEGIN
  2076. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2077. UseIntermediateOperand(result);
  2078. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  2079. UseIntermediateOperand(result);
  2080. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  2081. result := alternative; alternative := emptyOperand;
  2082. UseIntermediateOperand(result);
  2083. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2084. END;
  2085. END Reuse2a;
  2086. (* like reuse2 but only one source *)
  2087. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  2088. BEGIN
  2089. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2090. UseIntermediateOperand(result);
  2091. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2092. END;
  2093. END Reuse1;
  2094. (* like reuse2a but only one source *)
  2095. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  2096. BEGIN
  2097. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2098. UseIntermediateOperand(result);
  2099. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  2100. UseIntermediateOperand(result);
  2101. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2102. END;
  2103. END Reuse1a;
  2104. (* like reuse1 but guarantees that content of src1 is in result *)
  2105. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  2106. BEGIN
  2107. IF ReusableRegister(src1) THEN
  2108. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2109. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  2110. UseIntermediateOperand(result);
  2111. ELSE
  2112. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2113. Emit(Mov(position,result,src1));
  2114. END
  2115. END ReuseCopy;
  2116. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  2117. BEGIN
  2118. IF ReusableRegister(src) THEN
  2119. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  2120. ELSE
  2121. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  2122. Emit(Mov(position,result,src));
  2123. ReleaseIntermediateOperand(src);
  2124. END
  2125. END TransferToRegister;
  2126. (** labels and branches **)
  2127. PROCEDURE NewLabel(): Label;
  2128. VAR label: Label;
  2129. BEGIN
  2130. NEW(label,section); RETURN label;
  2131. END NewLabel;
  2132. (* EXPERIMENTAL *)
  2133. PROCEDURE EndBasicBlock;
  2134. VAR i: LONGINT;
  2135. BEGIN
  2136. i := 0;
  2137. WHILE (availableSymbols[i].symbol # NIL) DO
  2138. IF ~availableSymbols[i].inMemory & availableSymbols[i].inRegister THEN
  2139. Emit(Mov(position,availableSymbols[i].memory, availableSymbols[i].register));
  2140. END;
  2141. availableSymbols[i].symbol := NIL;
  2142. INC(i);
  2143. END;
  2144. END EndBasicBlock;
  2145. (* EXPERIMENTAL *)
  2146. PROCEDURE BeginBasicBlock;
  2147. BEGIN
  2148. ASSERT(availableSymbols[0].symbol = NIL);
  2149. END BeginBasicBlock;
  2150. PROCEDURE SetLabel(label: Label);
  2151. BEGIN
  2152. (* EXPERIMENTAL *)
  2153. EndBasicBlock;
  2154. BeginBasicBlock;
  2155. label.Resolve(section.pc);
  2156. END SetLabel;
  2157. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  2158. BEGIN
  2159. ASSERT(label # NIL);
  2160. IF label.pc < 0 THEN (* label not yet set *)
  2161. label.AddFixup(section.pc);
  2162. END;
  2163. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  2164. END LabelOperand;
  2165. PROCEDURE BrL(label: Label);
  2166. BEGIN
  2167. (* EXPERIMENTAL *)
  2168. EndBasicBlock;
  2169. Emit(Br(position,LabelOperand(label)));
  2170. END BrL;
  2171. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  2172. BEGIN
  2173. Emit(Brge(position,LabelOperand(label),left,right));
  2174. END BrgeL;
  2175. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  2176. BEGIN
  2177. Emit(Brlt(position,LabelOperand(label),left,right));
  2178. END BrltL;
  2179. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  2180. BEGIN
  2181. Emit(Breq(position,LabelOperand(label),left,right));
  2182. END BreqL;
  2183. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  2184. BEGIN
  2185. Emit(Brne(position,LabelOperand(label),left,right));
  2186. END BrneL;
  2187. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  2188. VAR new: IntermediateCode.Operand;
  2189. BEGIN
  2190. IF Trace THEN TraceEnter("Convert") END;
  2191. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  2192. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  2193. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  2194. & (operand.offset = 0)
  2195. THEN
  2196. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  2197. Emit(Conv(position,new,operand));
  2198. ELSE
  2199. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  2200. Emit(Conv(position,new,operand));
  2201. ReleaseIntermediateOperand(operand);
  2202. END;
  2203. operand := new;
  2204. 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
  2205. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  2206. ELSE
  2207. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  2208. Emit(Conv(position,new,operand));
  2209. ReleaseIntermediateOperand(operand);
  2210. operand := new;
  2211. END;
  2212. IF Trace THEN TraceExit("Convert") END;
  2213. END Convert;
  2214. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  2215. VAR exit: Label;
  2216. BEGIN
  2217. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  2218. exit := NewLabel();
  2219. br(exit,left,right);
  2220. EmitTrap(position,trapNo);
  2221. SetLabel(exit);
  2222. END TrapC;
  2223. (** expressions *)
  2224. (** emit necessary runtime check for set elements **)
  2225. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  2226. VAR max: IntermediateCode.Operand;
  2227. BEGIN
  2228. IF isUnchecked THEN RETURN END;
  2229. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  2230. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  2231. TrapC(BrgeL, max, o, SetElementTrap);
  2232. END;
  2233. END CheckSetElement;
  2234. (** the set that a range represents **)
  2235. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  2236. VAR
  2237. operand: Operand;
  2238. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  2239. BEGIN
  2240. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  2241. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  2242. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  2243. one := IntermediateCode.Immediate(setType, 1);
  2244. Evaluate(x, operand);
  2245. Convert(operand.op, setType);
  2246. Convert(operand.tag, setType);
  2247. CheckSetElement(operand.op);
  2248. CheckSetElement(operand.tag);
  2249. (* create mask for lower bound
  2250. i.e. shift 11111111 to the left by the value of the lower bound
  2251. *)
  2252. Reuse1(temp, operand.op);
  2253. Emit(Shl(position,temp, allBits, operand.op));
  2254. ReleaseIntermediateOperand(operand.op);
  2255. operand.op := temp;
  2256. (* create mask for upper bound
  2257. i.e. shift 11111111 to the right by the difference between the
  2258. upper bound and the maximum number of set elements
  2259. *)
  2260. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  2261. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  2262. Reuse1(temp, operand.tag);
  2263. ELSE
  2264. Reuse1(temp, operand.tag);
  2265. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  2266. Emit(Sub(position,temp, size, operand.tag));
  2267. END;
  2268. Emit(Shr(position,temp, allBits, operand.tag));
  2269. ReleaseIntermediateOperand(operand.tag);
  2270. operand.tag := temp;
  2271. Reuse2(resultingSet, operand.op, operand.tag);
  2272. (* intersect the two masks *)
  2273. Emit(And(position,resultingSet, operand.op, operand.tag));
  2274. ReleaseOperand(operand);
  2275. RETURN resultingSet
  2276. END SetFromRange;
  2277. PROCEDURE VisitSet*(x: SyntaxTree.Set);
  2278. VAR
  2279. res, operand: Operand;
  2280. temp, one, noBits, dest: IntermediateCode.Operand;
  2281. expression: SyntaxTree.Expression;
  2282. i: LONGINT;
  2283. BEGIN
  2284. IF Trace THEN TraceEnter("VisitSet") END;
  2285. dest := destination;
  2286. destination := emptyOperand;
  2287. noBits := IntermediateCode.Immediate(setType, 0);
  2288. one := IntermediateCode.Immediate(setType, 1);
  2289. (* start off with the empty set *)
  2290. InitOperand(res, ModeValue);
  2291. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2292. Emit(Mov(position,res.op, noBits));
  2293. FOR i := 0 TO x.elements.Length() - 1 DO
  2294. expression := x.elements.GetExpression(i);
  2295. IF expression IS SyntaxTree.RangeExpression THEN
  2296. (* range of set elements *)
  2297. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2298. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2299. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2300. ReleaseIntermediateOperand(temp)
  2301. ELSE
  2302. (* singelton element *)
  2303. Evaluate(expression, operand);
  2304. Convert(operand.op, setType);
  2305. CheckSetElement(operand.op);
  2306. (* create subset containing single element *)
  2307. Reuse1(temp, operand.op);
  2308. Emit(Shl(position,temp, one, operand.op));
  2309. ReleaseOperand(operand);
  2310. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2311. ReleaseIntermediateOperand(temp);
  2312. END
  2313. END;
  2314. result := res;
  2315. destination := dest;
  2316. IF Trace THEN TraceExit("VisitSet") END;
  2317. END VisitSet;
  2318. (* math arrays of the form [a,b,c]
  2319. x is a static array and thus does not provide any pointers
  2320. *)
  2321. PROCEDURE VisitMathArrayExpression*(x: SyntaxTree.MathArrayExpression);
  2322. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2323. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2324. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2325. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2326. element: SyntaxTree.IntegerValue;
  2327. BEGIN
  2328. numberElements := x.elements.Length();
  2329. expression := index.parameters.GetExpression(dim);
  2330. element := expression(SyntaxTree.IntegerValue);
  2331. FOR i := 0 TO numberElements-1 DO
  2332. expression := x.elements.GetExpression(i);
  2333. element.SetValue(i);
  2334. IF expression IS SyntaxTree.MathArrayExpression THEN
  2335. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2336. ELSE
  2337. Assign(index,expression);
  2338. END;
  2339. END;
  2340. END RecursiveAssignment;
  2341. PROCEDURE Dimension(): LONGINT;
  2342. VAR dim: LONGINT; expression: SyntaxTree.Expression;
  2343. BEGIN
  2344. dim := 0;
  2345. expression := x;
  2346. WHILE expression IS SyntaxTree.MathArrayExpression DO
  2347. expression := expression(SyntaxTree.MathArrayExpression).elements.GetExpression(0);
  2348. INC(dim);
  2349. END;
  2350. RETURN dim;
  2351. END Dimension;
  2352. BEGIN
  2353. (*static math array not providing pointers anyway *)
  2354. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2355. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2356. designator.SetType(variable.type);
  2357. dim := Dimension();
  2358. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2359. FOR i := 0 TO dim-1 DO
  2360. element := SyntaxTree.NewIntegerValue(x.position,0);
  2361. element.SetType(system.longintType);
  2362. index.parameters.AddExpression(element);
  2363. END;
  2364. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2365. RecursiveAssignment(x,0);
  2366. Expression(designator);
  2367. END VisitMathArrayExpression;
  2368. PROCEDURE VisitUnaryExpression*(x: SyntaxTree.UnaryExpression);
  2369. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2370. BEGIN
  2371. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2372. dest := destination; destination := emptyOperand;
  2373. IF x.operator = Scanner.Not THEN
  2374. Evaluate(x.left,operand);
  2375. InitOperand(result,ModeValue);
  2376. Reuse1a(result.op,operand.op,dest);
  2377. Emit(Xor(position,result.op,operand.op,true));
  2378. ReleaseOperand(operand);
  2379. ELSIF x.operator = Scanner.Minus THEN
  2380. Evaluate(x.left,operand);
  2381. InitOperand(result,ModeValue);
  2382. Reuse1a(result.op,operand.op,dest);
  2383. type := x.left.type.resolved;
  2384. IF type IS SyntaxTree.SetType THEN
  2385. Emit(Not(position,result.op,operand.op));
  2386. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2387. Reuse1(result.tag,operand.tag);
  2388. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2389. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2390. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2391. Emit(Neg(position,result.op,operand.op));
  2392. ELSE HALT(200)
  2393. END;
  2394. ReleaseOperand(operand);
  2395. ELSIF x.operator = Scanner.Address THEN
  2396. Designate(x.left,operand);
  2397. operand.mode := ModeValue;
  2398. t0 := x.left.type.resolved;
  2399. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2400. ReleaseIntermediateOperand(operand.op);
  2401. operand.op := operand.tag;
  2402. IntermediateCode.InitOperand(operand.tag);
  2403. END;
  2404. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2405. result := operand;
  2406. ELSE HALT(100)
  2407. END;
  2408. destination := dest;
  2409. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2410. END VisitUnaryExpression;
  2411. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2412. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; label: Label; reason: BOOLEAN; withPart: BOOLEAN);
  2413. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL,skip: Label; originalType: SyntaxTree.Type;
  2414. BEGIN
  2415. type := type.resolved;
  2416. originalType := type;
  2417. IF type IS SyntaxTree.PointerType THEN
  2418. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2419. END;
  2420. IF (type IS SyntaxTree.ObjectType) & reason THEN
  2421. BrL(label);
  2422. ELSE
  2423. ASSERT(type IS SyntaxTree.RecordType);
  2424. (*
  2425. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2426. *)
  2427. IF withPart THEN
  2428. left := tag;
  2429. ELSE
  2430. ReuseCopy(left,tag);
  2431. END;
  2432. right := TypeDescriptorAdr(type);
  2433. IF backend.cooperative THEN
  2434. repeatL := NewLabel();
  2435. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2436. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2437. END;
  2438. SetLabel(repeatL);
  2439. IF reason THEN
  2440. BreqL(label,left,right);
  2441. ELSE
  2442. skip := NewLabel();
  2443. BreqL(skip,left,right);
  2444. END;
  2445. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2446. BrneL(repeatL,left,nil);
  2447. IF ~reason THEN
  2448. BrL(label);
  2449. SetLabel(skip);
  2450. END;
  2451. ELSIF meta.simple THEN
  2452. level := type(SyntaxTree.RecordType).Level();
  2453. (* get type desc tag of level relative to base tag *)
  2454. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2455. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2456. IntermediateCode.MakeMemory(left,addressType);
  2457. IF reason THEN
  2458. BreqL(label,left,right);
  2459. ELSE
  2460. BrneL(label,left,right);
  2461. END;
  2462. ELSE
  2463. level := type(SyntaxTree.RecordType).Level();
  2464. (* get type desc tag of level relative to base tag *)
  2465. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2466. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2467. IntermediateCode.MakeMemory(left,addressType);
  2468. IF reason THEN
  2469. BreqL(label,left,right);
  2470. ELSE
  2471. BrneL(label,left,right);
  2472. END;
  2473. END;
  2474. IF ~withPart THEN
  2475. ReleaseIntermediateOperand(left);
  2476. END;
  2477. ReleaseIntermediateOperand(right);
  2478. END;
  2479. END TypeTest;
  2480. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2481. BEGIN
  2482. backend.Error(module.module.sourceName,position,Streams.Invalid,s);
  2483. IF dump # NIL THEN
  2484. dump.String(s); dump.Ln;
  2485. END;
  2486. END Error;
  2487. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2488. BEGIN
  2489. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2490. IF dump # NIL THEN
  2491. dump.String(s); dump.Ln; dump.Update;
  2492. END;
  2493. END Warning;
  2494. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2495. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2496. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2497. operand:Operand;
  2498. BEGIN
  2499. previousSection := section;
  2500. Global.GetModuleName(mod,name);
  2501. Strings.Append(name,".@Trace");
  2502. Basic.ToSegmentedName(name, pooledName);
  2503. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2504. IF dump # NIL THEN dump := section.comments END;
  2505. IF backend.hasLinkRegister THEN
  2506. Emit(Push(Basic.invalidPosition, lr));
  2507. END;
  2508. variable := mod.moduleScope.firstVariable;
  2509. WHILE variable # NIL DO
  2510. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2511. Symbol(variable, operand);
  2512. register := operand.op;
  2513. CallTraceMethod(register, variable.type);
  2514. ReleaseIntermediateOperand(register);
  2515. END;
  2516. variable := variable.nextVariable;
  2517. END;
  2518. IF backend.hasLinkRegister THEN
  2519. Emit(Pop(Basic.invalidPosition, lr));
  2520. END;
  2521. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2522. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2523. Emit(Br(position,op));
  2524. INC(statCoopTraceModule, section.pc);
  2525. section := previousSection;
  2526. IF dump # NIL THEN dump := section.comments END;
  2527. END CreateTraceModuleMethod;
  2528. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2529. BEGIN
  2530. Emit (Push(position, dst));
  2531. Emit (Push(position, src));
  2532. CallThis(position,"GarbageCollector","Assign", 2);
  2533. END CallAssignPointer;
  2534. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2535. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2536. BEGIN
  2537. IF SemanticChecker.IsPointerType (type) THEN
  2538. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2539. ELSIF type.IsRecordType() THEN
  2540. Emit (Push(position,dst));
  2541. Emit (Push(position,src));
  2542. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2543. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2544. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2545. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2546. ELSIF IsStaticArray(type) THEN
  2547. size := StaticArrayNumElements(type);
  2548. base := StaticArrayBaseType(type);
  2549. IF base.IsRecordType() THEN
  2550. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2551. Emit (Push(position, dst));
  2552. Emit (Push(position, src));
  2553. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2554. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2555. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2556. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2557. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2558. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2559. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2560. Emit (Push(position, dst));
  2561. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2562. Emit (Push(position, src));
  2563. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2564. ELSE
  2565. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2566. Emit (Push(position, dst));
  2567. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2568. Emit (Push(position, src));
  2569. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2570. ASSERT(StaticArrayBaseType(type).IsPointer());
  2571. END;
  2572. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2573. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2574. Emit (Push(position, dst));
  2575. Emit (Push(position, src));
  2576. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2577. ELSE HALT(100); (* missing ? *)
  2578. END;
  2579. END CallAssignMethod;
  2580. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2581. VAR name: Basic.SegmentedName;
  2582. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2583. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2584. context: Context;
  2585. BEGIN
  2586. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2587. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2588. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2589. GetRecordTypeName (recordType,name);
  2590. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2591. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2592. section.SetExported (TRUE);
  2593. IF dump # NIL THEN dump := section.comments END;
  2594. IF backend.hasLinkRegister THEN
  2595. Emit(Push(Basic.invalidPosition, lr));
  2596. END;
  2597. variable := recordType.recordScope.firstVariable;
  2598. WHILE variable # NIL DO
  2599. IF variable.NeedsTrace() THEN
  2600. dst := NewRegisterOperand (addressType);
  2601. src := NewRegisterOperand (addressType);
  2602. Emit (Mov(position, dst, parameter1));
  2603. Emit (Mov(position, src, parameter2));
  2604. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2605. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2606. CallAssignMethod(dst, src, variable.type);
  2607. ReleaseIntermediateOperand(src);
  2608. ReleaseIntermediateOperand(dst);
  2609. END;
  2610. variable := variable.nextVariable;
  2611. END;
  2612. recordBase := recordType.GetBaseRecord();
  2613. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2614. IF backend.hasLinkRegister THEN
  2615. Emit(Pop(Basic.invalidPosition, lr));
  2616. END;
  2617. GetRecordTypeName (recordBase,name);
  2618. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2619. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2620. Emit(Br(position,op));
  2621. ELSE
  2622. Emit(Exit(position,0,0, 0));
  2623. END;
  2624. IF ~recordType.isObject THEN
  2625. GetRecordTypeName (recordType,name);
  2626. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2627. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2628. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2629. section.SetExported (TRUE);
  2630. NEW(registerUsageCount);
  2631. usedRegisters := NIL;
  2632. dst := NewRegisterOperand (addressType);
  2633. src := NewRegisterOperand (addressType);
  2634. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2635. Emit(Mov(position, dst, parameter1));
  2636. Emit(Mov(position, src, parameter2));
  2637. label := NewLabel();
  2638. SetLabel(label);
  2639. Emit(Push(position, dst));
  2640. Emit(Push(position, src));
  2641. GetRecordTypeName (recordType,name);
  2642. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2643. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2644. Emit(Call(position, op, 0));
  2645. Emit(Pop(position, src));
  2646. Emit(Pop(position, dst));
  2647. Emit(Add(position, dst, dst, ofs));
  2648. Emit(Add(position, src, src, ofs));
  2649. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2650. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2651. Emit(Exit(position,0,0, 0));
  2652. END;
  2653. INC(statCoopAssignProcedure, section.pc);
  2654. ReturnToContext(context);
  2655. IF dump # NIL THEN dump := section.comments END;
  2656. END CreateAssignProcedure;
  2657. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2658. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2659. BEGIN
  2660. IF IsUnsafePointer (type) THEN
  2661. skip := NewLabel();
  2662. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2663. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2664. BreqL (skip, op, nil);
  2665. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2666. SetLabel (skip);
  2667. ELSIF SemanticChecker.IsPointerType (type) THEN
  2668. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2669. CallThis(position,"GarbageCollector","Mark", 1);
  2670. ELSIF type.IsRecordType() THEN
  2671. Emit (Push(position,register));
  2672. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2673. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2674. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2675. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2676. ELSIF IsStaticArray(type) THEN
  2677. size := StaticArrayNumElements(type);
  2678. base := StaticArrayBaseType(type);
  2679. IF base.IsRecordType() THEN
  2680. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2681. Emit (Push(position, register));
  2682. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2683. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2684. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2685. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2686. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2687. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2688. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2689. Emit (Push(position, register));
  2690. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2691. ELSE
  2692. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2693. Emit (Push(position, register));
  2694. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2695. ASSERT(base.IsPointer());
  2696. END;
  2697. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2698. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2699. CallThis(position,"GarbageCollector","Mark", 1);
  2700. ELSE HALT(100); (* missing ? *)
  2701. END;
  2702. END CallTraceMethod;
  2703. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2704. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2705. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2706. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2707. BEGIN
  2708. previousSection := section;
  2709. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2710. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2711. GetRecordTypeName (recordType,name);
  2712. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2713. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2714. section.SetExported (TRUE);
  2715. IF dump # NIL THEN dump := section.comments END;
  2716. IF backend.hasLinkRegister THEN
  2717. Emit(Push(Basic.invalidPosition, lr));
  2718. END;
  2719. variable := recordType.recordScope.firstVariable;
  2720. WHILE variable # NIL DO
  2721. IF variable.NeedsTrace() THEN
  2722. register := NewRegisterOperand (addressType);
  2723. Emit (Mov(position,register,parameter1));
  2724. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2725. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2726. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2727. END;
  2728. CallTraceMethod(register, variable.type);
  2729. ReleaseIntermediateOperand(register);
  2730. END;
  2731. variable := variable.nextVariable;
  2732. END;
  2733. recordBase := recordType.GetBaseRecord();
  2734. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2735. recordBase := recordBase.GetBaseRecord();
  2736. END;
  2737. IF recordBase # NIL THEN
  2738. IF backend.hasLinkRegister THEN
  2739. Emit(Pop(Basic.invalidPosition, lr));
  2740. END;
  2741. GetRecordTypeName (recordBase,name);
  2742. IF HasExplicitTraceMethod (recordBase) THEN
  2743. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2744. ELSE
  2745. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2746. END;
  2747. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2748. Emit(Br(position,op));
  2749. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2750. Emit(Exit(position,0,0,0));
  2751. ELSE
  2752. IF backend.hasLinkRegister THEN
  2753. Emit(Pop(Basic.invalidPosition, lr));
  2754. END;
  2755. IF recordType.isObject THEN
  2756. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2757. ELSE
  2758. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2759. END;
  2760. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2761. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2762. Emit(Br(position,op));
  2763. END;
  2764. IF ~recordType.isObject THEN
  2765. GetRecordTypeName (recordType,name);
  2766. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2767. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2768. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2769. section.SetExported (TRUE);
  2770. NEW(registerUsageCount);
  2771. usedRegisters := NIL;
  2772. IF dump # NIL THEN dump := section.comments END;
  2773. register := NewRegisterOperand (addressType);
  2774. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2775. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2776. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2777. END;
  2778. Emit (Push(position,register));
  2779. GetRecordTypeName (recordType,name);
  2780. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2781. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2782. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2783. ReleaseIntermediateOperand(register);
  2784. Emit(Exit(position,0,0,0));
  2785. GetRecordTypeName (recordType,name);
  2786. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2787. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2788. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2789. section.SetExported (TRUE);
  2790. NEW(registerUsageCount);
  2791. usedRegisters := NIL;
  2792. register := NewRegisterOperand (addressType);
  2793. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2794. Emit(Mov(position, register, parameter1));
  2795. label := NewLabel();
  2796. SetLabel(label);
  2797. Emit(Push(position, register));
  2798. GetRecordTypeName (recordType,name);
  2799. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2800. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2801. Emit(Call(position, op, 0));
  2802. Emit(Pop(position, register));
  2803. Emit(Add(position, register, register, ofs));
  2804. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2805. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2806. Emit(Exit(position,0,0,0));
  2807. END;
  2808. INC(statCoopTraceMethod, section.pc);
  2809. ReturnToContext(context);
  2810. IF dump # NIL THEN dump := section.comments END;
  2811. END CreateTraceMethod;
  2812. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2813. VAR name: Basic.SegmentedName;
  2814. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2815. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2816. context: Context;
  2817. BEGIN
  2818. IF recordType.isObject THEN RETURN END;
  2819. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2820. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2821. GetRecordTypeName (recordType,name);
  2822. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2823. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2824. section.SetExported (TRUE);
  2825. IF dump # NIL THEN dump := section.comments END;
  2826. IF backend.hasLinkRegister THEN
  2827. Emit(Push(Basic.invalidPosition, lr));
  2828. END;
  2829. variable := recordType.recordScope.firstVariable;
  2830. WHILE variable # NIL DO
  2831. IF variable.NeedsTrace() THEN
  2832. dst := NewRegisterOperand (addressType);
  2833. Emit (Mov(position, dst, parameter1));
  2834. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2835. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2836. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2837. END;
  2838. CallResetProcedure(dst, nil, variable.type);
  2839. ReleaseIntermediateOperand(dst);
  2840. END;
  2841. variable := variable.nextVariable;
  2842. END;
  2843. recordBase := recordType.GetBaseRecord();
  2844. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2845. IF backend.hasLinkRegister THEN
  2846. Emit(Pop(Basic.invalidPosition, lr));
  2847. END;
  2848. GetRecordTypeName (recordBase,name);
  2849. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2850. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2851. Emit(Br(position,op));
  2852. ELSE
  2853. Emit(Exit(position,0,0, 0));
  2854. END;
  2855. GetRecordTypeName (recordType,name);
  2856. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2857. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2858. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2859. section.SetExported (TRUE);
  2860. NEW(registerUsageCount);
  2861. usedRegisters := NIL;
  2862. dst := NewRegisterOperand (addressType);
  2863. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2864. Emit(Mov(position, dst, parameter1));
  2865. label := NewLabel();
  2866. SetLabel(label);
  2867. Emit(Push(position, dst));
  2868. GetRecordTypeName (recordType,name);
  2869. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2870. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2871. Emit(Call(position, op, 0));
  2872. Emit(Pop(position, dst));
  2873. Emit(Add(position, dst, dst, ofs));
  2874. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2875. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2876. Emit(Exit(position,0,0, 0));
  2877. INC(statCoopResetProcedure, section.pc);
  2878. ReturnToContext(context);
  2879. IF dump # NIL THEN dump := section.comments END;
  2880. END CreateResetProcedure;
  2881. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2882. VAR name: Basic.SegmentedName; context: Context;
  2883. BEGIN
  2884. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2885. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2886. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2887. IF dump # NIL THEN dump := section.comments END;
  2888. IF backend.hasLinkRegister THEN
  2889. Emit(Push(Basic.invalidPosition, lr));
  2890. END;
  2891. Emit(Push(position,fp));
  2892. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2893. ResetVariables(scope);
  2894. Emit(Pop(position,fp));
  2895. Emit(Exit(position,0,0, 0));
  2896. ReturnToContext(context);
  2897. IF dump # NIL THEN dump := section.comments END;
  2898. END CreateResetMethod;
  2899. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2900. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2901. BEGIN
  2902. IF SemanticChecker.IsPointerType (type) THEN
  2903. Emit (Push(position, dest));
  2904. CallThis(position,"GarbageCollector","Reset", 1);
  2905. ELSIF type.IsRecordType() THEN
  2906. Emit (Push(position, dest));
  2907. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2908. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2909. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2910. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2911. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2912. size := GetArrayLength(type, tag);
  2913. base := ArrayBaseType(type);
  2914. IF base.IsRecordType() THEN
  2915. Emit (Push(position, size));
  2916. Emit (Push(position, dest));
  2917. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2918. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2919. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2920. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2921. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2922. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2923. Emit (Push(position, size));
  2924. Emit (Push(position, dest));
  2925. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2926. ELSE
  2927. Emit (Push(position, size));
  2928. Emit (Push(position, dest));
  2929. CallThis(position,"GarbageCollector","ResetArray", 2);
  2930. ASSERT(ArrayBaseType(type).IsPointer());
  2931. END;
  2932. ReleaseIntermediateOperand(size);
  2933. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2934. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2935. Emit (Push(position, dest));
  2936. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2937. ELSE HALT(100); (* missing ? *)
  2938. END;
  2939. END CallResetProcedure;
  2940. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2941. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; prevOffset: SIZE; pc: LONGINT;
  2942. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2943. VAR operand: Operand;
  2944. BEGIN
  2945. Symbol (symbol, operand);
  2946. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2947. ReleaseOperand(operand);
  2948. END Reset;
  2949. BEGIN
  2950. previousScope := currentScope;
  2951. currentScope := scope;
  2952. pc := section.pc;
  2953. prevOffset := MAX(SIZE);
  2954. variable := scope.firstVariable;
  2955. WHILE variable # NIL DO
  2956. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  2957. Reset (variable);
  2958. prevOffset := variable.offsetInBits;
  2959. END;
  2960. variable := variable.nextVariable;
  2961. END;
  2962. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2963. WHILE parameter # NIL DO
  2964. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  2965. Reset (parameter);
  2966. END;
  2967. parameter := parameter.nextParameter;
  2968. END;
  2969. INC(statCoopResetVariables, section.pc - pc);
  2970. currentScope := previousScope;
  2971. END ResetVariables;
  2972. PROCEDURE Reset (symbol: SyntaxTree.Symbol; refer: BOOLEAN);
  2973. VAR operand: Operand; type: SyntaxTree.Type; saved: RegisterEntry; size: SIZE; base: SyntaxTree.Type; arg: IntermediateCode.Operand;
  2974. BEGIN
  2975. type := symbol.type.resolved;
  2976. SaveRegisters();ReleaseUsedRegisters(saved);
  2977. IF SemanticChecker.IsPointerType(type) OR (type IS SyntaxTree.PortType) THEN
  2978. Symbol(symbol, operand);
  2979. ToMemory(operand.op,addressType,0);
  2980. Emit(Push(position,operand.op));
  2981. IF refer THEN
  2982. CallThis(position,"Heaps","Refer",1);
  2983. ELSE
  2984. CallThis(position,"Heaps","Reset",1);
  2985. END;
  2986. ELSIF type.IsRecordType() THEN
  2987. Symbol(symbol, operand);
  2988. Emit(Push(position,operand.op));
  2989. Emit(Push(position,operand.tag)); (* type desc *)
  2990. IF refer THEN
  2991. CallThis(position,"Heaps","ReferRecord",2);
  2992. ELSE
  2993. CallThis(position,"Heaps","ResetRecord",2);
  2994. END;
  2995. ELSIF IsStaticArray(type) THEN
  2996. size := StaticArrayNumElements(type);
  2997. base := StaticArrayBaseType(type);
  2998. Symbol(symbol, operand);
  2999. arg := TypeDescriptorAdr(base);
  3000. Emit(Push(position,operand.op));
  3001. Emit(Push(position,arg));
  3002. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  3003. ReleaseIntermediateOperand(arg);
  3004. IF refer THEN
  3005. CallThis(position,"Heaps","ReferArray",3);
  3006. ELSE
  3007. CallThis(position,"Heaps","ResetArray",3);
  3008. END;
  3009. ELSIF IsStaticMathArray(type) THEN (* the representation of a static math array coincides with static array *)
  3010. size := StaticMathArrayNumElements(type);
  3011. base := StaticMathArrayBaseType(type);
  3012. Symbol(symbol, operand);
  3013. arg := TypeDescriptorAdr(base);
  3014. Emit(Push(position,operand.op));
  3015. Emit(Push(position,arg));
  3016. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  3017. ReleaseIntermediateOperand(arg);
  3018. IF refer THEN
  3019. CallThis(position,"Heaps","ReferArray",3);
  3020. ELSE
  3021. CallThis(position,"Heaps","ResetArray",3);
  3022. END;
  3023. ELSIF type IS SyntaxTree.MathArrayType THEN
  3024. Symbol(symbol, operand);
  3025. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3026. Emit (Push(position, operand.op));
  3027. ELSE
  3028. Emit (Push(position, operand.tag));
  3029. END;
  3030. IF refer THEN
  3031. CallThis(position,"Heaps","ReferMathArray", 1);
  3032. ELSE
  3033. CallThis(position,"Heaps","ResetMathArray", 1);
  3034. END;
  3035. ELSIF type IS SyntaxTree.ProcedureType THEN
  3036. ASSERT(type(SyntaxTree.ProcedureType).isDelegate);
  3037. Symbol(symbol, operand);
  3038. Emit (Push(position, operand.tag));
  3039. IF refer THEN
  3040. CallThis(position,"Heaps","Refer", 1);
  3041. ELSE
  3042. CallThis(position,"Heaps","Reset", 1);
  3043. END;
  3044. ELSE HALT(100); (* missing ? *)
  3045. END;
  3046. ReleaseOperand(operand);
  3047. RestoreRegisters(saved);
  3048. END Reset;
  3049. PROCEDURE ResetVariables2 (scope: SyntaxTree.ProcedureScope; refer: BOOLEAN);
  3050. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT; prevOffset: SIZE;
  3051. BEGIN
  3052. previousScope := currentScope;
  3053. currentScope := scope;
  3054. pc := section.pc;
  3055. IF ~ refer THEN
  3056. variable := scope.firstVariable;
  3057. prevOffset := MAX(SIZE);
  3058. WHILE variable # NIL DO
  3059. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  3060. Reset (variable,refer);
  3061. prevOffset := variable.offsetInBits;
  3062. END;
  3063. variable := variable.nextVariable;
  3064. END;
  3065. END;
  3066. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  3067. WHILE parameter # NIL DO
  3068. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) & ~IsOpenArray(parameter.type) THEN
  3069. Reset (parameter,refer);
  3070. END;
  3071. parameter := parameter.nextParameter;
  3072. END;
  3073. INC(statCoopResetVariables, section.pc - pc);
  3074. currentScope := previousScope;
  3075. END ResetVariables2;
  3076. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  3077. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  3078. VAR op: IntermediateCode.Operand; context: Context;
  3079. BEGIN
  3080. previousSection := section;
  3081. GetCodeSectionNameForSymbol(procedure, name);
  3082. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  3083. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  3084. IF dump # NIL THEN dump := section.comments END;
  3085. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  3086. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3087. Emit(Data(position,op));
  3088. Emit(Data(position,nil));
  3089. IF HasPointers (procedure.procedureScope) THEN
  3090. GetCodeSectionNameForSymbol(procedure, name);
  3091. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3092. ELSE
  3093. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  3094. END;
  3095. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3096. Emit(Data(position,op));
  3097. ReturnToContext(context);
  3098. IF dump # NIL THEN dump := section.comments END;
  3099. END CreateProcedureDescriptor;
  3100. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  3101. VAR import: SyntaxTree.Import;
  3102. s: Basic.MessageString;
  3103. selfName: SyntaxTree.IdentifierString;
  3104. BEGIN
  3105. moduleScope.ownerModule.GetName(selfName);
  3106. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  3107. module := moduleScope.ownerModule
  3108. ELSE
  3109. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  3110. IF import = NIL THEN
  3111. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  3112. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  3113. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  3114. s := "Module ";
  3115. Strings.Append(s,moduleName);
  3116. Strings.Append(s," cannot be imported.");
  3117. IF force THEN
  3118. Error(position,s);
  3119. ELSIF canBeLoaded THEN
  3120. IF WarningDynamicLoading THEN
  3121. Strings.Append(s, "=> no dynamic linking.");
  3122. Warning(position, s);
  3123. END;
  3124. canBeLoaded := FALSE;
  3125. END;
  3126. RETURN FALSE
  3127. ELSE
  3128. SELF.module.imports.AddName(moduleName)
  3129. END;
  3130. ELSIF import.module = NIL THEN (* already tried *)
  3131. RETURN FALSE
  3132. END;
  3133. module := import.module;
  3134. END;
  3135. RETURN TRUE
  3136. END AddImport;
  3137. (* needed for old binary object file format*)
  3138. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  3139. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  3140. BEGIN
  3141. IF AddImport(moduleName,module,TRUE) THEN
  3142. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3143. IF procedure = NIL THEN
  3144. s := "Instruction not supported on target, emulation procedure ";
  3145. Strings.Append(s,moduleName);
  3146. Strings.Append(s,".");
  3147. Strings.Append(s,procedureName);
  3148. Strings.Append(s," not present");
  3149. Error(position,s);
  3150. ELSE
  3151. StaticCallOperand(r,procedure);
  3152. ReleaseOperand(r);
  3153. fp := GetFingerprint(procedure);
  3154. END;
  3155. END;
  3156. END EnsureSymbol;
  3157. PROCEDURE ConditionValue(x: SyntaxTree.Expression): Operand;
  3158. VAR trueL, exitL: Label; op: Operand;
  3159. BEGIN
  3160. InitOperand(op,ModeValue);
  3161. trueL := NewLabel();
  3162. exitL := NewLabel();
  3163. IntermediateCode.InitRegister(op.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  3164. Condition(x,trueL,TRUE);
  3165. Emit(Mov(position,op.op,false));
  3166. BrL(exitL);
  3167. SetLabel(trueL);
  3168. Emit(MovReplace(position,op.op,true));
  3169. SetLabel(exitL);
  3170. RETURN op;
  3171. END ConditionValue;
  3172. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  3173. VAR size: LONGINT;
  3174. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  3175. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  3176. BEGIN
  3177. ASSERT(type.form = SyntaxTree.Open);
  3178. baseType := type.arrayBase.resolved;
  3179. IF IsOpenArray(baseType) THEN
  3180. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  3181. ELSE
  3182. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  3183. sizeOperand := IntermediateCode.Immediate(addressType,size);
  3184. END;
  3185. len := tag;
  3186. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  3187. IntermediateCode.MakeMemory(len,addressType);
  3188. UseIntermediateOperand(len);
  3189. Reuse2(res,sizeOperand,len);
  3190. Emit(Mul(position,res,sizeOperand,len));
  3191. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  3192. RETURN res
  3193. END GetArraySize;
  3194. BEGIN
  3195. type := type.resolved;
  3196. IF IsOpenArray(type) THEN
  3197. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  3198. RETURN tag
  3199. ELSE
  3200. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  3201. END;
  3202. ELSE
  3203. size := ToMemoryUnits(system,system.SizeOf(type));
  3204. RETURN IntermediateCode.Immediate(addressType,size)
  3205. END;
  3206. END GetDynamicSize;
  3207. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  3208. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  3209. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  3210. BEGIN
  3211. ASSERT(type.form = SyntaxTree.Open);
  3212. baseType := type.arrayBase.resolved;
  3213. IF IsOpenArray(baseType) THEN
  3214. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  3215. ELSE
  3216. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  3217. END;
  3218. len := tag;
  3219. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  3220. IntermediateCode.MakeMemory(len,addressType);
  3221. UseIntermediateOperand(len);
  3222. Reuse2(res,sizeOperand,len);
  3223. Emit(Mul(position,res,sizeOperand,len));
  3224. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  3225. RETURN res
  3226. END GetLength;
  3227. BEGIN
  3228. type := type.resolved;
  3229. IF IsOpenArray(type) THEN
  3230. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  3231. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  3232. ELSIF type IS SyntaxTree.StringType THEN
  3233. RETURN tag;
  3234. ELSE
  3235. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  3236. END;
  3237. END GetArrayLength;
  3238. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3239. VAR result: IntermediateCode.Operand;
  3240. BEGIN
  3241. IF backend.cooperative THEN
  3242. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  3243. ELSE
  3244. MakeMemory(result, tag, addressType, 0);
  3245. END;
  3246. RETURN result
  3247. END GetSizeFromTag;
  3248. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3249. VAR parameter: SyntaxTree.Parameter;
  3250. BEGIN
  3251. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  3252. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  3253. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  3254. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  3255. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  3256. END;
  3257. RETURN GetDynamicSize(e.type, tag);
  3258. END GetArrayOfBytesSize;
  3259. (*
  3260. to find imported symbol. not needed ?
  3261. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  3262. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  3263. BEGIN
  3264. IF AddImport(moduleName,importedModule,FALSE) THEN
  3265. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  3266. RETURN symbol
  3267. ELSE
  3268. RETURN NIL
  3269. END
  3270. END SymbolByName;
  3271. *)
  3272. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  3273. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  3274. BEGIN
  3275. IF AddImport(moduleName,runtimeModule,force) THEN
  3276. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3277. IF procedure = NIL THEN
  3278. s := "Procedure ";
  3279. Strings.Append(s,moduleName);
  3280. Strings.Append(s,".");
  3281. Strings.Append(s,procedureName);
  3282. Strings.Append(s," not present");
  3283. Error(position,s);
  3284. RETURN FALSE
  3285. ELSE
  3286. RETURN TRUE
  3287. END;
  3288. ELSE RETURN FALSE
  3289. END;
  3290. END GetRuntimeProcedure;
  3291. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  3292. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  3293. s: Basic.MessageString;
  3294. BEGIN
  3295. Basic.InitSegmentedName(name);
  3296. name[0] := Basic.MakeString(moduleName);
  3297. name[1] := Basic.MakeString(typeName);
  3298. name[2] := -1;
  3299. IF AddImport(moduleName,importedModule, FALSE) THEN
  3300. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  3301. IF symbol = NIL THEN
  3302. s := "type ";
  3303. Strings.Append(s,moduleName);
  3304. Strings.Append(s,".");
  3305. Strings.Append(s,typeName);
  3306. Strings.Append(s," not present");
  3307. Error(position,s);
  3308. END;
  3309. ELSE symbol := NIL;
  3310. END;
  3311. IF importedModule = moduleScope.ownerModule THEN
  3312. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3313. ELSE
  3314. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3315. END;
  3316. RETURN symbol
  3317. END GetTypeDescriptor;
  3318. (* 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. *)
  3319. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  3320. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  3321. pooledName: Basic.SegmentedName; size: LONGINT;
  3322. BEGIN
  3323. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  3324. StaticCallOperand(result,procedure);
  3325. IF numberParameters < 0 THEN
  3326. size := ProcParametersSize(procedure);
  3327. ELSE
  3328. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  3329. IF checkNumParameters & (size # ProcParametersSize(procedure)) THEN
  3330. Error(position,"runtime call parameter count mismatch");
  3331. END;
  3332. END;
  3333. Emit(Call(position, result.op, size));
  3334. ReleaseOperand(result);
  3335. ELSE (* only static linking possible *)
  3336. ASSERT(numberParameters >= 0);
  3337. Basic.InitSegmentedName(pooledName);
  3338. pooledName[0] := Basic.MakeString(moduleName);
  3339. pooledName[1] := Basic.MakeString(procedureName);
  3340. pooledName[2] := -1;
  3341. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  3342. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  3343. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  3344. END;
  3345. END CallThisChecked;
  3346. (* 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. *)
  3347. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  3348. BEGIN
  3349. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  3350. END CallThis;
  3351. PROCEDURE CompareString(br: ConditionalBranch; label: Label; leftExpression,rightExpression: SyntaxTree.Expression);
  3352. VAR
  3353. left,right: Operand;
  3354. leftSize, rightSize: IntermediateCode.Operand;
  3355. saved: RegisterEntry;
  3356. reg: IntermediateCode.Operand;
  3357. procedureName: SyntaxTree.IdentifierString;
  3358. BEGIN
  3359. procedureName := "CompareString";
  3360. SaveRegisters();ReleaseUsedRegisters(saved);
  3361. Designate(leftExpression,left);
  3362. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3363. Emit(Push(position,leftSize));
  3364. ReleaseIntermediateOperand(leftSize);
  3365. Emit(Push(position,left.op));
  3366. ReleaseOperand(left);
  3367. Designate(rightExpression,right);
  3368. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3369. Emit(Push(position,rightSize));
  3370. ReleaseIntermediateOperand(rightSize);
  3371. Emit(Push(position,right.op));
  3372. ReleaseOperand(right);
  3373. CallThis(position,builtinsModuleName,procedureName, 4);
  3374. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  3375. Emit(Result(position,reg));
  3376. RestoreRegisters(saved);
  3377. br(label,reg,IntermediateCode.Immediate(int8,0));
  3378. ReleaseIntermediateOperand(reg);
  3379. END CompareString;
  3380. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  3381. VAR
  3382. left,right: Operand;
  3383. leftSize, rightSize: IntermediateCode.Operand;
  3384. saved: RegisterEntry;
  3385. procedureName: SyntaxTree.IdentifierString;
  3386. BEGIN
  3387. procedureName := "CopyString";
  3388. SaveRegisters();ReleaseUsedRegisters(saved);
  3389. Designate(leftExpression,left);
  3390. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3391. Emit(Push(position,leftSize));
  3392. ReleaseIntermediateOperand(leftSize);
  3393. Emit(Push(position,left.op));
  3394. ReleaseOperand(left);
  3395. Designate(rightExpression,right);
  3396. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3397. Emit(Push(position,rightSize));
  3398. ReleaseIntermediateOperand(rightSize);
  3399. Emit(Push(position,right.op));
  3400. ReleaseOperand(right);
  3401. CallThis(position,builtinsModuleName,procedureName,4);
  3402. RestoreRegisters(saved);
  3403. END CopyString;
  3404. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  3405. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3406. leftType,rightType: SyntaxTree.Type;
  3407. leftExpression,rightExpression : SyntaxTree.Expression;
  3408. componentType: IntermediateCode.Type;
  3409. next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  3410. size: LONGINT;
  3411. BEGIN
  3412. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3413. dest := destination; destination := emptyOperand;
  3414. leftType := x.left.type.resolved;
  3415. rightType := x.right.type.resolved;
  3416. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3417. CASE x.operator OF
  3418. Scanner.Or, Scanner.And, Scanner.Is:
  3419. result := ConditionValue(x);
  3420. |Scanner.Plus:
  3421. Evaluate(x.left,left);
  3422. Evaluate(x.right,right);
  3423. IF leftType IS SyntaxTree.SetType THEN
  3424. InitOperand(result,ModeValue);
  3425. Reuse2a(result.op,left.op,right.op,dest);
  3426. Emit(Or(position,result.op,left.op,right.op));
  3427. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3428. InitOperand(result,ModeValue);
  3429. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3430. Reuse2(result.tag,left.tag,right.tag);
  3431. Emit(Add(position,result.op,left.op,right.op));
  3432. Emit(Add(position,result.tag,left.tag,right.tag))
  3433. ELSE
  3434. InitOperand(result,ModeValue);
  3435. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3436. AddInt(result.op, left.op, right.op) ;
  3437. ELSE
  3438. *)
  3439. Reuse2a(result.op,left.op,right.op,dest);
  3440. Emit(Add(position,result.op,left.op,right.op));
  3441. (*
  3442. END;
  3443. *)
  3444. END;
  3445. ReleaseOperand(left); ReleaseOperand(right);
  3446. |Scanner.Minus:
  3447. Evaluate(x.left,left);
  3448. Evaluate(x.right,right);
  3449. IF leftType IS SyntaxTree.SetType THEN
  3450. InitOperand(result,ModeValue);
  3451. Reuse1(result.op,right.op);
  3452. Emit(Not(position,result.op,right.op));
  3453. ReleaseOperand(right);
  3454. Emit(And(position,result.op,result.op,left.op));
  3455. ReleaseOperand(left);
  3456. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3457. InitOperand(result,ModeValue);
  3458. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3459. Reuse2(result.tag,left.tag,right.tag);
  3460. Emit(Sub(position,result.op,left.op,right.op));
  3461. Emit(Sub(position,result.tag,left.tag,right.tag));
  3462. ReleaseOperand(left); ReleaseOperand(right)
  3463. ELSE
  3464. InitOperand(result,ModeValue);
  3465. Reuse2a(result.op,left.op,right.op,dest);
  3466. Emit(Sub(position,result.op,left.op,right.op));
  3467. ReleaseOperand(left); ReleaseOperand(right);
  3468. END;
  3469. |Scanner.Times:
  3470. Evaluate(x.left,left);
  3471. Evaluate(x.right,right);
  3472. IF leftType IS SyntaxTree.SetType THEN
  3473. InitOperand(result,ModeValue);
  3474. Reuse2a(result.op,left.op,right.op,dest);
  3475. Emit(And(position,result.op,left.op,right.op));
  3476. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3477. InitOperand(result, ModeValue);
  3478. componentType := left.op.type;
  3479. (* TODO: review this *)
  3480. (*
  3481. result.op = left.op * right.op - left.tag * right.tag
  3482. result.tag = left.tag * right.op + left.op * right.tag
  3483. *)
  3484. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3485. Emit(Mul(position,result.op, left.op, right.op));
  3486. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3487. Emit(Mul(position,tempReg, left.tag, right.tag));
  3488. Emit(Sub(position,result.op, result.op, tempReg));
  3489. Reuse2(result.tag, left.tag, right.op);
  3490. Emit(Mul(position,result.tag, left.tag, right.op));
  3491. Emit(Mul(position,tempReg, left.op, right.tag));
  3492. Emit(Add(position,result.tag, result.tag, tempReg));
  3493. ReleaseIntermediateOperand(tempReg)
  3494. ELSE
  3495. InitOperand(result,ModeValue);
  3496. Reuse2a(result.op,left.op,right.op,dest);
  3497. Emit(Mul(position,result.op,left.op,right.op));
  3498. END;
  3499. ReleaseOperand(left); ReleaseOperand(right);
  3500. |Scanner.Div:
  3501. Evaluate(x.left,left);
  3502. Evaluate(x.right,right);
  3503. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3504. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3505. IF ~isUnchecked THEN
  3506. exit := NewLabel();
  3507. BrltL(exit,zero,right.op);
  3508. EmitTrap(position,NegativeDivisorTrap);
  3509. SetLabel(exit);
  3510. END;
  3511. END;
  3512. InitOperand(result,ModeValue);
  3513. Reuse2a(result.op,left.op,right.op,dest);
  3514. Emit(Div(position,result.op,left.op,right.op));
  3515. ReleaseOperand(left); ReleaseOperand(right);
  3516. |Scanner.Mod:
  3517. Evaluate(x.left,left);
  3518. Evaluate(x.right,right);
  3519. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3520. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3521. IF ~isUnchecked THEN
  3522. exit := NewLabel();
  3523. BrltL(exit,zero,right.op);
  3524. EmitTrap(position,NegativeDivisorTrap);
  3525. SetLabel(exit);
  3526. END;
  3527. END;
  3528. InitOperand(result,ModeValue);
  3529. Reuse2a(result.op,left.op,right.op,dest);
  3530. Emit(Mod(position,result.op,left.op,right.op));
  3531. ReleaseOperand(left); ReleaseOperand(right);
  3532. |Scanner.Slash:
  3533. Evaluate(x.left,left);
  3534. Evaluate(x.right,right);
  3535. IF leftType IS SyntaxTree.SetType THEN
  3536. InitOperand(result,ModeValue);
  3537. Reuse2a(result.op,left.op,right.op,dest);
  3538. Emit(Xor(position,result.op,left.op,right.op));
  3539. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3540. InitOperand(result,ModeValue);
  3541. componentType := left.op.type;
  3542. (* review this *)
  3543. (*
  3544. divisor = right.op * right.op + right.tag * right.tag
  3545. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3546. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3547. *)
  3548. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3549. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3550. Emit(Mul(position,tempReg, right.op, right.op));
  3551. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3552. Emit(Add(position,tempReg, tempReg, tempReg2));
  3553. result.op := tempReg2;
  3554. Emit(Mul(position,result.op, left.op, right.op));
  3555. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3556. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3557. Emit(Add(position,result.op, result.op, tempReg2));
  3558. Emit(Div(position,result.op, result.op, tempReg));
  3559. Reuse2(result.tag, left.tag, right.op);
  3560. Emit(Mul(position,result.tag, left.tag, right.op));
  3561. Emit(Mul(position,tempReg2, left.op, right.tag));
  3562. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3563. Emit(Div(position,result.tag, result.tag, tempReg));
  3564. ReleaseIntermediateOperand(tempReg);
  3565. ReleaseIntermediateOperand(tempReg2)
  3566. ELSE
  3567. InitOperand(result,ModeValue);
  3568. Reuse2a(result.op,left.op,right.op,dest);
  3569. Emit(Div(position,result.op,left.op,right.op));
  3570. END;
  3571. ReleaseOperand(left); ReleaseOperand(right);
  3572. |Scanner.Equal, Scanner.LessEqual, Scanner.Less, Scanner.Greater, Scanner.GreaterEqual, Scanner.Unequal :
  3573. result := ConditionValue(x);
  3574. |Scanner.In:
  3575. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3576. Evaluate(x.left,left);
  3577. Evaluate(x.right,right);
  3578. Convert(left.op,setType);
  3579. Convert(right.op,setType);
  3580. ReuseCopy(temp.op,right.op);
  3581. Emit(Shr(position,temp.op,temp.op,left.op));
  3582. ReleaseOperand(right); ReleaseOperand(left);
  3583. IntermediateCode.InitImmediate(one,setType,1);
  3584. Emit(And(position,temp.op,temp.op,one));
  3585. Convert(temp.op,bool);
  3586. result.mode := ModeValue;
  3587. result.op := temp.op;
  3588. result.tag := nil; (* may be left over from calls to evaluate *)
  3589. ELSE
  3590. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3591. IF x.operator = Scanner.Questionmarks THEN
  3592. leftExpression := x.left;
  3593. rightExpression := x.right;
  3594. ELSE
  3595. leftExpression := x.right;
  3596. rightExpression := x.left;
  3597. END;
  3598. Evaluate(leftExpression, left);
  3599. Emit(Push(position,left.op));
  3600. ReleaseOperand(left);
  3601. Designate(rightExpression, right);
  3602. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3603. IF ~backend.cellsAreObjects THEN
  3604. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3605. END;
  3606. Emit(Push(position,right.op));
  3607. ReleaseOperand(right);
  3608. IF backend.cellsAreObjects THEN
  3609. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3610. ELSE
  3611. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3612. END;
  3613. InitOperand(result, ModeValue);
  3614. result.op := NewRegisterOperand(bool);
  3615. Emit(Result(position,result.op));
  3616. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3617. leftExpression := x.left;
  3618. rightExpression := x.right;
  3619. Evaluate(leftExpression, left);
  3620. Emit(Push(position,left.op));
  3621. ReleaseOperand(left);
  3622. Evaluate(rightExpression, right);
  3623. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3624. IF ~backend.cellsAreObjects THEN
  3625. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3626. END;
  3627. Emit(Push(position,right.op));
  3628. ReleaseOperand(right);
  3629. IF backend.cellsAreObjects THEN
  3630. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3631. ELSE
  3632. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3633. END;
  3634. InitOperand(result, ModeValue);
  3635. result.op := NewRegisterOperand(bool);
  3636. Emit(Result(position,result.op));
  3637. ELSE
  3638. HALT(100);
  3639. END;
  3640. END;
  3641. destination := dest;
  3642. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3643. END VisitBinaryExpression;
  3644. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  3645. VAR localResult, operand: Operand;
  3646. BEGIN
  3647. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3648. InitOperand(localResult, ModeValue);
  3649. ASSERT(x.first # NIL);
  3650. Evaluate(x.first, operand);
  3651. localResult.op := operand.op;
  3652. ReleaseOperand(operand);
  3653. UseIntermediateOperand(localResult.op);
  3654. ASSERT(x.last # NIL);
  3655. Evaluate(x.last, operand);
  3656. localResult.tag := operand.op;
  3657. ReleaseOperand(operand);
  3658. UseIntermediateOperand(localResult.tag);
  3659. IF x.step # NIL THEN
  3660. Evaluate(x.step, operand);
  3661. localResult.extra := operand.op;
  3662. ReleaseOperand(operand);
  3663. UseIntermediateOperand(localResult.extra);
  3664. END;
  3665. result := localResult;
  3666. IF Trace THEN TraceExit("VisitRangeExpression") END
  3667. END VisitRangeExpression;
  3668. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3669. BEGIN
  3670. HALT(100); (* should never be evaluated *)
  3671. END VisitTensorRangeExpression;
  3672. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  3673. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3674. BEGIN
  3675. IF Trace THEN TraceEnter("VisitConversion") END;
  3676. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3677. dest := destination; destination := emptyOperand;
  3678. Evaluate(x.expression,old);
  3679. InitOperand(result,ModeValue);
  3680. result.op := old.op;
  3681. ASSERT(result.op.mode # 0);
  3682. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3683. (* convert TO a complex number *)
  3684. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3685. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3686. ASSERT(result.op.mode # 0);
  3687. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3688. (* convert FROM a complex number TO a complex number*)
  3689. result.tag := old.tag;
  3690. ASSERT(result.tag.mode # 0);
  3691. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3692. ASSERT(result.tag.mode # 0)
  3693. ELSE
  3694. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3695. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3696. END
  3697. ELSE
  3698. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3699. ASSERT(result.op.mode # 0);
  3700. result.tag := old.tag; (*! probably never used *)
  3701. END;
  3702. destination := dest;
  3703. IF Trace THEN TraceExit("VisitConversion") END;
  3704. END VisitConversion;
  3705. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  3706. BEGIN
  3707. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3708. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3709. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3710. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3711. END VisitTypeDeclaration;
  3712. (** designators (expressions) *)
  3713. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  3714. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3715. BEGIN
  3716. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3717. IF x.left # NIL THEN Expression(x.left) END;
  3718. Symbol(x.symbol,result);
  3719. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3720. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3721. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3722. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3723. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3724. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3725. END;
  3726. END;
  3727. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3728. END VisitSymbolDesignator;
  3729. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3730. BEGIN
  3731. IF isUnchecked THEN RETURN END;
  3732. IF tagsAvailable THEN
  3733. TrapC(BrltL,index,length,IndexCheckTrap);
  3734. END;
  3735. END BoundCheck;
  3736. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3737. VAR d: IntermediateCode.Operand;
  3738. BEGIN
  3739. IF isUnchecked THEN RETURN END;
  3740. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3741. TrapC(op,dim,d,ArraySizeTrap);
  3742. ReleaseIntermediateOperand(d);
  3743. END DimensionCheck;
  3744. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3745. VAR
  3746. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3747. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3748. expression: SyntaxTree.Expression;
  3749. resultingType, leftType, baseType: SyntaxTree.Type;
  3750. skipLabel1: Label;
  3751. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3752. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3753. variableOp: Operand;
  3754. variable: SyntaxTree.Variable;
  3755. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3756. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3757. VAR e: SyntaxTree.Expression; i: LONGINT;
  3758. BEGIN
  3759. tensorFound := FALSE;
  3760. FOR i := 0 TO parameters.Length()-1 DO
  3761. e := parameters.GetExpression(i);
  3762. IF e IS SyntaxTree.TensorRangeExpression THEN
  3763. ASSERT(~tensorFound);
  3764. tensorFound := TRUE;
  3765. ELSIF e IS SyntaxTree.RangeExpression THEN
  3766. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3767. ELSE
  3768. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3769. END;
  3770. END;
  3771. END CountIndices;
  3772. BEGIN
  3773. ASSERT(tagsAvailable);
  3774. resultingType := x.type.resolved; (* resulting type *)
  3775. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3776. InitOperand(localResult, ModeReference);
  3777. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3778. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3779. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3780. (* a globally defined array destination tag is available -> use and invalidate it*)
  3781. localResult.tag := arrayDestinationTag;
  3782. IntermediateCode.InitOperand(arrayDestinationTag)
  3783. ELSE
  3784. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3785. (* the result is of array range type and thus does not provide any collectable pointers *)
  3786. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3787. Symbol(variable, variableOp);
  3788. ReuseCopy(localResult.tag, variableOp.op);
  3789. ReleaseOperand(variableOp);
  3790. END
  3791. END;
  3792. indexListSize := x.parameters.Length();
  3793. CountIndices(x.parameters);
  3794. (*ASSERT(tensorRangeCount <= 1);*)
  3795. (* designate the array to be indexed over, perform tensor range check if known *)
  3796. Designate(x.left, array);
  3797. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3798. Dereference(array, leftType,FALSE);
  3799. IF ~tensorFound THEN
  3800. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  3801. END
  3802. END;
  3803. (* default base offset *)
  3804. srcDimOffset := 0;
  3805. destDimOffset := 0;
  3806. indexDim := 0;
  3807. (* use address of source array as basis *)
  3808. localResult.op := array.op;
  3809. UseIntermediateOperand(localResult.op);
  3810. (* go through the index list *)
  3811. FOR i := 0 TO indexListSize - 1 DO
  3812. expression := x.parameters.GetExpression(i);
  3813. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3814. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3815. srcDimOffset := -indexListSize;
  3816. destDimOffset := -suffixRanges;
  3817. ELSE
  3818. (* determine which dimension of source array is currently looked at *)
  3819. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3820. (* get the memory operand pointing to array descriptor dimension *)
  3821. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3822. (* make a reusable register from it *)
  3823. ReuseCopy(srcDim, tmp);
  3824. ReleaseIntermediateOperand(tmp);
  3825. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3826. ELSE
  3827. srcDim := IntermediateCode.Immediate(sizeType, i);
  3828. END;
  3829. (* get length and increment of source array for current dimension *)
  3830. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3831. Convert(sourceLength.op, sizeType);
  3832. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3833. Convert(sourceIncrement.op, sizeType);
  3834. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3835. ReleaseIntermediateOperand(srcDim);
  3836. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3837. (* SINGLE INDEX *)
  3838. Evaluate(expression, index);
  3839. ReleaseIntermediateOperand(index.tag);
  3840. index.tag := emptyOperand;
  3841. Convert(index.op, sizeType);
  3842. (* lower bound check *)
  3843. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3844. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3845. ELSIF isUnchecked THEN (* do nothing *)
  3846. ELSE
  3847. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3848. END;
  3849. (* upper bound check *)
  3850. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3851. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3852. ELSIF isUnchecked THEN (* do nothing *)
  3853. ELSE
  3854. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3855. END;
  3856. ReleaseOperand(sourceLength);
  3857. Convert(index.op, addressType);
  3858. summand := index.op;
  3859. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3860. (* RANGE OF INDICES *)
  3861. Evaluate(expression, range);
  3862. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3863. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3864. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3865. ReleaseOperand(range);
  3866. Convert(firstIndex, sizeType);
  3867. Convert(lastIndex, sizeType);
  3868. Convert(stepSize, sizeType);
  3869. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3870. if it is 'MAX(LONGINT)' *)
  3871. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3872. TransferToRegister(lastIndex, lastIndex);
  3873. skipLabel1 := NewLabel();
  3874. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3875. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3876. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3877. SetLabel(skipLabel1)
  3878. END;
  3879. (* check if step size is valid *)
  3880. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3881. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3882. ELSIF isUnchecked THEN (* do nothing *)
  3883. ELSE
  3884. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3885. END;
  3886. (* check lower bound check *)
  3887. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3888. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3889. ELSIF isUnchecked THEN (* do nothing *)
  3890. ELSE
  3891. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3892. END;
  3893. (* check upper bound check *)
  3894. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3895. (* statically open range: nothing to do *)
  3896. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3897. ASSERT(staticLastIndex < staticSourceLength)
  3898. ELSIF isUnchecked THEN (* do nothing *)
  3899. ELSE
  3900. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3901. END;
  3902. (* determine length of target array for current dimension *)
  3903. (* 1. incorporate last index: *)
  3904. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3905. (* last index is static *)
  3906. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3907. targetLength := sourceLength.op
  3908. ELSE
  3909. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3910. END;
  3911. UseIntermediateOperand(targetLength);
  3912. ELSE
  3913. (* targetLength := lastIndex + 1
  3914. Reuse1(targetLength, lastIndex);
  3915. *)
  3916. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3917. END;
  3918. ReleaseOperand(sourceLength);
  3919. ReleaseIntermediateOperand(lastIndex);
  3920. (* 2. incorporate first index: *)
  3921. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3922. (* first index and current target length are static *)
  3923. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3924. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3925. (* first index = 0: nothing to do *)
  3926. ELSE
  3927. (* targetLength := targetLength - firstIndex *)
  3928. TransferToRegister(targetLength, targetLength);
  3929. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3930. END;
  3931. (* clip negative lengths to 0 *)
  3932. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3933. IF staticTargetLength < 0 THEN
  3934. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3935. END
  3936. ELSE
  3937. skipLabel1 := NewLabel();
  3938. TransferToRegister(targetLength, targetLength);
  3939. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3940. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3941. SetLabel(skipLabel1)
  3942. END;
  3943. (* 3. incorporate index step size: *)
  3944. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3945. (*step size and current target length are static *)
  3946. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3947. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3948. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3949. (* step size = 1: nothing to do *)
  3950. ELSE
  3951. (* emit code for this:
  3952. targetLength := (targetLength-1) DIV stepSize +1;
  3953. *)
  3954. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3955. DivInt(targetLength, targetLength, stepSize);
  3956. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3957. END;
  3958. (* determine increment of target array for current dimension *)
  3959. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3960. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3961. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3962. (* step size = 1 *)
  3963. targetIncrement := sourceIncrement.op;
  3964. UseIntermediateOperand(targetIncrement)
  3965. ELSE
  3966. (* targetIncrement := sourceIncrement * stepSize *)
  3967. Reuse1(targetIncrement, stepSize);
  3968. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3969. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3970. END;
  3971. ReleaseIntermediateOperand(stepSize);
  3972. (* write length and increment of target array to descriptor *)
  3973. IF destDimOffset < 0 THEN
  3974. (* determine which dimension of target array is currently looked at *)
  3975. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3976. TransferToRegister(destDim, tmp);
  3977. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3978. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3979. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3980. ReleaseIntermediateOperand(destDim);
  3981. INC(destDimOffset);
  3982. ELSE
  3983. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3984. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  3985. END;
  3986. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3987. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3988. INC(indexDim);
  3989. Convert(firstIndex, addressType);
  3990. TransferToRegister(summand, firstIndex);
  3991. ELSE HALT(100);
  3992. END;
  3993. (*
  3994. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3995. *)
  3996. Convert(sourceIncrement.op, addressType);
  3997. Convert(summand, addressType);
  3998. MulInt(summand, summand, sourceIncrement.op);
  3999. ReleaseIntermediateOperand(sourceIncrement.op);
  4000. AddInt(localResult.op, localResult.op, summand);
  4001. ReleaseIntermediateOperand(summand);
  4002. END
  4003. END;
  4004. result := localResult;
  4005. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  4006. ReleaseIntermediateOperand(result.tag);
  4007. result.tag := TypeDescriptorAdr(resultingType);
  4008. ELSIF IsDelegate(resultingType) THEN
  4009. ReleaseIntermediateOperand(result.tag);
  4010. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4011. UseIntermediateOperand(result.tag);
  4012. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4013. ReleaseIntermediateOperand(result.tag);
  4014. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  4015. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  4016. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  4017. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  4018. (* finalize target array descriptor *)
  4019. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  4020. (* write lengths and increments of target array for remaining dimensions *)
  4021. i := indexListSize;
  4022. WHILE indexDim < targetArrayDimensionality DO
  4023. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  4024. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  4025. ReleaseOperand(sourceLength);
  4026. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  4027. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  4028. ReleaseOperand(sourceIncrement);
  4029. INC(i); INC(indexDim);
  4030. END;
  4031. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4032. tmp := nil;
  4033. ELSE
  4034. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  4035. END;
  4036. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  4037. ReleaseIntermediateOperand(tmp);
  4038. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4039. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  4040. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4041. ELSE
  4042. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  4043. END;
  4044. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  4045. ReleaseIntermediateOperand(tmp);
  4046. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  4047. (* write dimensionality *)
  4048. IF targetArrayDimensionality # 0 THEN
  4049. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  4050. END;
  4051. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  4052. END;
  4053. ReleaseOperand(array);
  4054. END MathIndexDesignator;
  4055. (* get the length of an array , trying to make use of static information *)
  4056. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  4057. VAR res: IntermediateCode.Operand; size: LONGINT;
  4058. BEGIN
  4059. type := type.resolved;
  4060. IF type IS SyntaxTree.ArrayType THEN
  4061. WITH type: SyntaxTree.ArrayType DO
  4062. IF type.form = SyntaxTree.Static THEN
  4063. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  4064. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4065. Evaluate(type.length, op);
  4066. ReleaseIntermediateOperand(op.tag);
  4067. RETURN op.op;*)
  4068. ELSE
  4069. res := tag;
  4070. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  4071. IntermediateCode.MakeMemory(res,addressType);
  4072. UseIntermediateOperand(res);
  4073. RETURN res
  4074. END
  4075. END;
  4076. ELSE
  4077. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  4078. RETURN IntermediateCode.Immediate(addressType,size);
  4079. END;
  4080. END ArrayLength;
  4081. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  4082. BEGIN
  4083. IF IsImmediate(x) THEN
  4084. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  4085. ELSE
  4086. IF ~ReusableRegister(res) THEN
  4087. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4088. ELSE
  4089. UseIntermediateOperand(res);
  4090. END;
  4091. Emit(Mov(position,res,x))
  4092. END;
  4093. END CopyInt;
  4094. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4095. BEGIN
  4096. ReleaseIntermediateOperand(res);
  4097. IF IsImmediate(x) & IsImmediate(y) THEN
  4098. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  4099. ELSIF IsAddress(x) & IsImmediate(y) THEN
  4100. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  4101. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  4102. ELSIF IsAddress(y) & IsImmediate(x) THEN
  4103. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  4104. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  4105. ELSIF IsRegister(x) & IsImmediate(y) THEN
  4106. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  4107. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  4108. UseIntermediateOperand(res);
  4109. ELSIF IsRegister(y) & IsImmediate(x) THEN
  4110. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  4111. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  4112. UseIntermediateOperand(res);
  4113. ELSE
  4114. IF ~ReusableRegister(res) THEN
  4115. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4116. ELSE
  4117. UseIntermediateOperand(res);
  4118. END;
  4119. IF IsImmediate(x) & (x.intValue = 0) THEN
  4120. Emit(Mov(position,res,y))
  4121. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  4122. Emit(Mov(position,res,x))
  4123. ELSE
  4124. Emit(Add(position,res, x, y));
  4125. END;
  4126. END;
  4127. END AddInt;
  4128. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4129. BEGIN
  4130. ReleaseIntermediateOperand(res);
  4131. IF IsImmediate(x) & IsImmediate(y) THEN
  4132. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  4133. ELSE
  4134. IF ~ReusableRegister(res) THEN
  4135. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4136. ELSE UseIntermediateOperand(res);
  4137. END;
  4138. IF IsImmediate(x) & (x.intValue = 1) THEN
  4139. Emit(Mov(position,res,y))
  4140. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4141. Emit(Mov(position,res,x))
  4142. ELSE
  4143. Emit(Mul(position,res, x, y));
  4144. END;
  4145. END;
  4146. END MulInt;
  4147. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4148. BEGIN
  4149. ReleaseIntermediateOperand(res);
  4150. IF IsImmediate(x) & IsImmediate(y) THEN
  4151. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  4152. ELSE
  4153. IF ~ReusableRegister(res) THEN
  4154. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4155. ELSE UseIntermediateOperand(res);
  4156. END;
  4157. IF IsImmediate(x) & (x.intValue = 1) THEN
  4158. Emit(Mov(position,res,y))
  4159. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4160. Emit(Mov(position,res,x))
  4161. ELSE
  4162. Emit(Div(position,res, x, y));
  4163. END;
  4164. END;
  4165. END DivInt;
  4166. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  4167. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  4168. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  4169. BEGIN
  4170. type := x.left.type.resolved;
  4171. IF type IS SyntaxTree.StringType THEN
  4172. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  4173. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  4174. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  4175. type := atype;
  4176. x.left.SetType(type);
  4177. END;
  4178. IntermediateCode.InitImmediate(res,addressType,0);
  4179. maxDim := x.parameters.Length()-1;
  4180. (*
  4181. computation rule:
  4182. a: ARRAY X,Y,Z OF Element with size S
  4183. a[i,j,k] -->
  4184. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  4185. *)
  4186. FOR i := 0 TO maxDim DO
  4187. e := x.parameters.GetExpression(i);
  4188. Evaluate(e,index);
  4189. Convert(index.op,addressType);
  4190. AddInt(res, res, index.op);
  4191. IF i = 0 THEN
  4192. (*
  4193. ReuseCopy(res, index.op);
  4194. *)
  4195. Designate(x.left,array);
  4196. type := x.left.type.resolved;
  4197. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4198. Dereference(array, type, FALSE);
  4199. END;
  4200. (*
  4201. ELSE AddInt(res, res, index.op);
  4202. *)
  4203. END;
  4204. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4205. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4206. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4207. BoundCheck(index.op, length);
  4208. END;
  4209. ReleaseIntermediateOperand(length);
  4210. END;
  4211. ReleaseOperand(index);
  4212. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4213. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4214. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4215. MulInt(res,res,length);
  4216. END;
  4217. ReleaseIntermediateOperand(length);
  4218. END;
  4219. (* remaining open dimensions -- compute address *)
  4220. i := maxDim+1;
  4221. IF type IS SyntaxTree.ArrayType THEN
  4222. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4223. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4224. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4225. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4226. MulInt(res,res,length);
  4227. END;
  4228. ReleaseIntermediateOperand(length);
  4229. INC(i);
  4230. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4231. END;
  4232. END;
  4233. IF (type IS SyntaxTree.ArrayType) THEN
  4234. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4235. size := StaticSize(system, type);
  4236. IF size # 1 THEN
  4237. length := IntermediateCode.Immediate(addressType,size);
  4238. MulInt(res,res,length);
  4239. END;
  4240. ELSE
  4241. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4242. IF size # 1 THEN
  4243. length := IntermediateCode.Immediate(addressType,size);
  4244. MulInt(res,res,length);
  4245. END;
  4246. END;
  4247. END;
  4248. AddInt(res,res,array.op);
  4249. InitOperand(result,ModeReference);
  4250. result.op := res;
  4251. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4252. ReleaseIntermediateOperand(result.tag);
  4253. result.tag := TypeDescriptorAdr(type);
  4254. ELSIF IsDelegate(type) THEN
  4255. ReleaseIntermediateOperand(result.tag);
  4256. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4257. UseIntermediateOperand(result.tag);
  4258. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4259. ReleaseIntermediateOperand(result.tag);
  4260. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4261. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4262. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4263. END;
  4264. ReleaseOperand(array);
  4265. END IndexDesignator;
  4266. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  4267. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4268. BEGIN
  4269. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4270. dest := destination; destination := emptyOperand;
  4271. type := x.left.type.resolved;
  4272. IF type IS SyntaxTree.MathArrayType THEN
  4273. MathIndexDesignator(x);
  4274. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4275. IndexDesignator(x);
  4276. END;
  4277. destination := dest;
  4278. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4279. END VisitIndexDesignator;
  4280. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4281. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4282. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4283. procedure: SyntaxTree.Procedure;
  4284. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4285. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4286. BEGIN
  4287. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4288. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4289. parameters := expression.parameters;
  4290. moduleName := "FoxArrayBase";
  4291. procedureName := "CopyDescriptor";
  4292. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4293. SaveRegisters();ReleaseUsedRegisters(saved);
  4294. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4295. IF procedure = NIL THEN
  4296. s := "procedure ";
  4297. Strings.Append(s,moduleName);
  4298. Strings.Append(s,".");
  4299. Strings.Append(s,procedureName);
  4300. Strings.Append(s," not present");
  4301. Error(position,s);
  4302. ELSE
  4303. (* push address of temporary variable *)
  4304. Symbol(variable,destOperand);
  4305. Emit(Push(position,destOperand.op));
  4306. ReleaseOperand(destOperand);
  4307. (* push src *)
  4308. Evaluate(expression.left,srcOperand);
  4309. (*
  4310. Dereference(srcOperand,expression.type.resolved);
  4311. Emit(Push(position,srcOperand.tag));
  4312. *)
  4313. Emit(Push(position,srcOperand.op));
  4314. ReleaseOperand(srcOperand);
  4315. tensorFound := FALSE;
  4316. FOR i := 0 TO parameters.Length()-1 DO
  4317. e := parameters.GetExpression(i);
  4318. IF e IS SyntaxTree.TensorRangeExpression THEN
  4319. tensorFound := TRUE;
  4320. ELSIF e IS SyntaxTree.RangeExpression THEN
  4321. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4322. ELSE
  4323. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4324. END;
  4325. END;
  4326. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4327. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4328. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4329. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4330. StaticCallOperand(procOp,procedure);
  4331. Emit(Call(position,procOp.op,ProcParametersSize(procedure)));
  4332. ReleaseOperand(procOp);
  4333. END;
  4334. RestoreRegisters(saved);
  4335. END;
  4336. RETURN variable
  4337. END PrepareTensorDescriptor;
  4338. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; register: WORD);
  4339. VAR
  4340. type, descriptorType, baseType, componentType: SyntaxTree.Type;
  4341. operand, tmpOperand, variableOp, variable2Op: Operand;
  4342. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4343. variable, variable2: SyntaxTree.Variable;
  4344. dim, i, size: LONGINT;
  4345. (* TODO: needed? *)
  4346. oldArrayDestinationTag: IntermediateCode.Operand;
  4347. oldArrayDestinationDimension: LONGINT;
  4348. position: Position;
  4349. saved: RegisterEntry;
  4350. arrayFlags: SET;
  4351. m, n: LONGINT;
  4352. PROCEDURE Pass(op: IntermediateCode.Operand);
  4353. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4354. BEGIN
  4355. IF register >= 0 THEN
  4356. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  4357. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4358. Emit(Mov(position,parameterRegister, op));
  4359. ELSE
  4360. Emit(Push(position,op))
  4361. END
  4362. END Pass;
  4363. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4364. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4365. BEGIN
  4366. formalType := formalType.resolved; actualType := actualType.resolved;
  4367. IF IsOpenArray(formalType)THEN
  4368. IF actualType IS SyntaxTree.StringType THEN
  4369. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4370. RETURN;
  4371. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4372. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4373. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4374. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4375. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4376. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4377. ELSE
  4378. tmp := baseReg;
  4379. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4380. IntermediateCode.MakeMemory(tmp,addressType);
  4381. Pass((tmp));
  4382. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4383. END;
  4384. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4385. END;
  4386. END PushArrayLens;
  4387. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4388. BEGIN
  4389. CASE size OF
  4390. |2: INCL(flags,Size2Flag);
  4391. |3: INCL(flags,Size3Flag);
  4392. |4: INCL(flags,Size4Flag);
  4393. |5: INCL(flags,Size5Flag);
  4394. |6: INCL(flags,Size6Flag);
  4395. |7: INCL(flags,Size7Flag);
  4396. |8: INCL(flags,Size8Flag);
  4397. END;
  4398. END SetSmallArraySizeFlag;
  4399. BEGIN
  4400. IF Trace THEN TraceEnter("PushParameter") END;
  4401. position := expression.position;
  4402. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4403. type := expression.type.resolved;
  4404. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4405. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4406. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4407. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4408. );
  4409. (* TODO: needed? *)
  4410. oldArrayDestinationTag := arrayDestinationTag;
  4411. oldArrayDestinationDimension := arrayDestinationDimension;
  4412. IF IsArrayOfSystemByte(parameter.type) THEN
  4413. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4414. Designate(expression,operand);
  4415. ELSE
  4416. Evaluate(expression, tmpOperand);
  4417. (* array of system byte does not provide any pointers *)
  4418. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4419. Symbol(variable, operand);
  4420. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4421. Emit(Mov(position,tmp, tmpOperand.op));
  4422. ReleaseOperand(tmpOperand);
  4423. END;
  4424. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4425. ReleaseIntermediateOperand(operand.tag);
  4426. operand.tag := tmp;
  4427. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4428. Pass((operand.tag));
  4429. END;
  4430. Pass((operand.op));
  4431. ELSIF IsOpenArray(parameter.type) THEN
  4432. Designate(expression,operand);
  4433. baseReg := operand.tag;
  4434. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4435. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4436. END;
  4437. Pass((operand.op)); (* address of the array *)
  4438. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4439. (* case 1
  4440. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4441. *)
  4442. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4443. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4444. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4445. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4446. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4447. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4448. arrayDestinationTag := sp;
  4449. (* case 1b
  4450. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4451. *)
  4452. IF expression IS SyntaxTree.IndexDesignator THEN
  4453. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4454. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4455. arrayDestinationDimension := dim;
  4456. Designate(expression,operand);
  4457. (* case 1a
  4458. P(...,A,...) push: push array descriptor to stack
  4459. *)
  4460. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4461. Designate(expression,operand);
  4462. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4463. i := 0;
  4464. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4465. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4466. INC(i);
  4467. END;
  4468. type := expression.type.resolved;
  4469. WHILE (i<dim) DO (* remaining static dimensions *)
  4470. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4471. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4472. ReleaseOperand(tmpOperand);
  4473. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4474. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4475. ReleaseOperand(tmpOperand);
  4476. INC(i);
  4477. END;
  4478. dimOp := IntermediateCode.Immediate(addressType,dim);
  4479. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4480. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4481. (* case 1d
  4482. P(...,T,...) push: process left arguments, create array descriptor with given s of dimensions from T on stack
  4483. + case 1e
  4484. P(.. PT() ... );
  4485. *)
  4486. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4487. Designate(expression,operand);
  4488. Dereference(operand,type.resolved,FALSE);
  4489. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4490. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4491. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4492. (* case 1f
  4493. P(...,S,...) push: create array descriptor to S on stack
  4494. case 1g
  4495. P(... PS()...)
  4496. *)
  4497. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4498. Designate(expression,operand);
  4499. FOR i := 0 TO dim-1 DO
  4500. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4501. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4502. ReleaseOperand(tmpOperand);
  4503. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4504. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4505. ReleaseOperand(tmpOperand);
  4506. END;
  4507. (*******
  4508. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4509. *)
  4510. arrayFlags := {StaticFlag};
  4511. IF dim = 1 THEN
  4512. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4513. ReleaseOperand(tmpOperand);
  4514. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4515. m := LONGINT(tmpOperand.op.intValue);
  4516. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4517. ELSIF dim = 2 THEN
  4518. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4519. ReleaseOperand(tmpOperand);
  4520. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4521. m := LONGINT(tmpOperand.op.intValue);
  4522. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4523. ReleaseOperand(tmpOperand);
  4524. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4525. n := LONGINT(tmpOperand.op.intValue);
  4526. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4527. INCL(arrayFlags,SmallMatrixFlag);
  4528. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4529. END;
  4530. END;
  4531. (*******)
  4532. dimOp := IntermediateCode.Immediate(addressType,dim);
  4533. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4534. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4535. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4536. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4537. baseType := SemanticChecker.ArrayBase(type,dim);
  4538. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4539. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4540. ELSE HALT(100);
  4541. END;
  4542. (* case 2
  4543. procedure P([left args], var A: array [*,*] of Type, [right args])
  4544. *)
  4545. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4546. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4547. (* case 2b
  4548. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4549. push: push reference to pushed array descriptor
  4550. post: remove array descriptor.
  4551. *)
  4552. IF expression IS SyntaxTree.IndexDesignator THEN
  4553. descriptorType := GetMathArrayDescriptorType(dim);
  4554. (* range type : no allocation possible, should be untraced *)
  4555. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4556. Symbol(variable,variableOp);
  4557. arrayDestinationTag := variableOp.op;
  4558. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4559. arrayDestinationDimension := dim;
  4560. NeedDescriptor := TRUE;
  4561. Designate(expression,operand);
  4562. Pass((operand.tag));
  4563. NeedDescriptor := FALSE;
  4564. (* case 2a
  4565. P(...,A,...)
  4566. push: push reference to array descriptor on stack
  4567. *)
  4568. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4569. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4570. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4571. INC(i);
  4572. END;
  4573. IF i = dim THEN
  4574. Designate(expression,operand);
  4575. Pass((operand.tag));
  4576. ELSE (* open-static *)
  4577. type := expression.type.resolved;
  4578. descriptorType := GetMathArrayDescriptorType(dim);
  4579. (* static array , cannot be reallocated, untraced !*)
  4580. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4581. Symbol(variable,variableOp);
  4582. arrayDestinationTag := variableOp.op;
  4583. Designate(expression,operand);
  4584. FOR i := 0 TO dim-1 DO
  4585. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4586. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4587. ReleaseOperand(tmpOperand);
  4588. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4589. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4590. ReleaseOperand(tmpOperand);
  4591. END;
  4592. dimOp := IntermediateCode.Immediate(addressType,dim);
  4593. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4594. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4595. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4596. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4597. baseType := SemanticChecker.ArrayBase(type,dim);
  4598. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4599. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4600. Pass((arrayDestinationTag));
  4601. END;
  4602. (* case 2d
  4603. P(...,T,...) push: emit dimension check, push T
  4604. *)
  4605. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4606. Designate(expression,operand);
  4607. Dereference(operand,type.resolved,FALSE);
  4608. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4609. Pass((operand.tag));
  4610. (* case 2f
  4611. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4612. push: push reference to pushed array descriptor
  4613. post: remove array descriptor
  4614. *)
  4615. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4616. descriptorType := GetMathArrayDescriptorType(dim);
  4617. (* static array -- cannot be reallocatated, untraced *)
  4618. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4619. Symbol(variable,variableOp);
  4620. arrayDestinationTag := variableOp.op;
  4621. Designate(expression,operand);
  4622. FOR i := 0 TO dim-1 DO
  4623. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4624. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4625. ReleaseOperand(tmpOperand);
  4626. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4627. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4628. ReleaseOperand(tmpOperand);
  4629. END;
  4630. (*
  4631. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4632. *)
  4633. arrayFlags := {StaticFlag};
  4634. IF dim = 1 THEN
  4635. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4636. ReleaseOperand(tmpOperand);
  4637. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4638. m := LONGINT(tmpOperand.op.intValue);
  4639. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4640. ELSIF dim = 2 THEN
  4641. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4642. ReleaseOperand(tmpOperand);
  4643. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4644. m := LONGINT(tmpOperand.op.intValue);
  4645. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4646. ReleaseOperand(tmpOperand);
  4647. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4648. n := LONGINT(tmpOperand.op.intValue);
  4649. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4650. INCL(arrayFlags,SmallMatrixFlag);
  4651. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4652. END;
  4653. END;
  4654. (*******)
  4655. dimOp := IntermediateCode.Immediate(addressType,dim);
  4656. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4657. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4658. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4659. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4660. baseType := SemanticChecker.ArrayBase(type,dim);
  4661. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4662. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4663. Pass((arrayDestinationTag));
  4664. ELSE HALT(100);
  4665. END;
  4666. (* case 3
  4667. procedure P([left args], [const] A: array [?] of Type, [right args])
  4668. *)
  4669. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4670. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4671. (* case 3b
  4672. P(...,A[a..b,c..d],...)
  4673. *)
  4674. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4675. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4676. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4677. Symbol(variable,variableOp);
  4678. LoadValue(variableOp,system.addressType);
  4679. ELSE
  4680. descriptorType := GetMathArrayDescriptorType(dim);
  4681. (* range -- cannot be reallocated *)
  4682. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4683. Symbol(variable,variableOp);
  4684. END;
  4685. arrayDestinationTag := variableOp.op;
  4686. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4687. arrayDestinationDimension := 0;
  4688. Designate(expression,operand);
  4689. Pass((operand.tag));
  4690. (* case 3a
  4691. P(...,A,...)
  4692. *)
  4693. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4694. i := 0;
  4695. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4696. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4697. INC(i);
  4698. END;
  4699. IF i = dim THEN
  4700. Designate(expression,operand);
  4701. Pass((operand.tag));
  4702. ELSE (* open-static *)
  4703. type := expression.type.resolved;
  4704. descriptorType := GetMathArrayDescriptorType(dim);
  4705. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4706. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4707. Symbol(variable,variableOp);
  4708. arrayDestinationTag := variableOp.op;
  4709. Designate(expression,operand);
  4710. FOR i := 0 TO dim-1 DO
  4711. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4712. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4713. ReleaseOperand(tmpOperand);
  4714. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4715. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4716. ReleaseOperand(tmpOperand);
  4717. END;
  4718. dimOp := IntermediateCode.Immediate(addressType,dim);
  4719. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4720. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4721. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4722. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4723. baseType := SemanticChecker.ArrayBase(type,dim);
  4724. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4725. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4726. Pass((arrayDestinationTag));
  4727. END;
  4728. (* case 3d
  4729. P(...,T,...)
  4730. case 3e
  4731. P(...,PT(...),...)
  4732. *)
  4733. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4734. Designate(expression,operand);
  4735. Dereference(operand,type.resolved,FALSE);
  4736. Pass((operand.tag));
  4737. (* case 3f
  4738. P(...,S,...)
  4739. case 3g
  4740. P(...,PS(...),...)
  4741. *)
  4742. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4743. descriptorType := GetMathArrayDescriptorType(dim);
  4744. (* static array does not need to be traced *)
  4745. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4746. Symbol(variable,variableOp);
  4747. arrayDestinationTag := variableOp.op;
  4748. Designate(expression,operand);
  4749. IF operand.op.type.length >1 THEN (* vector register *)
  4750. (* static array does not need to be traced *)
  4751. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4752. Symbol(variable2, variable2Op);
  4753. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4754. Emit(Mov(position,tmp, operand.op));
  4755. ReleaseOperand(operand);
  4756. Symbol(variable2, operand);
  4757. END;
  4758. FOR i := 0 TO dim-1 DO
  4759. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4760. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4761. ReleaseOperand(tmpOperand);
  4762. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4763. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4764. ReleaseOperand(tmpOperand);
  4765. END;
  4766. dimOp := IntermediateCode.Immediate(addressType,dim);
  4767. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4768. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4769. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4770. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4771. baseType := SemanticChecker.ArrayBase(type,dim);
  4772. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4773. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4774. Pass((arrayDestinationTag));
  4775. ELSE HALT(100);
  4776. END;
  4777. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4778. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4779. (* case 4b
  4780. P(...,A[a..b,c..d],...)
  4781. *)
  4782. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4783. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4784. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4785. Symbol(variable,variableOp);
  4786. LoadValue(variableOp,system.addressType);
  4787. ELSE
  4788. descriptorType := GetMathArrayDescriptorType(dim);
  4789. (* range array -- cannot be allocated *)
  4790. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4791. Symbol(variable,variableOp);
  4792. END;
  4793. arrayDestinationTag := variableOp.op;
  4794. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4795. arrayDestinationDimension := 0;
  4796. Designate(expression,operand);
  4797. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4798. Symbol(variable,variableOp);
  4799. ELSE
  4800. (* alias to range -- untraced *)
  4801. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4802. Symbol(variable,variableOp);
  4803. MakeMemory(tmp,variableOp.op,addressType,0);
  4804. Emit(Mov(position,tmp,operand.tag));
  4805. ReleaseIntermediateOperand(tmp);
  4806. END;
  4807. Pass((variableOp.op));
  4808. ReleaseOperand(variableOp);
  4809. (* case 4a
  4810. P(...,A,...)
  4811. *)
  4812. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4813. i := 0;
  4814. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4815. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4816. INC(i);
  4817. END;
  4818. IF i = dim THEN
  4819. Designate(expression,operand);
  4820. arrayDestinationTag := operand.tag;
  4821. ELSE (* open-static *)
  4822. type := expression.type.resolved;
  4823. descriptorType := GetMathArrayDescriptorType(dim);
  4824. (* static array -- untraced *)
  4825. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4826. Symbol(variable,variableOp);
  4827. arrayDestinationTag := variableOp.op;
  4828. Designate(expression,operand);
  4829. FOR i := 0 TO dim-1 DO
  4830. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4831. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4832. ReleaseOperand(tmpOperand);
  4833. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4834. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4835. ReleaseOperand(tmpOperand);
  4836. END;
  4837. dimOp := IntermediateCode.Immediate(addressType,dim);
  4838. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4839. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4840. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4841. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4842. baseType := SemanticChecker.ArrayBase(type,dim);
  4843. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4844. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4845. END;
  4846. (* tensor alias to open array -- untraced *)
  4847. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4848. Symbol(variable,variableOp);
  4849. MakeMemory(tmp,variableOp.op,addressType,0);
  4850. Emit(Mov(position,tmp,arrayDestinationTag));
  4851. ReleaseIntermediateOperand(tmp);
  4852. Pass((variableOp.op));
  4853. ReleaseOperand(variableOp);
  4854. (* case 4d
  4855. P(...,T,...)
  4856. *)
  4857. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4858. Designate(expression,operand);
  4859. Pass((operand.op));
  4860. (* case 4f
  4861. P(...,S,...)
  4862. *)
  4863. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4864. descriptorType := GetMathArrayDescriptorType(dim);
  4865. (* static array -- cannot be reallocated, untraced *)
  4866. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4867. Symbol(variable,variableOp);
  4868. arrayDestinationTag := variableOp.op;
  4869. Designate(expression,operand);
  4870. FOR i := 0 TO dim-1 DO
  4871. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4872. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4873. ReleaseOperand(tmpOperand);
  4874. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4875. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4876. ReleaseOperand(tmpOperand);
  4877. END;
  4878. dimOp := IntermediateCode.Immediate(addressType,dim);
  4879. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4880. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4881. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4882. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4883. baseType := SemanticChecker.ArrayBase(type,dim);
  4884. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4885. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4886. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4887. Symbol(variable,variableOp);
  4888. MakeMemory(tmp,variableOp.op,addressType,0);
  4889. Emit(Mov(position,tmp,arrayDestinationTag));
  4890. ReleaseIntermediateOperand(tmp);
  4891. Pass((variableOp.op));
  4892. ReleaseOperand(variableOp);
  4893. ELSE HALT(100);
  4894. END;
  4895. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4896. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4897. Designate(expression,operand);
  4898. IF operand.op.type.length > 1 THEN
  4899. Emit(Push(position, operand.op));
  4900. ELSE
  4901. size := system.SizeOf(type);
  4902. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4903. size := ToMemoryUnits(system,size);
  4904. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4905. arrayDestinationTag := sp;
  4906. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4907. END;
  4908. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4909. Designate(expression,operand);
  4910. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4911. (* static array no pointer *)
  4912. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4913. Symbol(variable,variableOp);
  4914. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4915. Emit(Mov(position,tmp,operand.op));
  4916. Emit(Push(position,variableOp.op));
  4917. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4918. Pass((operand.op));
  4919. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4920. END;
  4921. ELSE HALT(200)
  4922. END;
  4923. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4924. IF parameter.kind = SyntaxTree.VarParameter THEN
  4925. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4926. Designate(expression, operand);
  4927. Pass((operand.op));
  4928. ELSE
  4929. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4930. Evaluate(expression, operand);
  4931. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,system.lenType) = system.AlignmentOf(system.variableAlignment,system.lenType)) THEN
  4932. Pass((operand.extra)); (* step *)
  4933. Pass((operand.tag)); (* last *)
  4934. Pass((operand.op)); (* first *)
  4935. ELSE
  4936. (* pass range as structure in order to comply with the variable alignment of its components *)
  4937. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  4938. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,system.lenType)));
  4939. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4940. tmp := sp;
  4941. IntermediateCode.MakeMemory(tmp,operand.op.type);
  4942. Emit(Mov(position,tmp,operand.op)); (* first *)
  4943. size := ToMemoryUnits(system,system.AlignedSizeOf(system.lenType));
  4944. IntermediateCode.AddOffset(tmp,size);
  4945. Emit(Mov(position,tmp,operand.tag)); (* last *)
  4946. IntermediateCode.AddOffset(tmp,size);
  4947. Emit(Mov(position,tmp,operand.extra)); (* step *)
  4948. END;
  4949. END
  4950. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4951. IF parameter.kind = SyntaxTree.VarParameter THEN
  4952. Designate(expression, operand);
  4953. Pass((operand.op));
  4954. ELSE
  4955. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4956. Evaluate(expression, operand);
  4957. componentType := parameter.type.resolved(SyntaxTree.ComplexType).componentType;
  4958. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,componentType) = system.AlignmentOf(system.variableAlignment,componentType)) THEN
  4959. Pass((operand.tag)); (* imaginary part *)
  4960. Pass((operand.op)) (* real part *)
  4961. ELSE
  4962. (* pass complex as structure in order to comply with the variable alignment of its components *)
  4963. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  4964. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,componentType)));
  4965. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4966. tmp := sp;
  4967. IntermediateCode.MakeMemory(tmp,operand.op.type);
  4968. Emit(Mov(position,tmp,operand.op)); (* real part *)
  4969. size := ToMemoryUnits(system,system.AlignedSizeOf(componentType));
  4970. IntermediateCode.AddOffset(tmp,size);
  4971. Emit(Mov(position,tmp,operand.tag)); (* imaginary part *)
  4972. END
  4973. END
  4974. ELSE
  4975. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4976. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4977. Designate(expression,operand);
  4978. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4979. (* stack allocation *)
  4980. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4981. (*! parameter alignment to be discussed ... *)
  4982. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4983. size := type(SyntaxTree.StringType).length;
  4984. END;
  4985. IF backend.cooperative & parameter.NeedsTrace() THEN
  4986. dst := NewRegisterOperand (addressType);
  4987. Emit(Mov(position,dst, sp));
  4988. IntermediateCode.InitImmediate(null, byteType, 0);
  4989. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4990. ReleaseIntermediateOperand(dst);
  4991. SaveRegisters();ReleaseUsedRegisters(saved);
  4992. (* register dst has been freed before SaveRegisters already *)
  4993. CallAssignMethod(dst, operand.op, parameter.type);
  4994. RestoreRegisters(saved);
  4995. END;
  4996. IF operand.op.type.length > 1 THEN (* vector *)
  4997. MakeMemory(tmp,sp,operand.op.type,0);
  4998. Emit(Mov(position, tmp, operand.op));
  4999. ELSE
  5000. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  5001. END;
  5002. ELSIF IsOpenArray(parameter.type) THEN
  5003. Designate(expression,operand);
  5004. baseReg := operand.tag;
  5005. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  5006. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  5007. END;
  5008. Pass((operand.op)); (* address of the array *)
  5009. ELSIF IsDelegate(parameter.type) THEN
  5010. Evaluate(expression,operand);
  5011. IF backend.cooperative & parameter.NeedsTrace() THEN
  5012. Emit(Push(position, nil));
  5013. dst := NewRegisterOperand (addressType);
  5014. Emit(Mov(position,dst, sp));
  5015. ReleaseIntermediateOperand(dst);
  5016. SaveRegisters();ReleaseUsedRegisters(saved);
  5017. Emit(Push(position, dst));
  5018. (* register dst has been freed before SaveRegisters already *)
  5019. Emit(Push(position, operand.tag));
  5020. CallThis(position,"GarbageCollector","Assign",2);
  5021. RestoreRegisters(saved);
  5022. ELSE
  5023. Pass((operand.tag));
  5024. END;
  5025. Pass((operand.op));
  5026. ELSE
  5027. Evaluate(expression,operand);
  5028. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  5029. Emit(Push(position, nil));
  5030. dst := NewRegisterOperand (addressType);
  5031. Emit(Mov(position,dst, sp));
  5032. ReleaseIntermediateOperand(dst);
  5033. SaveRegisters();ReleaseUsedRegisters(saved);
  5034. Emit(Push(position, dst));
  5035. (* register dst has been freed before SaveRegisters already *)
  5036. Emit(Push(position, operand.op));
  5037. CallThis(position,"GarbageCollector","Assign",2);
  5038. RestoreRegisters(saved);
  5039. ELSE
  5040. Pass((operand.op));
  5041. END;
  5042. END;
  5043. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  5044. Evaluate(expression,operand);
  5045. Pass((operand.op));
  5046. ELSE (* var parameter *)
  5047. Designate(expression,operand);
  5048. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5049. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  5050. Pass((operand.tag));
  5051. END;
  5052. END;
  5053. Pass((operand.op));
  5054. END;
  5055. END;
  5056. (* TODO: needed? *)
  5057. arrayDestinationTag := oldArrayDestinationTag;
  5058. arrayDestinationDimension := oldArrayDestinationDimension;
  5059. IF needsParameterBackup THEN
  5060. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5061. ReuseCopy(parameterBackup, operand.op)
  5062. END;
  5063. ReleaseOperand(operand);
  5064. IF Trace THEN TraceExit("PushParameter") END;
  5065. END PushParameter;
  5066. PROCEDURE VisitStatementDesignator*(x: SyntaxTree.StatementDesignator);
  5067. BEGIN
  5068. 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
  5069. Expression(x.result); (* use register *)
  5070. END;
  5071. Statement(x.statement);
  5072. IF x.result # NIL THEN Expression(x.result) END;
  5073. 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
  5074. ReleaseIntermediateOperand(result.op);
  5075. END;
  5076. END VisitStatementDesignator;
  5077. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  5078. VAR
  5079. procedure: SyntaxTree.Procedure;
  5080. procedureType: SyntaxTree.ProcedureType;
  5081. wasInline: BOOLEAN;
  5082. actualParameters: SyntaxTree.ExpressionList;
  5083. formalParameter: SyntaxTree.Parameter;
  5084. actualParameter: SyntaxTree.Expression;
  5085. i: LONGINT;
  5086. localVariable: SyntaxTree.Variable;
  5087. variableDesignator, returnDesignator: SyntaxTree.Expression;
  5088. src, dest: Operand;
  5089. prevInlineExit : Label;
  5090. prevMapper: SymbolMapper;
  5091. tooComplex: BOOLEAN;
  5092. resultDesignator: SyntaxTree.Expression;
  5093. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  5094. BEGIN
  5095. IF e = NIL THEN RETURN TRUE
  5096. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  5097. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  5098. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  5099. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  5100. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  5101. ELSE RETURN FALSE
  5102. END;
  5103. END SimpleExpression;
  5104. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  5105. BEGIN
  5106. RETURN checker.CanPassInRegister(type)
  5107. END FitsInRegister;
  5108. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  5109. VAR
  5110. variable: SyntaxTree.Variable;
  5111. variableDesignator: SyntaxTree.Designator;
  5112. BEGIN
  5113. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  5114. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5115. variableDesignator.SetType(type);
  5116. RETURN variableDesignator
  5117. END GetTemp;
  5118. BEGIN
  5119. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5120. wasInline := currentIsInline;
  5121. prevInlineExit := currentInlineExit;
  5122. prevMapper := currentMapper;
  5123. currentInlineExit := NewLabel();
  5124. tooComplex := FALSE;
  5125. NEW(currentMapper);
  5126. currentIsInline := TRUE;
  5127. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5128. procedureType := procedure.type(SyntaxTree.ProcedureType);
  5129. formalParameter := procedureType.firstParameter;
  5130. actualParameters := x.parameters;
  5131. i := 0;
  5132. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  5133. actualParameter := actualParameters.GetExpression(i);
  5134. IF actualParameter.resolved # NIL THEN
  5135. actualParameter := actualParameter.resolved
  5136. END;
  5137. (*
  5138. if expression is simple and can be passed immediately
  5139. or if type fits in register then we can proceed
  5140. otherwise we escape to ordinary procedure call.
  5141. *)
  5142. (* cases where the expression can be mapped identically *)
  5143. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5144. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  5145. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  5146. variableDesignator := GetTemp(formalParameter.type, TRUE);
  5147. (*
  5148. Assign(variableDesignator, actualParameter);
  5149. *)
  5150. Evaluate(actualParameter, src);
  5151. Designate(variableDesignator, dest);
  5152. Emit(Mov(x.position, dest.op, src.op));
  5153. ReleaseOperand(dest);
  5154. ReleaseOperand(src);
  5155. (* the src operand should now have been completely released ! *)
  5156. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  5157. ELSE tooComplex := TRUE
  5158. END;
  5159. (*
  5160. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  5161. currentMapper.Add(formalParameter, actualParameter, NIL);
  5162. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  5163. variableDesignator := GetTemp(system.addressType, FALSE);
  5164. Designate(actualParameter, src);
  5165. Designate(variableDesignator, dest);
  5166. IntermediateCode.MakeMemory(dest.op,addressType);
  5167. Emit(Mov(x.position, dest.op, src.op));
  5168. ReleaseOperand(dest);
  5169. IF src.tag.mode # IntermediateCode.Undefined THEN
  5170. tagDesignator := GetTemp(system.addressType, FALSE);
  5171. Designate(tagDesignator, dest);
  5172. IntermediateCode.MakeMemory(dest.op,addressType);
  5173. Emit(Mov(x.position, dest.op, src.op));
  5174. END;
  5175. ReleaseOperand(dest); ReleaseOperand(src);
  5176. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  5177. END;
  5178. *)
  5179. formalParameter := formalParameter.nextParameter;
  5180. INC(i);
  5181. END;
  5182. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  5183. IF resultDesignator # NIL THEN
  5184. returnDesignator := resultDesignator
  5185. ELSE
  5186. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  5187. END;
  5188. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  5189. END;
  5190. localVariable := procedure.procedureScope.firstVariable;
  5191. WHILE ~tooComplex & (localVariable # NIL) DO
  5192. variableDesignator := GetTemp(localVariable.type, FALSE);
  5193. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  5194. localVariable := localVariable.nextVariable;
  5195. END;
  5196. IF ~tooComplex THEN
  5197. VisitStatementBlock(procedure.procedureScope.body);
  5198. SetLabel(currentInlineExit);
  5199. IF procedureType.returnType # NIL THEN
  5200. Designate(returnDesignator, result);
  5201. END;
  5202. END;
  5203. currentMapper := prevMapper;
  5204. currentInlineExit := prevInlineExit;
  5205. currentIsInline := wasInline;
  5206. RETURN ~tooComplex
  5207. END InlineProcedureCall;
  5208. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  5209. VAR
  5210. parameters: SyntaxTree.ExpressionList;
  5211. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  5212. designator: SyntaxTree.Designator;
  5213. procedureType: SyntaxTree.ProcedureType;
  5214. formalParameter: SyntaxTree.Parameter;
  5215. operand: Operand;
  5216. reg, size, mask, dest: IntermediateCode.Operand;
  5217. saved,saved2: RegisterEntry;
  5218. symbol: SyntaxTree.Symbol;
  5219. variable: SyntaxTree.Variable;
  5220. i, parametersSize : LONGINT;
  5221. structuredReturnType: BOOLEAN;
  5222. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5223. tempVariableDesignator: SyntaxTree.Designator;
  5224. gap, alignment: LONGINT; (*fld*)
  5225. (* TODO: remove unnecessary backup variables *)
  5226. oldResult: Operand;
  5227. oldCurrentScope: SyntaxTree.Scope;
  5228. oldArrayDestinationTag: IntermediateCode.Operand;
  5229. oldArrayDestinationDimension: LONGINT;
  5230. oldConstantDeclaration: SyntaxTree.Symbol;
  5231. oldDestination: IntermediateCode.Operand;
  5232. oldCurrentLoop: Label;
  5233. oldTrueLabel, oldFalseLabel: Label;
  5234. oldLocked: BOOLEAN;
  5235. usedRegisters,oldUsedRegisters: RegisterEntry;
  5236. return: IntermediateCode.Operand;
  5237. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5238. arg: IntermediateCode.Operand;
  5239. dummy: IntermediateCode.Operand;
  5240. recordType: SyntaxTree.RecordType;
  5241. operatorSelectionProcedureOperand: Operand;
  5242. operatorSelectionProcedure: SyntaxTree.Procedure;
  5243. fingerPrint: SyntaxTree.FingerPrint;
  5244. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5245. identifierNumber: LONGINT;
  5246. parameterRegisters: SIZE;
  5247. registers: ARRAY 64 OF WORD;
  5248. procedure: SyntaxTree.Procedure;
  5249. callingConvention: SyntaxTree.CallingConvention;
  5250. type: IntermediateCode.Type;
  5251. PROCEDURE BackupGlobalState;
  5252. BEGIN
  5253. oldResult := result;
  5254. oldCurrentScope := currentScope;
  5255. oldArrayDestinationTag := arrayDestinationTag;
  5256. oldArrayDestinationDimension := arrayDestinationDimension;
  5257. oldConstantDeclaration := constantDeclaration;
  5258. oldDestination := destination;
  5259. oldCurrentLoop := currentLoop;
  5260. oldTrueLabel := trueLabel;
  5261. oldFalseLabel := falseLabel;
  5262. oldLocked := locked;
  5263. oldUsedRegisters := usedRegisters
  5264. END BackupGlobalState;
  5265. PROCEDURE RestoreGlobalState;
  5266. BEGIN
  5267. result := oldResult;
  5268. currentScope := oldCurrentScope;
  5269. arrayDestinationTag := oldArrayDestinationTag;
  5270. arrayDestinationDimension := oldArrayDestinationDimension;
  5271. constantDeclaration := oldConstantDeclaration;
  5272. destination := oldDestination;
  5273. currentLoop := oldCurrentLoop;
  5274. trueLabel := oldTrueLabel;
  5275. falseLabel := oldFalseLabel;
  5276. locked := oldLocked;
  5277. usedRegisters := oldUsedRegisters
  5278. END RestoreGlobalState;
  5279. (** do preparations before parameter push for array-structured object types (ASOTs):
  5280. if ASOT is passed as VAR parameter:
  5281. - allocate temporary variable of math array type
  5282. - copy contents of ASOT to be passed to temporary variable
  5283. - use temporary variable as the actual parameter instead
  5284. - 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)
  5285. **)
  5286. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5287. VAR
  5288. expression: SyntaxTree.Expression;
  5289. BEGIN
  5290. IF actualParameter IS SyntaxTree.Designator THEN
  5291. designator := actualParameter(SyntaxTree.Designator);
  5292. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5293. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5294. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5295. ASSERT(checker # NIL);
  5296. checker.SetCurrentScope(currentScope);
  5297. (* allocate temporary variable *)
  5298. ASSERT(actualParameter.type # NIL);
  5299. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5300. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5301. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5302. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5303. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5304. ASSERT(tempVariableDesignator.type # NIL);
  5305. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5306. (* copy math array stored in actual parameter to temporary variable *)
  5307. BackupGlobalState;
  5308. AssignMathArray(tempVariableDesignator, actualParameter);
  5309. RestoreGlobalState;
  5310. (* use temporary variable as actual parameter instead of the original one *)
  5311. actualParameter := tempVariableDesignator;
  5312. (* create write-back call and store it in linked list *)
  5313. (* create new list entry *)
  5314. IF firstWriteBackCall = NIL THEN
  5315. NEW(firstWriteBackCall);
  5316. currentWriteBackCall := firstWriteBackCall
  5317. ELSE
  5318. ASSERT(currentWriteBackCall # NIL);
  5319. NEW(currentWriteBackCall.next);
  5320. currentWriteBackCall := currentWriteBackCall.next
  5321. END;
  5322. expression := checker.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5323. ASSERT(expression.type = NIL);
  5324. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5325. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5326. (* prepare writeback for any other "normal" indexer *)
  5327. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5328. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5329. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5330. Assign(tempVariableDesignator, actualParameter);
  5331. actualParameter := tempVariableDesignator;
  5332. IF firstWriteBackCall = NIL THEN
  5333. NEW(firstWriteBackCall);
  5334. currentWriteBackCall := firstWriteBackCall
  5335. ELSE
  5336. ASSERT(currentWriteBackCall # NIL);
  5337. NEW(currentWriteBackCall.next);
  5338. currentWriteBackCall := currentWriteBackCall.next
  5339. END;
  5340. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5341. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5342. END
  5343. END
  5344. END PrepareParameter;
  5345. BEGIN
  5346. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5347. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5348. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5349. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5350. IF InlineProcedureCall(x) THEN
  5351. RETURN
  5352. ELSE
  5353. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5354. END
  5355. END;
  5356. END;
  5357. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5358. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5359. callingConvention := procedureType.callingConvention;
  5360. dest := destination; destination := emptyOperand;
  5361. SaveRegisters();ReleaseUsedRegisters(saved);
  5362. parameters := x.parameters;
  5363. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5364. (* an operator is called *)
  5365. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5366. ASSERT(callingConvention = SyntaxTree.OberonCallingConvention);
  5367. (* check if a dynamic operator call should be performed *)
  5368. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5369. ELSE
  5370. isCallOfDynamicOperator := FALSE
  5371. END;
  5372. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5373. Emit(Push(position, ap));
  5374. END;
  5375. alignment := procedureType.stackAlignment;
  5376. IF (callingConvention IN SysvABIorWINAPI) & (system.addressSize = 64) THEN
  5377. alignment := 16 (* bytes *);
  5378. END;
  5379. IF alignment > 1 THEN
  5380. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5381. Emit(Mov(position,reg, sp));
  5382. gap := ParametersSize(system, procedureType,FALSE); (* account for all parameters being pushed *)
  5383. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5384. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN (* in WINAPI 64bit there is at least space for four registers on the stack *)
  5385. gap := 4*ToMemoryUnits(system,system.addressSize);
  5386. END;
  5387. ELSIF (callingConvention IN SysvABI) & (system.addressSize =64) THEN
  5388. backend.ResetParameterRegisters();
  5389. formalParameter := procedureType.firstParameter;
  5390. FOR i := 0 TO parameters.Length()-1 DO
  5391. IF (formalParameter.kind = SyntaxTree.VarParameter) THEN
  5392. type := addressType;
  5393. ELSIF formalParameter.type.IsRecordType() OR (formalParameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5394. type := addressType;
  5395. ELSE
  5396. type := GetType(system, formalParameter.type);
  5397. END;
  5398. IF backend.GetParameterRegister(callingConvention, type, registers[i]) THEN
  5399. DEC (gap, ToMemoryUnits(system,system.addressSize))
  5400. END;
  5401. formalParameter := formalParameter.nextParameter;
  5402. END;
  5403. IF gap < 0 THEN
  5404. gap := 0
  5405. END;
  5406. ELSE
  5407. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) (* Oberon CC: alignment at the BP in the stack frame *)
  5408. END;
  5409. gap := gap + ToMemoryUnits(system,system.addressSize); (* account for the additionally pushed stack pointer in any case *)
  5410. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5411. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5412. Emit(And(position,sp, sp, mask));
  5413. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5414. Emit(Push(position,reg));
  5415. ReleaseIntermediateOperand(reg);
  5416. END;
  5417. IF (callingConvention IN SysvABI) & (system.addressSize = 32) THEN
  5418. (* align stack to 16-byte boundary *)
  5419. IntermediateCode.InitImmediate(mask,addressType,-16);
  5420. Emit(And(position,sp, sp, mask));
  5421. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5422. IF gap # 0 THEN
  5423. IntermediateCode.InitImmediate(size,addressType,gap);
  5424. Emit(Sub(position,sp,sp,size))
  5425. END;
  5426. END;
  5427. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5428. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5429. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5430. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5431. ELSE
  5432. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5433. END;
  5434. Evaluate(x.left, operand);
  5435. IF symbol IS SyntaxTree.Procedure THEN
  5436. IF (procedureType.selfParameter # NIL) THEN
  5437. Emit(Push(position,operand.tag));
  5438. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5439. Emit(Push(position,operand.tag));
  5440. ELSIF (procedureType.isDelegate) THEN
  5441. Emit(Push(position,operand.tag));
  5442. END;
  5443. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5444. IF (procedureType.selfParameter # NIL) THEN
  5445. Emit(Push(position,operand.tag));
  5446. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5447. Emit(Push(position,operand.tag));
  5448. END;
  5449. ELSE HALT(200);
  5450. END;
  5451. ReleaseIntermediateOperand(operand.tag);
  5452. operand.tag := emptyOperand;
  5453. (* determine if a structured return type is needed *)
  5454. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5455. IF structuredReturnType THEN
  5456. IF resultDesignator # NIL THEN
  5457. d := resultDesignator;
  5458. ELSE
  5459. (* temporary result that might be allocated, must potentially be traced *)
  5460. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5461. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5462. d.SetType(variable.type);
  5463. END;
  5464. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5465. Designate(d,returnValue);
  5466. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5467. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5468. Emit(Push(position,size));
  5469. Emit(Push(position,returnValue.op));
  5470. ReleaseOperand(returnValue);
  5471. ELSE*)
  5472. PushParameter(d,procedureType.returnParameter,callingConvention, FALSE, dummy,-1)
  5473. (*
  5474. END;
  5475. *)
  5476. END;
  5477. firstWriteBackCall := NIL; (* reset write-back call list *)
  5478. IF callingConvention # SyntaxTree.OberonCallingConvention THEN
  5479. parameterRegisters := 0;
  5480. backend.ResetParameterRegisters();
  5481. formalParameter := procedureType.firstParameter;
  5482. FOR i := 0 TO parameters.Length()-1 DO
  5483. IF (formalParameter.kind = SyntaxTree.VarParameter) THEN
  5484. type := addressType;
  5485. ELSIF formalParameter.type.IsRecordType() OR (formalParameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5486. type := addressType;
  5487. ELSE
  5488. type := GetType(system, formalParameter.type);
  5489. END;
  5490. IF backend.GetParameterRegister(callingConvention, type, registers[i]) THEN
  5491. INC(parameterRegisters);
  5492. IF ~PassInRegister(formalParameter,callingConvention) THEN
  5493. Error(actualParameter.position,"cannot be passed by register")
  5494. END;
  5495. ELSE
  5496. registers[i] := -1;
  5497. END;
  5498. formalParameter := formalParameter.nextParameter;
  5499. END;
  5500. formalParameter := procedureType.lastParameter;
  5501. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5502. actualParameter := parameters.GetExpression(i);
  5503. PrepareParameter(actualParameter, formalParameter);
  5504. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy, registers[i]);
  5505. formalParameter := formalParameter.prevParameter;
  5506. END;
  5507. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5508. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5509. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,32)));
  5510. END;
  5511. ELSE
  5512. hasDynamicOperands := FALSE;
  5513. formalParameter := procedureType.firstParameter;
  5514. FOR i := 0 TO parameters.Length() - 1 DO
  5515. actualParameter := parameters.GetExpression(i);
  5516. IF formalParameter # NIL THEN (* TENTATIVE *)
  5517. PrepareParameter(actualParameter, formalParameter);
  5518. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5519. ASSERT(i < 2);
  5520. hasDynamicOperands := TRUE;
  5521. PushParameter(actualParameter, formalParameter, callingConvention, TRUE, parameterBackups[i],-1)
  5522. ELSE
  5523. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5524. END;
  5525. formalParameter := formalParameter.nextParameter;
  5526. END;
  5527. END;
  5528. END;
  5529. IF symbol IS SyntaxTree.Procedure THEN
  5530. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5531. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5532. Emit(Push(position,reg));
  5533. ReleaseIntermediateOperand(reg);
  5534. END;
  5535. parametersSize := ProcParametersSize(symbol(SyntaxTree.Procedure));
  5536. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5537. parametersSize := ParametersSize(system,procedureType, FALSE);
  5538. END;
  5539. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5540. (*
  5541. dynamic operator overloading:
  5542. first push parameters, regularly:
  5543. [self]
  5544. par1
  5545. par2
  5546. then push parameters for GetOperator
  5547. identifier
  5548. ptr1
  5549. tag
  5550. ptr2
  5551. tag
  5552. call GetOperatorRuntimeProc
  5553. call Operator
  5554. *)
  5555. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5556. (* push ID *)
  5557. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5558. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5559. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5560. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5561. formalParameter := procedureType.firstParameter;
  5562. FOR i := 0 TO parameters.Length() - 1 DO
  5563. IF formalParameter.access # SyntaxTree.Hidden THEN
  5564. ASSERT(i < 2);
  5565. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5566. (* push pointer *)
  5567. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5568. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5569. (* add dereference *)
  5570. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5571. (*! better: do refer to stack above than using parameter backups !!*)
  5572. ReleaseIntermediateOperand(parameterBackups[i]);
  5573. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5574. END;
  5575. Emit(Push(position,parameterBackups[i]));
  5576. ReleaseIntermediateOperand(parameterBackups[i]);
  5577. (* push typetag *)
  5578. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5579. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5580. arg := TypeDescriptorAdr(recordType);
  5581. Emit(Push(position,arg));
  5582. ELSE
  5583. (* push 'NonPointer' *)
  5584. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5585. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5586. (* push fingerprint *)
  5587. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5588. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5589. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5590. END
  5591. END;
  5592. formalParameter := formalParameter.nextParameter
  5593. END;
  5594. (* for unary operators: complete the information for the second parameter *)
  5595. IF procedureType.numberParameters < 2 THEN
  5596. (* push 'NonPointer' *)
  5597. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5598. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5599. (* push 'NoType' *)
  5600. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5601. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5602. END;
  5603. (* call operator selection procedure *)
  5604. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5605. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5606. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcParametersSize( operatorSelectionProcedure)));
  5607. ReleaseOperand(operatorSelectionProcedureOperand);
  5608. (* use the address that the operator selection procedure returned as the target address of the call *)
  5609. InitOperand(operand, ModeValue);
  5610. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5611. Emit(Result(position,operand.op))
  5612. END
  5613. END;
  5614. ReleaseParameterRegisters();
  5615. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5616. SaveRegisters();ReleaseUsedRegisters(saved2);
  5617. CallThis(position,"Objects","LeaveA2",0);
  5618. RestoreRegisters(saved2);
  5619. END;
  5620. IF (callingConvention = SyntaxTree.WinAPICallingConvention) OR (callingConvention IN SysvABI) THEN
  5621. Emit(Call(position,operand.op,0));
  5622. ELSE
  5623. Emit(Call(position,operand.op,parametersSize));
  5624. END;
  5625. ReleaseOperand(operand);
  5626. IF procedureType.noReturn THEN
  5627. EmitTrap(position,NoReturnTrap);
  5628. END;
  5629. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5630. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5631. Emit(Result(position,return));
  5632. END;
  5633. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5634. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5635. Emit(Push(position, return));
  5636. CallThis(position,"Objects","ReenterA2",0);
  5637. Emit(Pop(position, return));
  5638. ELSE
  5639. CallThis(position,"Objects","ReenterA2",0);
  5640. END;
  5641. END;
  5642. (* === return parameter space === *)
  5643. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5644. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5645. (* cleanup all space for all parameters *)
  5646. IF parametersSize < 32 THEN
  5647. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5648. parametersSize := 32
  5649. END;
  5650. size := IntermediateCode.Immediate(addressType,parametersSize);
  5651. Emit(Add(position,sp,sp,size))
  5652. END;
  5653. IF (callingConvention IN SysvABI) THEN
  5654. IF parameterRegisters > 0 THEN
  5655. IF parameters.Length() > parameterRegisters THEN
  5656. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5657. ELSE
  5658. parametersSize := 0
  5659. END;
  5660. ELSE
  5661. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5662. INC( parametersSize, (-parametersSize) MOD 16 )
  5663. END;
  5664. IF parametersSize > 0 THEN
  5665. size := IntermediateCode.Immediate(addressType,parametersSize);
  5666. Emit(Add(position,sp,sp,size))
  5667. END;
  5668. END;
  5669. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5670. IF structuredReturnType THEN
  5671. (* stack pointer rewinding done by callee
  5672. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5673. Emit(Add(position,sp,sp,size));
  5674. *)
  5675. RestoreRegisters(saved);
  5676. InitOperand(result,ModeReference);
  5677. Symbol(variable,result);
  5678. ELSE
  5679. RestoreRegisters(saved);
  5680. InitOperand(result,ModeValue);
  5681. result.op := return;
  5682. END;
  5683. END;
  5684. IF alignment > 1 THEN
  5685. Emit(Pop(position,sp));
  5686. END;
  5687. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5688. Emit(Pop(position, ap));
  5689. END;
  5690. destination := dest;
  5691. (* perform all write-back calls in the list *)
  5692. BackupGlobalState;
  5693. currentWriteBackCall := firstWriteBackCall;
  5694. WHILE currentWriteBackCall # NIL DO
  5695. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5696. currentWriteBackCall := currentWriteBackCall.next
  5697. END;
  5698. RestoreGlobalState;
  5699. (* TENATIVE *)
  5700. (*
  5701. IF isOperatorCall THEN
  5702. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5703. END;
  5704. *)
  5705. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5706. END VisitProcedureCallDesignator;
  5707. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5708. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5709. td: SyntaxTree.Symbol;
  5710. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5711. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5712. BEGIN
  5713. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5714. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5715. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5716. variable.SetType(system.anyType);
  5717. scope.AddVariable(variable);
  5718. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5719. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5720. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5721. typeDeclaration.SetScope(module.module.moduleScope);
  5722. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5723. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5724. END;
  5725. RETURN hiddenPointerType;
  5726. END GetHiddenPointerType;
  5727. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5728. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5729. BEGIN
  5730. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5731. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5732. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5733. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5734. scope.AddVariable(variable);
  5735. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5736. variable.SetType(system.anyType);
  5737. scope.AddVariable(variable);
  5738. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5739. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5740. typeDeclaration.SetDeclaredType(delegatePointerType);
  5741. typeDeclaration.SetScope(module.module.moduleScope);
  5742. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5743. delegatePointerType.SetState(SyntaxTree.Resolved);
  5744. END;
  5745. RETURN delegatePointerType
  5746. END GetDelegateType;
  5747. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5748. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5749. such as in VAR a: RECORD ... END;
  5750. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5751. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5752. *)
  5753. VAR source: Sections.Section;td: SyntaxTree.TypeDeclaration;
  5754. baseRecord: SyntaxTree.RecordType;
  5755. BEGIN (* no code emission *)
  5756. source := NIL;
  5757. x := x.resolved;
  5758. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5759. x := GetHiddenPointerType();
  5760. ELSIF IsDelegate(x) THEN
  5761. x := GetDelegateType();
  5762. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5763. ELSE HALT(200);
  5764. END;
  5765. td := x.typeDeclaration;
  5766. IF td = NIL THEN
  5767. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5768. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5769. ASSERT(td # NIL);
  5770. END;
  5771. GetCodeSectionNameForSymbol(td,name);
  5772. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5773. meta.CheckTypeDeclaration(x);
  5774. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5775. ELSE
  5776. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5777. END;
  5778. IF backend.cooperative OR meta.simple THEN
  5779. offset := 0;
  5780. ELSE
  5781. IF x IS SyntaxTree.CellType THEN
  5782. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5783. IF baseRecord = NIL THEN
  5784. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5785. ELSE
  5786. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5787. END;
  5788. ELSE
  5789. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5790. END;
  5791. END;
  5792. RETURN td
  5793. END GetBackendType;
  5794. BEGIN
  5795. (*td := t.typeDeclaration;*)
  5796. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5797. (*
  5798. IF t IS SyntaxTree.PointerType THEN
  5799. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5800. ELSE
  5801. source := GetBackendType(t);
  5802. END;
  5803. *)
  5804. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5805. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5806. IntermediateCode.SetOffset(res,offset);
  5807. (*
  5808. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5809. make memory should be used when tag is used, not earlier
  5810. *)
  5811. RETURN res
  5812. END TypeDescriptorAdr;
  5813. (*
  5814. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5815. VAR result: IntermediateCode.Operand;
  5816. BEGIN
  5817. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5818. operand.tag := TypeDescriptorAdr(operand.type);
  5819. IntermediateCode.MakeMemory(operand.tag,addressType);
  5820. UseIntermediateOperand(operand.tag);
  5821. END;
  5822. END MakeTypeTag;
  5823. *)
  5824. PROCEDURE ProfilerInit;
  5825. VAR reg: IntermediateCode.Operand;
  5826. BEGIN
  5827. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5828. Emit(Call(position,reg,0));
  5829. END ProfilerInit;
  5830. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5831. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5832. BEGIN
  5833. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5834. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5835. THEN
  5836. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5837. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5838. Emit(Push(position,reg));
  5839. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5840. Emit(Push(position,reg));
  5841. StaticCallOperand(result,procedure);
  5842. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5843. ReleaseOperand(result);
  5844. END;
  5845. END ProfilerEnterExit;
  5846. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5847. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5848. BEGIN
  5849. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5850. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5851. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5852. profileInit.Emit(Push(position,reg));
  5853. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5854. profileInit.Emit(Push(position,reg));
  5855. NEW(string, LEN(name)); COPY(name, string^);
  5856. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5857. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5858. sv.SetType(type);
  5859. Designate(sv,result);
  5860. profileInit.Emit(Push(position,result.tag));
  5861. profileInit.Emit(Push(position,result.op));
  5862. StaticCallOperand(result,procedure);
  5863. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5864. ReleaseOperand(result);
  5865. END;
  5866. END ProfilerAddProcedure;
  5867. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5868. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5869. BEGIN
  5870. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5871. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5872. profileInit.Emit(Push(position,reg));
  5873. profileInitPatchPosition := profileInit.pc;
  5874. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5875. NEW(string, LEN(name)); COPY(name, string^);
  5876. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5877. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5878. sv.SetType(type);
  5879. Designate(sv,result);
  5880. profileInit.Emit(Push(position,result.tag));
  5881. profileInit.Emit(Push(position,result.op));
  5882. StaticCallOperand(result,procedure);
  5883. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5884. ReleaseOperand(result);
  5885. END;
  5886. END ProfilerAddModule;
  5887. PROCEDURE ProfilerPatchInit;
  5888. VAR reg: IntermediateCode.Operand;
  5889. BEGIN
  5890. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5891. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5892. EmitLeave(profileInit,position,NIL,0);
  5893. profileInit.Emit(Exit(position,0,0,0));
  5894. END ProfilerPatchInit;
  5895. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5896. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5897. VAR
  5898. id: LONGINT;
  5899. leftType, rightType: SyntaxTree.Type;
  5900. procedureType: SyntaxTree.ProcedureType;
  5901. runtimeProcedure: SyntaxTree.Procedure;
  5902. runtimeProcedureOperand, operatorOperand: Operand;
  5903. kind: SET;
  5904. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5905. VAR
  5906. arg: IntermediateCode.Operand;
  5907. recordType: SyntaxTree.RecordType;
  5908. fingerPrint: SyntaxTree.FingerPrint;
  5909. BEGIN
  5910. IF type = NIL THEN
  5911. (* no type: push 'NoType' *)
  5912. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5913. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5914. ELSIF IsStrictlyPointerToRecord(type) THEN
  5915. (* pointer to record type: push typetag *)
  5916. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5917. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5918. arg := TypeDescriptorAdr(recordType);
  5919. ELSE
  5920. (* non-pointer to record type: push fingerprint *)
  5921. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5922. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5923. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5924. END;
  5925. operatorInitializationCodeSection.Emit(Push(position,arg))
  5926. END PushTypeInfo;
  5927. BEGIN
  5928. ASSERT(operatorInitializationCodeSection # NIL);
  5929. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5930. procedureType := operator.type(SyntaxTree.ProcedureType);
  5931. (* determine types *)
  5932. leftType := procedureType.firstParameter.type;
  5933. IF procedureType.numberParameters = 2 THEN
  5934. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5935. rightType := procedureType.firstParameter.nextParameter.type;
  5936. ELSE
  5937. rightType := NIL
  5938. END;
  5939. (* determine operator kind *)
  5940. IF IsStrictlyPointerToRecord(leftType) THEN
  5941. kind := {LhsIsPointer}
  5942. ELSE
  5943. kind := {}
  5944. END;
  5945. IF IsStrictlyPointerToRecord(rightType) THEN
  5946. kind := kind + {RhsIsPointer}
  5947. END;
  5948. IF kind # {} THEN (* TODO: to be removed later on *)
  5949. (* at least one of the types is a pointer to record *)
  5950. (* emit a code that registers this specific operator in the runtime *)
  5951. dump := operatorInitializationCodeSection.comments;
  5952. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5953. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5954. (* push ID *)
  5955. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5956. id := Global.GetSymbol(module.module.case, operator.name);
  5957. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5958. (* push kind *)
  5959. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5960. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5961. (* push type infos *)
  5962. PushTypeInfo(leftType);
  5963. PushTypeInfo(rightType);
  5964. (* push operator address *)
  5965. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5966. StaticCallOperand(operatorOperand, operator);
  5967. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5968. ReleaseOperand(operatorOperand);
  5969. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5970. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcParametersSize( runtimeProcedure)));
  5971. ReleaseOperand(runtimeProcedureOperand)
  5972. END
  5973. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5974. END
  5975. END RegisterDynamicOperator;
  5976. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5977. VAR
  5978. traceModule: SyntaxTree.Module;
  5979. procedure: SyntaxTree.Procedure;
  5980. procedureVariable: SyntaxTree.Variable;
  5981. s,msg: Basic.MessageString;
  5982. res: Operand;
  5983. i: LONGINT;
  5984. sv: SyntaxTree.StringValue;
  5985. type: SyntaxTree.Type;
  5986. recordType: SyntaxTree.RecordType;
  5987. printout: Printout.Printer;
  5988. stringWriter: Streams.StringWriter;
  5989. expression: SyntaxTree.Expression;
  5990. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5991. BEGIN
  5992. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5993. IF procedure = NIL THEN
  5994. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5995. END;
  5996. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5997. s := "procedure ";
  5998. Strings.Append(s,backend.traceModuleName);
  5999. Strings.Append(s,".");
  6000. Strings.Append(s,procedureName);
  6001. Strings.Append(s," not present");
  6002. Error(position,s);
  6003. RETURN FALSE
  6004. ELSE
  6005. RETURN TRUE
  6006. END;
  6007. END GetProcedure;
  6008. PROCEDURE CallProcedure;
  6009. VAR size: LONGINT;
  6010. BEGIN
  6011. IF procedure # NIL THEN
  6012. StaticCallOperand(result,procedure);
  6013. size := ProcParametersSize(procedure);
  6014. ELSE
  6015. Symbol(procedureVariable, result);
  6016. LoadValue(result, procedureVariable.type.resolved);
  6017. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  6018. END;
  6019. Emit(Call(position,result.op,size));
  6020. END CallProcedure;
  6021. PROCEDURE String(CONST s: ARRAY OF CHAR);
  6022. VAR res: Operand; string: SyntaxTree.String;
  6023. BEGIN
  6024. IF GetProcedure("String") THEN
  6025. NEW(string, LEN(s)); COPY(s, string^);
  6026. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6027. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6028. sv.SetType(type);
  6029. Designate(sv,res);
  6030. Emit(Push(position,res.tag));
  6031. Emit(Push(position,res.op));
  6032. ReleaseOperand(res);
  6033. CallProcedure;
  6034. END;
  6035. END String;
  6036. PROCEDURE Integer(op: IntermediateCode.Operand);
  6037. BEGIN
  6038. IF GetProcedure("Int") THEN
  6039. Emit(Push(position,op));
  6040. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  6041. CallProcedure;
  6042. END;
  6043. END Integer;
  6044. PROCEDURE Float(op: IntermediateCode.Operand);
  6045. BEGIN
  6046. IF GetProcedure("HIntHex") THEN
  6047. Emit(Push(position,op));
  6048. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  6049. CallProcedure;
  6050. END;
  6051. END Float;
  6052. PROCEDURE Set(op: IntermediateCode.Operand);
  6053. BEGIN
  6054. IF GetProcedure("Set") THEN
  6055. Emit(Push(position,op));
  6056. (*
  6057. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  6058. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  6059. *)
  6060. CallProcedure;
  6061. END;
  6062. END Set;
  6063. PROCEDURE Boolean(op: IntermediateCode.Operand);
  6064. BEGIN
  6065. IF GetProcedure("Boolean") THEN
  6066. Emit(Push(position,op));
  6067. CallProcedure;
  6068. END;
  6069. END Boolean;
  6070. PROCEDURE Char(op: IntermediateCode.Operand);
  6071. BEGIN
  6072. IF GetProcedure("Char") THEN
  6073. Emit(Push(position,op));
  6074. CallProcedure;
  6075. END;
  6076. END Char;
  6077. PROCEDURE Address(op: IntermediateCode.Operand);
  6078. BEGIN
  6079. IF GetProcedure("Address") THEN
  6080. Emit(Push(position,op));
  6081. CallProcedure;
  6082. END;
  6083. END Address;
  6084. PROCEDURE Size(op: IntermediateCode.Operand);
  6085. BEGIN
  6086. IF GetProcedure("Size") THEN
  6087. Emit(Push(position,op));
  6088. CallProcedure;
  6089. END;
  6090. END Size;
  6091. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  6092. VAR len: IntermediateCode.Operand;
  6093. BEGIN
  6094. IF GetProcedure("String") THEN
  6095. len := GetArrayLength(type, op.tag);
  6096. Emit(Push(position,len));
  6097. ReleaseIntermediateOperand(len);
  6098. Emit(Push(position,op.op));
  6099. CallProcedure;
  6100. END;
  6101. END StringOperand;
  6102. PROCEDURE Ln;
  6103. BEGIN
  6104. IF GetProcedure("Ln") THEN
  6105. CallProcedure;
  6106. END;
  6107. END Ln;
  6108. BEGIN
  6109. IF backend.traceModuleName = "" THEN RETURN END;
  6110. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  6111. IF GetProcedure("Enter") THEN
  6112. CallProcedure
  6113. END;
  6114. NEW(stringWriter,LEN(s));
  6115. FOR i := 0 TO x.Length()-1 DO
  6116. msg := "";
  6117. expression := x.GetExpression(i);
  6118. IF currentScope IS SyntaxTree.ProcedureScope THEN
  6119. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  6120. ELSE
  6121. Global.GetModuleName(module.module, s);
  6122. END;
  6123. IF i = 0 THEN
  6124. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  6125. stringWriter.String(":");
  6126. END;
  6127. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  6128. IF ~(expression IS SyntaxTree.StringValue) THEN
  6129. printout.Expression(expression);
  6130. stringWriter.Get(s);
  6131. Strings.Append(msg,s);
  6132. Strings.Append(msg,"= ");
  6133. ELSE stringWriter.Get(s); (* remove from string writer *)
  6134. Strings.Append(msg, s);
  6135. END;
  6136. String(msg);
  6137. IF SemanticChecker.IsStringType(expression.type) THEN
  6138. Designate(expression,res);
  6139. StringOperand(res, expression.type);
  6140. ELSE
  6141. Evaluate(expression,res);
  6142. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  6143. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  6144. Convert(res.op,int64);
  6145. END;
  6146. Integer(res.op);
  6147. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  6148. Boolean(res.op);
  6149. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  6150. Set(res.op);
  6151. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  6152. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  6153. Convert(res.op,float64);
  6154. END;
  6155. Float(res.op);
  6156. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  6157. Char(res.op);
  6158. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  6159. Address(res.op);String("H");
  6160. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  6161. Size(res.op);
  6162. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  6163. Address(res.op);String("H");
  6164. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  6165. Address(res.op);String("H");
  6166. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  6167. String("NIL");
  6168. ELSE HALT(200);
  6169. END;
  6170. END;
  6171. ReleaseOperand(res);
  6172. String("; ");
  6173. END;
  6174. IF GetProcedure("Exit") THEN
  6175. CallProcedure
  6176. ELSE
  6177. Ln;
  6178. END;
  6179. END;
  6180. END SystemTrace;
  6181. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  6182. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  6183. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  6184. BEGIN
  6185. type := type.resolved;
  6186. IF type IS SyntaxTree.RecordType THEN
  6187. WITH type: SyntaxTree.RecordType DO
  6188. baseType := type.baseType;
  6189. IF baseType # NIL THEN
  6190. baseType := baseType.resolved;
  6191. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6192. InitFields(baseType,adr,offset);
  6193. END;
  6194. variable := type.recordScope.firstVariable;
  6195. WHILE variable # NIL DO
  6196. IF variable.initializer # NIL THEN
  6197. Evaluate(variable.initializer,initializerOp);
  6198. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6199. Emit(Mov(position,mem,initializerOp.op));
  6200. ReleaseOperand(initializerOp);
  6201. ReleaseIntermediateOperand(mem);
  6202. END;
  6203. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6204. variable := variable.nextVariable
  6205. END;
  6206. END;
  6207. ELSIF type IS SyntaxTree.CellType THEN
  6208. WITH type: SyntaxTree.CellType DO
  6209. baseType := type.baseType;
  6210. IF baseType # NIL THEN
  6211. baseType := baseType.resolved;
  6212. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6213. InitFields(baseType,adr,offset);
  6214. END;
  6215. variable := type.cellScope.firstVariable;
  6216. WHILE variable # NIL DO
  6217. IF variable.initializer # NIL THEN
  6218. Evaluate(variable.initializer,initializerOp);
  6219. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6220. Emit(Mov(position,mem,initializerOp.op));
  6221. ReleaseOperand(initializerOp);
  6222. ReleaseIntermediateOperand(mem);
  6223. END;
  6224. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6225. variable := variable.nextVariable
  6226. END;
  6227. END;
  6228. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6229. WITH type: SyntaxTree.ArrayType DO
  6230. IF type.form = SyntaxTree.Static THEN
  6231. baseType := type.arrayBase;
  6232. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6233. FOR i := 0 TO type.staticLength-1 DO
  6234. InitFields(baseType,adr,offset+i*size);
  6235. END;
  6236. END;
  6237. END;
  6238. ELSIF type IS SyntaxTree.MathArrayType THEN
  6239. WITH type: SyntaxTree.MathArrayType DO
  6240. IF type.form = SyntaxTree.Open THEN
  6241. dim := DynamicDim(type);
  6242. imm := IntermediateCode.Immediate(addressType,dim);
  6243. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6244. baseType := SemanticChecker.ArrayBase(type,dim);
  6245. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6246. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6247. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6248. ReleaseIntermediateOperand(imm);
  6249. (* flags remain empty (=0) for open array *)
  6250. ELSIF type.form = SyntaxTree.Static THEN
  6251. baseType := type.arrayBase;
  6252. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6253. ASSERT(type.staticLength < 1024*1024*1024);
  6254. FOR i := 0 TO type.staticLength-1 DO
  6255. InitFields(baseType,adr,offset+i*size);
  6256. END;
  6257. END;
  6258. END;
  6259. END;
  6260. END InitFields;
  6261. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6262. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6263. saved: RegisterEntry;
  6264. BEGIN
  6265. type := variable.type.resolved;
  6266. IF (type IS SyntaxTree.MathArrayType) THEN
  6267. WITH type: SyntaxTree.MathArrayType DO
  6268. IF type.form = SyntaxTree.Open THEN
  6269. Symbol(variable,operand);
  6270. InitFields(type, operand.tag,0);
  6271. IF temporary THEN
  6272. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6273. END;
  6274. ELSIF type.form = SyntaxTree.Tensor THEN
  6275. IF temporary & backend.writeBarriers THEN
  6276. SaveRegisters();ReleaseUsedRegisters(saved);
  6277. Symbol(variable, operand);
  6278. Emit(Push(position,operand.op));
  6279. ReleaseOperand(operand);
  6280. Emit(Push(position,nil));
  6281. CallThis(position,"FoxArrayBase","Assign",2);
  6282. RestoreRegisters(saved);
  6283. ELSE
  6284. Symbol(variable, operand);
  6285. MakeMemory(tmp,operand.op,addressType,0);
  6286. ReleaseOperand(operand);
  6287. IF FALSE & temporary THEN
  6288. (* trick -- temporary object from array base *)
  6289. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6290. Symbol(symbol,operand);
  6291. MakeMemory(mem,operand.op,addressType,0);
  6292. ReleaseOperand(operand);
  6293. Emit(Mov(position,tmp, mem) );
  6294. ReleaseOperand(operand);
  6295. ELSE
  6296. Emit(Mov(position,tmp, nil ) );
  6297. END;
  6298. ReleaseIntermediateOperand(tmp)
  6299. END;
  6300. END;
  6301. END;
  6302. ELSE
  6303. Symbol(variable,operand);
  6304. IF variable.initializer # NIL THEN
  6305. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6306. reference.SetType(variable.type.resolved);
  6307. reference.SetAssignable(TRUE);
  6308. Assign(reference,variable.initializer);
  6309. ELSIF temporary THEN
  6310. IF SemanticChecker.IsPointerType(variable.type) THEN
  6311. IF backend.cooperative THEN
  6312. SaveRegisters();ReleaseUsedRegisters(saved);
  6313. Symbol(variable, operand);
  6314. CallAssignPointer(operand.op, nil);
  6315. ReleaseOperand(operand);
  6316. RestoreRegisters(saved);
  6317. ELSIF backend.writeBarriers THEN
  6318. SaveRegisters();ReleaseUsedRegisters(saved);
  6319. Symbol(variable, operand);
  6320. Emit(Push(position,operand.op));
  6321. ReleaseOperand(operand);
  6322. Emit(Push(position,nil));
  6323. CallThis(position,"Heaps","Assign",2);
  6324. RestoreRegisters(saved);
  6325. ELSE
  6326. Symbol(variable, operand);
  6327. MakeMemory(tmp,operand.op,addressType,0);
  6328. ReleaseOperand(operand);
  6329. Emit(Mov(position,tmp, nil ) );
  6330. ReleaseIntermediateOperand(tmp);
  6331. END;
  6332. END;
  6333. END;
  6334. InitFields(type, operand.op,0);
  6335. ReleaseOperand(operand);
  6336. END;
  6337. END InitVariable;
  6338. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6339. VAR end: Label;
  6340. BEGIN
  6341. IF type.form = SyntaxTree.Tensor THEN
  6342. InitOperand(result,ModeValue);
  6343. ReuseCopy(result.op,base);
  6344. end := NewLabel();
  6345. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6346. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6347. SetLabel(end);
  6348. Convert(result.op,lenType);
  6349. ELSE
  6350. InitOperand(result,ModeValue);
  6351. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6352. END
  6353. END MathArrayDim;
  6354. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6355. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6356. BEGIN
  6357. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6358. MakeMemory(mem,base,addressType,offset);
  6359. Emit(Mov(position,mem,value));
  6360. ReleaseIntermediateOperand(mem);
  6361. END PutMathArrayField;
  6362. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6363. VAR mem: IntermediateCode.Operand;
  6364. BEGIN
  6365. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6366. MakeMemory(mem,base,addressType,offset);
  6367. Emit(Mov(position,mem,value));
  6368. ReleaseIntermediateOperand(mem);
  6369. END PutMathArrayFieldOffset;
  6370. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6371. BEGIN
  6372. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6373. MakeMemory(value,base,addressType,offset);
  6374. END GetMathArrayField;
  6375. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6376. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6377. BEGIN
  6378. IF incr THEN
  6379. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6380. ELSE
  6381. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6382. END;
  6383. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6384. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6385. ELSE
  6386. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6387. Emit(Mov(position,reg,dim));
  6388. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6389. Emit(Add(position,reg,reg,base));
  6390. MakeMemory(mem, reg, addressType, offset);
  6391. ReleaseIntermediateOperand(reg);
  6392. Emit(Mov(position,mem,value));
  6393. ReleaseIntermediateOperand(mem);
  6394. END;
  6395. END PutMathArrayLenOrIncr;
  6396. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6397. BEGIN
  6398. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6399. END PutMathArrayLength;
  6400. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6401. BEGIN
  6402. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6403. END PutMathArrayIncrement;
  6404. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6405. BEGIN
  6406. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6407. END GetMathArrayIncrement;
  6408. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6409. BEGIN
  6410. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6411. END GetMathArrayLength;
  6412. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6413. VAR dimOp: IntermediateCode.Operand;
  6414. BEGIN
  6415. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6416. GetMathArrayLength(type, operand, dimOp, check, result);
  6417. END GetMathArrayLengthAt;
  6418. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6419. VAR dimOp: IntermediateCode.Operand;
  6420. BEGIN
  6421. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6422. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6423. END GetMathArrayIncrementAt;
  6424. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6425. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6426. offset: LONGINT;
  6427. BEGIN
  6428. IF increment THEN
  6429. offset := MathIncrOffset;
  6430. ELSE
  6431. offset := MathLenOffset;
  6432. END;
  6433. INC(offset,operand.dimOffset*2);
  6434. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6435. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6436. END;
  6437. (* static dimension *)
  6438. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6439. IF check & (type.form = SyntaxTree.Tensor) THEN
  6440. DimensionCheck(operand.tag,dim,BrltL);
  6441. END;
  6442. val := SHORT(dim.intValue);
  6443. IF type.form # SyntaxTree.Tensor THEN
  6444. t := SemanticChecker.ArrayBase(type,val);
  6445. type := t.resolved(SyntaxTree.MathArrayType);
  6446. IF type.form = SyntaxTree.Static THEN
  6447. IF increment THEN
  6448. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6449. ELSE
  6450. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6451. END;
  6452. InitOperand(result,ModeValue);
  6453. result.op := res;
  6454. RETURN;
  6455. END;
  6456. END;
  6457. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6458. MakeMemory(res,operand.tag,addressType,offset);
  6459. (*
  6460. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6461. *)
  6462. InitOperand(result,ModeValue);
  6463. result.op := res;
  6464. ELSE
  6465. Convert(dim,addressType);
  6466. IF check THEN
  6467. IF type.form = SyntaxTree.Tensor THEN
  6468. DimensionCheck(operand.tag,dim,BrltL);
  6469. ELSIF isUnchecked THEN (* do nothing *)
  6470. ELSE
  6471. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6472. END;
  6473. END;
  6474. end := NewLabel(); next := NIL;
  6475. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6476. Emit(Mov(position,res,dim));
  6477. Convert(res,sizeType);
  6478. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6479. WHILE t IS SyntaxTree.MathArrayType DO
  6480. type := t(SyntaxTree.MathArrayType);
  6481. IF type.form = SyntaxTree.Static THEN
  6482. imm := IntermediateCode.Immediate(sizeType,val);
  6483. next := NewLabel();
  6484. BrneL(next,imm,res);
  6485. IF increment THEN
  6486. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6487. ELSE
  6488. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6489. END;
  6490. Emit(MovReplace(position,res,imm));
  6491. BrL(end);
  6492. ELSE hasDynamicPart := TRUE;
  6493. END;
  6494. t := type.arrayBase.resolved;
  6495. val := val + 1;
  6496. IF next # NIL THEN SetLabel(next) END;
  6497. END;
  6498. IF hasDynamicPart THEN
  6499. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6500. Emit(Mov(position,res2,dim));
  6501. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6502. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6503. Emit(Add(position,res2,res2,imm));
  6504. Emit(Add(position,res2,res2,operand.tag));
  6505. IntermediateCode.MakeMemory(res2,sizeType);
  6506. Emit(MovReplace(position,res,res2));
  6507. ReleaseIntermediateOperand(res2);
  6508. END;
  6509. SetLabel(end);
  6510. Convert(res,sizeType);
  6511. InitOperand(result,ModeValue);
  6512. result.op := res;
  6513. END;
  6514. END MathArrayLenOrIncr;
  6515. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6516. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6517. offset: LONGINT;
  6518. BEGIN
  6519. offset := operand.dimOffset+DynamicDim(type)-1;
  6520. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6521. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6522. val := SHORT(dim.intValue);
  6523. t := SemanticChecker.ArrayBase(type,val);
  6524. type := t.resolved(SyntaxTree.ArrayType);
  6525. IF type.form = SyntaxTree.Static THEN
  6526. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6527. ELSE
  6528. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6529. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6530. END;
  6531. UseIntermediateOperand(res);
  6532. InitOperand(result,ModeValue);
  6533. result.op := res;
  6534. ELSE
  6535. Convert(dim,addressType);
  6536. IF ~isUnchecked THEN
  6537. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6538. END;
  6539. end := NewLabel(); next := NIL;
  6540. (* ReuseCopy(dim,res); *)
  6541. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6542. Emit(Mov(position,res,dim));
  6543. Convert(res,sizeType);
  6544. Convert(res,sizeType);
  6545. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6546. WHILE t IS SyntaxTree.ArrayType DO
  6547. type := t(SyntaxTree.ArrayType);
  6548. IF type.form = SyntaxTree.Static THEN
  6549. imm := IntermediateCode.Immediate(sizeType,val);
  6550. next := NewLabel();
  6551. BrneL(next,imm,res);
  6552. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6553. Emit(MovReplace(position,res,imm));
  6554. BrL(end);
  6555. ELSE hasDynamicPart := TRUE;
  6556. END;
  6557. t := type.arrayBase.resolved;
  6558. val := val + 1;
  6559. IF next # NIL THEN SetLabel(next) END;
  6560. END;
  6561. IF hasDynamicPart THEN
  6562. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6563. Convert(res2,addressType);
  6564. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6565. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6566. Emit(Sub(position,res2,imm,res2));
  6567. Emit(Add(position,res2,res2,operand.tag));
  6568. IntermediateCode.MakeMemory(res2,sizeType);
  6569. Emit(MovReplace(position,res,res2));
  6570. ReleaseIntermediateOperand(res2);
  6571. END;
  6572. SetLabel(end);
  6573. Convert(res,sizeType);
  6574. InitOperand(result,ModeValue);
  6575. result.op := res;
  6576. END;
  6577. END ArrayLen;
  6578. (**
  6579. create a temporary variable in current scope
  6580. **)
  6581. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6582. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6583. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6584. BEGIN
  6585. IF ~register THEN
  6586. v := temporaries.GetFreeVariable(type, untraced, index);
  6587. ELSE
  6588. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6589. END;
  6590. scope := currentScope;
  6591. (*
  6592. v := NIL; (* disable free variable managemenet for the time being *)
  6593. *)
  6594. name := temporaries.GetUID();
  6595. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6596. variable.SetType(type);
  6597. variable.SetAccess(SyntaxTree.Hidden);
  6598. variable.SetUntraced(untraced);
  6599. IF v = NIL THEN
  6600. temporaries.AddVariable(variable);
  6601. IF ~register THEN
  6602. IF scope.lastVariable # NIL THEN
  6603. offset := scope.lastVariable.offsetInBits;
  6604. ELSE
  6605. offset := 0;
  6606. END;
  6607. DEC(offset,system.SizeOf(variable.type));
  6608. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6609. variable(SyntaxTree.Variable).SetOffset(offset);
  6610. scope.AddVariable(variable(SyntaxTree.Variable));
  6611. scope.EnterSymbol(variable, duplicate);
  6612. ASSERT(~duplicate);
  6613. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6614. ELSE
  6615. variable.SetUseRegister(TRUE);
  6616. variable(SyntaxTree.Variable).SetOffset(0);
  6617. END;
  6618. ELSE (* v # NIL *)
  6619. (* reuse slot for new variable, do not create new slot ! *)
  6620. temporaries.SetVariable(index, variable);
  6621. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6622. ASSERT(~register);
  6623. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6624. ASSERT(v.offsetInBits # 0);
  6625. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6626. scope.EnterSymbol(variable, duplicate);
  6627. ASSERT(~duplicate);
  6628. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6629. END;
  6630. RETURN variable(SyntaxTree.Variable)
  6631. END GetTemporaryVariable;
  6632. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6633. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6634. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6635. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6636. i: LONGINT; duplicate: BOOLEAN;
  6637. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6638. VAR variable: SyntaxTree.Variable;
  6639. BEGIN
  6640. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6641. variable.SetType(type);
  6642. recordScope.AddVariable(variable);
  6643. END AddVariable;
  6644. BEGIN
  6645. name := "@ArrayDescriptor";
  6646. Basic.AppendNumber(name,dimensions);
  6647. identifier := SyntaxTree.NewIdentifier(name);
  6648. parentScope := module.module.moduleScope;
  6649. symbol := parentScope.FindSymbol(identifier);
  6650. IF symbol # NIL THEN
  6651. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6652. type := typeDeclaration.declaredType;
  6653. ELSE
  6654. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6655. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6656. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6657. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6658. recordType.SetTypeDeclaration(typeDeclaration);
  6659. recordType.SetState(SyntaxTree.Resolved);
  6660. typeDeclaration.SetDeclaredType(recordType);
  6661. AddVariable("@ptr",system.anyType);
  6662. AddVariable("@adr",system.addressType);
  6663. AddVariable("@flags",system.addressType);
  6664. AddVariable("@dim",system.addressType);
  6665. AddVariable("@elementSize",system.addressType);
  6666. FOR i := 0 TO dimensions-1 DO
  6667. name := "@len";
  6668. Basic.AppendNumber(name,i);
  6669. AddVariable(name,system.addressType);
  6670. name := "@incr";
  6671. Basic.AppendNumber(name,i);
  6672. AddVariable(name,system.addressType);
  6673. END;
  6674. parentScope.AddTypeDeclaration(typeDeclaration);
  6675. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6676. ASSERT(~duplicate);
  6677. type := recordType;
  6678. END;
  6679. RETURN type
  6680. END GetMathArrayDescriptorType;
  6681. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6682. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6683. BEGIN
  6684. NEW(string, LEN(s)); COPY(s, string^);
  6685. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6686. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6687. sv.SetType(type);
  6688. Designate(sv,res);
  6689. Emit(Push(position,res.tag));
  6690. Emit(Push(position,res.op));
  6691. ReleaseOperand(res);
  6692. END PushConstString;
  6693. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6694. BEGIN
  6695. IF b THEN
  6696. Emit(Push(Basic.invalidPosition, true));
  6697. ELSE
  6698. Emit(Push(Basic.invalidPosition, false));
  6699. END;
  6700. END PushConstBoolean;
  6701. PROCEDURE PushConstSet(v: SET);
  6702. VAR value: SyntaxTree.Value; op: Operand;
  6703. BEGIN
  6704. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6705. value.SetType(system.setType);
  6706. Evaluate(value, op);
  6707. Emit(Push(Basic.invalidPosition, op.op));
  6708. ReleaseOperand(op);
  6709. END PushConstSet;
  6710. PROCEDURE PushConstInteger(v: LONGINT);
  6711. VAR value: SyntaxTree.Value; op: Operand;
  6712. BEGIN
  6713. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6714. value.SetType(system.longintType);
  6715. Evaluate(value, op);
  6716. Emit(Push(Basic.invalidPosition, op.op));
  6717. ReleaseOperand(op);
  6718. END PushConstInteger;
  6719. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6720. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6721. section: IntermediateCode.Section;
  6722. BEGIN
  6723. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6724. Global.GetSymbolSegmentedName(symbol, name);
  6725. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6726. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6727. procedure.SetScope(moduleScope);
  6728. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6729. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6730. procedure.SetAccess(SyntaxTree.Hidden);
  6731. currentScope := procedureScope;
  6732. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6733. EmitEnter(section, Basic.invalidPosition,procedure,0,0);
  6734. RETURN section;
  6735. END OpenInitializer;
  6736. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6737. BEGIN
  6738. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6739. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6740. section := prev;
  6741. END CloseInitializer;
  6742. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6743. VAR name: SyntaxTree.IdentifierString;
  6744. parameter: SyntaxTree.Parameter;
  6745. type: SyntaxTree.Type;
  6746. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6747. BEGIN
  6748. InitOperand(op,ModeReference);
  6749. op.op := fp;
  6750. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6751. Dereference(op, x, FALSE);
  6752. result := op;
  6753. Symbol(symbol, op);
  6754. END Field;
  6755. PROCEDURE Direction(direction: LONGINT): SET;
  6756. BEGIN
  6757. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6758. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6759. ELSE HALT(100);
  6760. END;
  6761. END Direction;
  6762. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6763. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6764. BEGIN
  6765. Field(port, op);
  6766. ToMemory(op.op,addressType,0);
  6767. Emit(Push(Basic.invalidPosition, op.op));
  6768. ReleaseOperand(op);
  6769. Basic.GetString(modifier.identifier, name);
  6770. PushConstString(name);
  6771. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6772. ASSERT(SemanticChecker.IsStringType(value.type));
  6773. Designate(value, op);
  6774. Emit(Push(modifier.position, op.tag));
  6775. Emit(Push(modifier.position, op.op));
  6776. ReleaseOperand(op);
  6777. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6778. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6779. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6780. Evaluate(value, op);
  6781. Emit(Push(modifier.position, op.op));
  6782. ReleaseOperand(op);
  6783. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6784. ELSE
  6785. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6786. END;
  6787. END AddPortProperty;
  6788. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6789. VAR modifier: SyntaxTree.Modifier;
  6790. BEGIN
  6791. modifier := parameter.modifiers;
  6792. WHILE modifier # NIL DO
  6793. AddPortProperty(parameter,modifier, modifier.expression);
  6794. modifier := modifier.nextModifier;
  6795. END;
  6796. END AddPortProperties;
  6797. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6798. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6799. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6800. PROCEDURE PushLens(type: SyntaxTree.Type);
  6801. BEGIN
  6802. IF IsSemiDynamicArray(type) THEN
  6803. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6804. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6805. Emit(Push(Basic.invalidPosition, op.op));
  6806. ReleaseOperand(op);
  6807. INC(dim);
  6808. ELSIF IsStaticArray(type) THEN
  6809. len := len * type(SyntaxTree.ArrayType).staticLength;
  6810. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6811. INC(dim);
  6812. ELSE
  6813. baseType := type;
  6814. END;
  6815. END PushLens;
  6816. BEGIN
  6817. (* cell *)
  6818. IF parameter.type IS SyntaxTree.ArrayType THEN
  6819. type := parameter.type;
  6820. dim := 0;
  6821. len := 1;
  6822. PushLens(type);
  6823. portType := baseType.resolved(SyntaxTree.PortType);
  6824. ELSE
  6825. portType := parameter.type(SyntaxTree.PortType);
  6826. END;
  6827. PushSelfPointer();
  6828. (* port / array of ports *)
  6829. IF IsStaticArray(type) THEN
  6830. PushConstInteger(len);
  6831. END;
  6832. Field(parameter, op);
  6833. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6834. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6835. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6836. Designate(d, op);*)
  6837. Emit(Push(Basic.invalidPosition, op.op));
  6838. ReleaseOperand(op);
  6839. (* name *)
  6840. PushConstString(name);
  6841. (* inout *)
  6842. PushConstSet(Direction(portType.direction));
  6843. (* width *)
  6844. PushConstInteger(portType.sizeInBits);
  6845. IF parameter.type IS SyntaxTree.PortType THEN
  6846. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6847. AddPortProperties(parameter);
  6848. ELSIF IsStaticArray(type)THEN
  6849. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6850. ELSIF IsSemiDynamicArray(type) THEN
  6851. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6852. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6853. Emit(Add(position,reg, sp, size));
  6854. (* dim *)
  6855. PushConstInteger(dim);
  6856. (* len array *)
  6857. Emit(Push(position, reg));
  6858. ReleaseIntermediateOperand(reg);
  6859. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6860. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6861. Emit(Add(position, sp,sp, size));
  6862. ELSE
  6863. HALT(100);
  6864. END;
  6865. END Parameter;
  6866. BEGIN
  6867. IF backend.cellsAreObjects THEN
  6868. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6869. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6870. END;
  6871. parameter := x.firstParameter;
  6872. WHILE (parameter # NIL) DO
  6873. type := parameter.type.resolved;
  6874. WHILE (type IS SyntaxTree.ArrayType) DO
  6875. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6876. END;
  6877. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6878. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6879. Parameter(name,parameter);
  6880. END;
  6881. parameter := parameter.nextParameter;
  6882. END;
  6883. ELSE HALT(200)
  6884. END;
  6885. END AddPorts;
  6886. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6887. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6888. BEGIN
  6889. Symbol(cell,op);
  6890. ToMemory(op.op,addressType,0);
  6891. Emit(Push(position,op.op));
  6892. ReleaseOperand(op);
  6893. property.GetName(name);
  6894. (* does not work when inheritance is used:
  6895. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6896. *)
  6897. PushConstString(name);
  6898. IF (value # NIL) THEN
  6899. ASSERT(
  6900. SemanticChecker.IsStringType(property.type)
  6901. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6902. OR (property.type.resolved IS SyntaxTree.FloatType)
  6903. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6904. OR (property.type.resolved IS SyntaxTree.SetType)
  6905. );
  6906. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6907. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6908. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6909. Designate(d, op);
  6910. IF SemanticChecker.IsStringType(property.type) THEN
  6911. Emit(Push(Basic.invalidPosition, op.tag))
  6912. END;
  6913. Emit(Push(Basic.invalidPosition, op.op));
  6914. ReleaseOperand(op);
  6915. END;
  6916. IF value = NIL THEN
  6917. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6918. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6919. ASSERT(SemanticChecker.IsStringType(value.type));
  6920. Designate(value, op);
  6921. PushString(op, value.type);
  6922. ReleaseOperand(op);
  6923. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6924. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6925. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6926. Evaluate(value, op);
  6927. Emit(Push(property.position, op.op));
  6928. ReleaseOperand(op);
  6929. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6930. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6931. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6932. Evaluate(value, op);
  6933. Emit(Push(property.position, op.op));
  6934. ReleaseOperand(op);
  6935. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6936. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6937. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6938. Evaluate(value, op);
  6939. Emit(Push(property.position, op.op));
  6940. ReleaseOperand(op);
  6941. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6942. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6943. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6944. Evaluate(value, op);
  6945. Emit(Push(property.position, op.op));
  6946. ReleaseOperand(op);
  6947. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6948. ELSE
  6949. HALT(200);
  6950. END;
  6951. END AddProperty;
  6952. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6953. VAR symbol: SyntaxTree.Symbol;
  6954. BEGIN
  6955. WHILE modifier # NIL DO
  6956. symbol := cellType.FindProperty(modifier.identifier);
  6957. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6958. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6959. modifier := modifier.nextModifier;
  6960. END;
  6961. END AddModifiers;
  6962. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6963. VAR last: SyntaxTree.Modifier;
  6964. BEGIN
  6965. IF to = NIL THEN
  6966. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6967. ELSE
  6968. last := to;
  6969. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6970. last := last.nextModifier;
  6971. END;
  6972. IF last.identifier # this.identifier THEN
  6973. ASSERT(last.nextModifier = NIL);
  6974. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6975. END;
  6976. END;
  6977. END AppendModifier;
  6978. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6979. BEGIN
  6980. WHILE this # NIL DO
  6981. AppendModifier(to, this);
  6982. this := this.nextModifier;
  6983. END;
  6984. END AppendModifiers;
  6985. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6986. VAR base: SyntaxTree.Type;
  6987. BEGIN
  6988. AppendModifiers(to, c.modifiers);
  6989. base := c.GetBaseValueType();
  6990. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6991. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6992. END;
  6993. END AppendCellTypeModifiers;
  6994. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6995. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6996. BEGIN
  6997. Basic.GetString(modifier.identifier, name);
  6998. PushConstString(name);
  6999. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  7000. ASSERT(SemanticChecker.IsStringType(value.type));
  7001. Designate(value, op);
  7002. PushString(op, value.type);
  7003. ReleaseOperand(op);
  7004. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  7005. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  7006. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  7007. Evaluate(value, op);
  7008. Emit(Push(modifier.position, op.op));
  7009. ReleaseOperand(op);
  7010. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  7011. ELSE
  7012. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  7013. END;
  7014. END AddPortProperty;
  7015. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  7016. BEGIN
  7017. WHILE modifier # NIL DO
  7018. AddPortProperty(modifier, modifier.expression);
  7019. modifier := modifier.nextModifier;
  7020. END;
  7021. END AddPortProperties;
  7022. PROCEDURE PushPort(p: SyntaxTree.Expression);
  7023. VAR op: Operand;
  7024. BEGIN
  7025. Evaluate(p, op);
  7026. Emit(Push(p.position, op.op));
  7027. ReleaseOperand(op);
  7028. IF p IS SyntaxTree.Designator THEN
  7029. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  7030. END;
  7031. END PushPort;
  7032. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  7033. VAR tmp: IntermediateCode.Operand;
  7034. BEGIN
  7035. actualType := actualType.resolved;
  7036. IF actualType IS SyntaxTree.StringType THEN
  7037. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  7038. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  7039. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  7040. ELSE
  7041. tmp := op.tag;
  7042. IntermediateCode.MakeMemory(tmp,addressType);
  7043. Emit(Push(position,tmp));
  7044. END;
  7045. Emit(Push(position,op.op))
  7046. END PushString;
  7047. (* conservative check if x is potentially on the heap, excluding the module heap
  7048. required for generational garbage collector
  7049. *)
  7050. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  7051. BEGIN
  7052. RETURN TRUE;
  7053. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  7054. passed by reference.
  7055. pos := x.position.start;
  7056. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  7057. x := x(SyntaxTree.Designator).left;
  7058. END;
  7059. RETURN x # NIL;
  7060. *)
  7061. END OnHeap;
  7062. PROCEDURE VisitBuiltinCallDesignator*(x: SyntaxTree.BuiltinCallDesignator);
  7063. VAR
  7064. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  7065. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  7066. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  7067. tmp:IntermediateCode.Operand;
  7068. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  7069. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  7070. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  7071. dest: IntermediateCode.Operand;
  7072. staticLength: LONGINT; itype: IntermediateCode.Type;
  7073. convert,isTensor: BOOLEAN;
  7074. recordType: SyntaxTree.RecordType;
  7075. baseType: SyntaxTree.Type;
  7076. left: SyntaxTree.Expression;
  7077. call: SyntaxTree.Designator;
  7078. procedure: SyntaxTree.Procedure;
  7079. temporaryVariable: SyntaxTree.Variable;
  7080. dummy: IntermediateCode.Operand;
  7081. customBuiltin: SyntaxTree.CustomBuiltin;
  7082. isVarPar: ARRAY 3 OF BOOLEAN;
  7083. callsection: Sections.Section;
  7084. segmentedName: Basic.SegmentedName;
  7085. needsTrace: BOOLEAN;
  7086. n: ARRAY 256 OF CHAR;
  7087. modifier: SyntaxTree.Modifier;
  7088. previous, init: IntermediateCode.Section;
  7089. prevScope: SyntaxTree.Scope;
  7090. firstPar: LONGINT;
  7091. saved: RegisterEntry;
  7092. callingConvention: SyntaxTree.CallingConvention;
  7093. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  7094. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  7095. priority: IntermediateCode.Operand;
  7096. op,callop: Operand;
  7097. BEGIN
  7098. IF type = NIL THEN RETURN END;
  7099. type := type.resolved;
  7100. IF type IS SyntaxTree.PointerType THEN
  7101. type := type(SyntaxTree.PointerType).pointerBase.resolved
  7102. END;
  7103. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  7104. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  7105. recordScope := type(SyntaxTree.RecordType).recordScope;
  7106. IF recordScope.bodyProcedure # NIL THEN
  7107. procedure := recordScope.bodyProcedure;
  7108. body := procedure.procedureScope.body;
  7109. Emit(Push(position,self));
  7110. IF body.isActive THEN
  7111. StaticCallOperand(callop,procedure);
  7112. Emit(Push(position,callop.op));
  7113. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  7114. Convert(priority,sizeType);
  7115. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  7116. END;
  7117. Emit(Push(position,priority));
  7118. ReleaseIntermediateOperand(priority);
  7119. IF backend.cooperative THEN
  7120. Emit(Push(position,self));
  7121. CallThis(position,"Activities","Create",3)
  7122. ELSE
  7123. flags := 0;
  7124. IF body.isSafe THEN
  7125. flags := 1;
  7126. END;
  7127. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  7128. Emit(Push(position,self));
  7129. CallThis(position,"Objects","CreateProcess",4)
  7130. END;
  7131. ELSE
  7132. Emit(Push(position,self));
  7133. StaticCallOperand(callop,procedure);
  7134. Emit(Call(position,callop.op,ProcParametersSize(procedure)));
  7135. END;
  7136. Emit(Pop(position,self));
  7137. END;
  7138. END CallBodies;
  7139. PROCEDURE PushTD(type: SyntaxTree.Type);
  7140. VAR op: IntermediateCode.Operand;
  7141. BEGIN
  7142. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  7143. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  7144. ELSE
  7145. IF type.resolved IS SyntaxTree.PointerType THEN
  7146. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7147. END;
  7148. op := TypeDescriptorAdr(type.resolved);
  7149. Emit(Push(position,op));
  7150. END
  7151. END PushTD;
  7152. BEGIN
  7153. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  7154. dest := destination; destination := emptyOperand;
  7155. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  7156. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  7157. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  7158. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  7159. CASE x.id OF
  7160. (* ---- COPY ----- *)
  7161. |Global.Copy:
  7162. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  7163. (* ---- EXCL, INCL----- *)
  7164. |Global.Excl,Global.Incl:
  7165. Evaluate(p0,s0);
  7166. Evaluate(p1,s1);
  7167. Convert(s1.op,IntermediateCode.GetType(system,t0));
  7168. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7169. TrapC(BrltL,s1.op,IntermediateCode.Immediate(s1.op.type,t0.sizeInBits),IndexCheckTrap);
  7170. END;
  7171. ReuseCopy(res,s0.op);
  7172. ReleaseOperand(s0);
  7173. Reuse1(tmp,s1.op);
  7174. ReleaseOperand(s1);
  7175. Emit(Shl(position,tmp,IntermediateCode.Immediate(s1.op.type,1),s1.op));
  7176. IF x.id = Global.Excl THEN
  7177. Emit(Not(position,tmp,tmp));
  7178. Emit(And(position,res,res,tmp));
  7179. ELSE
  7180. Emit(Or(position,res,res,tmp));
  7181. END;
  7182. ReleaseIntermediateOperand(tmp);
  7183. Designate(p0,s0);
  7184. ToMemory(s0.op,s1.op.type,0);
  7185. Emit(Mov(position,s0.op,res));
  7186. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  7187. (* ---- DISPOSE ----- *)
  7188. |Global.Dispose:
  7189. Designate(p0,s0);
  7190. Emit(Push(position,s0.op));
  7191. ReleaseOperand(s0);
  7192. CallThis(position,"Runtime","Dispose", 1);
  7193. (* ---- GETPROCEDURE ----- *)
  7194. |Global.GetProcedure:
  7195. Designate(p0,s0);
  7196. PushString(s0,p0.type);
  7197. Designate(p1,s1);
  7198. PushString(s1,p1.type);
  7199. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  7200. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  7201. ELSE PushTD(procedureType.firstParameter.type)
  7202. END;
  7203. PushTD(procedureType.returnType);
  7204. Designate(p2,s2);
  7205. Emit(Push(position,s2.op));
  7206. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7207. CallThis(position,"Modules","GetProcedure", 7);
  7208. (* ---- ASH, LSH, ROT ----- *)
  7209. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  7210. Evaluate(p0,s0);
  7211. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  7212. (* make unsigned arguments in order to produced a logical shift *)
  7213. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  7214. convert:= TRUE;
  7215. itype := s0.op.type;
  7216. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  7217. Convert(s0.op,itype);
  7218. ELSE
  7219. convert := FALSE;
  7220. END;
  7221. END;
  7222. Evaluate(p1,s1);
  7223. IF IsIntegerConstant(p1,hint) THEN
  7224. ReuseCopy(reg,s0.op);
  7225. IF hint > 0 THEN
  7226. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  7227. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  7228. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7229. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7230. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7231. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7232. END;
  7233. ELSIF hint < 0 THEN
  7234. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7235. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7236. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7237. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7238. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7239. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7240. END;
  7241. END;
  7242. ReleaseOperand(s0); ReleaseOperand(s1);
  7243. ELSE
  7244. exit := NewLabel();
  7245. end := NewLabel();
  7246. ReuseCopy(reg,s0.op);
  7247. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7248. Reuse1(tmp,s1.op);
  7249. Emit(Neg(position,tmp,s1.op));
  7250. Convert(tmp,s1.op.type);
  7251. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7252. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7253. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7254. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7255. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7256. END;
  7257. ReleaseIntermediateOperand(tmp);
  7258. BrL(end);
  7259. SetLabel(exit);
  7260. ReuseCopy(tmp,s1.op);
  7261. Convert(tmp,s1.op.type);
  7262. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7263. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7264. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7265. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7266. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7267. END;
  7268. ReleaseIntermediateOperand(tmp);
  7269. SetLabel(end);
  7270. ReleaseOperand(s0); ReleaseOperand(s1);
  7271. END;
  7272. InitOperand(result,ModeValue);
  7273. IF convert THEN
  7274. itype := reg.type;
  7275. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7276. Convert(reg,itype);
  7277. END;
  7278. result.op := reg;
  7279. (* ---- CAP ----- *)
  7280. |Global.Cap:
  7281. Evaluate(p0,result);
  7282. ReuseCopy(reg,result.op);
  7283. ReleaseIntermediateOperand(result.op);
  7284. ignore := NewLabel();
  7285. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7286. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7287. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7288. SetLabel(ignore);
  7289. result.op := reg;
  7290. (* ---- CHR ----- *)
  7291. |Global.Chr, Global.Chr32:
  7292. Evaluate(p0,result);
  7293. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7294. |Global.Entier, Global.EntierH:
  7295. Evaluate(p0,result);
  7296. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7297. (* ---- MIN and MAX ----- *)
  7298. |Global.Max,Global.Min:
  7299. Evaluate(p0,s0);
  7300. Evaluate(p1,s1);
  7301. Reuse2(res,s0.op,s1.op);
  7302. else := NewLabel();
  7303. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7304. ELSE BrltL(else,s1.op,s0.op) END;
  7305. Emit(Mov(position,res,s0.op));
  7306. ReleaseOperand(s0);
  7307. end := NewLabel();
  7308. BrL(end);
  7309. SetLabel(else);
  7310. Emit(MovReplace(position,res,s1.op));
  7311. SetLabel(end);
  7312. ReleaseOperand(s1);
  7313. InitOperand(result,ModeValue);
  7314. result.op := res;
  7315. (* ---- ODD ----- *)
  7316. |Global.Odd:
  7317. Evaluate(p0,result);
  7318. Reuse1(res,result.op);
  7319. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7320. ReleaseIntermediateOperand(result.op);
  7321. result.op := res;
  7322. Convert(result.op,bool);
  7323. (* ---- ORD ----- *)
  7324. |Global.Ord, Global.Ord32:
  7325. Evaluate(p0,result);
  7326. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7327. (* ---- SHORT, LONG ----- *)
  7328. |Global.Short, Global.Long:
  7329. Evaluate(p0,result);
  7330. IF x.type IS SyntaxTree.ComplexType THEN
  7331. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7332. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7333. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7334. ELSE
  7335. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7336. END
  7337. (* ---- HALT, SYSTEM.HALT----- *)
  7338. |Global.Halt, Global.systemHalt:
  7339. val := LONGINT (p0.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7340. EmitTrap (position, val);
  7341. (* ---- ASSERT ----- *)
  7342. |Global.Assert:
  7343. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7344. trueL := NewLabel();
  7345. Condition(p0,trueL,TRUE);
  7346. IF p1 = NIL THEN val := AssertTrap
  7347. ELSE val := LONGINT(p1.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7348. END;
  7349. EmitTrap(position,val);
  7350. SetLabel(trueL);
  7351. END;
  7352. (*
  7353. Emit(TrapC(result.op,val);
  7354. *)
  7355. (* ---- INC, DEC----- *)
  7356. |Global.Inc,Global.Dec:
  7357. Expression(p0); adr := result.op;
  7358. s0 := result;
  7359. LoadValue(result,p0.type);
  7360. (* EXPERIMENTAL *)
  7361. IF (s0.availability >= 0) & (availableSymbols[s0.availability].inRegister) THEN
  7362. availableSymbols[s0.availability].inMemory := FALSE;
  7363. END;
  7364. l := result;
  7365. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7366. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7367. END;
  7368. IF x.id = Global.Inc THEN
  7369. Emit(Add(position,l.op,l.op,r.op));
  7370. ELSE
  7371. Emit(Sub(position,l.op,l.op,r.op));
  7372. END;
  7373. ReleaseOperand(l); ReleaseOperand(r);
  7374. (* ---- LEN ----- *)
  7375. |Global.Len: (* dynamic length, static length done by checker *)
  7376. Designate(p0,operand);
  7377. IF p1 = NIL THEN
  7378. InitOperand(l,ModeValue);
  7379. l.op := IntermediateCode.Immediate(sizeType,0);
  7380. ELSE
  7381. Evaluate(p1,l);
  7382. END;
  7383. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7384. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7385. Dereference(operand, p0.type.resolved, FALSE);
  7386. END;
  7387. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7388. ReleaseOperand(operand); ReleaseOperand(l);
  7389. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7390. ASSERT(p1 # NIL);
  7391. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7392. Dereference(operand,p0.type.resolved,FALSE);
  7393. END;
  7394. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7395. ReleaseOperand(operand); ReleaseOperand(l);
  7396. ELSE HALT(100);
  7397. END;
  7398. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7399. (* ---- FIRST ---- *)
  7400. |Global.First:
  7401. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7402. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7403. ELSE
  7404. Designate(p0, result)
  7405. END
  7406. (* ---- LAST ---- *)
  7407. |Global.Last:
  7408. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7409. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7410. ELSE
  7411. Designate(p0, result);
  7412. (* make sure result.op is a register *)
  7413. tmp := result.op;
  7414. ReuseCopy(result.op, result.op);
  7415. ReleaseIntermediateOperand(tmp);
  7416. (* add offset to result.op *)
  7417. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7418. END
  7419. (* ---- STEP ---- *)
  7420. |Global.Step:
  7421. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7422. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7423. ELSE
  7424. Designate(p0, result);
  7425. (* make sure result.op is a register *)
  7426. tmp := result.op;
  7427. ReuseCopy(result.op, result.op);
  7428. ReleaseIntermediateOperand(tmp);
  7429. (* add offset to result.op *)
  7430. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7431. END
  7432. (* ---- RE ---- *)
  7433. |Global.Re:
  7434. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7435. Designate(p0, result)
  7436. ELSE
  7437. Evaluate(p0, result)
  7438. END
  7439. (* ---- IM ---- *)
  7440. |Global.Im:
  7441. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7442. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7443. Designate(p0, result);
  7444. (* make sure result.op is a register *)
  7445. tmp := result.op;
  7446. ReuseCopy(result.op, result.op);
  7447. ReleaseIntermediateOperand(tmp);
  7448. (* add offset to result.op *)
  7449. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7450. (* ---- ABS ----- *)
  7451. |Global.Abs:
  7452. Evaluate(p0,operand);
  7453. type := p0.type.resolved;
  7454. InitOperand(result,ModeValue);
  7455. Reuse1a(result.op,operand.op,dest);
  7456. Emit(Abs(position,result.op,operand.op));
  7457. ReleaseOperand(operand);
  7458. (* ---- WAIT ----- *)
  7459. |Global.Wait:
  7460. Evaluate(p0,operand);
  7461. Emit(Push(position,operand.op));
  7462. ReleaseOperand(operand);
  7463. CallThis(position,"Activities","Wait", 1);
  7464. (* ---- NEW ----- *)
  7465. |Global.New:
  7466. (*! the following code is only correct for "standard" Oberon calling convention *)
  7467. IF x.type # NIL THEN
  7468. type := x.type.resolved;
  7469. firstPar := 0;
  7470. ELSE
  7471. type := p0.type.resolved;
  7472. firstPar := 1;
  7473. END;
  7474. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7475. THEN
  7476. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7477. IF backend.cooperative THEN
  7478. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7479. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7480. IF recordType.isObject THEN
  7481. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7482. IF recordType.IsActive() THEN
  7483. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7484. END;
  7485. IF recordType.IsProtected() THEN
  7486. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7487. END;
  7488. ELSE
  7489. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7490. END;
  7491. END;
  7492. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7493. CallThis(position,"Runtime","New", 1);
  7494. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7495. Emit(Result(position, pointer));
  7496. exit := NewLabel();
  7497. BreqL(exit,pointer,nil);
  7498. GetRecordTypeName (recordType,name);
  7499. IF ~recordType.isObject THEN
  7500. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7501. END;
  7502. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7503. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7504. IF recordType.isObject THEN
  7505. IF recordType.IsProtected() THEN
  7506. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7507. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7508. END;
  7509. IF recordType.IsActive() THEN
  7510. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7511. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7512. END;
  7513. END;
  7514. (* initialize fields *)
  7515. IF type(SyntaxTree.PointerType).isPlain THEN
  7516. size := 0;
  7517. ELSIF recordType.isObject THEN
  7518. size := BaseObjectTypeSize;
  7519. ELSE
  7520. size := BaseRecordTypeSize;
  7521. END;
  7522. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7523. (* call initializer *)
  7524. constructor := GetConstructor(recordType);
  7525. IF constructor # NIL THEN
  7526. (*! should be unified with ProcedureCallDesignator *)
  7527. Emit(Push(position,pointer));
  7528. ReleaseIntermediateOperand(pointer);
  7529. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7530. FOR i := firstPar TO x.parameters.Length()-1 DO
  7531. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7532. formalParameter := formalParameter.nextParameter;
  7533. END;
  7534. (* static call of the constructor *)
  7535. GetCodeSectionNameForSymbol(constructor,name);
  7536. ASSERT(~constructor.isInline);
  7537. IF constructor.scope.ownerModule # module.module THEN
  7538. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7539. ELSE
  7540. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7541. END;
  7542. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7543. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7544. Emit(Pop(position,pointer));
  7545. END;
  7546. (* call bodies *)
  7547. CallBodies(pointer,type);
  7548. SetLabel(exit);
  7549. needsTrace := p0.NeedsTrace();
  7550. IF needsTrace THEN ModifyAssignments(true) END;
  7551. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7552. Emit(Push(position, pointer));
  7553. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7554. Emit(Pop(position, pointer));
  7555. END;
  7556. Designate(p0,l);
  7557. IF needsTrace THEN
  7558. CallAssignPointer(l.op, pointer);
  7559. ELSE
  7560. ToMemory(l.op,addressType,0);
  7561. Emit(Mov(position,l.op,pointer));
  7562. END;
  7563. ReleaseIntermediateOperand(pointer);
  7564. ReleaseOperand(l);
  7565. IF needsTrace THEN ModifyAssignments(false) END;
  7566. ELSE (* not cooperative backend *)
  7567. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7568. IF temporaryVariable # NIL THEN
  7569. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7570. ELSE
  7571. Designate(p0,l);
  7572. END;
  7573. (* l.op contains address of pointer to record *)
  7574. Emit(Push(position,l.op)); (* address for use after syscall *)
  7575. Emit(Push(position,l.op));
  7576. ReleaseOperand(l);
  7577. (* push type descriptor *)
  7578. reg := TypeDescriptorAdr(recordType);
  7579. Emit(Push(position,reg));
  7580. ReleaseIntermediateOperand(reg);
  7581. (* push realtime flag *)
  7582. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7583. ELSE Emit(Push(position,false));
  7584. END;
  7585. CallThis(position,"Heaps","NewRec", 3);
  7586. (* check allocation success, if not successful then do not call initializers and bodies *)
  7587. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7588. Emit(Pop(position,pointer));
  7589. MakeMemory(reg,pointer,addressType,0);
  7590. ReleaseIntermediateOperand(pointer);
  7591. pointer := reg;
  7592. exit := NewLabel();
  7593. BreqL(exit,pointer,nil);
  7594. Emit(Push(position,pointer));
  7595. (* initialize fields *)
  7596. InitFields(recordType, pointer,0);
  7597. (* call initializer *)
  7598. constructor := GetConstructor(recordType);
  7599. IF constructor # NIL THEN
  7600. (*! should be unified with ProcedureCallDesignator *)
  7601. Emit(Push(position,pointer));
  7602. ReleaseIntermediateOperand(pointer);
  7603. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7604. FOR i := firstPar TO x.parameters.Length()-1 DO
  7605. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7606. formalParameter := formalParameter.nextParameter;
  7607. END;
  7608. (* static call of the constructor *)
  7609. GetCodeSectionNameForSymbol(constructor,name);
  7610. ASSERT(~constructor.isInline);
  7611. IF constructor.scope.ownerModule # module.module THEN
  7612. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7613. ELSE
  7614. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7615. END;
  7616. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  7617. ELSE
  7618. ReleaseIntermediateOperand(pointer);
  7619. END;
  7620. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7621. Emit(Pop(position,pointer));
  7622. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7623. Designate(p0,l);
  7624. IF backend.writeBarriers & OnHeap(p0) THEN
  7625. SaveRegisters();ReleaseUsedRegisters(saved);
  7626. Emit(Push(position,l.op));
  7627. Emit(Push(position,pointer));
  7628. CallThis(position,"Heaps","Assign",2);
  7629. RestoreRegisters(saved);
  7630. ELSE
  7631. ToMemory(l.op,addressType,0);
  7632. Emit(Mov(position,l.op,pointer));
  7633. END;
  7634. ReleaseOperand(l);
  7635. result.tag := emptyOperand;
  7636. ELSIF (x.type # NIL) THEN
  7637. result := l; (* temporary variable is the result of NEW Type() *)
  7638. END;
  7639. (* call bodies *)
  7640. CallBodies(pointer,type);
  7641. ReleaseIntermediateOperand(pointer);
  7642. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7643. end := NewLabel();
  7644. BrL(end);
  7645. SetLabel(exit);
  7646. Designate(p0,l);
  7647. ToMemory(l.op,addressType,0);
  7648. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7649. ReleaseOperand(l);
  7650. SetLabel(end);
  7651. ELSE
  7652. SetLabel(exit);
  7653. END;
  7654. END;
  7655. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7656. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7657. IF ~backend.cooperative THEN (* simpler version *)
  7658. (*
  7659. push len0
  7660. push len1
  7661. push len2
  7662. push len_size
  7663. push len_adr
  7664. push tag
  7665. push static elements
  7666. push element size
  7667. push adr
  7668. *)
  7669. dim := 0;
  7670. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7671. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7672. parameter := x.parameters.GetExpression(i);
  7673. Evaluate(parameter,r);
  7674. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7675. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7676. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7677. END;
  7678. Emit(Push(position,r.op));
  7679. ReleaseOperand(r);
  7680. INC(dim);
  7681. END;
  7682. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7683. Emit(Mov(position, adr, sp));
  7684. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7685. Emit(Push(position, adr));
  7686. ReleaseIntermediateOperand(adr);
  7687. openDim := dim;
  7688. staticLength := 1;
  7689. IF type IS SyntaxTree.ArrayType THEN
  7690. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7691. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7692. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7693. END;
  7694. END;
  7695. IF SemanticChecker.ContainsPointer(type) THEN
  7696. tmp := TypeDescriptorAdr(type);
  7697. ELSE
  7698. tmp := nil;
  7699. END;
  7700. Emit(Push(position,tmp)); (* type descriptor *)
  7701. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7702. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7703. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7704. Designate(p0,l);
  7705. Emit(Push(position,l.op)); (* address *)
  7706. ReleaseOperand(l);
  7707. CallThis(position,"Heaps","NewArray", 6);
  7708. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7709. Emit(Add(position,sp,sp,tmp));
  7710. ELSE
  7711. dim := 0;
  7712. IntermediateCode.InitOperand(reg);
  7713. IF p1 # NIL THEN
  7714. FOR i := firstPar TO x.parameters.Length()-1 DO
  7715. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7716. parameter := x.parameters.GetExpression(i);
  7717. Evaluate(parameter,r);
  7718. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7719. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7720. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7721. END;
  7722. Emit(Push(position,r.op));
  7723. IF i=1 THEN
  7724. CopyInt(reg,r.op);
  7725. ELSE
  7726. MulInt(reg, reg, r.op);
  7727. END;
  7728. ReleaseOperand(r);
  7729. INC(dim);
  7730. END;
  7731. Convert(reg,addressType);
  7732. ELSE
  7733. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7734. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7735. END;
  7736. openDim := dim;
  7737. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7738. IF backend.cooperative THEN
  7739. size := ToMemoryUnits(system,system.SizeOf(type));
  7740. WHILE type IS SyntaxTree.ArrayType DO
  7741. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7742. END;
  7743. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7744. IF (size # 1) THEN
  7745. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7746. END;
  7747. Emit(Push(position,reg));
  7748. size := ToMemoryUnits(system,system.SizeOf(type));
  7749. IF (size # 1) THEN
  7750. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7751. END;
  7752. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7753. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7754. Emit(Push(position,reg));
  7755. ReleaseIntermediateOperand(reg);
  7756. CallThis(position,"Runtime","New", 1);
  7757. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7758. Emit(Result(position, pointer));
  7759. exit := NewLabel();
  7760. else := NewLabel();
  7761. BreqL(else,pointer,nil);
  7762. IF ~type.hasPointers THEN
  7763. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7764. ELSIF type IS SyntaxTree.RecordType THEN
  7765. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7766. ELSIF type IS SyntaxTree.ProcedureType THEN
  7767. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7768. ELSE
  7769. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7770. END;
  7771. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7772. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7773. 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))));
  7774. IF type IS SyntaxTree.RecordType THEN
  7775. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7776. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7777. ELSE
  7778. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7779. END;
  7780. i := openDim;
  7781. WHILE i > 0 DO
  7782. DEC (i);
  7783. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7784. END;
  7785. needsTrace := p0.NeedsTrace();
  7786. IF needsTrace THEN ModifyAssignments(true) END;
  7787. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7788. Emit(Push(position, pointer));
  7789. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7790. Emit(Pop(position, pointer));
  7791. END;
  7792. Designate(p0,l);
  7793. IF needsTrace THEN
  7794. CallAssignPointer(l.op, pointer);
  7795. ModifyAssignments(false);
  7796. ELSE
  7797. ToMemory(l.op,addressType,0);
  7798. Emit(Mov(position,l.op,pointer));
  7799. END;
  7800. ReleaseIntermediateOperand(pointer);
  7801. ReleaseOperand(l);
  7802. BrL(exit);
  7803. SetLabel(else);
  7804. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7805. Designate(p0,l);
  7806. IF needsTrace THEN
  7807. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7808. ELSE
  7809. ToMemory(l.op,addressType,0);
  7810. Emit(Mov(position,l.op,pointer));
  7811. END;
  7812. ReleaseOperand(l);
  7813. SetLabel(exit);
  7814. ELSE
  7815. (*! the following code is only correct for "standard" Oberon calling convention *)
  7816. IF SemanticChecker.ContainsPointer(type) THEN
  7817. IF type IS SyntaxTree.ArrayType THEN
  7818. staticLength := 1;
  7819. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7820. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7821. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7822. END;
  7823. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7824. MulInt(reg,reg,tmp);
  7825. END;
  7826. Designate(p0,l);
  7827. IF openDim > 0 THEN
  7828. Emit(Push(position,l.op)); (* address for use after syscall *)
  7829. END;
  7830. Emit(Push(position,l.op)); (* address *)
  7831. ReleaseOperand(l);
  7832. tmp := TypeDescriptorAdr(type);
  7833. Emit(Push(position,tmp)); (* type descriptor *)
  7834. ReleaseIntermediateOperand(tmp);
  7835. Emit(Push(position,reg)); (* number Elements *)
  7836. ReleaseIntermediateOperand(reg);
  7837. tmp := IntermediateCode.Immediate(addressType,dim);
  7838. Emit(Push(position,tmp)); (* dimensions *)
  7839. (* push realtime flag *)
  7840. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7841. ELSE Emit(Push(position,false));
  7842. END;
  7843. CallThis(position,"Heaps","NewArr",5)
  7844. ELSE
  7845. size := ToMemoryUnits(system,system.SizeOf(type));
  7846. IF (size # 1) THEN
  7847. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7848. (*
  7849. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7850. *)
  7851. END;
  7852. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7853. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7854. AddInt(reg, reg, tmp);
  7855. (*
  7856. Emit(Add(position,reg,reg,tmp));
  7857. *)
  7858. Designate(p0,l);
  7859. IF openDim >0 THEN
  7860. Emit(Push(position,l.op)); (* address for use after syscall *)
  7861. END;
  7862. Emit(Push(position,l.op)); (* address for syscall *)
  7863. ReleaseOperand(l); (* pointer address *)
  7864. Emit(Push(position,reg)); (* size *)
  7865. ReleaseIntermediateOperand(reg);
  7866. (* push realtime flag *)
  7867. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7868. ELSE Emit(Push(position,false));
  7869. END;
  7870. CallThis(position,"Heaps","NewSys", 3)
  7871. END;
  7872. IF openDim > 0 THEN
  7873. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7874. Emit(Pop(position,adr));
  7875. ToMemory(adr,addressType,0);
  7876. ReuseCopy(tmp,adr);
  7877. ReleaseIntermediateOperand(adr);
  7878. adr := tmp;
  7879. else := NewLabel();
  7880. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7881. i := openDim-1;
  7882. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7883. WHILE (i >= 0) DO
  7884. Emit(Pop(position,reg));
  7885. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7886. Emit(Mov(position,res,reg));
  7887. DEC(i);
  7888. END;
  7889. ReleaseIntermediateOperand(adr);
  7890. ReleaseIntermediateOperand(reg);
  7891. exit := NewLabel();
  7892. BrL(exit);
  7893. SetLabel(else);
  7894. (* else part: array could not be allocated *)
  7895. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7896. Emit(Add(position,sp,sp,tmp));
  7897. SetLabel(exit);
  7898. END;
  7899. END;
  7900. END;
  7901. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7902. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7903. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7904. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7905. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7906. callingConvention := procedureType.callingConvention;
  7907. left.SetType(procedure.type);
  7908. formalParameter := procedureType.firstParameter;
  7909. (* push array to allocate *)
  7910. PushParameter(p0, formalParameter, callingConvention, FALSE, dummy,-1);
  7911. formalParameter :=formalParameter.nextParameter;
  7912. (* push length array *)
  7913. PushParameter(p1, formalParameter, callingConvention, FALSE, dummy,-1);
  7914. (* push size *)
  7915. type := t0;
  7916. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7917. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7918. END;
  7919. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.sizeType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7920. Emit(Push(position,tmp));
  7921. (* *)
  7922. IF SemanticChecker.ContainsPointer(type) THEN
  7923. tmp := TypeDescriptorAdr(type);
  7924. ELSE
  7925. tmp := IntermediateCode.Immediate(addressType, 0);
  7926. END;
  7927. Emit(Push(position,tmp)); (* type descriptor *)
  7928. StaticCallOperand(result,procedure);
  7929. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7930. ReleaseOperand(result);
  7931. END;
  7932. (*
  7933. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7934. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7935. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7936. *)
  7937. ELSE
  7938. (*
  7939. push len0
  7940. push len1
  7941. push len2
  7942. push size
  7943. push len_adr
  7944. push element_size
  7945. push tag
  7946. push adr
  7947. *)
  7948. dim := 0;
  7949. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7950. isTensor := TRUE;
  7951. ELSE
  7952. isTensor := FALSE;
  7953. END;
  7954. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7955. IF ~isTensor THEN
  7956. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7957. END;
  7958. parameter := x.parameters.GetExpression(i);
  7959. Evaluate(parameter,r);
  7960. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7961. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7962. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7963. END;
  7964. Emit(Push(position,r.op));
  7965. ReleaseOperand(r);
  7966. INC(dim);
  7967. END;
  7968. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7969. Emit(Mov(position, adr, sp));
  7970. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7971. Emit(Push(position, adr));
  7972. ReleaseIntermediateOperand(adr);
  7973. openDim := dim;
  7974. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7975. IF isTensor THEN
  7976. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7977. ELSE
  7978. baseType := SemanticChecker.ArrayBase(type,openDim);
  7979. END;
  7980. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7981. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7982. IF SemanticChecker.ContainsPointer(baseType) THEN
  7983. tmp := TypeDescriptorAdr(baseType);
  7984. ELSE
  7985. tmp := nil;
  7986. END;
  7987. Emit(Push(position,tmp)); (* type descriptor *)
  7988. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7989. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7990. ELSE (* error message has already been emited *)
  7991. RETURN;
  7992. END;
  7993. Designate(p0,l);
  7994. IF isTensor THEN
  7995. Emit(Push(position,l.op)); (* address *)
  7996. ELSE
  7997. Emit(Push(position,l.tag)); (* address *)
  7998. END;
  7999. ReleaseOperand(l);
  8000. StaticCallOperand(result,procedure);
  8001. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  8002. ReleaseOperand(result);
  8003. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  8004. Emit(Add(position,sp,sp,tmp));
  8005. END;
  8006. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  8007. THEN
  8008. IF ~backend.cellsAreObjects THEN RETURN END;
  8009. IF InCellScope(currentScope) THEN
  8010. PushSelfPointer()
  8011. ELSE
  8012. Emit(Push(position, nil));
  8013. END;
  8014. (* push temp address *)
  8015. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  8016. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  8017. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8018. (* l.op contains address of pointer to record *)
  8019. Emit(Push(position,l.op)); (* address for use after syscall *)
  8020. ReleaseOperand(l);
  8021. (* push type descriptor *)
  8022. reg := TypeDescriptorAdr(baseType);
  8023. Emit(Push(position,reg));
  8024. ReleaseIntermediateOperand(reg);
  8025. (* push name *)
  8026. (*Global.GetSymbolName(p0, n);*)
  8027. IF currentScope IS SyntaxTree.ProcedureScope THEN
  8028. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  8029. ELSE
  8030. Global.GetModuleName(module.module, n);
  8031. END;
  8032. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  8033. (*type.typeDeclaration.GetName(n);*)
  8034. PushConstString(n);
  8035. (* push cellnet boolean *)
  8036. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  8037. (* push engine boolean *)
  8038. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  8039. (* allocate *)
  8040. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  8041. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8042. (* l.op contains address of pointer to record *)
  8043. ToMemory(l.op,addressType,0);
  8044. (* l.op contains value of pointer to record *)
  8045. InitFields(baseType, l.op,0);
  8046. (* add capabilities *)
  8047. modifier := p0(SyntaxTree.Designator).modifiers;
  8048. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  8049. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  8050. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  8051. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  8052. END;
  8053. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  8054. (*
  8055. modifier := baseType(SyntaxTree.CellType).modifiers;
  8056. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  8057. modifier := p0(SyntaxTree.Designator).modifiers;
  8058. *)
  8059. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  8060. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8061. (* l.op contains address of pointer to record *)
  8062. ToMemory(l.op,addressType,0);
  8063. (* l.op contains value of pointer to record *)
  8064. Emit(Push(position,l.op)); (* address for use after syscall *)
  8065. ReleaseOperand(l);
  8066. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  8067. prevScope := currentScope;
  8068. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  8069. previous := section;
  8070. section := init;
  8071. (* add ports *)
  8072. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  8073. CloseInitializer(previous);
  8074. currentScope := prevScope;
  8075. Symbol(temporaryVariable,l);
  8076. ToMemory(l.op,addressType,0);
  8077. Emit(Push(position,l.op));
  8078. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  8079. (*
  8080. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  8081. IF constructor # NIL THEN
  8082. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8083. FOR i := 1 TO x.parameters.Length()-1 DO
  8084. p := x.parameters.GetExpression(i);
  8085. Global.GetSymbolName(parameter,name);
  8086. Evaluate(p, value);
  8087. ASSERT(value.type # NIL);
  8088. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  8089. par := instance.AddParameter(name);
  8090. par.SetInteger(value.integer);
  8091. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  8092. par := instance.AddParameter(name);
  8093. par.SetBoolean(value.boolean);
  8094. ELSE Error(x.position,NotYetImplemented)
  8095. END;
  8096. parameter := parameter.nextParameter
  8097. END;
  8098. END;
  8099. *)
  8100. (* call initializer *)
  8101. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  8102. IF constructor # NIL THEN
  8103. (*! should be unified with ProcedureCallDesignator *)
  8104. IF backend.cellsAreObjects THEN
  8105. Symbol(temporaryVariable,l);
  8106. ToMemory(l.op,addressType,0);
  8107. Emit(Push(position,l.op));
  8108. ReleaseOperand(l);
  8109. END;
  8110. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8111. FOR i := firstPar TO x.parameters.Length()-1 DO
  8112. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8113. formalParameter := formalParameter.nextParameter;
  8114. END;
  8115. (* static call of the constructor *)
  8116. Global.GetSymbolSegmentedName(constructor,name);
  8117. ASSERT(~constructor.isInline);
  8118. IF constructor.scope.ownerModule # module.module THEN
  8119. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8120. ELSE
  8121. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8122. END;
  8123. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  8124. (*ELSE
  8125. ReleaseIntermediateOperand(pointer);*)
  8126. END;
  8127. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8128. ToMemory(l.op, addressType, 0);
  8129. Designate(p0,s0);
  8130. ToMemory(s0.op,addressType,0);
  8131. Emit(Mov(position,s0.op,l.op));
  8132. ReleaseOperand(l);
  8133. ReleaseOperand(s0);
  8134. result.tag := emptyOperand;
  8135. (* start *)
  8136. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  8137. (* push cell *)
  8138. Symbol(temporaryVariable, l);
  8139. ToMemory(l.op,addressType,0);
  8140. Emit(Push(Basic.invalidPosition,l.op));
  8141. (* push delegate *)
  8142. Emit(Push(Basic.invalidPosition,l.op));
  8143. ReleaseOperand(l);
  8144. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  8145. Emit(Push(position, s1.op));
  8146. ReleaseOperand(s1);
  8147. CallThis(position,"ActiveCellsRuntime","Start",3);
  8148. END;
  8149. (*IF temporaryVariable # NIL THEN
  8150. end := NewLabel();
  8151. BrL(end);
  8152. SetLabel(exit);
  8153. Designate(p0,l);
  8154. ToMemory(l.op,addressType,0);
  8155. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  8156. ReleaseOperand(l);
  8157. SetLabel(end);
  8158. ELSE
  8159. SetLabel(exit);
  8160. END;
  8161. *)
  8162. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  8163. ELSE (* no pointer to record, no pointer to array *)
  8164. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  8165. (* ignore new statement *)
  8166. Warning(p0.position, "cannot run on final hardware");
  8167. ELSE
  8168. HALT(200);
  8169. END;
  8170. END;
  8171. (* ---- ADDRESSOF----- *)
  8172. |Global.systemAdr:
  8173. Designate(p0,s0);
  8174. s0.mode := ModeValue;
  8175. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  8176. ReleaseIntermediateOperand(s0.op);
  8177. s0.op := s0.tag;
  8178. IntermediateCode.InitOperand(s0.tag);
  8179. END;
  8180. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  8181. result := s0;
  8182. (* ---- BIT ----- *)
  8183. |Global.systemBit:
  8184. Evaluate(p0,s0);
  8185. ToMemory(s0.op,addressType,0);
  8186. ReuseCopy(res,s0.op);
  8187. ReleaseOperand(s0);
  8188. Evaluate(p1,s1);
  8189. Emit(Ror(position,res,res,s1.op));
  8190. ReleaseOperand(s1);
  8191. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8192. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  8193. InitOperand(result,ModeValue);
  8194. result.op := res;
  8195. (* --- MSK ----*)
  8196. |Global.systemMsk:
  8197. Evaluate(p0,s0);
  8198. Evaluate(p1,s1);
  8199. ReuseCopy(res,s0.op);
  8200. ReleaseOperand(s0);
  8201. Emit(And(position,res,res,s1.op));
  8202. ReleaseOperand(s1);
  8203. InitOperand(result,ModeValue);
  8204. result.op := res;
  8205. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8206. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8207. Evaluate(p0,s0);
  8208. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8209. ReleaseOperand(s0);
  8210. InitOperand(result,ModeValue);
  8211. result.op := res;
  8212. (* ---- SYSTEM.GetStackPointer ----- *)
  8213. |Global.systemGetStackPointer:
  8214. InitOperand(result,ModeValue);
  8215. result.op := sp;
  8216. (* ---- SYSTEM.GetFramePointer ----- *)
  8217. |Global.systemGetFramePointer:
  8218. InitOperand(result,ModeValue);
  8219. result.op := fp;
  8220. (* ---- SYSTEM.GetActivity ----- *)
  8221. |Global.systemGetActivity:
  8222. ASSERT(backend.cooperative);
  8223. InitOperand(result,ModeValue);
  8224. result.op := ap;
  8225. (* ---- SYSTEM.SetStackPointer ----- *)
  8226. |Global.systemSetStackPointer:
  8227. Evaluate(p0,s0); (* *)
  8228. Emit(Mov(position,sp,s0.op));
  8229. ReleaseOperand(s0);
  8230. (* ---- SYSTEM.SetFramePointer ----- *)
  8231. |Global.systemSetFramePointer:
  8232. Evaluate(p0,s0); (* *)
  8233. Emit(Mov(position,fp,s0.op));
  8234. ReleaseOperand(s0);
  8235. (* ---- SYSTEM.Activity ----- *)
  8236. |Global.systemSetActivity:
  8237. ASSERT(backend.cooperative);
  8238. Evaluate(p0,s0); (* *)
  8239. Emit(Mov(position,ap,s0.op));
  8240. ReleaseOperand(s0);
  8241. (* ---- SYSTEM.VAL ----- *)
  8242. |Global.systemVal:
  8243. Expression(p1);
  8244. s1 := result;
  8245. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8246. IF s1.mode = ModeReference THEN
  8247. (* nothing to be done if not record type, just take over new type *)
  8248. IF (type IS SyntaxTree.RecordType) THEN
  8249. ReleaseIntermediateOperand(s1.tag);
  8250. s1.tag := TypeDescriptorAdr(type);
  8251. UseIntermediateOperand(s1.tag);
  8252. END;
  8253. result := s1;
  8254. ELSE (* copy over result to different type, may not use convert *)
  8255. itype := IntermediateCode.GetType(system,type);
  8256. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8257. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8258. Emit(Mov(position,s0.op,s1.op));
  8259. ReleaseOperand(s1);
  8260. InitOperand(result,ModeValue);
  8261. result.op := s0.op;
  8262. ELSE (* different size, must convert *)
  8263. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8264. Convert(s1.op, IntermediateCode.GetType(system,type));
  8265. result := s1;
  8266. END;
  8267. END;
  8268. (* ---- SYSTEM.GET ----- *)
  8269. |Global.systemGet:
  8270. Evaluate(p0,s0); (* adr *)
  8271. Designate(p1,s1); (* variable *)
  8272. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8273. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8274. Emit(Mov(position,s1.op,s0.op));
  8275. ReleaseOperand(s1);
  8276. ReleaseOperand(s0);
  8277. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8278. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8279. Evaluate(p0,s0); (* *)
  8280. Evaluate(p1,s1); (* variable *)
  8281. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8282. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8283. (* real part *)
  8284. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8285. Emit(Mov(position,res, s1.op));
  8286. ReleaseIntermediateOperand(res);
  8287. (* imaginary part *)
  8288. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8289. Emit(Mov(position,res, s1.tag));
  8290. ReleaseIntermediateOperand(res);
  8291. ReleaseOperand(s1);
  8292. ReleaseOperand(s0);
  8293. ELSE
  8294. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8295. ReleaseOperand(s0);
  8296. Emit(Mov(position,res,s1.op));
  8297. ReleaseIntermediateOperand(res);
  8298. ReleaseOperand(s1);
  8299. END;
  8300. (* ---- SYSTEM.MOVE ----- *)
  8301. |Global.systemMove:
  8302. Evaluate(p0,s0);
  8303. Evaluate(p1,s1);
  8304. Evaluate(p2,s2);
  8305. Emit(Copy(position,s1.op,s0.op,s2.op));
  8306. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8307. (* ---- SYSTEM.NEW ----- *)
  8308. |Global.systemNew:
  8309. Designate(p0,s0);
  8310. Emit(Push(position,s0.op));
  8311. ReleaseOperand(s0);
  8312. Evaluate(p1,s1);
  8313. Emit(Push(position,s1.op));
  8314. ReleaseOperand(s1);
  8315. (* push realtime flag: false by default *)
  8316. Emit(Push(position,false));
  8317. CallThis(position,"Heaps","NewSys",3);
  8318. (* ---- SYSTEM.CALL ----- *)
  8319. |Global.systemRef:
  8320. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8321. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8322. s0.mode := ModeValue;
  8323. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8324. result := s0
  8325. (* ---- INCR ----- *)
  8326. |Global.Incr:
  8327. Designate(p0,operand);
  8328. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8329. Dereference(operand,p0.type.resolved,FALSE);
  8330. END;
  8331. ASSERT(p1 # NIL);
  8332. Evaluate(p1,l);
  8333. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8334. ReleaseOperand(operand); ReleaseOperand(l);
  8335. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8336. (* ---- SUM ----- *)
  8337. |Global.Sum: HALT(200);
  8338. (* ---- ALL ----- *)
  8339. |Global.All: HALT(200);
  8340. (* ---- CAS ----- *)
  8341. |Global.Cas:
  8342. needsTrace := p0.NeedsTrace();
  8343. IF needsTrace THEN ModifyAssignments(true) END;
  8344. Designate(p0,s0);
  8345. Evaluate(p1,s1);
  8346. Evaluate(p2,s2);
  8347. IF needsTrace THEN
  8348. Emit(Push(position, s0.op));
  8349. Emit(Push(position, s1.op));
  8350. Emit(Push(position, s2.op));
  8351. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8352. ELSE
  8353. Emit(Cas(position,s0.op,s1.op,s2.op));
  8354. END;
  8355. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8356. IF needsTrace THEN ModifyAssignments(false) END;
  8357. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8358. Emit(Result(position, res));
  8359. result.op := res;
  8360. result.mode := ModeValue;
  8361. (*
  8362. IF conditional THEN
  8363. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8364. BrL(falseLabel);
  8365. ReleaseIntermediateOperand(res);
  8366. END;
  8367. *)
  8368. (* ---- DIM ----- *)
  8369. |Global.Dim:
  8370. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8371. Designate(p0,s0);
  8372. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8373. Dereference(s0,p0.type.resolved,FALSE);
  8374. END;
  8375. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8376. ReleaseOperand(s0);
  8377. (* ---- RESHAPE ----- *)
  8378. |Global.Reshape:
  8379. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8380. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8381. left.SetType(procedure.type);
  8382. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8383. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8384. END;
  8385. (* ---- SYSTEM.TYPECODE ----- *)
  8386. |Global.systemTypeCode:
  8387. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8388. IF type.resolved IS SyntaxTree.PointerType THEN
  8389. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8390. END;
  8391. result.op := TypeDescriptorAdr(type);
  8392. Convert(result.op, IntermediateCode.GetType(system,x.type));
  8393. result.mode := ModeValue;
  8394. (* ---- SYSTEM.TRACE ----- *)
  8395. |Global.systemTrace:
  8396. SystemTrace(x.parameters, x.position);
  8397. (* ----- CONNECT ------*)
  8398. |Global.Connect:
  8399. IF backend.cellsAreObjects THEN
  8400. PushPort(p0);
  8401. PushPort(p1);
  8402. IF p2 # NIL THEN
  8403. Evaluate(p2, s2);
  8404. Emit(Push(p2.position, s2.op));
  8405. ReleaseOperand(s2);
  8406. ELSE
  8407. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8408. END;
  8409. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8410. ELSE
  8411. Warning(x.position, "cannot run on final hardware");
  8412. END;
  8413. (* ----- DELEGATE ------*)
  8414. |Global.Delegate:
  8415. IF backend.cellsAreObjects THEN
  8416. PushPort(p0);
  8417. PushPort(p1);
  8418. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8419. ELSE
  8420. Warning(x.position, "cannot run on final hardware");
  8421. END;
  8422. (* ----- SEND ------*)
  8423. |Global.Send:
  8424. Evaluate(p0,s0);
  8425. Evaluate(p1,s1);
  8426. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8427. Emit(Push(position,s0.op));
  8428. Emit(Push(position,s1.op));
  8429. (*
  8430. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8431. *)
  8432. IF ~backend.cellsAreObjects THEN
  8433. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8434. END;
  8435. ReleaseOperand(s0);
  8436. ReleaseOperand(s1);
  8437. IF backend.cellsAreObjects THEN
  8438. CallThis(position,"ActiveCellsRuntime","Send",2);
  8439. ELSE
  8440. CallThis(position,ChannelModuleName,"Send",2);
  8441. END;
  8442. (* ----- RECEIVE ------*)
  8443. |Global.Receive:
  8444. Evaluate(p0,s0);
  8445. Emit(Push(position,s0.op));
  8446. Designate(p1,s1);
  8447. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8448. Emit(Push(position,s1.op));
  8449. IF p2 # NIL THEN
  8450. Designate(p2,s2);
  8451. Emit(Push(position,s2.op));
  8452. END;
  8453. (*
  8454. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8455. *)
  8456. IF ~backend.cellsAreObjects THEN
  8457. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8458. END;
  8459. ReleaseOperand(s0);
  8460. ReleaseOperand(s1);
  8461. ReleaseOperand(s2);
  8462. IF backend.cellsAreObjects THEN
  8463. IF p2 = NIL THEN
  8464. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8465. ELSE
  8466. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8467. END;
  8468. ELSE
  8469. IF p2 = NIL THEN
  8470. CallThis(position,ChannelModuleName,"Receive",2)
  8471. ELSE
  8472. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8473. END;
  8474. END;
  8475. | Global.systemSpecial:
  8476. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8477. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8478. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8479. (* determine if parameters are of the VAR kind *)
  8480. ASSERT(x.parameters.Length() <= 3);
  8481. formalParameter := procedureType.firstParameter;
  8482. FOR i := 0 TO x.parameters.Length() - 1 DO
  8483. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8484. formalParameter := formalParameter.nextParameter
  8485. END;
  8486. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8487. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8488. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8489. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8490. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8491. IF procedureType.returnType # NIL THEN
  8492. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8493. Emit(Result(position, res));
  8494. (*InitOperand(result,ModeValue);
  8495. result.op := res;
  8496. *)
  8497. InitOperand(result,ModeValue); result.op := res;
  8498. END
  8499. ELSE (* function not yet implemented *)
  8500. Error(position,"not yet implemented");
  8501. END;
  8502. destination := dest;
  8503. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8504. END VisitBuiltinCallDesignator;
  8505. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  8506. VAR trueL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8507. BEGIN
  8508. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8509. dest := destination; destination := emptyOperand;
  8510. Expression(x.left);
  8511. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8512. ELSIF isUnchecked THEN (* no check *)
  8513. ELSE
  8514. trueL := NewLabel();
  8515. IF IsPointerToRecord(x.left.type,recordType) THEN
  8516. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8517. Emit(Mov(position,tag, result.op));
  8518. IF result.mode # ModeValue THEN
  8519. ptr := tag;
  8520. IntermediateCode.MakeMemory(ptr,addressType);
  8521. Emit(Mov(position,tag, ptr));
  8522. END;
  8523. IF ~backend.cooperative THEN
  8524. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8525. END;
  8526. IntermediateCode.MakeMemory(tag,addressType);
  8527. ELSE
  8528. tag := result.tag;
  8529. UseIntermediateOperand(tag);
  8530. END;
  8531. TypeTest(tag,x.type,trueL,TRUE,FALSE);
  8532. ReleaseIntermediateOperand(tag);
  8533. EmitTrap(position,TypeCheckTrap);
  8534. SetLabel(trueL);
  8535. END;
  8536. destination := dest;
  8537. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8538. END VisitTypeGuardDesignator;
  8539. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8540. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8541. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8542. VAR label: Label; pc: LONGINT;
  8543. BEGIN
  8544. IF backend.cooperative & ~isUnchecked THEN
  8545. pc := section.pc;
  8546. label := NewLabel();
  8547. BrneL(label, operand.op, nil);
  8548. EmitTrap(position, NilPointerTrap);
  8549. SetLabel(label);
  8550. INC(statCoopNilCheck, section.pc - pc);
  8551. END;
  8552. END NilCheck;
  8553. BEGIN
  8554. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8555. ReuseCopy(dereferenced,operand.op);
  8556. ReleaseOperand(operand);
  8557. operand.mode := ModeReference;
  8558. operand.op := dereferenced;
  8559. operand.tag := dereferenced;
  8560. UseIntermediateOperand(operand.tag);
  8561. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8562. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8563. ReleaseIntermediateOperand(operand.tag);
  8564. operand.tag := TypeDescriptorAdr(type);
  8565. ELSE
  8566. IF ~backend.cooperative THEN
  8567. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8568. END;
  8569. IntermediateCode.MakeMemory(operand.tag,addressType);
  8570. END;
  8571. NilCheck(operand.op);
  8572. ELSIF type IS SyntaxTree.ArrayType THEN
  8573. IF isUnsafe THEN
  8574. NilCheck(operand.op);
  8575. ReleaseIntermediateOperand(operand.tag);
  8576. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8577. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8578. ELSE
  8579. operand.tag := emptyOperand;
  8580. END;
  8581. ELSE
  8582. NilCheck(operand.op);
  8583. IF backend.cooperative THEN
  8584. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8585. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8586. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8587. ELSE
  8588. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8589. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8590. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8591. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8592. END;
  8593. END;
  8594. ELSIF type IS SyntaxTree.MathArrayType THEN
  8595. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8596. IntermediateCode.MakeMemory(operand.op,addressType);
  8597. ELSE HALT(100);
  8598. END;
  8599. END Dereference;
  8600. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  8601. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8602. BEGIN
  8603. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8604. dest := destination; destination := emptyOperand;
  8605. Evaluate(x.left,d);
  8606. type := x.type.resolved;
  8607. prevIsUnchecked := isUnchecked;
  8608. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8609. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8610. END;
  8611. Dereference(d,type,IsUnsafePointer(x.left.type));
  8612. isUnchecked := prevIsUnchecked;
  8613. result := d;
  8614. 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
  8615. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8616. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8617. END;
  8618. END;
  8619. destination := dest;
  8620. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8621. END VisitDereferenceDesignator;
  8622. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  8623. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8624. BEGIN
  8625. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8626. dest := destination; destination := emptyOperand;
  8627. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8628. tag := result.op;
  8629. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8630. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8631. StaticCallOperand(result,procedure.super);
  8632. ReleaseIntermediateOperand(result.tag);
  8633. UseIntermediateOperand(tag); (* necessary ? *)
  8634. result.tag := tag;
  8635. destination := dest;
  8636. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8637. END VisitSupercallDesignator;
  8638. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  8639. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8640. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8641. name: Basic.SegmentedName;
  8642. procedure: SyntaxTree.Procedure;
  8643. procedureType: SyntaxTree.ProcedureType;
  8644. BEGIN
  8645. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8646. dest := destination; destination := emptyOperand;
  8647. scope := currentScope;
  8648. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8649. scope := scope.outerScope;
  8650. END;
  8651. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8652. moduleSection := meta.ModuleSection();
  8653. IF backend.cooperative THEN
  8654. moduleOffset := 0;
  8655. ELSE
  8656. moduleOffset := moduleSection.pc;
  8657. END;
  8658. result.mode := ModeValue;
  8659. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8660. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8661. result.mode := ModeValue;
  8662. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8663. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8664. ELSE
  8665. GetBaseRegister(basereg,currentScope,scope);
  8666. InitOperand(result,ModeReference);
  8667. result.op := basereg;
  8668. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8669. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8670. parametersSize := ProcParametersSize(procedure);
  8671. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8672. IF backend.cooperative THEN
  8673. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8674. END;
  8675. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8676. MakeMemory(result.op, result.op, addressType, 0);
  8677. END;
  8678. (* tag must be loaded when dereferencing SELF pointer *)
  8679. END;
  8680. destination := dest;
  8681. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8682. END VisitSelfDesignator;
  8683. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  8684. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8685. BEGIN
  8686. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8687. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8688. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8689. parameter := procedureType.returnParameter;
  8690. IF currentIsInline THEN
  8691. map := currentMapper.Get(NIL);
  8692. IF map # NIL THEN
  8693. Designate(map.to, result);
  8694. ELSE
  8695. HALT(200);
  8696. END;
  8697. RETURN;
  8698. END;
  8699. VisitParameter(parameter);
  8700. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8701. END VisitResultDesignator;
  8702. (** values *)
  8703. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  8704. BEGIN
  8705. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8706. InitOperand(result,ModeValue);
  8707. IF x.value THEN result.op := true ELSE result.op := false END;
  8708. END VisitBooleanValue;
  8709. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8710. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8711. BEGIN
  8712. Global.GetModuleSegmentedName(module.module, name);
  8713. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8714. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8715. RETURN section
  8716. END GetDataSection;
  8717. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8718. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8719. BEGIN
  8720. type := vop.type;
  8721. data := GetDataSection();
  8722. pc := EnterImmediate(data,vop);
  8723. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8724. IntermediateCode.MakeMemory(vop, type);
  8725. END GetImmediateMem;
  8726. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  8727. BEGIN
  8728. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8729. InitOperand(result,ModeValue);
  8730. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8731. IF ~supportedImmediate(result.op) &~inData THEN
  8732. GetImmediateMem(result.op)
  8733. END;
  8734. END VisitIntegerValue;
  8735. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  8736. BEGIN
  8737. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8738. InitOperand(result,ModeValue);
  8739. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8740. END VisitCharacterValue;
  8741. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  8742. BEGIN
  8743. IF Trace THEN TraceEnter("VisitSetValue") END;
  8744. InitOperand(result,ModeValue);
  8745. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  8746. END VisitSetValue;
  8747. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  8748. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8749. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8750. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8751. BEGIN
  8752. numberElements := x.elements.Length();
  8753. FOR i := 0 TO numberElements-1 DO
  8754. expression := x.elements.GetExpression(i);
  8755. IF expression IS SyntaxTree.MathArrayExpression THEN
  8756. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8757. ELSE
  8758. inData := TRUE;
  8759. Evaluate(expression,op);
  8760. irv.Emit(Data(position,op.op));
  8761. inData := FALSE;
  8762. ReleaseOperand(op);
  8763. END;
  8764. END;
  8765. END RecursiveData;
  8766. BEGIN
  8767. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8768. IF ~TryConstantDeclaration() THEN
  8769. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8770. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8771. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8772. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8773. ELSE
  8774. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8775. END;
  8776. RecursiveData(x.array);
  8777. InitOperand(result,ModeReference);
  8778. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8779. END
  8780. END VisitMathArrayValue;
  8781. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8782. VAR constant: Sections.Section;
  8783. BEGIN
  8784. IF constantDeclaration = NIL THEN
  8785. RETURN FALSE
  8786. ELSE
  8787. (* Is a constant in this module: did we generate it already? *)
  8788. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8789. IF constant # NIL THEN
  8790. InitOperand(result,ModeReference);
  8791. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8792. RETURN TRUE;
  8793. END;
  8794. END;
  8795. RETURN FALSE
  8796. END TryConstantDeclaration;
  8797. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  8798. BEGIN
  8799. constantDeclaration := x;
  8800. VExpression(x.value.resolved);
  8801. END VisitConstant;
  8802. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  8803. BEGIN
  8804. IF Trace THEN TraceEnter("VisitRealValue") END;
  8805. InitOperand(result,ModeValue);
  8806. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8807. END VisitRealValue;
  8808. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  8809. VAR
  8810. componentType: SyntaxTree.Type;
  8811. BEGIN
  8812. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8813. ASSERT(x.type IS SyntaxTree.ComplexType);
  8814. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8815. InitOperand(result,ModeValue);
  8816. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8817. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8818. END VisitComplexValue;
  8819. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  8820. VAR i: LONGINT; name: Basic.SegmentedName;
  8821. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8822. BEGIN
  8823. IF Trace THEN TraceEnter("VisitStringValue") END;
  8824. IF ~TryConstantDeclaration() THEN
  8825. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8826. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8827. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8828. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8829. ELSE
  8830. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8831. END;
  8832. FOR i := 0 TO x.length-1 DO
  8833. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8834. irv.Emit(Data(position,op));
  8835. END;
  8836. InitOperand(result,ModeReference);
  8837. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8838. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8839. END
  8840. END VisitStringValue;
  8841. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  8842. BEGIN
  8843. IF Trace THEN TraceEnter("VisitNilValue") END;
  8844. InitOperand(result,ModeValue);
  8845. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8846. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8847. END VisitNilValue;
  8848. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  8849. BEGIN
  8850. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8851. InitOperand(result,ModeValue);
  8852. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8853. END VisitEnumerationValue;
  8854. (** symbols *)
  8855. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  8856. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8857. END VisitImport;
  8858. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8859. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8860. BEGIN
  8861. IF scope # baseScope THEN
  8862. (* left := [fp+8] *)
  8863. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8864. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8865. ReuseCopy(left,right);
  8866. ReleaseIntermediateOperand(right);
  8867. scope := scope.outerScope; DEC(level);
  8868. (* { left := [left+8] } *)
  8869. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8870. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8871. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8872. Emit(Mov(position,left,right));
  8873. scope := scope.outerScope; DEC(level);
  8874. END;
  8875. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8876. result := left;
  8877. ELSE
  8878. result := fp;
  8879. END;
  8880. END GetBaseRegister;
  8881. (* EXPERIMENTAL *)
  8882. PROCEDURE GetAvailability(x: SyntaxTree.Variable): WORD;
  8883. VAR i: WORD;
  8884. BEGIN
  8885. IF ~backend.experiment THEN RETURN -1 END;
  8886. i := 0;
  8887. WHILE (availableSymbols[i].symbol # NIL) & (availableSymbols[i].symbol # x) DO
  8888. INC(i);
  8889. END;
  8890. IF availableSymbols[i].symbol = NIL THEN
  8891. availableSymbols[i].inRegister := FALSE;
  8892. availableSymbols[i].inMemory := TRUE;
  8893. availableSymbols[i].symbol := x;
  8894. END;
  8895. RETURN i;
  8896. END GetAvailability;
  8897. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  8898. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8899. BEGIN
  8900. IF Trace THEN TraceEnter("VisitVariable"); END;
  8901. type := x.type.resolved;
  8902. IF (x.useRegister) THEN
  8903. InitOperand(result, ModeValue);
  8904. IF x.registerNumber < 0 THEN
  8905. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8906. reg := x.registerNumber;
  8907. ELSE
  8908. reg := registerUsageCount.Map(x.registerNumber);
  8909. UseRegister(reg);
  8910. END;
  8911. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8912. ELSIF x.externalName # NIL THEN
  8913. InitOperand(result,ModeReference);
  8914. Basic.ToSegmentedName(x.externalName^, name);
  8915. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8916. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8917. InitOperand(result,ModeReference);
  8918. GetBaseRegister(result.op,currentScope,x.scope);
  8919. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8920. (* EXPERIMENTAL *)
  8921. result.availability := GetAvailability(x);
  8922. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8923. InitOperand(result,ModeReference);
  8924. GetCodeSectionNameForSymbol(x,name);
  8925. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8926. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8927. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8928. InitOperand(result,ModeReference);
  8929. GetCodeSectionNameForSymbol(x,name);
  8930. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8931. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8932. ELSE (* field, left designator must have been emitted *)
  8933. ASSERT(result.mode = ModeReference);
  8934. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8935. ReuseCopy(temp,result.op);
  8936. ReleaseIntermediateOperand(result.op);
  8937. result.op := temp;
  8938. END;
  8939. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8940. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8941. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8942. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8943. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8944. END;
  8945. END;
  8946. END;
  8947. IF type IS SyntaxTree.ProcedureType THEN
  8948. ReleaseIntermediateOperand(result.tag);
  8949. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8950. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8951. UseIntermediateOperand(result.tag);
  8952. ELSE
  8953. result.tag := nil; (* nil *)
  8954. END;
  8955. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8956. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8957. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8958. ReleaseIntermediateOperand(result.tag);
  8959. Global.GetSymbolSegmentedName(x,name);
  8960. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8961. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8962. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8963. ELSE
  8964. END;
  8965. ELSE
  8966. ReleaseIntermediateOperand(result.tag);
  8967. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8968. END;
  8969. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8970. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8971. ReleaseIntermediateOperand(result.tag);
  8972. result.tag := result.op;
  8973. UseIntermediateOperand(result.tag);
  8974. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8975. IntermediateCode.MakeMemory(result.op,addressType);
  8976. END;
  8977. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8978. ReleaseIntermediateOperand(result.tag);
  8979. result.tag := TypeDescriptorAdr(type);
  8980. UseIntermediateOperand(result.tag);
  8981. (* tag for pointer type computed not here but during dereferencing *)
  8982. END;
  8983. IF Trace THEN TraceExit("VisitVariable") END;
  8984. END VisitVariable;
  8985. PROCEDURE VisitProperty*(property: SyntaxTree.Property);
  8986. BEGIN
  8987. VisitVariable(property);
  8988. END VisitProperty;
  8989. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  8990. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; symbol: Sections.Section;
  8991. name: Basic.SegmentedName; ptype: SyntaxTree.Type; temp: IntermediateCode.Operand;
  8992. BEGIN
  8993. type := x.type.resolved;
  8994. IF Trace THEN TraceEnter("VisitParameter") END;
  8995. IF x.ownerType IS SyntaxTree.CellType THEN
  8996. ptype := x.type.resolved;
  8997. IF backend.cellsAreObjects THEN
  8998. ASSERT(result.mode = ModeReference);
  8999. IF result.op.mode = IntermediateCode.ModeMemory THEN
  9000. ReuseCopy(temp,result.op);
  9001. ReleaseIntermediateOperand(result.op);
  9002. result.op := temp;
  9003. END;
  9004. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9005. RETURN;
  9006. ELSE
  9007. InitOperand(result,ModeReference);
  9008. GetCodeSectionNameForSymbol(x,name);
  9009. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9010. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9011. RETURN;
  9012. END;
  9013. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  9014. InitOperand(result,ModeReference);
  9015. GetCodeSectionNameForSymbol(x,name);
  9016. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9017. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9018. RETURN
  9019. ELSE
  9020. GetBaseRegister(basereg,currentScope,x.scope);
  9021. InitOperand(result,ModeReference);
  9022. result.op := basereg;
  9023. END;
  9024. IF IsOpenArray(type) THEN
  9025. result.tag := basereg;
  9026. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9027. IntermediateCode.MakeMemory(result.op,addressType);
  9028. IF Global.IsOberonProcedure(x.ownerType) THEN
  9029. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  9030. UseIntermediateOperand(result.tag);
  9031. ELSE
  9032. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  9033. END;
  9034. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  9035. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9036. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9037. ELSIF IsStaticArray(type) THEN
  9038. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9039. IntermediateCode.MakeMemory(result.op,addressType);
  9040. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9041. ELSIF type IS SyntaxTree.MathArrayType THEN
  9042. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9043. WITH type: SyntaxTree.MathArrayType DO
  9044. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9045. IF type.form = SyntaxTree.Tensor THEN
  9046. ELSIF type.form = SyntaxTree.Open THEN
  9047. result.tag := result.op;
  9048. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9049. IntermediateCode.MakeMemory(result.op,addressType);
  9050. UseIntermediateOperand(result.tag);
  9051. ELSIF type.form = SyntaxTree.Static THEN
  9052. IF x.kind = SyntaxTree.ConstParameter THEN
  9053. IntermediateCode.MakeMemory(result.op,addressType);
  9054. END;
  9055. ELSE HALT(100)
  9056. END;
  9057. ELSIF x.kind = SyntaxTree.VarParameter THEN
  9058. IF type.form = SyntaxTree.Tensor THEN
  9059. ToMemory(result.op,addressType,0);
  9060. ELSIF type.form = SyntaxTree.Open THEN
  9061. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  9062. ReuseCopy(result.tag, mem);
  9063. ReleaseIntermediateOperand(mem);
  9064. ReleaseIntermediateOperand(result.op);
  9065. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9066. ELSIF type.form = SyntaxTree.Static THEN
  9067. IntermediateCode.MakeMemory(result.op,addressType);
  9068. ELSE HALT(100)
  9069. END;
  9070. ELSE HALT(100)
  9071. END;
  9072. END;
  9073. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  9074. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9075. IntermediateCode.MakeMemory(result.op,addressType);
  9076. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9077. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9078. END;
  9079. IF type IS SyntaxTree.ProcedureType THEN
  9080. ReleaseIntermediateOperand(result.tag);
  9081. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  9082. IF x.kind = SyntaxTree.VarParameter THEN
  9083. ReuseCopy(result.tag,result.op);
  9084. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  9085. IntermediateCode.MakeMemory(result.tag,addressType);
  9086. ELSE
  9087. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9088. UseIntermediateOperand(result.tag);
  9089. END;
  9090. ELSE
  9091. result.tag := nil;
  9092. END;
  9093. (* tag for pointer type computed not here but during dereferencing *)
  9094. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  9095. ReleaseIntermediateOperand(result.tag);
  9096. result.tag := basereg;
  9097. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  9098. IntermediateCode.MakeMemory(result.tag,addressType);
  9099. UseIntermediateOperand(result.tag);
  9100. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  9101. ReleaseIntermediateOperand(result.tag);
  9102. result.tag := TypeDescriptorAdr(type);
  9103. UseIntermediateOperand(result.tag);
  9104. END;
  9105. IF Trace THEN TraceExit("VisitParameter") END;
  9106. END VisitParameter;
  9107. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9108. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  9109. BEGIN
  9110. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  9111. (* left.p: left already emitted *)
  9112. tag := result.op; (* value of pointer to left *)
  9113. (* get type desc *)
  9114. tmp := result.tag;
  9115. IntermediateCode.MakeMemory(tmp,addressType);
  9116. (* get method adr *)
  9117. Reuse1(reg,tmp);
  9118. ReleaseIntermediateOperand(tmp);
  9119. IF backend.cooperative THEN
  9120. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9121. WHILE recordType.baseType # NIL DO
  9122. recordType := recordType.GetBaseRecord ();
  9123. END;
  9124. GetRecordTypeName (recordType,name);
  9125. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  9126. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  9127. offset := 0;
  9128. ELSE
  9129. offset := 2;
  9130. END;
  9131. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  9132. ELSIF meta.simple THEN
  9133. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber)))));
  9134. ELSE
  9135. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  9136. END;
  9137. InitOperand(operand,ModeReference);
  9138. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  9139. operand.op := reg;
  9140. operand.tag := tag;
  9141. IF Trace THEN TraceExit("DynamicCallOperand") END;
  9142. END DynamicCallOperand;
  9143. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9144. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  9145. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  9146. BEGIN
  9147. IF Trace THEN TraceEnter("StaticCallOperand") END;
  9148. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  9149. tag := operand.op;
  9150. ReleaseIntermediateOperand(operand.tag);
  9151. ELSE tag := nil
  9152. END;
  9153. IF x.isInline THEN
  9154. sectionType := Sections.InlineCodeSection;
  9155. ELSE
  9156. sectionType := Sections.CodeSection;
  9157. END;
  9158. IF x.externalName # NIL THEN
  9159. Basic.ToSegmentedName(x.externalName^, name);
  9160. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  9161. ELSE
  9162. GetCodeSectionNameForSymbol(x, name);
  9163. IF (x.scope.ownerModule = module.module) THEN
  9164. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9165. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  9166. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9167. IF source.pc = 0 THEN (* no code yet *)
  9168. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  9169. END;
  9170. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  9171. bits := x.procedureScope.body.code.inlineCode;
  9172. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  9173. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  9174. binary.CopyBits(bits, 0, bits.GetSize());
  9175. source.SetResolved(binary);
  9176. ELSE
  9177. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  9178. END;
  9179. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  9180. END;
  9181. InitOperand(operand,ModeValue);
  9182. operand.op := reg;
  9183. operand.tag := tag;
  9184. IF Trace THEN TraceExit("StaticCallOperand") END;
  9185. END StaticCallOperand;
  9186. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  9187. (* handle expressions of the form designator.procedure or procedure *)
  9188. BEGIN
  9189. IF Trace THEN TraceEnter("VisitProcedure") END;
  9190. EndBasicBlock;
  9191. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  9192. DynamicCallOperand(result,x);
  9193. ELSIF x.isInline THEN
  9194. StaticCallOperand(result,x);
  9195. ELSE
  9196. StaticCallOperand(result,x);
  9197. END;
  9198. IF Trace THEN TraceExit("VisitProcedure") END;
  9199. END VisitProcedure;
  9200. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  9201. BEGIN
  9202. VisitProcedure(x);
  9203. END VisitOperator;
  9204. (** statements *)
  9205. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  9206. BEGIN
  9207. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  9208. Expression(x.call);
  9209. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  9210. ReleaseOperand(result)
  9211. END;
  9212. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  9213. END VisitProcedureCallStatement;
  9214. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  9215. VAR leftType, rightType: SyntaxTree.MathArrayType;
  9216. leftBase, rightBase: SyntaxTree.Type;
  9217. procedureName,s: SyntaxTree.IdentifierString;
  9218. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  9219. size: LONGINT; rightKind: LONGINT;
  9220. dummy: IntermediateCode.Operand;
  9221. CONST moduleName = "FoxArrayBase";
  9222. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  9223. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  9224. BEGIN
  9225. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  9226. IF base IS SyntaxTree.MathArrayType THEN
  9227. base := OpenArray(base(SyntaxTree.MathArrayType));
  9228. END;
  9229. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  9230. result.SetArrayBase(base);
  9231. RETURN result
  9232. END OpenArray;
  9233. BEGIN
  9234. IF AddImport(moduleName,arrayBase,TRUE) THEN
  9235. SaveRegisters();ReleaseUsedRegisters(saved);
  9236. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  9237. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  9238. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  9239. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  9240. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  9241. IF leftType.form = SyntaxTree.Tensor THEN
  9242. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  9243. ELSIF leftType.form = SyntaxTree.Open THEN
  9244. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  9245. ELSIF leftType.form = SyntaxTree.Static THEN
  9246. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  9247. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  9248. END;
  9249. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  9250. IF procedure = NIL THEN
  9251. s := "Instruction not supported on target, emulation procedure ";
  9252. Strings.Append(s,moduleName);
  9253. Strings.Append(s,".");
  9254. Strings.Append(s,procedureName);
  9255. Strings.Append(s," not present");
  9256. Error(position,s);
  9257. ELSE
  9258. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  9259. parameter.SetType(leftType);
  9260. parameter.SetAccess(SyntaxTree.Internal);
  9261. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9262. parameter.SetKind(rightKind);
  9263. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9264. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  9265. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  9266. StaticCallOperand(result,procedure);
  9267. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  9268. ReleaseOperand(result);
  9269. END;
  9270. RestoreRegisters(saved);
  9271. END;
  9272. END AssignMathArray;
  9273. VAR modifyAssignmentCounter := 0: LONGINT;
  9274. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  9275. VAR processor,mem,dst: IntermediateCode.Operand;
  9276. BEGIN
  9277. IF value.intValue = true.intValue THEN
  9278. INC(modifyAssignmentCounter);
  9279. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  9280. modifyAssignmentsPC := section.pc;
  9281. ELSE
  9282. DEC(modifyAssignmentCounter);
  9283. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  9284. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  9285. END;
  9286. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  9287. dst := NewRegisterOperand (addressType);
  9288. Emit(Mov(position,dst, processor));
  9289. IntermediateCode.InitMemory(mem,bool, dst, 0);
  9290. Emit(Mov(position,mem, value));
  9291. ReleaseIntermediateOperand(dst);
  9292. END ModifyAssignments;
  9293. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9294. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9295. BEGIN
  9296. type := left.type.resolved;
  9297. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9298. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9299. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9300. IF procedureType.returnParameter = parameter THEN
  9301. (* this is the only case where the destination can be dynamically smaller than the source
  9302. in all other cases the dynamic size has to be taken
  9303. *)
  9304. IF backend.cooperative THEN
  9305. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  9306. ELSE
  9307. MakeMemory(mem, tag, addressType, 0);
  9308. END;
  9309. RETURN mem;
  9310. END;
  9311. END;
  9312. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9313. END CopySize;
  9314. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9315. VAR
  9316. leftO, rightO: Operand;
  9317. arg,mem, sizeOp: IntermediateCode.Operand;
  9318. leftType, rightType, componentType, base: SyntaxTree.Type;
  9319. size: LONGINT;
  9320. parameters: SyntaxTree.ExpressionList;
  9321. procedure: SyntaxTree.Procedure;
  9322. call: SyntaxTree.ProcedureCallDesignator;
  9323. designator: SyntaxTree.Designator;
  9324. saved: RegisterEntry;
  9325. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9326. VAR procedureType: SyntaxTree.ProcedureType;
  9327. BEGIN
  9328. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9329. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9330. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9331. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9332. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9333. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9334. IF right.id = Global.Reshape THEN RETURN TRUE
  9335. END;
  9336. END;
  9337. END;
  9338. END;
  9339. RETURN FALSE
  9340. END CanPassAsResultParameter;
  9341. BEGIN
  9342. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9343. leftType := left.type.resolved; rightType:= right.type.resolved;
  9344. IF backend.cooperative & left.NeedsTrace() THEN
  9345. ModifyAssignments(true);
  9346. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9347. Designate(right, rightO);
  9348. Designate(left, leftO);
  9349. ASSERT(leftO.mode = ModeReference);
  9350. TransferToRegister(leftO.op, leftO.op);
  9351. TransferToRegister(rightO.op, rightO.op);
  9352. Emit(Push(position, leftO.op));
  9353. Emit(Push(position, rightO.op));
  9354. CallAssignMethod(leftO.op, rightO.op, left.type);
  9355. Emit(Pop(position, rightO.op));
  9356. Emit(Pop(position, leftO.op));
  9357. sizeOp := CopySize(left, leftO.tag);
  9358. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9359. ReleaseIntermediateOperand(sizeOp);
  9360. ReleaseOperand(leftO);
  9361. ReleaseOperand(rightO);
  9362. ELSE
  9363. Evaluate(right,rightO);
  9364. Designate(left,leftO);
  9365. ASSERT(leftO.mode = ModeReference);
  9366. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9367. (* copy procedure address first *)
  9368. MakeMemory(mem,leftO.op,addressType,0);
  9369. Emit(Mov(position,mem,rightO.op));
  9370. ReleaseIntermediateOperand(mem);
  9371. (* copy pointer address *)
  9372. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9373. CallAssignPointer(leftO.tag, rightO.tag);
  9374. ELSE
  9375. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9376. CallAssignPointer(leftO.op, rightO.op);
  9377. END;
  9378. ReleaseOperand(leftO);
  9379. ReleaseOperand(rightO);
  9380. END;
  9381. ModifyAssignments(false);
  9382. RETURN;
  9383. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  9384. SaveRegisters();ReleaseUsedRegisters(saved);
  9385. IF SemanticChecker.IsPointerType(leftType) THEN
  9386. Evaluate(right,rightO);
  9387. Designate(left,leftO);
  9388. Emit(Push(position,leftO.op));
  9389. ReleaseOperand(leftO);
  9390. Emit(Push(position,rightO.op));
  9391. ReleaseOperand(rightO);
  9392. CallThis(position,"Heaps","Assign",2);
  9393. ELSIF leftType.IsRecordType() THEN
  9394. Designate(right,rightO);
  9395. Designate(left,leftO);
  9396. Emit(Push(position,leftO.op));
  9397. Emit(Push(position,leftO.tag)); (* type desc *)
  9398. ReleaseOperand(leftO);
  9399. Emit(Push(position,rightO.op));
  9400. ReleaseOperand(rightO);
  9401. CallThis(position,"Heaps","AssignRecord",3);
  9402. ELSIF IsStaticArray(leftType) THEN
  9403. size := StaticArrayNumElements(leftType);
  9404. base := StaticArrayBaseType(leftType);
  9405. Designate(right,rightO);
  9406. Designate(left,leftO);
  9407. Emit(Push(position,leftO.op));
  9408. ReleaseOperand(leftO);
  9409. arg := TypeDescriptorAdr(base);
  9410. Emit(Push(position,arg));
  9411. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9412. Emit(Push(position,rightO.op));
  9413. ReleaseOperand(rightO);
  9414. CallThis(position,"Heaps","AssignArray",4);
  9415. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  9416. size := StaticMathArrayNumElements(leftType);
  9417. base := StaticMathArrayBaseType(leftType);
  9418. Designate(right,rightO);
  9419. Designate(left,leftO);
  9420. Emit(Push(position,leftO.op));
  9421. ReleaseOperand(leftO);
  9422. arg := TypeDescriptorAdr(base);
  9423. Emit(Push(position,arg));
  9424. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9425. Emit(Push(position,rightO.op));
  9426. ReleaseOperand(rightO);
  9427. CallThis(position,"Heaps","AssignArray",4);
  9428. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9429. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9430. Evaluate(right,rightO);
  9431. Designate(left,leftO);
  9432. MakeMemory(mem,leftO.op,addressType,0);
  9433. Emit(Mov(position,mem,rightO.op));
  9434. ReleaseIntermediateOperand(mem);
  9435. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9436. Emit (Push(position, leftO.tag));
  9437. ReleaseOperand(leftO);
  9438. Emit (Push(position, rightO.tag));
  9439. ReleaseOperand(rightO);
  9440. CallThis(position,"Heaps","Assign", 2);
  9441. ELSE HALT(100); (* missing ? *)
  9442. END;
  9443. RestoreRegisters(saved);
  9444. RETURN;
  9445. END;
  9446. IF CanPassAsResultParameter(right) THEN
  9447. procedureResultDesignator := left(SyntaxTree.Designator);
  9448. Expression(right);
  9449. procedureResultDesignator := NIL;
  9450. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9451. (* left <-- ALIAS OF right: zerocopy *)
  9452. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9453. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9454. designator.SetType(procedure.type);
  9455. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9456. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9457. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9458. END;
  9459. ELSIF leftType IS SyntaxTree.RangeType THEN
  9460. (* LHS is of array range type *)
  9461. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9462. Evaluate(right, rightO);
  9463. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9464. (* first *)
  9465. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  9466. Emit(Mov(position,mem, rightO.op));
  9467. ReleaseIntermediateOperand(mem);
  9468. (* last *)
  9469. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9470. Emit(Mov(position,mem, rightO.tag));
  9471. ReleaseIntermediateOperand(mem);
  9472. (* step *)
  9473. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9474. Emit(Mov(position,mem, rightO.extra));
  9475. ReleaseIntermediateOperand(mem);
  9476. ReleaseOperand(rightO);
  9477. ReleaseOperand(leftO)
  9478. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9479. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9480. Evaluate(right, rightO);
  9481. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9482. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9483. (* real part *)
  9484. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9485. Emit(Mov(position,mem, rightO.op));
  9486. ReleaseIntermediateOperand(mem);
  9487. (* imaginary part *)
  9488. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9489. Emit(Mov(position,mem, rightO.tag));
  9490. ReleaseIntermediateOperand(mem);
  9491. ReleaseOperand(rightO);
  9492. ReleaseOperand(leftO)
  9493. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9494. OR (leftType IS SyntaxTree.PortType) THEN
  9495. (* rightO := leftO;*)
  9496. Evaluate(right,rightO);
  9497. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9498. Designate(left,leftO);
  9499. IF leftO.mode = ModeReference THEN
  9500. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9501. destination := mem;
  9502. ELSE
  9503. destination := leftO.op;
  9504. END;
  9505. ReleaseOperand(leftO);
  9506. (* EXPERIMENTAL *)
  9507. IF (leftO.availability >= 0) & (availableSymbols[leftO.availability].inRegister) THEN
  9508. ReleaseIntermediateOperand(destination);
  9509. destination := availableSymbols[leftO.availability].register;
  9510. UseIntermediateOperand(destination);
  9511. availableSymbols[leftO.availability].inMemory := FALSE;
  9512. END;
  9513. IF destination.mode # IntermediateCode.Undefined THEN
  9514. Emit(Mov(position,destination,rightO.op));
  9515. END;
  9516. ReleaseOperand(rightO);
  9517. ReleaseIntermediateOperand(mem);
  9518. IntermediateCode.InitOperand(destination);
  9519. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9520. Evaluate(right,rightO);
  9521. Designate(left,leftO);
  9522. MakeMemory(mem,leftO.op,addressType,0);
  9523. Emit(Mov(position,mem,rightO.op));
  9524. ReleaseIntermediateOperand(mem);
  9525. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9526. (* delegate *)
  9527. (*
  9528. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9529. *)
  9530. Emit(Mov(position,leftO.tag,rightO.tag));
  9531. END;
  9532. ReleaseOperand(leftO);
  9533. ReleaseOperand(rightO);
  9534. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9535. Designate(right,rightO);
  9536. Designate(left,leftO);
  9537. sizeOp := CopySize(left, leftO.tag);
  9538. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9539. ReleaseIntermediateOperand(sizeOp);
  9540. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9541. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9542. IF (rightType IS SyntaxTree.StringType) THEN
  9543. CopyString(left,right);
  9544. 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
  9545. Designate(right,rightO);
  9546. Designate(left,leftO);
  9547. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9548. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9549. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9550. ELSE
  9551. HALT(201)
  9552. END;
  9553. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9554. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9555. Designate(right,rightO);
  9556. Designate(left,leftO);
  9557. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9558. IF IntermediateCode.IsVectorRegister(leftO.op) THEN
  9559. MakeMemory(mem, rightO.op, leftO.op.type,0);
  9560. Emit(Mov(position, leftO.op, mem));
  9561. ReleaseIntermediateOperand(mem);
  9562. ELSE
  9563. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9564. END;
  9565. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9566. ELSE
  9567. AssignMathArray(left,right);
  9568. END;
  9569. ELSE
  9570. HALT(200);
  9571. END;
  9572. END Assign;
  9573. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  9574. BEGIN
  9575. IF Trace THEN TraceEnter("VisitAssignment") END;
  9576. Assign(x.left,x.right);
  9577. IF Trace THEN TraceExit("VisitAssignment") END;
  9578. END VisitAssignment;
  9579. PROCEDURE EmitCooperativeSwitch;
  9580. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9581. BEGIN
  9582. ASSERT (cooperativeSwitches);
  9583. pc := section.pc;
  9584. IF lastSwitchPC = section.pc THEN RETURN END;
  9585. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9586. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9587. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9588. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9589. INC(statCoopSwitch, section.pc - pc);
  9590. END EmitCooperativeSwitch;
  9591. PROCEDURE VisitCommunicationStatement*(communication: SyntaxTree.CommunicationStatement);
  9592. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9593. BEGIN
  9594. p0 := communication.left; p1 := communication.right;
  9595. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9596. Evaluate(p0,s0);
  9597. Evaluate(p1,s1);
  9598. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9599. Emit(Push(position,s0.op));
  9600. Emit(Push(position,s1.op));
  9601. (*
  9602. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9603. *)
  9604. IF ~backend.cellsAreObjects THEN
  9605. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9606. END;
  9607. ReleaseOperand(s0);
  9608. ReleaseOperand(s1);
  9609. IF backend.cellsAreObjects THEN
  9610. CallThis(position,"ActiveCellsRuntime","Send",2);
  9611. ELSE
  9612. CallThis(position,ChannelModuleName,"Send",2);
  9613. END;
  9614. (* ----- RECEIVE ------*)
  9615. ELSE
  9616. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9617. tmp := p0; p0 := p1; p1 := tmp;
  9618. END;
  9619. Evaluate(p0,s0);
  9620. Emit(Push(position,s0.op));
  9621. Designate(p1,s1);
  9622. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9623. Emit(Push(position,s1.op));
  9624. (*
  9625. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9626. *)
  9627. IF ~backend.cellsAreObjects THEN
  9628. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9629. END;
  9630. ReleaseOperand(s0);
  9631. ReleaseOperand(s1);
  9632. IF backend.cellsAreObjects THEN
  9633. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9634. ELSE
  9635. CallThis(position,ChannelModuleName,"Receive",2)
  9636. END;
  9637. END;
  9638. END VisitCommunicationStatement;
  9639. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  9640. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9641. PROCEDURE IfPart(if: SyntaxTree.IfPart; last: BOOLEAN);
  9642. VAR false: Label; condition, value: BOOLEAN;
  9643. BEGIN
  9644. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9645. IF condition THEN
  9646. false := NewLabel();
  9647. Condition(if.condition,false,FALSE);
  9648. StatementSequence(if.statements);
  9649. IF ~last OR (x.elsePart # NIL) THEN BrL(end) END;
  9650. SetLabel(false);
  9651. ELSE
  9652. IF value THEN (* always true *)
  9653. escape := TRUE;
  9654. StatementSequence(if.statements);
  9655. (* no branch necessary -- rest skipped *)
  9656. END;
  9657. END;
  9658. END IfPart;
  9659. BEGIN
  9660. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9661. end := NewLabel();
  9662. elsifs := x.ElsifParts();
  9663. IfPart(x.ifPart,elsifs=0);
  9664. FOR i := 0 TO elsifs-1 DO
  9665. IF ~escape THEN
  9666. elsif := x.GetElsifPart(i);
  9667. IfPart(elsif, i=elsifs-1);
  9668. END;
  9669. END;
  9670. IF (x.elsePart # NIL) & ~escape THEN
  9671. StatementSequence(x.elsePart);
  9672. END;
  9673. SetLabel(end);
  9674. IF Trace THEN TraceExit("VisitIfStatement") END;
  9675. END VisitIfStatement;
  9676. PROCEDURE BrWithPart(CONST tag: IntermediateCode.Operand; x: SyntaxTree.WithPart; VAR trueL: Label);
  9677. VAR reg: IntermediateCode.Operand;
  9678. BEGIN
  9679. trueL := NewLabel();
  9680. IF backend.cooperative THEN
  9681. IntermediateCode.InitRegister(reg,tag.type,tag.registerClass, AcquireRegister(tag.type, tag.registerClass));
  9682. Emit(Mov(position,reg,tag));
  9683. TypeTest(reg, x.type, trueL, TRUE,TRUE);
  9684. ReleaseIntermediateOperand(reg);
  9685. ELSE
  9686. TypeTest(tag, x.type, trueL, TRUE,TRUE);
  9687. END;
  9688. END BrWithPart;
  9689. PROCEDURE EmitWithPart(x: SyntaxTree.WithPart);
  9690. BEGIN
  9691. StatementSequence(x.statements);
  9692. END EmitWithPart;
  9693. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  9694. VAR endL,elseL: Label;i: LONGINT; trueL: POINTER TO ARRAY OF Label; res: Operand; recordType: SyntaxTree.RecordType;
  9695. tag: IntermediateCode.Operand;
  9696. BEGIN
  9697. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9698. endL := NewLabel();
  9699. elseL := NewLabel();
  9700. Designate(x.variable,res);
  9701. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9702. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9703. END;
  9704. ReuseCopy(tag, res.tag);
  9705. ReleaseOperand(res);
  9706. NEW(trueL, x.WithParts());
  9707. FOR i := 0 TO x.WithParts()-1 DO
  9708. BrWithPart(tag, x.GetWithPart(i), trueL[i]);
  9709. END;
  9710. ReleaseIntermediateOperand(tag);
  9711. BrL(elseL);
  9712. FOR i := 0 TO x.WithParts()-1 DO
  9713. SetLabel(trueL[i]);
  9714. EmitWithPart(x.GetWithPart(i));
  9715. BrL(endL);
  9716. END;
  9717. SetLabel(elseL);
  9718. IF x.elsePart = NIL THEN
  9719. IF ~isUnchecked THEN
  9720. EmitTrap(position,WithTrap);
  9721. END;
  9722. ELSE
  9723. StatementSequence(x.elsePart)
  9724. END;
  9725. SetLabel(endL);
  9726. IF Trace THEN TraceExit("VisitWithStatement") END;
  9727. END VisitWithStatement;
  9728. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  9729. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; range, j: Basic.Integer; i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9730. out,else: Label; label: Label;
  9731. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9732. symbol: SyntaxTree.Symbol;
  9733. table: BOOLEAN;
  9734. BEGIN
  9735. (*! split case statement into if-elsif statements for large case label lists *)
  9736. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9737. range := x.max-x.min+1;
  9738. IF (range < 0) OR (range > 1024) & (range DIV x.caseParts.Length() >10) THEN
  9739. (* if case table is larger than 1024 elements and only sparsely used, then do not employ a table *)
  9740. table := FALSE;
  9741. size := x.caseParts.Length();
  9742. ELSE
  9743. table := TRUE;
  9744. size := LONGINT(range);
  9745. END;
  9746. Evaluate(x.variable,var);
  9747. ReuseCopy(tmp,var.op);
  9748. ReleaseIntermediateOperand(var.op);
  9749. var.op := tmp;
  9750. (*
  9751. UniqueId(name,module.module,"case",caseId);
  9752. *)
  9753. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9754. else := NewLabel();
  9755. IF table THEN
  9756. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9757. Convert(var.op,addressType);
  9758. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9759. ReuseCopy(res,var.op);
  9760. ReleaseOperand(var);
  9761. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9762. Global.GetModuleSegmentedName(module.module, name);
  9763. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9764. symbol := SyntaxTree.NewSymbol(name[1]);
  9765. symbol.SetScope(moduleScope);
  9766. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9767. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9768. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9769. Emit(Add(position,res,res,jmp));
  9770. IntermediateCode.MakeMemory(res,addressType);
  9771. Emit(Br(position,res));
  9772. ReleaseIntermediateOperand(res);
  9773. ELSE
  9774. ReuseCopy(res,var.op); (* make sure it is in a register *)
  9775. ReleaseOperand(var);
  9776. BrltL(else,res,IntermediateCode.Immediate(res.type,x.min));
  9777. BrltL(else,IntermediateCode.Immediate(res.type,x.max),res);
  9778. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9779. part := x.GetCasePart(i);
  9780. constant := part.firstConstant;
  9781. fixups[i] := NewLabel();
  9782. WHILE(constant # NIL) DO (* case labels for this case part *)
  9783. IF constant.min = constant.max THEN
  9784. BreqL(fixups[i], res,IntermediateCode.Immediate(res.type,constant.min));
  9785. ELSE
  9786. label := NewLabel();
  9787. BrltL(label, res, IntermediateCode.Immediate(res.type,constant.min));
  9788. BrltL(label, IntermediateCode.Immediate(res.type,constant.max),res);
  9789. BrL(fixups[i]);
  9790. SetLabel(label);
  9791. END;
  9792. constant := constant.next;
  9793. END;
  9794. END;
  9795. BrL(else);
  9796. ReleaseIntermediateOperand(res);
  9797. END;
  9798. out := NewLabel();
  9799. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9800. part := x.GetCasePart(i);
  9801. constant := part.firstConstant;
  9802. IF table THEN
  9803. label := NewLabel();
  9804. SetLabel(label);
  9805. WHILE(constant # NIL) DO (* case labels for this case part *)
  9806. FOR j := constant.min TO constant.max DO
  9807. fixups[j-x.min] := label;
  9808. END;
  9809. constant := constant.next;
  9810. END;
  9811. ELSE
  9812. SetLabel(fixups[i]);
  9813. END;
  9814. StatementSequence(part.statements);
  9815. BrL(out);
  9816. END;
  9817. SetLabel(else);
  9818. FOR i := 0 TO size-1 DO
  9819. IF fixups[i] = NIL THEN
  9820. fixups[i] := else;
  9821. END;
  9822. END;
  9823. IF x.elsePart # NIL THEN
  9824. StatementSequence(x.elsePart);
  9825. ELSIF ~isUnchecked THEN
  9826. EmitTrap(position,CaseTrap);
  9827. END;
  9828. SetLabel(out);
  9829. IF table THEN
  9830. FOR i := 0 TO size-1 DO
  9831. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9832. section.Emit(Data(position,op));
  9833. END;
  9834. END;
  9835. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9836. END VisitCaseStatement;
  9837. PROCEDURE VisitWhileStatement*(x: SyntaxTree.WhileStatement);
  9838. VAR startL,falseL: Label;
  9839. BEGIN
  9840. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9841. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9842. startL := NewLabel();
  9843. falseL := NewLabel();
  9844. SetLabel(startL);
  9845. Condition(x.condition,falseL,FALSE);
  9846. StatementSequence(x.statements);
  9847. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9848. BrL(startL);
  9849. SetLabel(falseL);
  9850. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9851. END VisitWhileStatement;
  9852. PROCEDURE VisitRepeatStatement*(x: SyntaxTree.RepeatStatement);
  9853. VAR falseL: Label;
  9854. BEGIN
  9855. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9856. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9857. falseL := NewLabel();
  9858. SetLabel(falseL);
  9859. StatementSequence(x.statements);
  9860. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9861. Condition(x.condition,falseL,FALSE);
  9862. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9863. END VisitRepeatStatement;
  9864. PROCEDURE VisitForStatement*(x: SyntaxTree.ForStatement);
  9865. VAR
  9866. binary: SyntaxTree.BinaryExpression; startL,falseL : Label; cmp: LONGINT; by: HUGEINT;
  9867. temporaryVariable: SyntaxTree.Variable;
  9868. temporaryVariableDesignator : SyntaxTree.Designator;
  9869. BEGIN
  9870. IF Trace THEN TraceEnter("VisitForStatement") END;
  9871. falseL := NewLabel();
  9872. startL := NewLabel();
  9873. Assign(x.variable,x.from);
  9874. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9875. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9876. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9877. Assign(temporaryVariableDesignator,x.to);
  9878. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).value END;
  9879. IF by > 0 THEN
  9880. cmp := Scanner.LessEqual
  9881. ELSE
  9882. cmp := Scanner.GreaterEqual
  9883. END;
  9884. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9885. binary.SetType(system.booleanType);
  9886. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9887. SetLabel(startL);
  9888. Condition(binary,falseL, FALSE);
  9889. StatementSequence(x.statements);
  9890. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9891. binary.SetType(x.variable.type);
  9892. Assign(x.variable,binary);
  9893. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9894. BrL(startL);
  9895. SetLabel(falseL);
  9896. IF Trace THEN TraceExit("VisitForStatement") END;
  9897. END VisitForStatement;
  9898. PROCEDURE VisitExitableBlock*(x: SyntaxTree.ExitableBlock);
  9899. VAR prevLoop: Label;
  9900. BEGIN
  9901. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9902. prevLoop := currentLoop;
  9903. currentLoop := NewLabel();
  9904. StatementSequence(x.statements);
  9905. SetLabel(currentLoop);
  9906. currentLoop := prevLoop;
  9907. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9908. END VisitExitableBlock;
  9909. PROCEDURE VisitLoopStatement*(x: SyntaxTree.LoopStatement);
  9910. VAR prevLoop,start: Label;
  9911. BEGIN
  9912. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9913. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9914. start := NewLabel();
  9915. prevLoop := currentLoop;
  9916. SetLabel(start);
  9917. currentLoop := NewLabel();
  9918. StatementSequence(x.statements);
  9919. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9920. BrL(start);
  9921. SetLabel(currentLoop);
  9922. currentLoop := prevLoop;
  9923. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9924. END VisitLoopStatement;
  9925. PROCEDURE VisitExitStatement*(x: SyntaxTree.ExitStatement);
  9926. VAR outer: SyntaxTree.Statement;
  9927. BEGIN
  9928. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9929. IF locked THEN (* r if we jump out of an exclusive block *)
  9930. outer := x.outer;
  9931. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9932. outer := outer.outer;
  9933. END;
  9934. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9935. Lock(FALSE);
  9936. END;
  9937. END;
  9938. BrL(currentLoop);
  9939. IF Trace THEN TraceExit("VisitExitStatement") END;
  9940. END VisitExitStatement;
  9941. PROCEDURE VisitReturnStatement*(x: SyntaxTree.ReturnStatement);
  9942. VAR
  9943. expression, parameterDesignator: SyntaxTree.Expression;
  9944. type, componentType: SyntaxTree.Type;
  9945. res, right: Operand;
  9946. left, mem, reg: IntermediateCode.Operand;
  9947. parameter: SyntaxTree.Parameter;
  9948. procedure: SyntaxTree.Procedure;
  9949. procedureType: SyntaxTree.ProcedureType;
  9950. returnTypeOffset: LONGINT;
  9951. delegate: BOOLEAN;
  9952. map: SymbolMap;
  9953. callingConvention, parametersSize: LONGINT;
  9954. BEGIN
  9955. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9956. expression := x.returnValue;
  9957. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9958. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9959. IF currentIsInline THEN
  9960. IF expression # NIL THEN
  9961. map := currentMapper.Get(NIL);
  9962. IF map # NIL THEN
  9963. Assign(map.to, expression);
  9964. ELSE
  9965. Evaluate(expression,res);
  9966. Emit(Return(position,res.op));
  9967. ReleaseOperand(res);
  9968. END;
  9969. END;
  9970. BrL(currentInlineExit);
  9971. RETURN;
  9972. END;
  9973. IF expression # NIL THEN
  9974. type := expression.type.resolved;
  9975. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9976. IF locked THEN Lock(FALSE) END;
  9977. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9978. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9979. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9980. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (type IS SyntaxTree.EnumerationType) OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9981. (* return without structured return parameter *)
  9982. Evaluate(expression,res);
  9983. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9984. IF locked OR profile THEN
  9985. Emit(Push(position,res.op));
  9986. IF delegate THEN HALT(200) END;
  9987. ReleaseOperand(res);
  9988. IF locked THEN Lock(FALSE) END;
  9989. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9990. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9991. reg := NewRegisterOperand(res.op.type);
  9992. Emit(Pop(position,reg));
  9993. Emit(Return(position,reg));
  9994. ReleaseIntermediateOperand(reg);
  9995. ELSE
  9996. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9997. Emit(Return(position,res.op));
  9998. ReleaseOperand(res);
  9999. END;
  10000. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  10001. THEN
  10002. (* return using structured return parameter *)
  10003. 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)
  10004. OR SemanticChecker.IsPointerType(type));
  10005. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  10006. parameter :=procedureType.returnParameter;
  10007. ASSERT(parameter # NIL);
  10008. returnTypeOffset := parameter.offsetInBits;
  10009. (*
  10010. IF parameter# NIL THEN
  10011. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  10012. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  10013. ELSE
  10014. returnTypeOffset := system.offsetFirstParameter
  10015. END;
  10016. *)
  10017. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  10018. IF type IS SyntaxTree.RangeType THEN
  10019. (* array range type *)
  10020. Evaluate(expression, right);
  10021. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  10022. Emit(Mov(position,mem, right.op)); (* first *)
  10023. ReleaseIntermediateOperand(mem);
  10024. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10025. Emit(Mov(position,mem, right.tag)); (* last *)
  10026. ReleaseIntermediateOperand(mem);
  10027. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10028. Emit(Mov(position,mem, right.extra)); (* step *)
  10029. ReleaseIntermediateOperand(mem);
  10030. ReleaseOperand(right);
  10031. ELSIF type IS SyntaxTree.ComplexType THEN
  10032. Evaluate(expression, right);
  10033. componentType := type(SyntaxTree.ComplexType).componentType;
  10034. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  10035. Emit(Mov(position,mem, right.op)); (* real part *)
  10036. ReleaseIntermediateOperand(mem);
  10037. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  10038. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  10039. ReleaseIntermediateOperand(mem);
  10040. ReleaseOperand(right);
  10041. ELSE (* covers cases: pointer / record / array *)
  10042. parameter := procedureType.returnParameter;
  10043. checker.SetCurrentScope(currentScope);
  10044. ASSERT(parameter # NIL);
  10045. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  10046. Assign(parameterDesignator,expression);
  10047. END;
  10048. ReleaseIntermediateOperand(left);
  10049. IF locked THEN Lock(FALSE) END;
  10050. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10051. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10052. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  10053. parameter := procedureType.returnParameter;
  10054. checker.SetCurrentScope(currentScope);
  10055. IF parameter = NIL THEN
  10056. Error(procedure.position, "structured return of parameter of procedure not found");
  10057. ELSE
  10058. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  10059. Assign(parameterDesignator,expression);
  10060. END;
  10061. IF locked THEN Lock(FALSE) END;
  10062. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10063. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10064. ELSE
  10065. HALT(200);
  10066. END;
  10067. ELSE
  10068. IF locked THEN Lock(FALSE) END;
  10069. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10070. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10071. END;
  10072. IF backend.cooperative THEN
  10073. BrL(exitLabel);
  10074. ELSE
  10075. callingConvention := procedureType.callingConvention;
  10076. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10077. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10078. ELSE
  10079. parametersSize := 0;
  10080. END;
  10081. EmitLeave(section, position,procedure, callingConvention);
  10082. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10083. END;
  10084. IF Trace THEN TraceExit("VisitReturnStatement") END;
  10085. END VisitReturnStatement;
  10086. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  10087. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  10088. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  10089. statements: SyntaxTree.StatementSequence;
  10090. name, suffix: SyntaxTree.IdentifierString;
  10091. BEGIN
  10092. Strings.IntToStr(awaitProcCounter,suffix);
  10093. Strings.Concat("@AwaitProcedure",suffix,name);
  10094. identifier := SyntaxTree.NewIdentifier(name);
  10095. INC(awaitProcCounter);
  10096. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  10097. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  10098. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  10099. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  10100. procedure.SetAccess(SyntaxTree.Hidden);
  10101. procedure.SetScope(currentScope);
  10102. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  10103. procedureType.SetReturnType(system.booleanType);
  10104. procedure.SetType(procedureType);
  10105. body := SyntaxTree.NewBody(x.position,procedureScope);
  10106. procedureScope.SetBody(body);
  10107. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  10108. returnStatement.SetReturnValue(x.condition);
  10109. statements := SyntaxTree.NewStatementSequence();
  10110. statements.AddStatement(returnStatement);
  10111. body.SetStatementSequence(statements);
  10112. currentScope.AddProcedure(procedure);
  10113. RETURN procedure
  10114. END MakeAwaitProcedure;
  10115. PROCEDURE VisitAwaitStatement*(x: SyntaxTree.AwaitStatement);
  10116. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  10117. call: IntermediateCode.Operand; label, startL, trueL, falseL: Label; name: Basic.SegmentedName;
  10118. BEGIN
  10119. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  10120. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10121. IF backend.cooperative THEN
  10122. startL := NewLabel();
  10123. trueL := NewLabel();
  10124. SetLabel(startL);
  10125. Condition(x.condition,trueL,TRUE);
  10126. PushSelfPointer();
  10127. CallThis(position,"ExclusiveBlocks","Await",1);
  10128. BrL(startL);
  10129. SetLabel(trueL);
  10130. PushSelfPointer();
  10131. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  10132. ELSE
  10133. proc := MakeAwaitProcedure(x);
  10134. Emit(Push(position,fp));
  10135. GetCodeSectionNameForSymbol(proc,name);
  10136. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10137. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  10138. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  10139. Emit(Call(position,call,ProcParametersSize(proc)));
  10140. Emit(Result(position,res));
  10141. (*
  10142. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10143. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10144. *)
  10145. InitOperand(result,ModeValue);
  10146. result.op := res;
  10147. label := NewLabel();
  10148. BreqL(label, result.op, SELF.true);
  10149. ReleaseOperand(result);
  10150. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10151. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  10152. Emit(Push(position,res));
  10153. Emit(Push(position,fp));
  10154. PushSelfPointer();
  10155. Emit(Push(position,nil));
  10156. CallThis(position,"Objects","Await",4);
  10157. SetLabel(label);
  10158. END;
  10159. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10160. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  10161. END VisitAwaitStatement;
  10162. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  10163. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  10164. BEGIN
  10165. FOR i := 0 TO x.Length() - 1 DO
  10166. statement := x.GetStatement( i );
  10167. Statement(statement);
  10168. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  10169. END;
  10170. END StatementSequence;
  10171. PROCEDURE PushSelfPointer;
  10172. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  10173. procedureType: SyntaxTree.ProcedureType;
  10174. BEGIN
  10175. scope := currentScope;
  10176. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  10177. scope := scope.outerScope;
  10178. END;
  10179. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  10180. moduleSection := meta.ModuleSection();
  10181. IF backend.cooperative THEN
  10182. moduleOffset := 0;
  10183. ELSE
  10184. moduleOffset := moduleSection.pc;
  10185. END;
  10186. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  10187. ELSE
  10188. GetBaseRegister(op.op,currentScope,scope);
  10189. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10190. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10191. parametersSize := ProcParametersSize(procedure);
  10192. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  10193. IF backend.cooperative THEN
  10194. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  10195. END;
  10196. IntermediateCode.MakeMemory(op.op,addressType);
  10197. END;
  10198. Emit(Push(position,op.op));
  10199. ReleaseOperand(op);
  10200. END PushSelfPointer;
  10201. PROCEDURE Lock(lock: BOOLEAN);
  10202. BEGIN
  10203. IF Trace THEN TraceEnter("Lock") END;
  10204. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10205. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  10206. ASSERT(modifyAssignmentCounter = 0);
  10207. IF dump # NIL THEN
  10208. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  10209. dump.Ln;dump.Update;
  10210. END;
  10211. PushSelfPointer;
  10212. IF backend.cooperative THEN
  10213. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  10214. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  10215. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  10216. END;
  10217. ELSE
  10218. Emit(Push(position,true));
  10219. IF lock THEN CallThis(position,"Objects","Lock",2)
  10220. ELSE CallThis(position,"Objects","Unlock",2);
  10221. END;
  10222. END;
  10223. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10224. IF Trace THEN TraceExit("Lock") END;
  10225. END Lock;
  10226. PROCEDURE VisitStatementBlock*(x: SyntaxTree.StatementBlock);
  10227. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN; end: Label;
  10228. BEGIN
  10229. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  10230. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10231. previouslyUnchecked := isUnchecked;
  10232. isUnchecked := isUnchecked OR x.isUnchecked;
  10233. previouslyCooperativeSwitches := cooperativeSwitches;
  10234. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  10235. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  10236. IF x.statements # NIL THEN
  10237. StatementSequence(x.statements);
  10238. END;
  10239. IF (x IS SyntaxTree.Body) THEN
  10240. IF (x(SyntaxTree.Body).finally # NIL) THEN
  10241. section.SetFinally(section.pc);
  10242. StatementSequence(x(SyntaxTree.Body).finally)
  10243. ELSIF x.isExclusive THEN
  10244. end := NewLabel();
  10245. BrL(end);
  10246. section.SetFinally(section.pc);
  10247. Lock(FALSE);
  10248. EmitTrap(position,RethrowTrap);
  10249. SetLabel(end);
  10250. END;
  10251. END;
  10252. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  10253. isUnchecked := previouslyUnchecked;
  10254. cooperativeSwitches := previouslyCooperativeSwitches;
  10255. IF Trace THEN TraceExit("VisitStatementBlock") END;
  10256. END VisitStatementBlock;
  10257. PROCEDURE VisitCode*(x: SyntaxTree.Code);
  10258. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  10259. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  10260. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  10261. procedure: SyntaxTree.Procedure;
  10262. map: SymbolMap;
  10263. callingConvention, parametersSize: LONGINT;
  10264. BEGIN
  10265. scope := currentScope;
  10266. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  10267. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10268. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10269. return := emptyOperand;
  10270. IF Trace THEN TraceEnter("VisitCode") END;
  10271. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  10272. NEW(in, x.inRules.Length());
  10273. FOR i := 0 TO LEN(in)-1 DO
  10274. statement := x.inRules.GetStatement(i);
  10275. WITH statement: SyntaxTree.Assignment DO
  10276. Evaluate(statement.right, operand);
  10277. result := operand.op;
  10278. NEW(str, 64);
  10279. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  10280. in[i] := result; IntermediateCode.SetString(in[i], str);
  10281. ReleaseIntermediateOperand(operand.tag);
  10282. END;
  10283. END;
  10284. ELSE in := NIL
  10285. END;
  10286. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  10287. NEW(out, x.outRules.Length());
  10288. FOR i := 0 TO LEN(out)-1 DO
  10289. statement := x.outRules.GetStatement(i);
  10290. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  10291. WITH statement:
  10292. SyntaxTree.Assignment DO
  10293. Designate(statement.left, operand);
  10294. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  10295. NEW(str, 64);
  10296. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  10297. out[i] := result; IntermediateCode.SetString(out[i], str);
  10298. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  10299. | SyntaxTree.ReturnStatement DO
  10300. NEW(str, 64);
  10301. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  10302. IF currentIsInline THEN
  10303. map := currentMapper.Get(NIL);
  10304. Designate(map.to, operand);
  10305. IF map.isAddress THEN
  10306. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10307. ELSE
  10308. result := operand.op;
  10309. END;
  10310. (*! only if it does not fit into register
  10311. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10312. *)
  10313. (*Evaluate(map.to, operand);*)
  10314. out[i] := result;
  10315. ELSE
  10316. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  10317. END;
  10318. IntermediateCode.SetString(out[i], str);
  10319. ReleaseIntermediateOperand(operand.tag);
  10320. return := out[i];
  10321. ELSE
  10322. END;
  10323. END;
  10324. ELSE out := NIL
  10325. END;
  10326. Emit(Asm(x.position,x.sourceCode, in, out));
  10327. IF in # NIL THEN
  10328. FOR i := 0 TO LEN(in)-1 DO
  10329. ReleaseIntermediateOperand(in[i]);
  10330. END;
  10331. END;
  10332. IF out # NIL THEN
  10333. FOR i := 0 TO LEN(out)-1 DO
  10334. WITH statement:
  10335. SyntaxTree.Assignment DO
  10336. ReleaseIntermediateOperand(out[i]);
  10337. |SyntaxTree.ReturnStatement DO
  10338. (* release happens below *)
  10339. ELSE
  10340. END;
  10341. statement := x.outRules.GetStatement(i);
  10342. END;
  10343. END;
  10344. IF return.mode # IntermediateCode.Undefined THEN
  10345. IF currentIsInline THEN
  10346. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  10347. Symbol(procedureType.returnParameter, par);
  10348. MakeMemory(mem, par.op, return.type, 0);
  10349. ReleaseOperand(par);
  10350. Emit(Mov(position, mem, return));
  10351. ReleaseIntermediateOperand(mem);
  10352. ELSE
  10353. Emit(Return(position,return));
  10354. END;
  10355. ReleaseIntermediateOperand(return);
  10356. IF currentIsInline THEN RETURN END;
  10357. callingConvention := procedureType(SyntaxTree.ProcedureType).callingConvention;
  10358. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10359. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10360. ELSE
  10361. parametersSize := 0;
  10362. END;
  10363. EmitLeave(section, position,procedure, callingConvention);
  10364. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10365. END;
  10366. IF Trace THEN TraceExit("VisitCode") END;
  10367. END VisitCode;
  10368. PROCEDURE ProcParametersSize(procedure: SyntaxTree.Procedure): LONGINT;
  10369. BEGIN
  10370. RETURN ProcedureParametersSize(system, procedure);
  10371. END ProcParametersSize;
  10372. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  10373. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  10374. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  10375. const, call: IntermediateCode.Operand;
  10376. parameterDesignator: SyntaxTree.Expression;
  10377. saved: RegisterEntry;
  10378. name: Basic.SegmentedName;
  10379. BEGIN
  10380. IF Trace THEN TraceEnter("ParameterCopies") END;
  10381. parameter := x.firstParameter;
  10382. WHILE parameter # NIL DO
  10383. IF parameter.kind = SyntaxTree.ValueParameter THEN
  10384. type := parameter.type.resolved;
  10385. IF IsOpenArray(type) THEN
  10386. VisitParameter(parameter);
  10387. op := result;
  10388. IF backend.cooperative & parameter.NeedsTrace() THEN
  10389. length := GetArrayLength(type, op.tag);
  10390. size := NewRegisterOperand(addressType);
  10391. base := ArrayBaseType(type);
  10392. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10393. Emit(Mul(position, size, length, const));
  10394. dst := NewRegisterOperand (addressType);
  10395. Emit(Mov(position, dst, size));
  10396. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10397. Emit(Sub(position,dst,sp,dst));
  10398. Emit(And(position,dst,dst,const));
  10399. Emit(Mov(position,sp,dst));
  10400. par := fp;
  10401. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10402. IntermediateCode.InitImmediate(null, byteType, 0);
  10403. Emit(Fill(position, dst, size, null));
  10404. ReleaseIntermediateOperand(dst);
  10405. ReleaseIntermediateOperand(length);
  10406. SaveRegisters();ReleaseUsedRegisters(saved);
  10407. (* register dst has been freed before SaveRegisters already *)
  10408. base := ArrayBaseType(type);
  10409. (* assign method of open array *)
  10410. IF base.IsRecordType() THEN
  10411. Emit (Push(position, length));
  10412. Emit (Push(position, dst));
  10413. Emit (Push(position, op.op));
  10414. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10415. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10416. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10417. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10418. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10419. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10420. Emit (Push(position,length));
  10421. Emit (Push(position, dst));
  10422. Emit (Push(position, length));
  10423. Emit (Push(position, op.op));
  10424. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10425. ELSE
  10426. Emit (Push(position, length));
  10427. Emit (Push(position, dst));
  10428. Emit (Push(position, length));
  10429. Emit (Push(position, op.op));
  10430. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10431. ASSERT(ArrayBaseType(type).IsPointer());
  10432. END;
  10433. RestoreRegisters(saved);
  10434. ELSE
  10435. temp := GetDynamicSize(type,op.tag);
  10436. ReuseCopy(size,temp);
  10437. ReleaseIntermediateOperand(temp);
  10438. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10439. Emit(Sub(position,size,sp,size));
  10440. Emit(And(position,size,size,const));
  10441. Emit(Mov(position,sp,size));
  10442. par := fp;
  10443. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10444. ReleaseIntermediateOperand(size);
  10445. size := GetDynamicSize(type,op.tag);
  10446. END;
  10447. Emit(Copy(position,sp,op.op,size));
  10448. ReleaseIntermediateOperand(size);
  10449. ReleaseOperand(op);
  10450. IntermediateCode.MakeMemory(par,addressType);
  10451. Emit(Mov(position,par,sp));
  10452. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10453. checker.SetCurrentScope(currentScope);
  10454. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10455. Assign(parameterDesignator,parameterDesignator);
  10456. END;
  10457. END;
  10458. parameter := parameter.nextParameter;
  10459. END;
  10460. IF Trace THEN TraceExit("ParameterCopies") END;
  10461. END ParameterCopies;
  10462. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10463. VAR x: SyntaxTree.Variable;
  10464. BEGIN
  10465. x := scope.firstVariable;
  10466. WHILE x # NIL DO
  10467. InitVariable(x,FALSE);
  10468. x := x.nextVariable;
  10469. END;
  10470. END InitVariables;
  10471. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10472. BEGIN
  10473. IF (symbol # NIL) THEN
  10474. RETURN fingerPrinter.SymbolFP(symbol).public
  10475. ELSE
  10476. RETURN 0
  10477. END;
  10478. END GetFingerprint;
  10479. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10480. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10481. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10482. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10483. name: Basic.SegmentedName;
  10484. offset: LONGINT;
  10485. BEGIN
  10486. IF Trace THEN TraceEnter("Body") END;
  10487. ReleaseUsedRegisters(saved); (* just in case ... *)
  10488. section := ir;
  10489. exitLabel := NewLabel ();
  10490. IF moduleBody THEN moduleBodySection := section END;
  10491. IF ir.comments # NIL THEN
  10492. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10493. commentPrintout.SingleStatement(TRUE);
  10494. dump := ir.comments;
  10495. ELSE
  10496. commentPrintout := NIL;
  10497. dump := NIL;
  10498. END;
  10499. prevScope := currentScope;
  10500. currentScope := scope;
  10501. lastSwitchPC := 0;
  10502. cooperativeSwitches := backend.cooperative;
  10503. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10504. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10505. IF x # NIL THEN
  10506. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10507. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10508. IF moduleBody THEN
  10509. ProfilerInit();
  10510. ELSE
  10511. Basic.SegmentedNameToString(ir.name, string);
  10512. ProfilerAddProcedure(numberProcedures,string);
  10513. ProfilerEnterExit(numberProcedures,TRUE);
  10514. END;
  10515. END;
  10516. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10517. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10518. END;
  10519. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10520. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10521. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10522. IF procedure = cellScope.bodyProcedure THEN
  10523. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10524. StaticCallOperand(op, cellScope.constructor);
  10525. Emit(Call(position,op.op,0));
  10526. END;
  10527. END;
  10528. END;
  10529. InitVariables(scope);
  10530. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10531. GetCodeSectionNameForSymbol(procedure, name);
  10532. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10533. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10534. IF ProtectModulesPointers THEN
  10535. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10536. ELSE
  10537. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10538. END;
  10539. IntermediateCode.SetOffset(right,offset); (* tag *)
  10540. IntermediateCode.InitMemory(left,addressType,fp,0);
  10541. Emit(Mov(position, left, right));
  10542. END;
  10543. IF HasPointers (procedure.procedureScope) & backend.writeBarriers THEN ResetVariables2(procedure.procedureScope,TRUE) END;
  10544. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10545. ParameterCopies(procedureType);
  10546. IF x.code = NIL THEN
  10547. VisitStatementBlock(x);
  10548. ELSE
  10549. VisitCode(x.code)
  10550. END;
  10551. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10552. IF ~backend.cooperative THEN
  10553. ProfilerEnterExit(numberProcedures,FALSE);
  10554. END;
  10555. INC(numberProcedures);
  10556. END;
  10557. END;
  10558. IF backend.cooperative THEN
  10559. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10560. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10561. END;
  10562. IF x # NIL THEN
  10563. SELF.position := x.position;
  10564. END;
  10565. EndBasicBlock;
  10566. CheckRegistersFree();
  10567. ASSERT(modifyAssignmentCounter = 0);
  10568. currentScope := prevScope;
  10569. IF Trace THEN TraceExit("Body") END;
  10570. END Body;
  10571. END ImplementationVisitor;
  10572. MetaDataGenerator=OBJECT
  10573. VAR
  10574. implementationVisitor: ImplementationVisitor;
  10575. declarationVisitor: DeclarationVisitor;
  10576. module: Sections.Module;
  10577. moduleName: ARRAY 128 OF CHAR;
  10578. moduleNamePool: Basic.HashTableInt;
  10579. moduleNamePoolSection: IntermediateCode.Section;
  10580. modulePointerSection: IntermediateCode.Section;
  10581. modulePointerSizePC: LONGINT;
  10582. modulePointerSectionOffset: LONGINT;
  10583. modulePointers: LONGINT;
  10584. simple: BOOLEAN; (* simple = no module loading, no reflection *)
  10585. RecordBaseOffset: LONGINT;
  10586. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10587. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10588. TypeTags: LONGINT; (* type extension level support *)
  10589. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10590. patchInfoPC: LONGINT;
  10591. patchCRC: LONGINT;
  10592. CONST
  10593. EmptyBlockOffset = 2;
  10594. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10595. BEGIN
  10596. IF implementationVisitor.backend.cooperative THEN
  10597. TypeTags := MAX(LONGINT);
  10598. BaseTypesTableOffset := 0;
  10599. MethodTableOffset := 2;
  10600. TypeRecordBaseOffset := 0;
  10601. RecordBaseOffset := 0;
  10602. ELSIF simple THEN
  10603. TypeTags := 3; (* only 3 extensions allowed *)
  10604. BaseTypesTableOffset := 1;
  10605. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10606. TypeRecordBaseOffset := 0;
  10607. RecordBaseOffset := 1;
  10608. ELSE
  10609. TypeTags := 16;
  10610. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10611. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10612. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10613. (* change this when Heaps.HeapBlock is modified *)
  10614. IF implementationVisitor.system.addressType.sizeInBits = 64 THEN
  10615. RecordBaseOffset := 8; (* addresses *)
  10616. ELSE
  10617. RecordBaseOffset := 9; (* addresses *)
  10618. END;
  10619. END;
  10620. SELF.simple := simple;
  10621. SELF.implementationVisitor := implementationVisitor;
  10622. SELF.declarationVisitor := declarationVisitor;
  10623. implementationVisitor.meta := SELF;
  10624. declarationVisitor.meta := SELF;
  10625. END InitMetaDataGenerator;
  10626. PROCEDURE SetModule(module: Sections.Module);
  10627. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10628. BEGIN
  10629. SELF.module := module;
  10630. Global.GetModuleName(module.module,moduleName);
  10631. Global.GetSymbolSegmentedName(module.module, name);
  10632. IF ReflectionSupport & ~simple & ~implementationVisitor.backend.cooperative THEN
  10633. NEW(moduleNamePool, 32);
  10634. (*! require GC protection *)
  10635. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10636. IF ProtectModulesPointers THEN
  10637. name := "Heaps.AnyPtr";
  10638. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10639. (* set base pointer *)
  10640. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10641. END;
  10642. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10643. modulePointers := 0;
  10644. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10645. AddPointer(moduleNamePoolSection, namePoolOffset);
  10646. END;
  10647. END SetModule;
  10648. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10649. BEGIN
  10650. IF ~implementationVisitor.backend.cooperative THEN
  10651. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  10652. INC(modulePointers);
  10653. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10654. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10655. END;
  10656. END AddPointer;
  10657. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10658. BEGIN
  10659. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10660. END GetTypeRecordBaseOffset;
  10661. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10662. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10663. BEGIN
  10664. (* change this when Heaps.HeapBlock is modified *)
  10665. INC(dataAdrOffset,7);
  10666. Info(section,"headerAdr");
  10667. Address(section,0);
  10668. Info(section,"typeDesc");
  10669. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10670. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10671. NamedSymbol(section, name, symbol, 0, offset);
  10672. Info(section,"mark: LONGINT;");
  10673. Longint(section,-1);
  10674. Info(section,"refCount: LONGINT;");
  10675. Longint(section,0);
  10676. (*
  10677. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10678. *)
  10679. Info(section,"dataAdr-: ADDRESS");
  10680. Symbol(section,section, dataAdrOffset,0);
  10681. Info(section,"size-: SIZE");
  10682. Address(section,0);
  10683. Info(section,"nextMark: HeapBlock;");
  10684. Address(section,0);
  10685. END HeapBlock;
  10686. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10687. VAR i: LONGINT;
  10688. BEGIN
  10689. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10690. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10691. Info(section,"count*: LONGINT");
  10692. Longint(section,0);
  10693. Info(section,"locked*: BOOLEAN");
  10694. Longint(section,0);
  10695. Info(section,"awaitingLock*: ProcessQueue");
  10696. Address(section,0);
  10697. Address(section,0);
  10698. Info(section,"awaitingCond*: ProcessQueue");
  10699. Address(section,0);
  10700. Address(section,0);
  10701. Info(section,"lockedBy*: ANY");
  10702. Address(section,0);
  10703. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10704. Longint(section,1);
  10705. FOR i := 2 TO 6 DO
  10706. Longint(section,0);
  10707. END;
  10708. Info(section,"lock*: ANY");
  10709. Address(section,0);
  10710. END ProtectedHeapBlock;
  10711. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10712. BEGIN
  10713. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10714. END Info;
  10715. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10716. VAR op: IntermediateCode.Operand;
  10717. BEGIN
  10718. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10719. section.Emit(Data(Basic.invalidPosition,op));
  10720. END Address;
  10721. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10722. VAR op: IntermediateCode.Operand;
  10723. BEGIN
  10724. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10725. section.Emit(Data(Basic.invalidPosition,op));
  10726. END Size;
  10727. PROCEDURE Set(section: IntermediateCode.Section; value: Basic.Set);
  10728. VAR op: IntermediateCode.Operand;
  10729. BEGIN
  10730. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.setType),SYSTEM.VAL(Basic.Integer,value));
  10731. section.Emit(Data(Basic.invalidPosition,op));
  10732. END Set;
  10733. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10734. VAR op: IntermediateCode.Operand;
  10735. BEGIN
  10736. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10737. section.Emit(Data(Basic.invalidPosition,op));
  10738. END Longint;
  10739. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10740. VAR op,noOperand: IntermediateCode.Operand;
  10741. BEGIN
  10742. IntermediateCode.InitOperand(noOperand);
  10743. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10744. section.PatchOperands(pc,op,noOperand,noOperand);
  10745. END PatchSize;
  10746. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10747. VAR op,noOperand: IntermediateCode.Operand;
  10748. BEGIN
  10749. IntermediateCode.InitOperand(noOperand);
  10750. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10751. section.PatchOperands(pc,op,noOperand,noOperand);
  10752. END PatchLongint;
  10753. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10754. VAR op, noOperand: IntermediateCode.Operand;
  10755. BEGIN
  10756. IntermediateCode.InitOperand(noOperand);
  10757. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10758. section.PatchOperands(pc,op,noOperand,noOperand);
  10759. END PatchSymbol;
  10760. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10761. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10762. BEGIN
  10763. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10764. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10765. section.Emit(Data(Basic.invalidPosition,op));
  10766. END Boolean;
  10767. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10768. VAR op: IntermediateCode.Operand;
  10769. BEGIN
  10770. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10771. section.Emit(Data(Basic.invalidPosition,op));
  10772. END Char;
  10773. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10774. VAR i: LONGINT;
  10775. BEGIN
  10776. Info(section,str);
  10777. i := 0;
  10778. WHILE(str[i] # 0X) DO
  10779. Char(section,str[i]);
  10780. INC(i);
  10781. END;
  10782. Char(section,0X);
  10783. END String;
  10784. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10785. VAR s: Basic.SectionName;
  10786. BEGIN
  10787. StringPool.GetString(str, s);
  10788. String(section, s);
  10789. END String0;
  10790. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10791. VAR op: IntermediateCode.Operand;
  10792. BEGIN
  10793. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10794. IntermediateCode.SetOffset(op,realOffset);
  10795. section.Emit(Data(Basic.invalidPosition,op));
  10796. END NamedSymbol;
  10797. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10798. VAR op: IntermediateCode.Operand;
  10799. BEGIN
  10800. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10801. IntermediateCode.SetOffset(op,realOffset);
  10802. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10803. END NamedSymbolAt;
  10804. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10805. BEGIN
  10806. IF symbol= NIL THEN
  10807. Address( section, realOffset);
  10808. ASSERT(virtualOffset = 0);
  10809. ELSE
  10810. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10811. END;
  10812. END Symbol;
  10813. (* OutPointers delivers
  10814. {pointerOffset}
  10815. *)
  10816. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10817. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10818. BEGIN
  10819. type := type.resolved;
  10820. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10821. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10822. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10823. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10824. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10825. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10826. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10827. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10828. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10829. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10830. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10831. ELSIF (type IS SyntaxTree.RecordType) THEN
  10832. (* never treat a record like a pointer, even if the pointer field is set! *)
  10833. WITH type: SyntaxTree.RecordType DO
  10834. base := type.GetBaseRecord();
  10835. IF base # NIL THEN
  10836. Pointers(offset,symbol,section, base,numberPointers);
  10837. END;
  10838. variable := type.recordScope.firstVariable;
  10839. WHILE(variable # NIL) DO
  10840. IF ~(variable.untraced) THEN
  10841. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10842. END;
  10843. variable := variable.nextVariable;
  10844. END;
  10845. END;
  10846. ELSIF (type IS SyntaxTree.CellType) THEN
  10847. WITH type: SyntaxTree.CellType DO
  10848. base := type.GetBaseRecord();
  10849. IF base # NIL THEN
  10850. Pointers(offset,symbol,section, base,numberPointers);
  10851. END;
  10852. variable := type.cellScope.firstVariable;
  10853. WHILE(variable # NIL) DO
  10854. IF ~(variable.untraced) THEN
  10855. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10856. END;
  10857. variable := variable.nextVariable;
  10858. END;
  10859. property := type.firstProperty;
  10860. WHILE(property # NIL) DO
  10861. IF ~(property.untraced) THEN
  10862. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10863. END;
  10864. property := property.nextProperty;
  10865. END;
  10866. parameter := type.firstParameter;
  10867. WHILE(parameter # NIL) DO
  10868. IF ~(parameter.untraced) THEN
  10869. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10870. END;
  10871. parameter := parameter.nextParameter;
  10872. END;
  10873. END;
  10874. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10875. WITH type: SyntaxTree.ArrayType DO
  10876. IF type.form= SyntaxTree.Static THEN
  10877. n := type.staticLength;
  10878. base := type.arrayBase.resolved;
  10879. WHILE(base IS SyntaxTree.ArrayType) DO
  10880. type := base(SyntaxTree.ArrayType);
  10881. n := n* type.staticLength;
  10882. base := type.arrayBase.resolved;
  10883. END;
  10884. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10885. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  10886. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10887. FOR i := 0 TO n-1 DO
  10888. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10889. END;
  10890. END;
  10891. ELSE
  10892. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10893. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10894. END;
  10895. END;
  10896. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10897. WITH type: SyntaxTree.MathArrayType DO
  10898. IF type.form = SyntaxTree.Static THEN
  10899. n := type.staticLength;
  10900. base := type.arrayBase.resolved;
  10901. WHILE(base IS SyntaxTree.MathArrayType) DO
  10902. type := base(SyntaxTree.MathArrayType);
  10903. n := n* type.staticLength;
  10904. base := type.arrayBase.resolved;
  10905. END;
  10906. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10907. IF SemanticChecker.ContainsPointer(base) THEN
  10908. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10909. FOR i := 0 TO n-1 DO
  10910. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10911. END;
  10912. END;
  10913. ELSE
  10914. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10915. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10916. END
  10917. END;
  10918. (* ELSE no pointers in type *)
  10919. END;
  10920. END Pointers;
  10921. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10922. VAR position,i: LONGINT; ch: CHAR;
  10923. BEGIN
  10924. IF pool.Has(index) THEN
  10925. RETURN pool.GetInt(index)
  10926. ELSE
  10927. position := source.pc;
  10928. pool.PutInt(index, position);
  10929. Info(source, name);
  10930. i := 0;
  10931. REPEAT
  10932. ch := name[i]; INC(i);
  10933. Char( source, ch);
  10934. UNTIL ch = 0X;
  10935. END;
  10936. RETURN position;
  10937. END EnterDynamicName;
  10938. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10939. VAR name: Basic.SectionName; position: LONGINT;
  10940. BEGIN
  10941. IF pool.Has(index) THEN
  10942. RETURN pool.GetInt(index)
  10943. ELSE
  10944. StringPool.GetString(index, name);
  10945. position := EnterDynamicName(source,name,index, pool);
  10946. END;
  10947. RETURN position;
  10948. END DynamicName;
  10949. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10950. VAR section: IntermediateCode.Section;
  10951. BEGIN
  10952. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10953. IF implementationVisitor.backend.cooperative THEN
  10954. Info(section, "TypeDescriptor");
  10955. Basic.ToSegmentedName("BaseTypes.Array", name);
  10956. NamedSymbol(section, name,NIL, 0, 0);
  10957. BasePointer(section);
  10958. offset := 0;
  10959. ELSE
  10960. IF ProtectModulesPointers THEN
  10961. HeapBlock(mName,typeName,section,2);
  10962. END;
  10963. Info(section, "HeapBlock");
  10964. IF ProtectModulesPointers THEN
  10965. Symbol(section,section,2,0);
  10966. ELSE
  10967. Address(section,0);
  10968. END;
  10969. Info(section, "TypeDescriptor");
  10970. Address(section,0);
  10971. offset := section.pc;
  10972. END;
  10973. RETURN section
  10974. END NamedBlock;
  10975. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10976. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10977. BEGIN
  10978. COPY(moduleName,name);
  10979. Strings.Append(name,suffix);
  10980. Basic.ToSegmentedName(name, pooledName);
  10981. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10982. END Block;
  10983. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10984. VAR name: Basic.SegmentedName;
  10985. BEGIN
  10986. Info(source,"ArrayHeader");
  10987. IF implementationVisitor.backend.cooperative THEN
  10988. sizePC := source.pc;
  10989. Address(source,0);
  10990. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10991. IF baseType # "" THEN
  10992. Basic.ToSegmentedName(baseType, name);
  10993. NamedSymbol(source, name,NIL, 0, 0);
  10994. ELSE
  10995. Address(source,0);
  10996. END;
  10997. Address(source,0);
  10998. ELSE
  10999. Address(source,0);
  11000. Address(source,0);
  11001. (* first pointer for GC *)
  11002. IF hasPointer THEN
  11003. (* points to first element in the array, this is NOT the base type descriptor *)
  11004. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  11005. ELSE
  11006. Address(source,0);
  11007. END;
  11008. sizePC := source.pc;
  11009. Address(source,0);
  11010. Info(source,"array data");
  11011. END;
  11012. END ArrayBlock;
  11013. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  11014. BEGIN
  11015. IF implementationVisitor.backend.cooperative THEN
  11016. PatchSize(section, pc, size);
  11017. PatchSize(section, pc + 3, size);
  11018. ELSE
  11019. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  11020. PatchSize(section, pc, size);
  11021. END;
  11022. END PatchArray;
  11023. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  11024. VAR
  11025. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  11026. sectionArray: POINTER TO ARRAY OF Sections.Section;
  11027. poolMap: Basic.HashTableInt;
  11028. namePool: IntermediateCode.Section;
  11029. namePoolOffset: LONGINT;
  11030. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  11031. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  11032. BEGIN
  11033. Basic.SegmentedNameToString(s1.name,n1);
  11034. Basic.SegmentedNameToString(s2.name,n2);
  11035. index := 0;
  11036. ch1 := n1[index];
  11037. ch2 := n2[index];
  11038. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  11039. INC(index);
  11040. ch1 := n1[index];
  11041. ch2 := n2[index];
  11042. END;
  11043. RETURN ch1 < ch2;
  11044. END Compare;
  11045. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  11046. VAR
  11047. i, j: LONGINT;
  11048. x, t: Sections.Section;
  11049. BEGIN
  11050. IF lo < hi THEN
  11051. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  11052. WHILE i <= j DO
  11053. WHILE Compare(list[i], x) DO INC(i) END;
  11054. WHILE Compare(x, list[j]) DO DEC(j) END;
  11055. IF i <= j THEN
  11056. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  11057. INC(i); DEC(j)
  11058. END
  11059. END;
  11060. IF lo < j THEN QuickSort(list, lo, j) END;
  11061. IF i < hi THEN QuickSort(list, i, hi) END
  11062. END;
  11063. END QuickSort;
  11064. (*
  11065. ExportDesc* = RECORD
  11066. fp*: ADDRESS;
  11067. name* {UNTRACED}: DynamicName;
  11068. adr*: ADDRESS;
  11069. exports*: LONGINT;
  11070. dsc* {UNTRACED}: ExportArray
  11071. END;
  11072. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  11073. *)
  11074. PROCEDURE ExportDesc2(
  11075. source: IntermediateCode.Section;
  11076. namePool: IntermediateCode.Section;
  11077. fingerPrinter: FingerPrinter.FingerPrinter;
  11078. symbol: Sections.Section;
  11079. name: StringPool.Index;
  11080. VAR patchAdr: LONGINT
  11081. ): BOOLEAN;
  11082. VAR fingerPrint: SyntaxTree.FingerPrint;
  11083. BEGIN
  11084. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  11085. & (symbol.type # Sections.InlineCodeSection)
  11086. THEN
  11087. *)
  11088. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection)
  11089. & (symbol.type # Sections.ExitCodeSection)
  11090. & (symbol.type # Sections.InlineCodeSection))
  11091. THEN
  11092. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  11093. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  11094. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  11095. Longint(source,fingerPrint.public);
  11096. ELSE
  11097. Longint(source, 0);
  11098. END;
  11099. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  11100. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  11101. Symbol(source, symbol,0,0);
  11102. patchAdr := source.pc;
  11103. Longint(source, 0);
  11104. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  11105. Address(source,0);
  11106. END;
  11107. RETURN TRUE
  11108. ELSE
  11109. RETURN FALSE
  11110. END;
  11111. END ExportDesc2;
  11112. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  11113. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  11114. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  11115. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  11116. nextPatch: LONGINT;
  11117. TYPE
  11118. Scope = RECORD
  11119. elements: LONGINT;
  11120. gelements: LONGINT;
  11121. section: IntermediateCode.Section;
  11122. patchAdr: LONGINT;
  11123. arraySizePC: LONGINT;
  11124. beginPC: LONGINT; (* current scope start pc *)
  11125. END;
  11126. BEGIN
  11127. Basic.InitSegmentedName(prev);
  11128. olevel := -1;
  11129. scopes[0].section := source;
  11130. scopes[0].arraySizePC := MIN(LONGINT);
  11131. FOR s := 0 TO LEN(sections)-1 DO
  11132. symbol := sections[s];
  11133. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection) & (symbol.type # Sections.ExitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  11134. this := sections[s].name;
  11135. level := 0;
  11136. WHILE (level < LEN(this)) & (this[level] > 0) DO
  11137. WHILE (level < LEN(this)) & (this[level] > 0) & (prev[level] = this[level]) DO
  11138. INC(level);
  11139. END;
  11140. WHILE level < olevel DO
  11141. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11142. IF olevel > 0 THEN
  11143. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11144. nextPatch := scopes[olevel-1].patchAdr+1;
  11145. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11146. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11147. END;
  11148. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11149. DEC(olevel);
  11150. END;
  11151. IF (level < LEN(this)) & (this[level] > 0) THEN
  11152. IF level > olevel THEN
  11153. (*TRACE("opening",level); *)
  11154. IF scopes[level].section = NIL THEN
  11155. arrayName := ".@ExportArray";
  11156. Strings.AppendInt(arrayName, level);
  11157. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  11158. AddPointer(scopes[level].section,offset);
  11159. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  11160. END;
  11161. scopes[level].beginPC := scopes[level].section.pc;
  11162. olevel := level;
  11163. scopes[olevel].elements := 0;
  11164. END;
  11165. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  11166. sym := sections[s];
  11167. ELSE
  11168. sym := NIL;
  11169. END;
  11170. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  11171. THEN
  11172. INC(scopes[olevel].elements);
  11173. END;
  11174. (* enter string in scope *)
  11175. INC(level);
  11176. END;
  11177. END;
  11178. Basic.SegmentedNameToString(this, name);
  11179. prev := this;
  11180. END;
  11181. END;
  11182. WHILE 0 <= olevel DO
  11183. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11184. IF olevel > 0 THEN
  11185. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11186. nextPatch := scopes[olevel-1].patchAdr+1;
  11187. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11188. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11189. END;
  11190. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11191. DEC(olevel);
  11192. END;
  11193. level := 0;
  11194. WHILE (level < LEN(scopes)) DO
  11195. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  11196. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  11197. END;
  11198. INC(level);
  11199. END;
  11200. END Export;
  11201. BEGIN
  11202. NEW(fingerPrinter);
  11203. NEW(poolMap, 64);
  11204. (* 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 *)
  11205. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  11206. NEW(sectionArray, module.allSections.Length());
  11207. FOR i := 0 TO module.allSections.Length() - 1 DO
  11208. section := module.allSections.GetSection(i);
  11209. sectionArray[i] := section;
  11210. END;
  11211. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  11212. Export(sectionArray^);
  11213. END ExportDesc;
  11214. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  11215. VAR
  11216. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  11217. BEGIN
  11218. Info(source, "exception table offsets array descriptor");
  11219. size := 0;
  11220. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  11221. Info(source, "exception table content");
  11222. FOR i := 0 TO module.allSections.Length() - 1 DO
  11223. p := module.allSections.GetSection(i);
  11224. IF p.type = Sections.CodeSection THEN
  11225. finallyPC := p(IntermediateCode.Section).finally;
  11226. IF finallyPC>=0 THEN
  11227. Symbol( source, p, 0,0);
  11228. Symbol( source, p, finallyPC, 0);
  11229. Symbol( source, p, finallyPC,0);
  11230. INC(size);
  11231. END;
  11232. END
  11233. END;
  11234. PatchArray(source,sizePC,size);
  11235. END ExceptionArray;
  11236. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  11237. VAR i: LONGINT; ch: CHAR;
  11238. BEGIN
  11239. i := 0;
  11240. REPEAT
  11241. ch := name[i]; INC(i);
  11242. Char( section, ch);
  11243. UNTIL ch = 0X;
  11244. WHILE i < 32 DO
  11245. Char( section, 0X); INC(i);
  11246. END;
  11247. END Name;
  11248. PROCEDURE References(section: IntermediateCode.Section);
  11249. CONST
  11250. sfTypeNone = 0X;
  11251. sfTypeCHAR = 01X;
  11252. sfTypeCHAR8 = 02X;
  11253. sfTypeCHAR16 = 03X;
  11254. sfTypeCHAR32 = 04X;
  11255. sfTypeRANGE = 05X;
  11256. sfTypeSHORTINT = 06X;
  11257. sfTypeINTEGER = 07X;
  11258. sfTypeLONGINT = 08X;
  11259. sfTypeHUGEINT = 09X;
  11260. sfTypeWORD = 0AX;
  11261. sfTypeLONGWORD = 0BX;
  11262. sfTypeSIGNED8 = 0CX;
  11263. sfTypeSIGNED16 = 0DX;
  11264. sfTypeSIGNED32 = 0EX;
  11265. sfTypeSIGNED64 = 0FX;
  11266. sfTypeUNSIGNED8 = 10X;
  11267. sfTypeUNSIGNED16 = 11X;
  11268. sfTypeUNSIGNED32 = 12X;
  11269. sfTypeUNSIGNED64 = 13X;
  11270. sfTypeREAL = 14X;
  11271. sfTypeLONGREAL = 15X;
  11272. sfTypeCOMPLEX = 16X;
  11273. sfTypeLONGCOMPLEX = 17X;
  11274. sfTypeBOOLEAN = 18X;
  11275. sfTypeSET = 19X;
  11276. sfTypeANY = 1AX;
  11277. sfTypeOBJECT = 1BX;
  11278. sfTypeBYTE = 1CX;
  11279. sfTypeADDRESS = 1DX;
  11280. sfTypeSIZE = 1EX;
  11281. sfTypeIndirect = 1FX;
  11282. sfTypeRecord = 20X;
  11283. sfTypePointerToRecord = 21X;
  11284. sfTypePointerToArray = 22X;
  11285. sfTypeOpenArray = 23X;
  11286. sfTypeStaticArray = 24X;
  11287. sfTypeDynamicArray = 25X;
  11288. sfTypeMathStaticArray = 26X;
  11289. sfTypeMathOpenArray = 27X;
  11290. sfTypeMathTensor = 28X;
  11291. sfTypeProcedure = 29X;
  11292. sfTypeDelegate = 2AX;
  11293. sfTypeENUM = 2BX;
  11294. (* sfTypeCELL = 2CX; *)
  11295. sfTypePORT = 2DX;
  11296. sfIN = 0X;
  11297. sfOUT = 1X;
  11298. flagDelegate = 0;
  11299. flagConstructor = 1;
  11300. (* variable / parameter addressing modes *)
  11301. sfAbsolute = 0X; (* global vars *)
  11302. sfRelative = 1X; (* variables, value parameters *)
  11303. sfIndirect = 2X; (* var parameters *)
  11304. sfScopeBegin = 0F0X;
  11305. sfScopeEnd = 0F1X;
  11306. sfProcedure = 0F2X;
  11307. sfVariable = 0F3X;
  11308. sfTypeDeclaration = 0F4X;
  11309. sfModule = 0FFX;
  11310. RefInfo = TRUE;
  11311. VAR
  11312. sizePC, startPC, lastOffset: LONGINT;
  11313. indirectTypes: Basic.HashTable;
  11314. PROCEDURE CurrentIndex(): LONGINT;
  11315. VAR i: LONGINT;
  11316. BEGIN
  11317. FOR i := startPC TO section.pc -1 DO
  11318. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  11319. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  11320. END;
  11321. startPC := section.pc;
  11322. RETURN lastOffset;
  11323. END CurrentIndex;
  11324. (*
  11325. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11326. Module = sfModule prevSymbol:SIZE name:String Scope.
  11327. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11328. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  11329. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11330. Type =
  11331. sfTypePointerToRecord
  11332. | sfTypePointerToArray Type
  11333. | sfTypeOpenArray Type
  11334. | sfTypeDynamicArray Type
  11335. | sfTypeStaticArray length:SIZE Type
  11336. | sfTypeMathOpenArray Type
  11337. | sfTypeMathStaticArray length:SIZE Type
  11338. | sfTypeMathTensor Type
  11339. | sfTypeRecord tdAdr:ADDRESS
  11340. | sfTypeProcedure {Parameter} return:Type
  11341. | sfTypeDelegate {Parameter} return:Type
  11342. | sfTypePort (sfIN | sfOUT)
  11343. | sfTypeBOOLEAN
  11344. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  11345. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  11346. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  11347. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  11348. | sfTypeWORD | sfTypeLONGWORD
  11349. | sfTypeREAL | sfTypeLONGREAL
  11350. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  11351. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  11352. | sfTypeIndirect offset:SIZE.
  11353. *)
  11354. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  11355. VAR offset: SIZE;
  11356. BEGIN
  11357. IF indirectTypes.Has(type) THEN
  11358. offset := indirectTypes.GetInt(type);
  11359. Char(section, sfTypeIndirect);
  11360. Size(section, offset);
  11361. RETURN TRUE;
  11362. ELSE
  11363. indirectTypes.PutInt(type, CurrentIndex());
  11364. RETURN FALSE;
  11365. END;
  11366. END Indirect;
  11367. PROCEDURE NType(type: SyntaxTree.Type);
  11368. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  11369. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  11370. BEGIN
  11371. IF type = NIL THEN
  11372. Char(section, sfTypeNone)
  11373. ELSE
  11374. type := type.resolved;
  11375. size := type.sizeInBits;
  11376. WITH type:
  11377. SyntaxTree.PointerType DO
  11378. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11379. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11380. Char(section, sfTypePointerToRecord);
  11381. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11382. ELSE
  11383. IF RefInfo THEN Info(section,"PointerToArray") END;
  11384. Char(section, sfTypePointerToArray);
  11385. NType(type.pointerBase);
  11386. END;
  11387. | SyntaxTree.ArrayType DO
  11388. IF ~Indirect(type) THEN
  11389. IF type.form = SyntaxTree.Open THEN
  11390. IF RefInfo THEN Info(section,"OpenArray") END;
  11391. Char(section, sfTypeOpenArray);
  11392. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11393. IF RefInfo THEN Info(section,"DynamicArray") END;
  11394. Char(section, sfTypeDynamicArray);
  11395. ELSIF type.form = SyntaxTree.Static THEN
  11396. IF RefInfo THEN Info(section,"StaticArray") END;
  11397. Char(section, sfTypeStaticArray);
  11398. Size(section, type.staticLength);
  11399. ELSE
  11400. HALT(100);
  11401. END;
  11402. NType(type.arrayBase);
  11403. END;
  11404. | SyntaxTree.MathArrayType DO
  11405. IF ~Indirect(type) THEN
  11406. IF type.form = SyntaxTree.Open THEN
  11407. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11408. Char(section, sfTypeMathOpenArray);
  11409. ELSIF type.form = SyntaxTree.Static THEN
  11410. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11411. Char(section, sfTypeMathStaticArray);
  11412. Size(section, type.staticLength);
  11413. ELSIF type.form = SyntaxTree.Tensor THEN
  11414. IF RefInfo THEN Info(section,"MathTensor") END;
  11415. Char(section, sfTypeMathTensor);
  11416. ELSE
  11417. HALT(100);
  11418. END;
  11419. NType(type.arrayBase);
  11420. END;
  11421. | SyntaxTree.RecordType DO
  11422. IF ~Indirect(type) THEN
  11423. IF type.pointerType # NIL (* OBJECT *) THEN
  11424. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11425. Char(section, sfTypePointerToRecord)
  11426. ELSE
  11427. IF RefInfo THEN Info(section,"Record") END;
  11428. Char(section, sfTypeRecord);
  11429. td := type.typeDeclaration;
  11430. IF RefInfo THEN Info(section,"TD") END;
  11431. IF (td # NIL) THEN
  11432. Global.GetSymbolSegmentedName(td,segmentedName);
  11433. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11434. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11435. ELSE
  11436. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11437. END;
  11438. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11439. Symbol(section, tir, 0, offset);
  11440. ELSE
  11441. Address(section, 0);
  11442. END;
  11443. END;
  11444. END;
  11445. | SyntaxTree.CellType DO
  11446. IF ~Indirect(type) THEN
  11447. IF RefInfo THEN Info(section,"Record") END;
  11448. Char(section, sfTypeRecord);
  11449. td := type.typeDeclaration;
  11450. IF RefInfo THEN Info(section,"TD") END;
  11451. IF (td # NIL) THEN
  11452. Global.GetSymbolSegmentedName(td,segmentedName);
  11453. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11454. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11455. ELSE
  11456. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11457. END;
  11458. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11459. Symbol(section, tir, 0, offset);
  11460. ELSE
  11461. Address(section, 0);
  11462. END;
  11463. END;
  11464. | SyntaxTree.PortType DO
  11465. Char(section, sfTypePORT);
  11466. IF type.direction = SyntaxTree.OutPort THEN
  11467. Char(section, sfOUT)
  11468. ELSE
  11469. Char(section, sfIN)
  11470. END;
  11471. | SyntaxTree.ProcedureType DO
  11472. IF ~Indirect(type) THEN
  11473. IF type.isDelegate THEN
  11474. Char(section, sfTypeDelegate);
  11475. ELSE
  11476. Char(section, sfTypeProcedure);
  11477. END;
  11478. parameter := type.firstParameter;
  11479. WHILE(parameter # NIL) DO
  11480. NParameter(parameter, -1);
  11481. parameter := parameter.nextParameter;
  11482. END;
  11483. NType(type.returnType);
  11484. END;
  11485. | SyntaxTree.EnumerationType DO
  11486. Char(section, sfTypeENUM);
  11487. | SyntaxTree.BasicType DO
  11488. WITH type:
  11489. SyntaxTree.BooleanType DO
  11490. IF RefInfo THEN Info(section,"Boolean") END;
  11491. Char(section, sfTypeBOOLEAN);
  11492. | SyntaxTree.CharacterType DO
  11493. IF type = module.system.characterType THEN
  11494. IF RefInfo THEN Info(section,"CHAR") END;
  11495. Char(section, sfTypeCHAR);
  11496. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11497. IF RefInfo THEN Info(section,"CHAR8") END;
  11498. Char(section, sfTypeCHAR8)
  11499. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11500. IF RefInfo THEN Info(section,"CHAR16") END;
  11501. Char(section, sfTypeCHAR16);
  11502. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11503. IF RefInfo THEN Info(section,"CHAR32") END;
  11504. Char(section, sfTypeCHAR32);
  11505. ELSE
  11506. HALT(100);
  11507. END;
  11508. |SyntaxTree.IntegerType DO
  11509. IF type(SyntaxTree.IntegerType).signed THEN
  11510. IF (type = module.system.shortintType) THEN
  11511. IF RefInfo THEN Info(section,"SHORTINT") END;
  11512. Char(section, sfTypeSHORTINT)
  11513. ELSIF (type = module.system.integerType) THEN
  11514. IF RefInfo THEN Info(section,"INTEGER") END;
  11515. Char(section, sfTypeINTEGER)
  11516. ELSIF (type = module.system.longintType) THEN
  11517. IF RefInfo THEN Info(section,"LONGINT") END;
  11518. Char(section, sfTypeLONGINT)
  11519. ELSIF (type = module.system.hugeintType) THEN
  11520. IF RefInfo THEN Info(section,"HUGEINT") END;
  11521. Char(section, sfTypeHUGEINT)
  11522. ELSIF (type = module.system.wordType) THEN
  11523. IF RefInfo THEN Info(section,"WORD") END;
  11524. Char(section, sfTypeWORD)
  11525. ELSIF (type = module.system.longWordType) THEN
  11526. IF RefInfo THEN Info(section,"LONGWORD") END;
  11527. Char(section, sfTypeLONGWORD);
  11528. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11529. IF RefInfo THEN Info(section,"SIGNED8") END;
  11530. Char(section, sfTypeSIGNED8)
  11531. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11532. IF RefInfo THEN Info(section,"SIGNED16") END;
  11533. Char(section, sfTypeSIGNED16)
  11534. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11535. IF RefInfo THEN Info(section,"SIGNED32") END;
  11536. Char(section, sfTypeSIGNED32)
  11537. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11538. IF RefInfo THEN Info(section,"SIGNED64") END;
  11539. Char(section, sfTypeSIGNED64)
  11540. ELSE
  11541. HALT(100);
  11542. END
  11543. ELSE (* unsigned *)
  11544. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11545. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11546. Char(section, sfTypeUNSIGNED8)
  11547. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11548. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11549. Char(section, sfTypeUNSIGNED16)
  11550. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11551. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11552. Char(section, sfTypeUNSIGNED32)
  11553. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11554. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11555. Char(section, sfTypeUNSIGNED64)
  11556. ELSE
  11557. HALT(100)
  11558. END
  11559. END;
  11560. | SyntaxTree.FloatType DO
  11561. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11562. IF RefInfo THEN Info(section,"REAL") END;
  11563. Char(section, sfTypeREAL);
  11564. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11565. IF RefInfo THEN Info(section,"LONGREAL") END;
  11566. Char(section, sfTypeLONGREAL);
  11567. ELSE
  11568. HALT(100);
  11569. END;
  11570. | SyntaxTree.ComplexType DO
  11571. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11572. IF RefInfo THEN Info(section,"COMPLEX") END;
  11573. Char(section, sfTypeCOMPLEX);
  11574. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11575. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11576. Char(section, sfTypeLONGCOMPLEX);
  11577. ELSE
  11578. HALT(100);
  11579. END;
  11580. |SyntaxTree.SetType DO
  11581. IF RefInfo THEN Info(section,"SET") END;
  11582. Char(section, sfTypeSET);
  11583. |SyntaxTree.AnyType DO
  11584. IF RefInfo THEN Info(section,"ANY") END;
  11585. Char(section, sfTypeANY);
  11586. |SyntaxTree.ObjectType DO
  11587. IF RefInfo THEN Info(section,"OBJECT") END;
  11588. Char(section, sfTypeOBJECT);
  11589. |SyntaxTree.ByteType DO
  11590. IF RefInfo THEN Info(section,"BYTE") END;
  11591. Char(section, sfTypeBYTE);
  11592. |SyntaxTree.RangeType DO
  11593. IF RefInfo THEN Info(section,"RANGE") END;
  11594. Char(section, sfTypeRANGE)
  11595. |SyntaxTree.AddressType DO
  11596. IF RefInfo THEN Info(section,"ADDRESS") END;
  11597. Char(section, sfTypeADDRESS)
  11598. |SyntaxTree.SizeType DO
  11599. IF RefInfo THEN Info(section,"SIZE") END;
  11600. Char(section, sfTypeSIZE)
  11601. ELSE
  11602. HALT(100)
  11603. END;
  11604. ELSE HALT(101);
  11605. END;
  11606. END;
  11607. END NType;
  11608. (*
  11609. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11610. *)
  11611. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11612. VAR type: SyntaxTree.Type;
  11613. BEGIN
  11614. IF RefInfo THEN Info(section, "Parameter") END;
  11615. Char(section, sfVariable);
  11616. Size(section, procOffset);
  11617. String0(section, parameter.name);
  11618. type := parameter.type.resolved;
  11619. IF parameter.kind = SyntaxTree.VarParameter THEN
  11620. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11621. ELSE Char(section, sfIndirect)
  11622. END;
  11623. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11624. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11625. Char(section, sfIndirect);
  11626. ELSE
  11627. Char(section, sfRelative);
  11628. END;
  11629. ELSE
  11630. Char(section, sfRelative);
  11631. END;
  11632. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11633. NType(parameter.type);
  11634. END NParameter;
  11635. (*
  11636. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11637. *)
  11638. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11639. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11640. flags: SET;
  11641. BEGIN
  11642. IF procedure.externalName # NIL THEN RETURN END;
  11643. IF RefInfo THEN Info(section, "Procedure") END;
  11644. pos := CurrentIndex();
  11645. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11646. Char(section, sfProcedure);
  11647. Size(section, scopeOffset);
  11648. String0(section,procedure.name);
  11649. s := module.allSections.FindBySymbol(procedure);
  11650. Symbol(section,s,0,0); (* start *)
  11651. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11652. flags := {};
  11653. IF procedureType.isDelegate THEN
  11654. INCL(flags, flagDelegate);
  11655. END;
  11656. IF procedure.isConstructor THEN
  11657. INCL(flags, flagConstructor);
  11658. END;
  11659. Set(section, flags);
  11660. IF RefInfo THEN Info(section, "Parameters") END;
  11661. parameter := procedureType.firstParameter;
  11662. WHILE(parameter # NIL) DO
  11663. NParameter(parameter, pos);
  11664. parameter := parameter.nextParameter;
  11665. END;
  11666. IF procedureType.returnParameter # NIL THEN
  11667. NParameter(procedureType.returnParameter, pos);
  11668. END;
  11669. IF procedureType.selfParameter # NIL THEN
  11670. NParameter(procedureType.selfParameter, pos);
  11671. END;
  11672. IF RefInfo THEN Info(section, "ReturnType") END;
  11673. NType(procedureType.returnType);
  11674. NScope(procedure.procedureScope, pos);
  11675. END NProcedure;
  11676. (*
  11677. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11678. *)
  11679. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11680. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11681. BEGIN
  11682. IF RefInfo THEN Info(section, "Variable") END;
  11683. pos := CurrentIndex();
  11684. Char(section, sfVariable);
  11685. Size(section, scopeOffset);
  11686. String0(section, variable.name);
  11687. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11688. Char(section, sfAbsolute);
  11689. IF variable.externalName # NIL THEN
  11690. sn := variable.externalName^;
  11691. NamedSymbol(section, sn,NIL, 0,0);
  11692. ELSE
  11693. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11694. NamedSymbol(section, sn,variable, 0,0);
  11695. END;
  11696. ELSE
  11697. Char(section, sfRelative);
  11698. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11699. END;
  11700. NType(variable.type);
  11701. s := module.allSections.FindBySymbol(variable);
  11702. END NVariable;
  11703. (*
  11704. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11705. *)
  11706. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11707. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11708. BEGIN
  11709. IF typeDeclaration = NIL THEN RETURN END;
  11710. pos := CurrentIndex();
  11711. s := module.allSections.FindBySymbol(typeDeclaration);
  11712. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11713. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11714. Char(section, sfTypeDeclaration);
  11715. Size(section, scopeOffset);
  11716. String0(section, typeDeclaration.name);
  11717. declared := typeDeclaration.declaredType.resolved;
  11718. IF (declared IS SyntaxTree.PointerType) THEN
  11719. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11720. END;
  11721. WITH declared:
  11722. SyntaxTree.RecordType DO
  11723. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11724. Symbol(section, s, 0, offset);
  11725. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11726. Basic.AppendToSegmentedName(name,".@Info");
  11727. s := module.allSections.FindByName(name);
  11728. IF s # NIL THEN (* does not work for coop *)
  11729. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11730. END;
  11731. NScope(declared.recordScope, pos);
  11732. |SyntaxTree.CellType DO
  11733. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11734. Symbol(section, s, 0, offset);
  11735. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11736. Basic.AppendToSegmentedName(name,".@Info");
  11737. s := module.allSections.FindByName(name);
  11738. IF s # NIL THEN
  11739. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11740. END;
  11741. NScope(declared.cellScope, pos);
  11742. ELSE
  11743. Address(section, 0);
  11744. END;
  11745. END NTypeDeclaration;
  11746. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11747. VAR pos: LONGINT;
  11748. BEGIN
  11749. pos := CurrentIndex();
  11750. Char(section,sfModule);
  11751. Size(section, prevSymbol);
  11752. String0(section, module.name);
  11753. NScope(module.moduleScope, pos);
  11754. END NModule;
  11755. (*
  11756. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11757. *)
  11758. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11759. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  11760. BEGIN
  11761. IF scope = NIL THEN RETURN END;
  11762. IF RefInfo THEN Info(section, "Scope") END;
  11763. Char(section, sfScopeBegin);
  11764. variable := scope.firstVariable;
  11765. WHILE (variable # NIL) DO
  11766. NVariable(variable, prevSymbol);
  11767. variable := variable.nextVariable;
  11768. END;
  11769. WITH scope:
  11770. SyntaxTree.ModuleScope DO
  11771. bodyProcedure := scope.bodyProcedure;
  11772. |SyntaxTree.RecordScope DO
  11773. bodyProcedure := scope.bodyProcedure;
  11774. ELSE
  11775. bodyProcedure := NIL;
  11776. END;
  11777. IF bodyProcedure # NIL THEN
  11778. NProcedure(bodyProcedure, prevSymbol)
  11779. END;
  11780. procedure := scope.firstProcedure;
  11781. WHILE procedure # NIL DO
  11782. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11783. procedure := procedure.nextProcedure;
  11784. END;
  11785. typeDeclaration := scope.firstTypeDeclaration;
  11786. WHILE typeDeclaration # NIL DO
  11787. NTypeDeclaration(typeDeclaration, prevSymbol);
  11788. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11789. END;
  11790. Char(section, sfScopeEnd); (* scope ends *)
  11791. END NScope;
  11792. BEGIN
  11793. NEW(indirectTypes, 32);
  11794. ArrayBlock(section,sizePC,"", FALSE);
  11795. startPC := section.pc;
  11796. NModule(module.module, -1);
  11797. PatchArray(section,sizePC,CurrentIndex());
  11798. END References;
  11799. (*
  11800. Command* = RECORD
  11801. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11802. name*: Name; (* name of the procedure *)
  11803. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11804. entryAdr* : ADDRESS; (* entry address of procedure *)
  11805. END;
  11806. *)
  11807. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11808. VAR
  11809. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11810. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11811. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11812. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11813. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11814. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11815. BEGIN
  11816. RETURN
  11817. (type = NIL) OR
  11818. (type.resolved IS SyntaxTree.RecordType) OR
  11819. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11820. (type.resolved IS SyntaxTree.AnyType);
  11821. END TypeAllowed;
  11822. BEGIN
  11823. numberParameters := procedureType.numberParameters;
  11824. RETURN
  11825. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11826. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11827. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11828. END GetProcedureAllowed;
  11829. PROCEDURE WriteType(type : SyntaxTree.Type);
  11830. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11831. name: Basic.SegmentedName; offset: LONGINT;
  11832. BEGIN
  11833. IF type = NIL THEN
  11834. Address(source,0);
  11835. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11836. Address(source,1);
  11837. ELSE
  11838. type := type.resolved;
  11839. IF type IS SyntaxTree.PointerType THEN
  11840. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11841. END;
  11842. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11843. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11844. name[0] := typeDeclaration.name; name[1] := -1;
  11845. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11846. ASSERT(section # NIL);
  11847. ELSE
  11848. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11849. (* TODO *)
  11850. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11851. END;
  11852. IF implementationVisitor.backend.cooperative THEN
  11853. offset := 0;
  11854. ELSE
  11855. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11856. END;
  11857. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11858. END;
  11859. END WriteType;
  11860. BEGIN
  11861. Info(source, "command array descriptor");
  11862. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11863. numberCommands := 0;
  11864. Info(source, "command array content");
  11865. FOR i := 0 TO module.allSections.Length() - 1 DO
  11866. p := module.allSections.GetSection(i);
  11867. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11868. procedure := p.symbol(SyntaxTree.Procedure);
  11869. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11870. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11871. procedure.GetName(name);
  11872. Name(source,name);
  11873. numberParameters := procedureType.numberParameters;
  11874. (* offset of type of first parameter *)
  11875. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11876. ELSE WriteType(procedureType.firstParameter.type)
  11877. END;
  11878. (* offset of type of return parameter *)
  11879. WriteType(procedureType.returnType);
  11880. (* command name *)
  11881. (* command code offset *)
  11882. Symbol(source,p,0,0);
  11883. INC(numberCommands);
  11884. IF Trace THEN
  11885. D.Ln;
  11886. END;
  11887. END;
  11888. END
  11889. END;
  11890. PatchArray(source,sizePC,numberCommands);
  11891. END CommandArray;
  11892. (* to prevent from double import of different module aliases *)
  11893. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11894. VAR i: SyntaxTree.Import;
  11895. BEGIN
  11896. i := module.module.moduleScope.firstImport;
  11897. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11898. i := i.nextImport;
  11899. END;
  11900. RETURN i = import
  11901. END IsFirstDirectOccurence;
  11902. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11903. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11904. BEGIN
  11905. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11906. ArrayBlock(source,pc,"", FALSE);
  11907. Info(source, "import module array data");
  11908. IF implementationVisitor.backend.cooperative THEN
  11909. offset := 0;
  11910. ELSE
  11911. IF module.system.addressType.sizeInBits = 64 THEN
  11912. (* change this when Heaps.HeapBlock is modified *)
  11913. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11914. ELSE
  11915. (* change this when Heaps.HeapBlock is modified *)
  11916. offset := ToMemoryUnits(module.system, 23* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11917. END;
  11918. END;
  11919. import := module.module.moduleScope.firstImport;
  11920. numberImports := 0;
  11921. WHILE import # NIL DO
  11922. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11923. Global.GetModuleSegmentedName(import.module,name);
  11924. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11925. NamedSymbol(source, name, NIL, 0, offset);
  11926. INC(numberImports);
  11927. END;
  11928. import := import.nextImport
  11929. END;
  11930. PatchArray(source,pc,numberImports);
  11931. END ImportsArray;
  11932. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11933. VAR
  11934. p: Sections.Section; sizePC, size, i: LONGINT;
  11935. BEGIN
  11936. Info(source, "Type info section");
  11937. size := 0;
  11938. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11939. FOR i := 0 TO module.allSections.Length() - 1 DO
  11940. p := module.allSections.GetSection(i);
  11941. WITH p: IntermediateCode.Section DO
  11942. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11943. Symbol(source,p,EmptyBlockOffset,0);
  11944. INC(size);
  11945. END;
  11946. END
  11947. END;
  11948. PatchArray(source,sizePC,size);
  11949. END TypeInfoSection;
  11950. (*
  11951. ProcTableEntry* = RECORD
  11952. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11953. noPtr*: LONGINT;
  11954. END;
  11955. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11956. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11957. *)
  11958. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11959. VAR
  11960. numberPointers: LONGINT;
  11961. procedure: SyntaxTree.Procedure;
  11962. BEGIN
  11963. Info(section,"pcFrom");
  11964. Symbol(section,procedureSection,0,0);
  11965. Info(section,"pcTo");
  11966. Symbol(section, procedureSection, procedureSection.pc, 0);
  11967. Info(section,"pointer to offsets array");
  11968. Symbol(section, section,section.pc+1,0);
  11969. Info(section,"offsets array");
  11970. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11971. PointerArray(section, procedure.procedureScope, numberPointers);
  11972. END ProcedureDescriptor;
  11973. (* only for tracing, the descriptor is otherwise not complete ! *)
  11974. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11975. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11976. BEGIN
  11977. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11978. name := procedureSection.name;
  11979. Basic.AppendToSegmentedName(name,".@Info");
  11980. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11981. Address(section,0);
  11982. Symbol(section,section,2,0);
  11983. (*
  11984. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11985. descSize: SIZE;
  11986. sentinel: ADDRESS; (* = MPO-4 *)
  11987. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11988. flags*: SET;
  11989. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11990. name*: Name;
  11991. END;
  11992. *)
  11993. Size(section, 0);
  11994. Address(section,0);
  11995. Address(section,0);
  11996. Set(section,{});
  11997. moduleSection := ModuleSection();
  11998. Symbol( section, moduleSection, moduleSection.pc,0);
  11999. IF procedureSection.symbol = NIL THEN
  12000. Basic.SegmentedNameToString(procedureSection.name, infoName);
  12001. ELSE
  12002. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  12003. END;
  12004. Name(section, infoName);
  12005. Size(section, 0);
  12006. RETURN section;
  12007. END MakeProcedureDescriptorTag;
  12008. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  12009. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  12010. BEGIN
  12011. name := procedureSection.name;
  12012. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  12013. IF implementationVisitor.backend.cooperative THEN
  12014. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12015. Info(section, "TypeDescriptor");
  12016. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  12017. NamedSymbol(dest, name,NIL, 0, 0);
  12018. BaseRecord(dest);
  12019. offset := 0;
  12020. ELSIF CreateProcedureDescInfo THEN
  12021. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12022. Address(dest,0);
  12023. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  12024. offset := dest.pc;
  12025. ELSE
  12026. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  12027. END;
  12028. ProcedureDescriptor(dest, procedureSection);
  12029. Symbol(section, dest, offset, 0);
  12030. END ProcedureDescriptorPointer;
  12031. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  12032. VAR sizePC, i: LONGINT; destination: Sections.Section;
  12033. BEGIN
  12034. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  12035. numberProcs := 0;
  12036. FOR i := 0 TO module.allSections.Length() - 1 DO
  12037. destination := module.allSections.GetSection(i);
  12038. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  12039. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  12040. INC(numberProcs);
  12041. END
  12042. END;
  12043. PatchArray(section, sizePC, numberProcs);
  12044. END ProcedureDescriptorArray;
  12045. (*
  12046. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  12047. VAR
  12048. next*: Module; (** once a module is published, all fields are read-only *)
  12049. name*: Name;
  12050. init, published: BOOLEAN;
  12051. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  12052. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  12053. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  12054. command*: POINTER TO ARRAY OF Command;
  12055. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  12056. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  12057. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  12058. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  12059. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  12060. data*, code*: Bytes;
  12061. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  12062. export*: ExportDesc;
  12063. term*: TerminationHandler;
  12064. exTable*: ExceptionTable;
  12065. noProcs*: LONGINT;
  12066. firstProc*: ADDRESS; <- done by loader
  12067. maxPtrs*: LONGINT;
  12068. crc*: LONGINT;
  12069. *)
  12070. PROCEDURE BasePointer (section: IntermediateCode.Section);
  12071. BEGIN
  12072. Info(section, "cycle");
  12073. Size(section,0);
  12074. Info(section, "references");
  12075. Size(section,0);
  12076. Info(section, "nextMarked");
  12077. Address(section,0);
  12078. Info(section, "nextWatched");
  12079. Address(section,0);
  12080. END BasePointer;
  12081. PROCEDURE BaseObject (section: IntermediateCode.Section);
  12082. BEGIN
  12083. BasePointer(section);
  12084. Info(section, "action");
  12085. Address(section,0);
  12086. Info(section, "monitor");
  12087. Address(section,0);
  12088. END BaseObject;
  12089. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  12090. BEGIN
  12091. BasePointer(section);
  12092. Info(section, "action");
  12093. Address(section,0);
  12094. Info(section, "monitor");
  12095. Address(section,0);
  12096. END BaseRecord;
  12097. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  12098. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  12099. pooledName: Basic.SegmentedName;
  12100. symbol: SyntaxTree.Symbol;
  12101. BEGIN
  12102. Global.GetModuleName(module.module,name);
  12103. Strings.Append(name,".@Module.@Descriptor");
  12104. Basic.ToSegmentedName(name, pooledName);
  12105. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12106. Symbol(section,descriptorSection,0,0);
  12107. Info(descriptorSection, "descriptor");
  12108. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12109. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  12110. Address(descriptorSection,0);
  12111. Global.GetModuleName(module.module,name);
  12112. Strings.Append(name,".@Trace");
  12113. Basic.ToSegmentedName(name, pooledName);
  12114. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12115. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  12116. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12117. END ModuleDescriptor;
  12118. PROCEDURE ModuleSection(): IntermediateCode.Section;
  12119. VAR name: ARRAY 128 OF CHAR;
  12120. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  12121. symbol: SyntaxTree.Symbol;
  12122. BEGIN
  12123. Global.GetModuleName(module.module,name);
  12124. Strings.Append(name,".@Module");
  12125. Basic.ToSegmentedName(name, pooledName);
  12126. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12127. moduleSection.SetExported(TRUE);
  12128. IF moduleSection.pc = 0 THEN
  12129. IF implementationVisitor.backend.cooperative THEN
  12130. Info(moduleSection, "descriptor");
  12131. ModuleDescriptor(moduleSection);
  12132. BaseObject(moduleSection);
  12133. implementationVisitor.CreateTraceModuleMethod(module.module);
  12134. ELSE
  12135. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  12136. Info(moduleSection, "HeapBlock");
  12137. Symbol(moduleSection,moduleSection,2,0);
  12138. Info(moduleSection, "TypeDescriptor");
  12139. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12140. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  12141. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  12142. END;
  12143. END;
  12144. RETURN moduleSection;
  12145. END ModuleSection;
  12146. PROCEDURE NewModuleInfo();
  12147. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12148. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12149. sectionName: Basic.SectionName;
  12150. CONST MPO=-40000000H;
  12151. BEGIN
  12152. (*
  12153. TypeDesc* = POINTER TO RECORD
  12154. descSize: SIZE;
  12155. sentinel: LONGINT; (* = MPO-4 *)
  12156. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12157. flags*: SET;
  12158. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12159. name*: Name;
  12160. refsOffset: SIZE;
  12161. END;
  12162. *)
  12163. (*name is missing prefixes sometimes*)
  12164. Global.GetModuleSegmentedName(module.module,name);
  12165. Basic.AppendToSegmentedName(name,".@Info");
  12166. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12167. IF ~implementationVisitor.backend.cooperative THEN
  12168. Info(source, "HeapBlock");
  12169. Address(source,0); (* an empty heap block prevents GC marking *)
  12170. Info(source, "TypeDescriptor");
  12171. Address(source,0);
  12172. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12173. END;
  12174. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12175. Address(source,MPO-4);
  12176. Info(source, "type tag pointer");
  12177. Address( source,0);
  12178. Info(source, "type flags");
  12179. flags := {};
  12180. Set( source, flags);
  12181. Info(source, "pointer to module");
  12182. moduleSection := ModuleSection();
  12183. Symbol( source, moduleSection, moduleSection.pc,0);
  12184. Info(source, "type name");
  12185. i := 0;
  12186. sectionName := "@Self";
  12187. (*
  12188. Global.GetSymbolSegmentedName(td,name);
  12189. Basic.SegmentedNameToString(name, sectionName);
  12190. *)
  12191. Name(source,sectionName);
  12192. patchInfoPC := source.pc;
  12193. Size(source, 0);
  12194. END NewModuleInfo;
  12195. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  12196. VAR
  12197. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  12198. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  12199. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  12200. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, numberProcs,temp,
  12201. referenceSectionOffset : LONGINT;
  12202. name: Basic.SegmentedName; offset: LONGINT;
  12203. flags: SET;
  12204. BEGIN
  12205. NewModuleInfo();
  12206. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  12207. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  12208. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  12209. ImportsArray(importSection);
  12210. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  12211. CommandArray(commandsSection);
  12212. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  12213. ExceptionArray(exceptionSection);
  12214. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  12215. AddPointer(typeInfoSection, typeInfoSectionOffset);
  12216. TypeInfoSection(typeInfoSection);
  12217. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  12218. referenceSection.SetExported(TRUE);
  12219. References(referenceSection);
  12220. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  12221. ProcedureDescriptorArray(procTableSection, numberProcs);
  12222. IF ProtectModulesPointers THEN
  12223. name := "Heaps.AnyPtr";
  12224. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  12225. (* set base pointer *)
  12226. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  12227. END;
  12228. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  12229. ArrayBlock(emptyArraySection,temp,"", FALSE);
  12230. moduleSection := ModuleSection();
  12231. Info(moduleSection, "nextRoot*: RootObject");
  12232. Address(moduleSection,0);
  12233. Info(moduleSection, "next*: Module");
  12234. Address(moduleSection,0);
  12235. Info(moduleSection, "name*: Name");
  12236. Name(moduleSection,moduleName);
  12237. Info(moduleSection, "init, published: BOOLEAN");
  12238. Boolean(moduleSection,FALSE);
  12239. Boolean(moduleSection,FALSE);
  12240. Info(moduleSection,"filler"); (*! introduce alignment! *)
  12241. Boolean(moduleSection,FALSE);
  12242. Boolean(moduleSection,FALSE);
  12243. Info(moduleSection, "refcnt*: LONGINT");
  12244. Longint(moduleSection,0);
  12245. Info(moduleSection, "sb*: ADDRESS");
  12246. Address(moduleSection,0);
  12247. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  12248. Address(moduleSection,0);
  12249. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  12250. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  12251. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  12252. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  12253. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  12254. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  12255. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  12256. Symbol(moduleSection,importSection,importSectionOffset,0);
  12257. Info(moduleSection, "procTable*: ProcTable");
  12258. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  12259. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  12260. Address(moduleSection,0);
  12261. Address(moduleSection,0);
  12262. Address(moduleSection,0);
  12263. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  12264. Info(moduleSection, "export*: ExportDesc");
  12265. ExportDesc(moduleSection);
  12266. Info(moduleSection, "term*: TerminationHandler");
  12267. Address(moduleSection,0);
  12268. Info(moduleSection, "exTable*: ExceptionTable");
  12269. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  12270. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  12271. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  12272. Info(moduleSection, "crc*: LONGINT");
  12273. patchCRC:= moduleSection.pc;
  12274. Longint(moduleSection, 0); (*! must be implemented *)
  12275. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  12276. Info(moduleSection, "body*: ADDRESS");
  12277. Symbol(moduleSection, bodyProc, 0,0);
  12278. Info(moduleSection, "module flags");
  12279. flags := {};
  12280. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  12281. Set( moduleSection, flags);
  12282. IF implementationVisitor.backend.cooperative THEN
  12283. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  12284. Info(moduleSection, "monitor.owner");
  12285. Address(moduleSection,0);
  12286. Info(moduleSection, "monitor.nestingLevel");
  12287. Address(moduleSection,0);
  12288. Info(moduleSection, "monitor.blockedQueue");
  12289. Address(moduleSection,0); Address(moduleSection,0);
  12290. Info(moduleSection, "monitor.waitingQueue");
  12291. Address(moduleSection,0); Address(moduleSection,0);
  12292. Info(moduleSection, "monitor.waitingSentinel");
  12293. Address(moduleSection,0);
  12294. END;
  12295. END Module;
  12296. PROCEDURE PatchCRC(crc: LONGINT);
  12297. BEGIN
  12298. IF ~simple THEN
  12299. PatchLongint(ModuleSection(), patchCRC, crc);
  12300. END;
  12301. END PatchCRC;
  12302. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  12303. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  12304. BEGIN
  12305. ArrayBlock(source,pc,"",FALSE);
  12306. Info(source, "pointer offsets array data");
  12307. IF scope IS SyntaxTree.RecordScope THEN
  12308. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  12309. ELSIF scope IS SyntaxTree.CellScope THEN
  12310. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  12311. ELSIF scope IS SyntaxTree.ModuleScope THEN
  12312. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  12313. WHILE variable # NIL DO
  12314. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12315. symbol := module.allSections.FindBySymbol(variable);
  12316. ASSERT(symbol # NIL);
  12317. Pointers(0,symbol, source,variable.type,numberPointers);
  12318. END;
  12319. variable := variable.nextVariable;
  12320. END;
  12321. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  12322. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12323. WHILE parameter # NIL DO
  12324. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN (* immutable or variable parameters do not need tracing *)
  12325. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  12326. END;
  12327. parameter := parameter.nextParameter;
  12328. END;
  12329. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  12330. parametersSize := implementationVisitor.ProcParametersSize(scope(SyntaxTree.ProcedureScope).ownerProcedure);
  12331. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12332. IF implementationVisitor.backend.preciseGC THEN
  12333. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12334. END;
  12335. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  12336. END;
  12337. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  12338. WHILE(variable # NIL) DO
  12339. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12340. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  12341. END;
  12342. variable := variable.nextVariable
  12343. END;
  12344. END;
  12345. PatchArray(source,pc,numberPointers);
  12346. END PointerArray;
  12347. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  12348. VAR recordType: SyntaxTree.RecordType;
  12349. tir, tdInfo: IntermediateCode.Section; td: SyntaxTree.TypeDeclaration;
  12350. section: Sections.Section; cellType: SyntaxTree.CellType;
  12351. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  12352. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12353. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12354. sectionName: Basic.SectionName;
  12355. CONST MPO=-40000000H;
  12356. BEGIN
  12357. (*
  12358. TypeDesc* = POINTER TO RECORD
  12359. descSize: SIZE;
  12360. sentinel: LONGINT; (* = MPO-4 *)
  12361. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12362. flags*: SET;
  12363. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12364. name*: Name;
  12365. refsOffset: SIZE;
  12366. END;
  12367. *)
  12368. (* source := module.sections.FindByName(...) *)
  12369. Global.GetSymbolSegmentedName(td,name);
  12370. Basic.AppendToSegmentedName(name,".@Info");
  12371. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12372. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12373. Address(source,0);
  12374. Info(source, "TypeDescriptor");
  12375. Address(source,0);
  12376. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12377. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12378. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12379. Info(source, "type tag pointer");
  12380. Symbol( source, tag, offset, 0);
  12381. Info(source, "type flags");
  12382. flags := {};
  12383. IF isProtected THEN INCL(flags,31) END;
  12384. Set( source, flags);
  12385. Info(source, "pointer to module");
  12386. moduleSection := ModuleSection();
  12387. Symbol( source, moduleSection, moduleSection.pc,0);
  12388. Info(source, "type name");
  12389. i := 0;
  12390. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12391. (*
  12392. Global.GetSymbolSegmentedName(td,name);
  12393. Basic.SegmentedNameToString(name, sectionName);
  12394. *)
  12395. Name(source,sectionName);
  12396. Size(source, 0);
  12397. RETURN source;
  12398. END NewTypeDescriptorInfo;
  12399. PROCEDURE NewTypeDescriptor;
  12400. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12401. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12402. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12403. numberPointers: LONGINT; padding, i: LONGINT;
  12404. CONST MPO=-40000000H;
  12405. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12406. VAR i: LONGINT;
  12407. PROCEDURE Td(record: SyntaxTree.RecordType);
  12408. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12409. BEGIN
  12410. IF record # NIL THEN
  12411. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12412. baseTD := record.typeDeclaration;
  12413. Global.GetSymbolSegmentedName(baseTD,name);
  12414. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12415. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12416. ELSE
  12417. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12418. END;
  12419. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12420. Symbol(source, tir, 0, offset);
  12421. IF reverse THEN Td(record.GetBaseRecord()) END;
  12422. END;
  12423. END Td;
  12424. BEGIN
  12425. Info(source, "tag table");
  12426. baseRecord := recordType;
  12427. i := 0;
  12428. WHILE baseRecord # NIL DO
  12429. INC(i);
  12430. baseRecord := baseRecord.GetBaseRecord();
  12431. END;
  12432. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12433. IF ~reverse THEN Td(recordType) END;
  12434. WHILE i < size DO
  12435. Address(source,0);
  12436. INC(i);
  12437. END;
  12438. IF reverse THEN Td(recordType) END;
  12439. END TdTable;
  12440. PROCEDURE MethodTable(reverse: BOOLEAN);
  12441. VAR i,methods: LONGINT;
  12442. BEGIN
  12443. Info(source, "method table");
  12444. IF recordType # NIL THEN
  12445. methods := recordType.recordScope.numberMethods;
  12446. IF reverse THEN
  12447. FOR i := methods-1 TO 0 BY -1 DO
  12448. procedure := recordType.recordScope.FindMethod(i);
  12449. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12450. NamedSymbol(source, name,procedure, 0,0);
  12451. END;
  12452. ELSE
  12453. FOR i := 0 TO methods-1 DO
  12454. procedure := recordType.recordScope.FindMethod(i);
  12455. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12456. NamedSymbol(source, name,procedure, 0,0);
  12457. END;
  12458. END;
  12459. END;
  12460. END MethodTable;
  12461. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12462. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12463. BEGIN
  12464. Info(source, "method table");
  12465. baseRecord := recordType;
  12466. WHILE baseRecord.baseType # NIL DO
  12467. baseRecord := baseRecord.GetBaseRecord ();
  12468. END;
  12469. GetRecordTypeName (baseRecord, name);
  12470. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12471. IF name = stackFrame THEN
  12472. start := 0;
  12473. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12474. baseRecord := recordType;
  12475. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12476. baseRecord := baseRecord.GetBaseRecord ();
  12477. END;
  12478. IF baseRecord # NIL THEN
  12479. GetRecordTypeName (baseRecord, name);
  12480. IF pointer & ~baseRecord.isObject THEN
  12481. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12482. END;
  12483. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12484. ELSIF recordType.isObject THEN
  12485. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12486. ELSIF pointer THEN
  12487. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12488. ELSE
  12489. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12490. END;
  12491. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12492. Symbol(source, tir, 0, 0);
  12493. start := 0;
  12494. baseRecord := recordType;
  12495. WHILE (baseRecord # NIL) DO
  12496. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12497. baseRecord := baseRecord.GetBaseRecord ();
  12498. END;
  12499. ELSE
  12500. (* explicit trace method: *)
  12501. procedure := recordType.recordScope.FindMethod(0);
  12502. IF ~procedure.isFinalizer THEN
  12503. Global.GetSymbolSegmentedName(procedure, name);
  12504. NamedSymbol(source, name,procedure, 0,0);
  12505. END;
  12506. start := 1;
  12507. END;
  12508. IF (name # stackFrame) & recordType.isObject THEN
  12509. baseRecord := recordType;
  12510. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12511. baseRecord := baseRecord.GetBaseRecord ();
  12512. END;
  12513. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12514. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12515. ELSE
  12516. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12517. END;
  12518. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12519. Symbol(source, tir, 0, 0);
  12520. END;
  12521. methods := recordType.recordScope.numberMethods;
  12522. FOR i := start TO methods-1 DO
  12523. procedure := recordType.recordScope.FindMethod(i);
  12524. IF ~procedure.isFinalizer THEN
  12525. Global.GetSymbolSegmentedName(procedure, name);
  12526. NamedSymbol(source, name,procedure, 0,0);
  12527. END;
  12528. END;
  12529. END CooperativeMethodTable;
  12530. BEGIN
  12531. Global.GetSymbolSegmentedName(td,name);
  12532. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12533. source.SetExported(IsExported(td));
  12534. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12535. IF implementationVisitor.backend.cooperative THEN
  12536. base := NIL;
  12537. baseRecord := recordType.GetBaseRecord();
  12538. IF baseRecord # NIL THEN
  12539. baseTD := baseRecord.typeDeclaration;
  12540. END;
  12541. IF ~recordType.isObject THEN
  12542. Info(source, "parent");
  12543. IF baseRecord # NIL THEN
  12544. Global.GetSymbolSegmentedName(baseTD,name);
  12545. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12546. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12547. ELSE
  12548. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12549. END;
  12550. Symbol(source, tir, 0, 0);
  12551. ELSE
  12552. Address(source,0);
  12553. END;
  12554. Info(source, "record size");
  12555. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12556. CooperativeMethodTable(FALSE);
  12557. base := source;
  12558. Global.GetSymbolSegmentedName(td,name);
  12559. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12560. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12561. source.SetExported(IsExported(td));
  12562. END;
  12563. Info(source, "parent");
  12564. IF baseRecord # NIL THEN
  12565. Global.GetSymbolSegmentedName(baseTD,name);
  12566. sym := baseTD;
  12567. IF ~recordType.isObject THEN
  12568. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12569. sym := NIL;
  12570. END;
  12571. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12572. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12573. ELSE
  12574. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12575. END;
  12576. Symbol(source, tir, 0, 0);
  12577. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12578. Address(source,0);
  12579. ELSE
  12580. IF recordType.isObject THEN
  12581. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12582. ELSE
  12583. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12584. END;
  12585. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12586. Symbol(source, tir, 0, 0);
  12587. END;
  12588. Info(source, "base record descriptor");
  12589. Symbol(source, base, 0, 0);
  12590. CooperativeMethodTable(TRUE);
  12591. IF recordType.hasPointers THEN
  12592. IF ~HasExplicitTraceMethod (recordType) THEN
  12593. implementationVisitor.CreateTraceMethod(recordType);
  12594. END;
  12595. implementationVisitor.CreateResetProcedure(recordType);
  12596. implementationVisitor.CreateAssignProcedure(recordType);
  12597. END;
  12598. ELSIF ~simple THEN
  12599. (*
  12600. MethodEnd = MPO
  12601. ---
  12602. methods (# methods)
  12603. ---
  12604. tags (16)
  12605. ---
  12606. TypeDesc = TypeInfoAdr
  12607. ---
  12608. td adr ---> rec size
  12609. ----
  12610. pointer offsets
  12611. ----
  12612. (padding)
  12613. -----
  12614. empty [2 addresses aligned]
  12615. empty
  12616. empty
  12617. numPtrs
  12618. ---
  12619. pointer offsets
  12620. ---
  12621. *)
  12622. Info(source, "MethodEnd = MPO");
  12623. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12624. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12625. MethodTable(TRUE);
  12626. TdTable(TypeTags, TRUE);
  12627. Info(source, "type descriptor info pointer");
  12628. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12629. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12630. IF (cellType # NIL) THEN
  12631. IF cellType.sizeInBits < 0 THEN
  12632. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12633. END;
  12634. Info(source, "cell size");
  12635. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12636. ELSE
  12637. Info(source, "record size");
  12638. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12639. END;
  12640. Info(source, "pointer offsets pointer");
  12641. padding := 1- source.pc MOD 2;
  12642. Symbol(source, source, source.pc+1+padding,0);
  12643. IF padding >0 THEN
  12644. Info(source, "padding");
  12645. FOR i := 1 TO padding DO Address(source,0) END;
  12646. END;
  12647. IF cellType # NIL THEN
  12648. PointerArray(source, cellType.cellScope, numberPointers);
  12649. ELSE
  12650. PointerArray(source, recordType.recordScope, numberPointers);
  12651. END;
  12652. ELSE
  12653. (*
  12654. simple:
  12655. td adr --> size
  12656. tag(1)
  12657. tag(2)
  12658. tag(3)
  12659. methods ->
  12660. *)
  12661. Info(source, "record size");
  12662. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12663. TdTable(TypeTags, FALSE);
  12664. MethodTable(FALSE);
  12665. END;
  12666. END NewTypeDescriptor;
  12667. BEGIN
  12668. x := x.resolved;
  12669. IF (x IS SyntaxTree.PointerType) THEN
  12670. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12671. END;
  12672. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12673. recordType := x(SyntaxTree.RecordType);
  12674. td := x.typeDeclaration;
  12675. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12676. ASSERT(td # NIL);
  12677. section := module.allSections.FindBySymbol(td); (* TODO *)
  12678. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12679. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12680. NewTypeDescriptor
  12681. END;
  12682. END;
  12683. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12684. cellType := x(SyntaxTree.CellType);
  12685. td := x.typeDeclaration;
  12686. section := module.allSections.FindBySymbol(td); (* TODO *)
  12687. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12688. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12689. NewTypeDescriptor
  12690. END;
  12691. END;
  12692. END
  12693. END CheckTypeDeclaration
  12694. END MetaDataGenerator;
  12695. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12696. VAR
  12697. trace-: BOOLEAN;
  12698. traceString-: SyntaxTree.IdentifierString;
  12699. traceModuleName-: SyntaxTree.IdentifierString;
  12700. profile-: BOOLEAN;
  12701. noRuntimeChecks: BOOLEAN;
  12702. simpleMetaData-: BOOLEAN;
  12703. noAsserts: BOOLEAN;
  12704. optimize-: BOOLEAN;
  12705. cooperative-: BOOLEAN;
  12706. preregisterStatic-: BOOLEAN;
  12707. dump-: Basic.Writer;
  12708. cellsAreObjects: BOOLEAN;
  12709. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12710. experiment: BOOLEAN;
  12711. PROCEDURE &InitIntermediateBackend*;
  12712. BEGIN
  12713. simpleMetaData := FALSE;
  12714. InitBackend;
  12715. SetBuiltinsModuleName(DefaultBuiltinsModuleName);
  12716. SetTraceModuleName(DefaultTraceModuleName);
  12717. END InitIntermediateBackend;
  12718. (* must be overwritten by actual backend, if parameter registers should be used *)
  12719. PROCEDURE GetParameterRegister*(callingConvention: SyntaxTree.CallingConvention; type: IntermediateCode.Type; VAR register: WORD): BOOLEAN;
  12720. BEGIN
  12721. register := -1;
  12722. RETURN FALSE;
  12723. END GetParameterRegister;
  12724. PROCEDURE ResetParameterRegisters*;
  12725. BEGIN
  12726. END ResetParameterRegisters;
  12727. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12728. VAR
  12729. declarationVisitor: DeclarationVisitor;
  12730. implementationVisitor: ImplementationVisitor;
  12731. module: Sections.Module;
  12732. name, platformName: SyntaxTree.IdentifierString;
  12733. meta: MetaDataGenerator;
  12734. crc: CRC.CRC32Stream;
  12735. BEGIN
  12736. ResetError;
  12737. Global.GetSymbolName(x,name);
  12738. NEW(module,x,system); (* backend structures *)
  12739. Global.GetModuleName(x, name);
  12740. module.SetModuleName(name);
  12741. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, builtinsModuleName, SELF);
  12742. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12743. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12744. declarationVisitor.Module(x,module);
  12745. IF ~meta.simple THEN
  12746. meta.Module(implementationVisitor.moduleBodySection);
  12747. END;
  12748. GetDescription(platformName);
  12749. module.SetPlatformName(platformName);
  12750. NEW(crc);
  12751. module.allSections.WriteRaw(crc);
  12752. crc.Update;
  12753. meta.PatchCRC(crc.GetCRC());
  12754. RETURN module
  12755. END GenerateIntermediate;
  12756. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12757. BEGIN RETURN TRUE
  12758. END SupportedImmediate;
  12759. PROCEDURE ProcessSyntaxTreeModule*(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12760. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12761. END ProcessSyntaxTreeModule;
  12762. PROCEDURE ProcessIntermediateCodeModule*(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12763. VAR
  12764. result: Sections.Module;
  12765. traceName: Basic.MessageString;
  12766. BEGIN
  12767. ASSERT(intermediateCodeModule IS Sections.Module);
  12768. result := intermediateCodeModule(Sections.Module);
  12769. IF trace THEN
  12770. traceName := "intermediate code trace: ";
  12771. Strings.Append(traceName,traceString);
  12772. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12773. IF (traceString="") OR (traceString="*") THEN
  12774. result.Dump(dump);
  12775. dump.Update
  12776. ELSE
  12777. Sections.DumpFiltered(dump, result, traceString);
  12778. END
  12779. END;
  12780. RETURN result
  12781. END ProcessIntermediateCodeModule;
  12782. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12783. BEGIN instructionSet := "Intermediate";
  12784. END GetDescription;
  12785. PROCEDURE SetSimpleMetaData*(simpleMetaData: BOOLEAN);
  12786. BEGIN
  12787. SELF.simpleMetaData := simpleMetaData;
  12788. END SetSimpleMetaData;
  12789. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12790. BEGIN COPY(name, traceModuleName)
  12791. END SetTraceModuleName;
  12792. PROCEDURE DefineOptions*(options: Options.Options);
  12793. BEGIN
  12794. DefineOptions^(options);
  12795. options.Add(0X,"trace",Options.String);
  12796. options.Add(0X,"builtinsModule",Options.String);
  12797. options.Add(0X,"traceModule",Options.String);
  12798. options.Add(0X,"profile",Options.Flag);
  12799. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12800. options.Add(0X,"noAsserts",Options.Flag);
  12801. options.Add(0X,"metaData",Options.String);
  12802. options.Add('o',"optimize", Options.Flag);
  12803. options.Add(0X,"preregisterStatic", Options.Flag);
  12804. options.Add(0X,"cellsAreObjects", Options.Flag);
  12805. options.Add(0X,"preciseGC", Options.Flag);
  12806. options.Add(0X,"trackLeave", Options.Flag);
  12807. options.Add(0X,"writeBarriers", Options.Flag);
  12808. options.Add(0X,"experiment", Options.Flag);
  12809. END DefineOptions;
  12810. PROCEDURE GetOptions*(options: Options.Options);
  12811. VAR name,string: SyntaxTree.IdentifierString;
  12812. BEGIN
  12813. GetOptions^(options);
  12814. trace := options.GetString("trace",traceString);
  12815. profile := options.GetFlag("profile");
  12816. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12817. noAsserts := options.GetFlag("noAsserts");
  12818. cooperative := options.GetFlag("cooperative");
  12819. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12820. simpleMetaData := TRUE
  12821. END;
  12822. IF options.GetString("metaData",string) THEN
  12823. IF string = "simple" THEN simpleMetaData := TRUE
  12824. ELSIF string ="full" THEN simpleMetaData := FALSE
  12825. END;
  12826. END;
  12827. IF options.GetString("builtinsModule",name) THEN SetBuiltinsModuleName(name) END;
  12828. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12829. optimize := options.GetFlag("optimize");
  12830. preregisterStatic := options.GetFlag("preregisterStatic");
  12831. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12832. preciseGC := options.GetFlag("preciseGC");
  12833. trackLeave := options.GetFlag("trackLeave");
  12834. writeBarriers := options.GetFlag("writeBarriers");
  12835. experiment := options.GetFlag("experiment");
  12836. END GetOptions;
  12837. PROCEDURE DefaultSymbolFileFormat*(): Formats.SymbolFileFormat;
  12838. BEGIN RETURN SymbolFileFormat.Get()
  12839. END DefaultSymbolFileFormat;
  12840. END IntermediateBackend;
  12841. (* ----------------------------------- register allocation ------------------------------------- *)
  12842. (* register mapping scheme
  12843. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12844. spill offset
  12845. part(n) --> ticket <--> physical register
  12846. spill offset
  12847. *)
  12848. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12849. emptyOperand: IntermediateCode.Operand;
  12850. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12851. statCoopResetVariables: LONGINT;
  12852. statCoopModifyAssignments: LONGINT;
  12853. modifyAssignmentsPC : LONGINT;
  12854. statCoopNilCheck: LONGINT;
  12855. statCoopSwitch: LONGINT;
  12856. statCoopAssignProcedure: LONGINT;
  12857. statCoopTraceMethod: LONGINT;
  12858. statCoopResetProcedure: LONGINT;
  12859. statCoopTraceModule: LONGINT;
  12860. PROCEDURE ResetStatistics*;
  12861. BEGIN
  12862. statCoopResetVariables := 0;
  12863. statCoopModifyAssignments := 0;
  12864. statCoopNilCheck:= 0;
  12865. statCoopSwitch:= 0;
  12866. statCoopAssignProcedure:= 0;
  12867. statCoopTraceMethod:= 0;
  12868. statCoopResetProcedure:= 0;
  12869. statCoopTraceModule:= 0;
  12870. END ResetStatistics;
  12871. PROCEDURE Statistics*;
  12872. BEGIN
  12873. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12874. TRACE(statCoopNilCheck, statCoopSwitch);
  12875. TRACE(statCoopAssignProcedure,
  12876. statCoopTraceMethod,
  12877. statCoopResetProcedure,
  12878. statCoopTraceModule)
  12879. END Statistics;
  12880. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12881. VAR h: LONGINT;
  12882. BEGIN
  12883. WHILE b # 0 DO
  12884. h := a MOD b;
  12885. a := b;
  12886. b := h;
  12887. END;
  12888. RETURN a
  12889. END GCD;
  12890. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12891. BEGIN
  12892. RETURN a*b DIV GCD(a,b)
  12893. END SCM;
  12894. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12895. BEGIN
  12896. (*TRACE(a,b);*)
  12897. IF a = 0 THEN RETURN b
  12898. ELSIF b = 0 THEN RETURN a
  12899. ELSE RETURN SCM(a,b)
  12900. END;
  12901. END CommonAlignment;
  12902. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12903. BEGIN
  12904. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12905. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12906. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12907. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12908. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12909. END
  12910. END PassBySingleReference;
  12911. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12912. BEGIN
  12913. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter,callingConvention)
  12914. END PassInRegister;
  12915. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12916. VAR new: RegisterEntry;
  12917. BEGIN
  12918. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12919. IF queue = NIL THEN
  12920. queue := new
  12921. ELSE
  12922. new.next := queue;
  12923. IF queue#NIL THEN queue.prev := new END;
  12924. queue := new
  12925. END;
  12926. END AddRegisterEntry;
  12927. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12928. VAR this: RegisterEntry;
  12929. BEGIN
  12930. this := queue;
  12931. WHILE (this # NIL) & (this.register # register) DO
  12932. this := this.next;
  12933. END;
  12934. IF this = NIL THEN
  12935. RETURN FALSE
  12936. END;
  12937. ASSERT(this # NIL);
  12938. IF this = queue THEN queue := queue.next END;
  12939. IF this.prev # NIL THEN this.prev.next := this.next END;
  12940. IF this.next # NIL THEN this.next.prev := this.prev END;
  12941. RETURN TRUE
  12942. END RemoveRegisterEntry;
  12943. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12944. BEGIN ASSERT(cond);
  12945. END Assert;
  12946. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12947. BEGIN
  12948. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12949. END ReusableRegister;
  12950. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12951. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12952. BEGIN
  12953. procedure := moduleScope.bodyProcedure;
  12954. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12955. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12956. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12957. procedure.SetScope(moduleScope);
  12958. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12959. procedure.SetAccess(SyntaxTree.Hidden);
  12960. moduleScope.SetBodyProcedure(procedure);
  12961. moduleScope.AddProcedure(procedure);
  12962. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12963. END;
  12964. END EnsureBodyProcedure;
  12965. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12966. VAR import: SyntaxTree.Import;
  12967. selfName: SyntaxTree.IdentifierString;
  12968. module: SyntaxTree.Module;
  12969. BEGIN
  12970. scope.ownerModule.GetName(selfName);
  12971. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12972. module := scope.ownerModule
  12973. ELSE
  12974. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12975. IF import = NIL THEN
  12976. RETURN NIL
  12977. ELSIF import.module = NIL THEN
  12978. RETURN NIL
  12979. ELSE module := import.module
  12980. END;
  12981. END;
  12982. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12983. END GetSymbol;
  12984. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12985. BEGIN
  12986. op.mode := mode;
  12987. IntermediateCode.InitOperand(op.op);
  12988. IntermediateCode.InitOperand(op.tag);
  12989. IntermediateCode.InitOperand(op.extra);
  12990. op.dimOffset := 0;
  12991. op.availability := -1;
  12992. END InitOperand;
  12993. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12994. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12995. BEGIN RETURN IntermediateCode.GetType(system, type)
  12996. END GetType;
  12997. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12998. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12999. BEGIN
  13000. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  13001. (*
  13002. UniqueId(name,module,name,adr);
  13003. *)
  13004. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  13005. constant.SetValue(value);
  13006. constant.SetAccess(SyntaxTree.Hidden);
  13007. module.moduleScope.AddConstant(constant);
  13008. constant.SetScope(module.moduleScope);
  13009. RETURN constant
  13010. END BuildConstant;
  13011. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  13012. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  13013. BEGIN
  13014. variable := scope.firstVariable;
  13015. WHILE variable # NIL DO
  13016. IF variable.NeedsTrace() THEN
  13017. RETURN TRUE;
  13018. END;
  13019. variable := variable.nextVariable;
  13020. END;
  13021. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13022. WHILE parameter # NIL DO
  13023. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  13024. RETURN TRUE;
  13025. END;
  13026. parameter := parameter.nextParameter;
  13027. END;
  13028. RETURN FALSE;
  13029. END HasPointers;
  13030. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  13031. 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));
  13032. END IsVariableParameter;
  13033. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  13034. VAR parameter: SyntaxTree.Parameter;
  13035. BEGIN
  13036. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13037. WHILE parameter # NIL DO
  13038. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  13039. IF parameter.movable THEN RETURN TRUE END;
  13040. parameter := parameter.nextParameter;
  13041. END;
  13042. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  13043. END HasVariableParameters;
  13044. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  13045. BEGIN
  13046. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  13047. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  13048. END HasExplicitTraceMethod;
  13049. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  13050. BEGIN
  13051. IF expression.resolved # NIL THEN expression := expression.resolved END;
  13052. IF (expression IS SyntaxTree.IntegerValue) THEN
  13053. val := expression(SyntaxTree.IntegerValue).value;
  13054. RETURN TRUE
  13055. ELSE
  13056. RETURN FALSE
  13057. END;
  13058. END IsIntegerConstant;
  13059. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  13060. BEGIN
  13061. IF val <= 0 THEN RETURN FALSE END;
  13062. exp := 0;
  13063. WHILE ~ODD(val) DO
  13064. val := val DIV 2;
  13065. INC(exp)
  13066. END;
  13067. RETURN val = 1
  13068. END PowerOf2;
  13069. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  13070. VAR procedure: SyntaxTree.Procedure;
  13071. BEGIN
  13072. procedure := record.recordScope.constructor;
  13073. IF procedure = NIL THEN
  13074. record := record.GetBaseRecord();
  13075. IF record # NIL THEN
  13076. procedure := GetConstructor(record)
  13077. END;
  13078. END;
  13079. RETURN procedure;
  13080. END GetConstructor;
  13081. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  13082. BEGIN
  13083. value := SHORT(op.intValue);
  13084. RETURN op.mode = IntermediateCode.ModeImmediate;
  13085. END IsIntegerImmediate;
  13086. (** whether a type strictily is a pointer to record or object type
  13087. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  13088. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  13089. BEGIN
  13090. IF type = NIL THEN
  13091. RETURN FALSE
  13092. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  13093. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  13094. ELSE
  13095. RETURN FALSE
  13096. END
  13097. END IsStrictlyPointerToRecord;
  13098. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  13099. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  13100. END IsUnsafePointer;
  13101. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  13102. BEGIN type := type.resolved;
  13103. IF type IS SyntaxTree.PointerType THEN
  13104. type := type(SyntaxTree.PointerType).pointerBase;
  13105. type := type.resolved;
  13106. IF type IS SyntaxTree.RecordType THEN
  13107. recordType := type(SyntaxTree.RecordType);
  13108. RETURN TRUE
  13109. ELSE
  13110. RETURN FALSE
  13111. END
  13112. ELSIF type IS SyntaxTree.RecordType THEN
  13113. recordType := type(SyntaxTree.RecordType);
  13114. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  13115. ELSIF type IS SyntaxTree.ObjectType THEN
  13116. RETURN TRUE
  13117. ELSIF type IS SyntaxTree.AnyType THEN
  13118. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  13119. ELSE
  13120. RETURN FALSE
  13121. END;
  13122. END IsPointerToRecord;
  13123. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  13124. BEGIN
  13125. type := type.resolved;
  13126. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  13127. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  13128. END IsArrayOfSystemByte;
  13129. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  13130. BEGIN
  13131. IF type = NIL THEN RETURN FALSE END;
  13132. type := type.resolved;
  13133. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  13134. END IsOpenArray;
  13135. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  13136. BEGIN
  13137. IF type = NIL THEN RETURN FALSE END;
  13138. type := type.resolved;
  13139. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  13140. END IsSemiDynamicArray;
  13141. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  13142. BEGIN
  13143. IF type = NIL THEN RETURN FALSE END;
  13144. type := type.resolved;
  13145. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  13146. END IsStaticArray;
  13147. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  13148. BEGIN
  13149. IF type = NIL THEN RETURN FALSE END;
  13150. type := type.resolved;
  13151. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  13152. END IsStaticMathArray;
  13153. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13154. BEGIN
  13155. WHILE (IsStaticMathArray(type)) DO
  13156. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13157. END;
  13158. RETURN type;
  13159. END StaticMathArrayBaseType;
  13160. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13161. VAR size: LONGINT;
  13162. BEGIN
  13163. size := 1;
  13164. WHILE (IsStaticArray(type)) DO
  13165. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  13166. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13167. END;
  13168. RETURN size;
  13169. END StaticArrayNumElements;
  13170. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13171. VAR size: LONGINT;
  13172. BEGIN
  13173. size := 1;
  13174. WHILE (IsStaticMathArray(type)) DO
  13175. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  13176. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13177. END;
  13178. RETURN size;
  13179. END StaticMathArrayNumElements;
  13180. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13181. BEGIN
  13182. WHILE (IsStaticArray(type)) DO
  13183. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13184. END;
  13185. RETURN type;
  13186. END StaticArrayBaseType;
  13187. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13188. BEGIN
  13189. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  13190. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13191. END;
  13192. RETURN type;
  13193. END ArrayBaseType;
  13194. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  13195. BEGIN
  13196. IF type = NIL THEN RETURN FALSE END;
  13197. type := type.resolved;
  13198. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  13199. END IsDelegate;
  13200. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  13201. VAR i: LONGINT;
  13202. BEGIN
  13203. i := 0; type := type.resolved;
  13204. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13205. INC(i);
  13206. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  13207. END;
  13208. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13209. INC(i);
  13210. type := type(SyntaxTree.MathArrayType).arrayBase;
  13211. IF type # NIL THEN type := type.resolved END;
  13212. END;
  13213. RETURN i
  13214. END DynamicDim;
  13215. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  13216. BEGIN
  13217. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13218. type := type(SyntaxTree.ArrayType).arrayBase;
  13219. END;
  13220. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13221. type := type(SyntaxTree.MathArrayType).arrayBase;
  13222. END;
  13223. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  13224. END StaticSize;
  13225. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  13226. BEGIN
  13227. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  13228. END IsImmediate;
  13229. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  13230. BEGIN
  13231. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  13232. END IsAddress;
  13233. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  13234. BEGIN
  13235. RETURN (x.mode = IntermediateCode.ModeRegister);
  13236. END IsRegister;
  13237. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  13238. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  13239. BEGIN
  13240. typeDeclaration := recordType.typeDeclaration;
  13241. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13242. Global.GetSymbolSegmentedName(typeDeclaration,name);
  13243. END GetRecordTypeName;
  13244. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  13245. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  13246. BEGIN
  13247. parSize := 0;
  13248. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  13249. parameter := procedureType.returnParameter;
  13250. INC(parSize,system.SizeOfParameter(parameter));
  13251. parSize := parSize + (-parSize) MOD system.addressSize;
  13252. END;
  13253. parameter :=procedureType.lastParameter;
  13254. WHILE (parameter # NIL) DO
  13255. IF procedureType.callingConvention IN SysvABIorWINAPI THEN
  13256. INC(parSize, system.addressSize);
  13257. ELSE
  13258. INC(parSize,system.SizeOfParameter(parameter));
  13259. parSize := parSize + (-parSize) MOD system.addressSize;
  13260. END;
  13261. parameter := parameter.prevParameter;
  13262. END;
  13263. IF procedureType.selfParameter # NIL THEN
  13264. parameter := procedureType.selfParameter;
  13265. INC(parSize,system.SizeOfParameter(parameter));
  13266. parSize := parSize + (-parSize) MOD system.addressSize;
  13267. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  13268. END; (* method => self pointer *)
  13269. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  13270. RETURN ToMemoryUnits(system,parSize)
  13271. END ParametersSize;
  13272. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  13273. BEGIN
  13274. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  13275. END IsNested;
  13276. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  13277. BEGIN
  13278. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  13279. scope := scope.outerScope;
  13280. END;
  13281. RETURN scope # NIL;
  13282. END InCellScope;
  13283. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  13284. BEGIN
  13285. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType), IsNested(procedure));
  13286. END ProcedureParametersSize;
  13287. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  13288. VAR dataUnit: LONGINT;
  13289. BEGIN dataUnit := system.dataUnit;
  13290. ASSERT(size MOD system.dataUnit = 0);
  13291. RETURN LONGINT(size DIV system.dataUnit)
  13292. END ToMemoryUnits;
  13293. PROCEDURE Get*(): Backend.Backend;
  13294. VAR backend: IntermediateBackend;
  13295. BEGIN NEW(backend); RETURN backend
  13296. END Get;
  13297. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  13298. VAR instruction: IntermediateCode.Instruction;
  13299. BEGIN
  13300. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  13301. RETURN instruction
  13302. END Nop;
  13303. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13304. VAR instruction: IntermediateCode.Instruction;
  13305. BEGIN
  13306. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  13307. RETURN instruction
  13308. END Mov;
  13309. (* like Mov but ensures that no new register will be allocated for dest *)
  13310. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13311. VAR instruction: IntermediateCode.Instruction;
  13312. BEGIN
  13313. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  13314. RETURN instruction
  13315. END MovReplace;
  13316. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13317. VAR instruction: IntermediateCode.Instruction;
  13318. BEGIN
  13319. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  13320. RETURN instruction
  13321. END Conv;
  13322. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  13323. VAR instruction: IntermediateCode.Instruction;
  13324. BEGIN
  13325. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  13326. RETURN instruction
  13327. END Call;
  13328. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  13329. VAR op1, op2, op3: IntermediateCode.Operand;
  13330. VAR instruction: IntermediateCode.Instruction;
  13331. BEGIN
  13332. IntermediateCode.InitNumber(op1,pcOffset);
  13333. IntermediateCode.InitNumber(op2,callingConvention);
  13334. IntermediateCode.InitNumber(op3,unwind);
  13335. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  13336. RETURN instruction
  13337. END Exit;
  13338. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13339. VAR instruction: IntermediateCode.Instruction;
  13340. BEGIN
  13341. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  13342. RETURN instruction
  13343. END Return;
  13344. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13345. VAR instruction: IntermediateCode.Instruction;
  13346. BEGIN
  13347. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  13348. RETURN instruction
  13349. END Result;
  13350. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  13351. VAR op1: IntermediateCode.Operand;
  13352. VAR instruction: IntermediateCode.Instruction;
  13353. BEGIN
  13354. IntermediateCode.InitNumber(op1,nr);
  13355. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  13356. RETURN instruction
  13357. END Trap;
  13358. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  13359. VAR instruction: IntermediateCode.Instruction;
  13360. BEGIN
  13361. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  13362. RETURN instruction
  13363. END Br;
  13364. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13365. VAR instruction: IntermediateCode.Instruction;
  13366. BEGIN
  13367. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  13368. RETURN instruction
  13369. END Breq;
  13370. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13371. VAR instruction: IntermediateCode.Instruction;
  13372. BEGIN
  13373. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13374. RETURN instruction
  13375. END Brne;
  13376. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13377. VAR instruction: IntermediateCode.Instruction;
  13378. BEGIN
  13379. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13380. RETURN instruction
  13381. END Brge;
  13382. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13383. VAR instruction: IntermediateCode.Instruction;
  13384. BEGIN
  13385. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13386. RETURN instruction
  13387. END Brlt;
  13388. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13389. VAR instruction: IntermediateCode.Instruction;
  13390. BEGIN
  13391. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13392. RETURN instruction
  13393. END Pop;
  13394. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13395. VAR instruction: IntermediateCode.Instruction;
  13396. BEGIN
  13397. ASSERT(op.mode # IntermediateCode.Undefined);
  13398. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13399. RETURN instruction
  13400. END Push;
  13401. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13402. VAR instruction: IntermediateCode.Instruction;
  13403. BEGIN
  13404. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13405. RETURN instruction
  13406. END Neg;
  13407. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13408. VAR instruction: IntermediateCode.Instruction;
  13409. BEGIN
  13410. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13411. RETURN instruction
  13412. END Not;
  13413. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13414. VAR instruction: IntermediateCode.Instruction;
  13415. BEGIN
  13416. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13417. RETURN instruction
  13418. END Abs;
  13419. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13420. VAR instruction: IntermediateCode.Instruction;
  13421. BEGIN
  13422. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13423. ASSERT(~IsImmediate(instruction.op1));
  13424. RETURN instruction
  13425. END Mul;
  13426. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13427. VAR instruction: IntermediateCode.Instruction;
  13428. BEGIN
  13429. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13430. RETURN instruction
  13431. END Div;
  13432. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13433. VAR instruction: IntermediateCode.Instruction;
  13434. BEGIN
  13435. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13436. RETURN instruction
  13437. END Mod;
  13438. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13439. VAR instruction: IntermediateCode.Instruction;
  13440. BEGIN
  13441. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13442. RETURN instruction
  13443. END Sub;
  13444. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13445. VAR instruction: IntermediateCode.Instruction;
  13446. BEGIN
  13447. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13448. RETURN instruction
  13449. END Add;
  13450. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13451. VAR instruction: IntermediateCode.Instruction;
  13452. BEGIN
  13453. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13454. RETURN instruction
  13455. END And;
  13456. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13457. VAR instruction: IntermediateCode.Instruction;
  13458. BEGIN
  13459. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13460. RETURN instruction
  13461. END Or;
  13462. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13463. VAR instruction: IntermediateCode.Instruction;
  13464. BEGIN
  13465. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13466. RETURN instruction
  13467. END Xor;
  13468. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13469. VAR instruction: IntermediateCode.Instruction;
  13470. BEGIN
  13471. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13472. RETURN instruction
  13473. END Shl;
  13474. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13475. VAR instruction: IntermediateCode.Instruction;
  13476. BEGIN
  13477. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13478. RETURN instruction
  13479. END Shr;
  13480. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13481. VAR instruction: IntermediateCode.Instruction;
  13482. BEGIN
  13483. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13484. RETURN instruction
  13485. END Rol;
  13486. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13487. VAR instruction: IntermediateCode.Instruction;
  13488. BEGIN
  13489. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13490. RETURN instruction
  13491. END Ror;
  13492. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13493. VAR instruction: IntermediateCode.Instruction;
  13494. BEGIN
  13495. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13496. RETURN instruction
  13497. END Cas;
  13498. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13499. VAR instruction: IntermediateCode.Instruction;
  13500. BEGIN
  13501. ASSERT(~IntermediateCode.IsVectorRegister(dest));
  13502. ASSERT(~IntermediateCode.IsVectorRegister(src));
  13503. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13504. RETURN instruction
  13505. END Copy;
  13506. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13507. VAR instruction: IntermediateCode.Instruction;
  13508. BEGIN
  13509. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13510. RETURN instruction
  13511. END Fill;
  13512. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13513. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13514. BEGIN
  13515. string := IntermediateCode.String(s);
  13516. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13517. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13518. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13519. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13520. RETURN instruction
  13521. END Asm;
  13522. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13523. VAR instruction: IntermediateCode.Instruction;
  13524. BEGIN
  13525. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13526. RETURN instruction
  13527. END Data;
  13528. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13529. VAR instruction: IntermediateCode.Instruction;
  13530. BEGIN
  13531. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13532. IntermediateCode.SetSubType(instruction, subtype);
  13533. RETURN instruction
  13534. END SpecialInstruction;
  13535. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13536. VAR op1: IntermediateCode.Operand;
  13537. VAR instruction: IntermediateCode.Instruction;
  13538. BEGIN
  13539. (*! generate a warning if size exceeds a certain limit *)
  13540. (*
  13541. ASSERT(bytes < 1000000); (* sanity check *)
  13542. *)
  13543. ASSERT(0 <= units); (* sanity check *)
  13544. IntermediateCode.InitNumber(op1,units);
  13545. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13546. RETURN instruction
  13547. END Reserve;
  13548. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13549. VAR op1: IntermediateCode.Operand;
  13550. VAR instruction: IntermediateCode.Instruction;
  13551. BEGIN
  13552. IntermediateCode.InitNumber(op1,position.start);
  13553. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13554. RETURN instruction
  13555. END LabelInstruction;
  13556. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13557. VAR pc: LONGINT;
  13558. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13559. BEGIN
  13560. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13561. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13562. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13563. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13564. IF instr.op1.type.form = IntermediateCode.Float THEN
  13565. RETURN instr.op1.floatValue = op.floatValue
  13566. ELSE
  13567. RETURN instr.op1.intValue = op.intValue
  13568. END;
  13569. END ProvidesValue;
  13570. BEGIN
  13571. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13572. pc := 0;
  13573. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13574. INC(pc);
  13575. END;
  13576. IF pc = data.pc THEN
  13577. data.Emit(Data(Basic.invalidPosition,vop));
  13578. END;
  13579. RETURN pc
  13580. END EnterImmediate;
  13581. PROCEDURE Init;
  13582. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13583. BEGIN
  13584. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13585. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13586. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13587. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13588. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13589. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13590. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13591. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13592. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13593. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13594. IntermediateCode.InitOperand(emptyOperand);
  13595. FOR i := 0 TO NumberSystemCalls-1 DO
  13596. name := "@SystemCall";
  13597. Basic.AppendNumber(name,i);
  13598. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13599. END;
  13600. END Init;
  13601. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13602. BEGIN
  13603. RETURN (symbol # NIL) & symbol.NeedsSection();
  13604. END IsExported;
  13605. BEGIN
  13606. Init;
  13607. END FoxIntermediateBackend.
  13608. Compiler.Compile -p=Win32 FoxIntermediateBackend.Mod ~
  13609. # Release.Build --path="/temp/obg/" Win32 ~
  13610. # Linker.Link --fileFormat=PE32 --fileName=A2H.exe --extension=GofW --displacement=401000H Builtins Trace Kernel32 Machine Heaps Modules Objects Kernel KernelLog Streams Commands Files WinFS Clock Dates Reals Strings Diagnostics BitSets StringPool ObjectFile GenericLinker Reflection Loader BootConsole ~
  13611. FStols.CloseFiles A2Z.exe ~
  13612. System.FreeDownTo FoxIntermediateBackend ~
  13613. Compiler.Compile -p=Win32 --destPath=/temp/obg/ --traceModule=Trace
  13614. I386.Builtins.Mod Trace.Mod Windows.I386.Kernel32.Mod Windows.I386.Machine.Mod Heaps.Mod
  13615. Modules.Mod Windows.I386.Objects.Mod Windows.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13616. Commands.Mod I386.Reals.Mod Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13617. Windows.I386.Traps.Mod Locks.Mod Windows.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13618. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13619. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Windows.User32.Mod
  13620. Windows.WinTrace.Mod Windows.ODBC.Mod Windows.Shell32.Mod Windows.SQL.Mod Windows.WinFS.Mod
  13621. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13622. GenericLinker.Mod Loader.Mod BootConsole.Mod